首页 > 其他分享 >Eurocrypt 2024 's Accepted Papers

Eurocrypt 2024 's Accepted Papers

时间:2024-06-10 22:45:23浏览次数:20  
标签:2024 CNRS Information Institute University France Eurocrypt Security Accepted

Accepted Papers  已接受的论文

These papers are listed in order of submission.
这些论文按提交顺序排列。

  1. Twinkle: Threshold Signatures from DDH with Full Adaptive Security
    闪烁:具有完全自适应安全性的DDH阈值签名

    Renas Bacho, Julian Loss, Stefano Tessaro, Benedikt Wagner, Chenzhi Zhu
    Renas Bacho、Julian Loss、Stefano Tessaro、Benedikt Wagner、Chen Zhi Zhu
    CISPA Helmholtz Center for Information Security, Saarland University, CISPA Helmholtz Center for Information Security, University of Washington
    CISPA亥姆霍兹信息安全中心,萨尔大学,CISPA亥姆霍兹信息安全中心,华盛顿大学

  2. Efficient Arithmetic in Garbled Circuits
    Garbled电路中的有效算法

    David Heath
    University of Illinois Urbana-Champaign
    伊利诺伊香槟分校

  3. M&M'S: Mix and Match Attacks on Schnorr-type Blind Signatures with Repetition
    M&M:对具有重复的Schnorr型盲签名的混合匹配攻击

    Khue Do, Lucjan Hanzlik, Eugenio Paracucchi
    Khue Do、Lucjan Hanzlik、Eugenio Paracucchi
    CISPA Helmholtz Center for Information Security
    CISPA亥姆霍兹信息安全中心

  4. Toothpicks: More Efficient Fork-Free Two-Round Multi-Signatures
    牙签:更高效的无叉两轮多重签名

    Jiaxin Pan, Benedikt Wagner
    潘嘉欣,瓦格纳
    University of Kassel, Germany, CISPA Helmholtz Center for Information Security, Saarland University
    德国卡塞尔大学,CISPA亥姆霍兹信息安全中心,萨尔大学

  5. The Exact Multi-User Security of (Tweakable) Key Alternating Ciphers with a Single Permutation
    具有单次置换的(可调)密钥交替密码的精确多用户安全性

    Yusuke Naito, Yu Sasaki, Takeshi Sugawara
    内藤佑介、佐佐木由纪、杉原武
    Mitsubishi Electric Corporation, NTT Social Informatics Laboratories, The University of Electro-Communications
    三菱电机公司、NTT社会信息学实验室、电气通信大学

  6. A Holistic Security Analysis of Monero Transactions
    Monero交易的整体安全性分析

    Cas Cremers, Julian Loss, Benedikt Wagner
    Cas Cremers、Julian Loss、Benedikt Wagner
    CISPA Helmholtz Center for Information Security, CISPA Helmholtz Center for Information Security, Saarland University
    CISPA亥姆霍兹信息安全中心

  7. Anamorphic Encryption, Revisited
    变形加密,再谈

    Fabio Banfi, Konstantin Gegier, Martin Hirt, Ueli Maurer, Guilherme Rito
    法比奥·班菲、康斯坦丁·格吉尔、马丁·希尔特、尤里·毛雷尔、吉列尔梅·里托
    Zühlke Engineering AG, ETH Zurich, Ruhr-Universität Bochum
    苏黎世联邦理工学院Zühlke Engineering AG,波鸿鲁尔大学

  8. Can Alice and Bob Guarantee Output to Carol?
    Alice和Bob能保证输出给Carol吗?

    Bar Alon, Eran Omri, Muthuramakrishnan Venkitasubramaniam
    Bar-Alon,EranOmri,MuthuramakrishnanVenkitasubramaniam,
    Ben Gurion University, Ariel University, Georgetown University
    本古里安大学、阿里尔大学、乔治敦大学

  9. SPRINT: High-Throughput Robust Distributed Schnorr Signatures
    SPRINT:高吞吐量鲁棒分布式Schnorr签名

    Fabrice Benhamouda, Shai Halevi, Hugo Krawczyk, Yiping Ma, Tal Rabin
    Fabrice Benhamouda、Shai Halevi、Hugo Krawczyk、Yiping Ma、Tal Rabin
    Amazon Web Services, University of Pennsylvania, Amazon Web Services and University of Pennsylvania
    亚马逊网络服务、宾夕法尼亚大学、亚马逊网络服务和宾夕法尼亚大学

  10. The supersingular Endomorphism Ring and One Endomorphism problems are equivalent
    超奇异自同态环与一个自同态问题是等价的

    Aurel Page, Benjamin Wesolowski
    Aurel Page,Benjamin Wesolowski
    Univ. Bordeaux, CNRS, INRIA, Bordeaux INP, IMB, UMR 5251, F-33400 Talence, France, ENS de Lyon, CNRS, UMPA, UMR 5669, Lyon, France
    波尔多大学,CNRS,INRIA,波尔多INP,IMB,UMR 5251,F-33400 Talence,France,ENS de Lyon,CNRS、UMPA,UMR 5669,Lyon,France

  11. Trapdoor Memory-Hard Functions
    活门记忆硬功能

    Christoph U. Günther, Benedikt Auerbach, Krzysztof Pietrzak
    Christoph U.Günther、Benedikt Auerbach、Krzysztof Pietrzak
    Institute of Science and Technology Austria
    奥地利科学技术研究所

  12. AprèsSQI: Extra Fast Verification for SQIsign Using Extension-Field Signing
    AprèsSQI:使用扩展字段签名的SQIsign超快速验证

    Maria Corte-Real Santos, Jonathan Komada Eriksen, Michael Meyer, Krijn Reijnders
    Maria Corte Real Santos、Jonathan Komada Eriksen、Michael Meyer、Krijn Reijnders
    University College London, NTNU, University of Regensburg, Radboud University Nijmegen
    伦敦大学学院、NTNU、雷根斯堡大学、奈梅亨拉德布大学

  13. Probabilistically Checkable Arguments for all NP
    所有NP的概率可检验自变量

    Shany Ben-David  Shany Ben David
    Bar-Ilan University 巴宜兰大学

  14. Partial Sums Meet FFT: Improved Attack on 6-Round AES
    部分和满足FFT:改进的6轮AES攻击

    Orr Dunkelman, Shibam Ghosh, Nathan Keller, Gaetan Leurent, Avichai Marmor, Victor Mollimard
    Orr Dunkelman、Shibam Ghosh、Nathan Keller、Gaetan Leurent、Avichai Marmor、Victor Mollimard
    University of Haifa, Bar Ilan University, Inria, Paris
    海法大学、巴伊兰大学、巴黎因里亚

  15. Evaluating the security of CRYSTALS-Dilithium in the quantum random oracle model
    量子随机预言机模型中晶体二锂的安全性评价

    Kelsey A. Jackson, Carl A. Miller, Daochen Wang
    Kelsey A.Jackson、Carl A.Miller、Daochen Wang
    University of Maryland, University of Maryland, NIST

  16. Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
    基于新同构不变量的矩阵编码和交替三线性形式等价算法

    Anand Kumar Narayanan, Youming Qiao, Gang Tang
    阿南德·库马尔·纳拉亚南、乔友明、唐刚
    SandboxAQ, University of Technology Sydney
    SandboxAQ,悉尼科技大学

  17. Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search
    在私有信息检索和更高级的数据库搜索中实现主动安全的高效通用方法

    Reo Eriguchi, Kaoru Kurosawa, Koji Nuida
    Eriguchi,Kaoru Kurosawa,Koji Nuida
    National Institute of Advanced Industrial Science and Technology (AIST), Chuo University/AIST, Kyushu University/AIST
    国立先进工业科学技术研究所(AIST)、中央大学/AIST、九州大学/AIST

  18. New Records in Collision Attacks on SHA-2
    SHA-2碰撞攻击的新记录

    Yingxin Li, Fukang Liu, Gaoli Wang
    李迎新、刘福康、王高丽
    East China Normal University, Tokyo Institute of Technology
    华东师范大学东京工业大学

  19. Constant-Round Simulation-Secure Coin Tossing Extension with Guaranteed Output
    具有保证输出的常圆模拟安全抛硬币扩展

    Damiano Abram, Jack Doerner, Yuval Ishai, Varun Narayanan
    Damiano Abram、Jack Doerner、Yuval Ishai、Varun Narayanan
    Aarhus University, Technion and Reichman U, Technion, University of California, LA
    奥胡斯理工大学和赖克曼理工大学

  20. Generalized Feistel Ciphers for Efficient Prime Field Masking
    广义Feistel密码在素数域屏蔽中的应用

    Lorenzo Grassi, Loïc Masure, Pierrick Méaux, Thorben Moos, François-Xavier Standaert
    Lorenzo Grassi、Loïc Masure、Pierrick Méaux、Thorben Moos、François Xavier Standaert
    Ruhr University Bochum (Germany), Université de Montpellier, CNRS, LIRMM (France), University of Luxembourg (Luxembourg), Université catholique de Louvain (Belgium)
    波鸿鲁尔大学(德国)、蒙彼利埃大学、CNRS、LIRMM(法国)、卢森堡大学(卢森堡)、卢万天主教大学(比利时)

  21. Crypto Dark Matter on the Torus: Oblivious PRFs from shallow PRFs and TFHE
    Torus上的加密暗物质:来自浅层重频和TFHE的遗忘重频

    Martin R. Albrecht, Alex Davidson, Amit Deo, Daniel Gardham
    Martin R.Albrecht、Alex Davidson、Amit Deo、Daniel Gardham
    King’s College London and SandboxAQ, NOVA LINCS & DI, FCT, Universidade NOVA de Lisboa, Zama and Crypto Quantique, University of Surrey
    伦敦国王学院和SandboxAQ、NOVA LINCS&DI、FCT、里斯本NOVA大学、扎马和萨里大学Crypto Quantique

  22. Practical Attack on All Parameters of the DME Signature Scheme
    DME签名方案所有参数的实用攻击

    Pierre Briaud, Maxime Bros, Ray Perlner, Daniel Smith-Tone
    Pierre Briaud、Maxime Bros、Ray Perlner、Daniel Smith Tone
    Inria Paris & Sorbonne Université, NIST, NIST & University of Louisville
    Inria巴黎和索邦大学、NIST、NIST和路易斯维尔大学

  23. Signatures with Memory-Tight Security in the Quantum Random Oracle Model
    量子随机Oracle模型中具有内存紧安全性的签名

    Keita Xagawa  泽川敬太
    Technology Innovation Institute
    技术创新研究所

  24. Key Exchange with Tight (Full) Forward Secrecy via Key Confirmation
    通过密钥确认进行严格(完全)前向保密的密钥交换

    Jiaxin Pan, Doreen Riepel, Runzhi Zeng
    潘佳欣、Doreen Riepel、曾润芝
    University of Kassel, Germany, UC San Diego, USA, NTNU, Norway
    德国卡塞尔大学、美国加州大学圣地亚哥分校、挪威国立大学

  25. The Complexity of Algebraic Algorithms for LWE
    LWE代数算法的复杂性

    Matthias Johann Steiner
    Alpen-Adria-Universität Klagenfurt
    克拉根福Alpen Adria大学

  26. Anamorphic Encryption: New Constructions and Homomorphic Realizations
    同态加密:新构造与同态实现

    Dario Catalano, Emanuele Giunta, Francesco Migliaro
    Dario Catalano、Emanuele Giunta、Francesco Migliaro
    Università di Catania, IMDEA Software Institute 

  27. SQIsignHD: New Dimensions in Cryptography  

    Pierrick Dartois, Antonin Leroux, Damien Robert, Benjamin Wesolowski  
    INRIA, IMB, UMR 5251, F-33400, Talence, France, DGA-MI, Bruz, France, ENS de Lyon, CNRS, UMPA, UMR 5669, Lyon, France 

  28. Witness Semantic Security  

    Paul Lou, Nathan Manohar, Amit Sahai  
    UCLA, IBM T.J. Watson Research Center 

  29. Fully Homomorphic Encryption beyond IND-CCA1 Security: Integrity through Verifiability  

    Mark Manulis, Jérôme Nguyen  
    Universität der Bundeswehr, Munich 

  30. Garbled Circuit Lookup Tables with Logarithmic Number of Ciphertexts  

    David Heath, Vladimir Kolesnikov, Lucien K. L. Ng  
    University of Illinois Urbana-Champaign, Georgia Institute of Technology 

  31. Pauli Manipulation Detection Codes and Applications to Quantum Communication over Adversarial Channels  

    Thiago Bergamaschi  
    UC Berkeley 

  32. Publicly Verifiable Secret Sharing over Class Groups and Applications to DKG and YOSO  

    Ignacio Cascudo, Bernardo David  
    IMDEA Software Institute, ITU Copenhagen 

  33. Bulletproofs++: Next Generation Confidential Transactions via Reciprocal Set Membership Arguments  

    Liam Eagen, Sanket Kanjalkar, Jonas Nick, Tim Ruffing  
    Blockstream Research 

  34. Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More  

    Taiga Hiroka, Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Tapas Pal, Takashi Yamakawa  
    Kyoto University, NTT Social Informatics Laboratories 

  35. A Novel Framework for Explainable Leakage Assessment  

    Si Gao, Elisabeth Oswald  
    University of Klagenfurt, University of Klagenfurt and University of Birmingham 

  36. Polynomial Time Cryptanalytic Extraction of Neural Network Models  

    Isaac Canales-Martínez, Jorge Chávez-Saab, Anna Hambitzer, Francisco Rodríguez-Henríquez, Nitin Satpute, Adi Shamir  
    Technology Innovation Institute, Weizmann Institute 

  37. Perfect Asynchronous MPC with Linear Communication Overhead  

    Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra  
    Intel Labs, Bar Ilan University, Indian Institute of Science, Bangalore, Indian Institute of Science Bangalore 

  38. SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions  

    Martin R. Albrecht, Giacomo Fenzi, Oleksandra Lapiha, Ngoc Khanh Nguyen  
    King's College London and SandboxAQ, EPFL, Royal Holloway University of London 

  39. Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSS  

    Gilad Asharov, Anirudh Chandramouli  
    Bar-Ilan University 巴宜兰大学

  40. Improving Key Recovery Linear Attacks with Walsh Spectrum Puncturing  

    Antonio Flórez-Gutiérrez, Yosuke Todo  
    NTT Social Informatics Laboratories
    NTT社会信息学实验室

  41. Universal Composable Password Authenticated Key Exchange for the Post-Quantum World  

    You Lyu, Shengli Liu, Shuai Han  
    Shanghai Jiao Tong University
    上海交通大学

  42. Early Stopping for Any Number of Corruptions  

    Julian Loss, Jesper Buus Nielsen  
    CISPA Helmholtz Center for Information Security, Aarhus University 

  43. Fuzzy Private Set Intersection with Large Hyperballs  

    Aron van Baarsen, Sihang Pu  
    CWI, CISPA Helmholtz Center for Information Security 

  44. Bootstrapping Bits with CKKS  

    Youngjin Bae, Jung Hee Cheon, Jaehyung Kim, Damien Stehlé  
    CryptoLab Inc., CryptoLab Inc. / Seoul National University 

  45. Asymptotics and Improvements of Sieving for Codes  

    Leo Ducas, Simona Etinski, Andre Esser, Elena Kirshanova  
    CWI, Leiden University, CWI, Technology Innovation Institute 

  46. A generic algorithm for efficient key recovery in differential attacks – and its associated tool  

    Christina Boura, Nicolas David, Patrick Derbez, Rachelle Heim Boissier, María Naya-Plasencia  
    University of Versailles, France, Inria, France, Univ Rennes, Inria, CNRS, IRISA, France 

  47. Concurrently Secure Blind Schnorr Signatures  

    Georg Fuchsbauer, Mathias Wolf  
    TU Wien 

  48. Fast batched asynchronous distributed key generation  

    Victor Shoup, Jens Groth  
    DFINITY 

  49. The NISQ Complexity of Collision Finding  

    Yassine Hamoudi, Qipeng Liu, Makrand Sinha  
    Université de Bordeaux, CNRS, LaBRI, University of California at San Diego, University of Illinois at Urbana-Champaign 

  50. Non-malleable codes with optimal rate for poly-size circuits  

    Marshall Ball, Ronen Shaltiel, Jad Silbak  
    New York University, University of Haifa, Tel Aviv University 

  51. Foundations of Adaptor Signatures  

    Paul Gerhart, Dominique Schröder, Pratik Soni, Sri Aravinda Krishnan Thyagarajan  
    Friedrich-Alexander-Universität Erlangen-Nürnberg, University of Utah, NTT Research 

  52. Approximate Lower Bound Arguments  

    Pyrros Chaidos, Aggelos Kiayias, Leonid Reyzin, Anatoliy Zinovyev  
    National & Kapodistrian University of Athens, IOG, University of Edinburgh and IOG, Boston University 

  53. Isogeny problems with level structure  

    Luca De Feo, Tako Boris Fouotsa, Lorenz Panny  
    IBM Research Europe, EPFL, Switzerland, TU München, Germany 

  54. Toward Malicious Constant-Rate 2PC via Arithmetic Garbling  

    Carmit Hazay, Yibin Yang  
    Bar-Ilan University, Georgia Institute of Technology 

  55. Software with Certified Deletion  

    James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta, Justin Raizes, Bhaskar Roberts  
    UC Berkeley, CMU and NTT Research, UIUC, Bocconi University and Max Planck Institute for Security and Privacy, CMU 

  56. Tight Security of TNT and Beyond: Attacks, Proofs and Possibilities for the Cascaded LRW Paradigm  

    Ashwin Jha, Mustafa Khairallah, Mridul Nandi, Abishanka Saha  
    Ruhr-Universität Bochum, Bochum, Germany, CISPA Helmholtz Center for Information Security, Saarbrücken, Germany, Seagate Research Group, Singapore, Singapore, Lund University, Lund, Sweden, Indian Statistical Institute, Kolkata, India, Indian Statistical Institute , Kolkata, India 

  57. Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance  

    Cody Freitag, Omer Paneth, Rafael Pass  
    Northeastern University and Boston University, Tel Aviv University, Tel Aviv University and Cornell Tech 

  58. Closing the Efficiency Gap between Synchronous and Network-Agnostic Consensus  

    Giovanni Deligios, Mose Mizrahi Erbes  
    ETH Zurich 苏黎世联邦理工学院

  59. Key Recovery Attack on the Partial Vandermonde Knapsack Problem  

    Dipayan Das, Antoine Joux  
    NTT Social Informatics Laboratories, CISPA Helmholtz Center for Information Security 

  60. Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation  

    Fangqi Dong, Zihan Hao, Ethan Mook, Daniel Wichs  
    IIIS, Tsinghua University, Northeastern University, Northeastern University and NTT Research 

  61. Jolt: SNARKs for Virtual Machines via Lookups  

    Arasu Arun, Srinath Setty, Justin Thaler  
    New York University, Microsoft Research, a16z crypto and Georgetown University 

  62. Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions  

    Helger Lipmaa, Roberto Parisella, Janno Siim  
    University of Tartu, Simula UiB 

  63. Lower-Bounds on Public-Key Operations in PIR  

    Jesko Dujmovic, Mohammad Hajiabadi  
    CISPA Helmholtz Center for Information Security, University of Waterloo 

  64. Fast Public-Key Silent OT and More from Constrained Naor-Reingold  

    Dung Bui, Geoffroy Couteau, Pierre Meyer, Alain Passelègue, Mahshid Riahinia  
    Université Paris Cité, IRIF, Université Paris Cité, CNRS, IRIF, Aarhus Universitet, CryptoLab, ENS de Lyon, Laboratoire LIP (U. Lyon, CNRS, ENSL, Inria, UCBL) 

  65. Unbiasable Verifiable Random Functions  

    Emanuele Giunta, Alistair Stewart  
    Web3 Foundation 

  66. Monotone-Policy Aggregate Signatures  

    Maya Farber Brodsky, Arka Rai Choudhuri, Abhishek Jain, Omer Paneth  
    Tel Aviv University, NTT Research, NTT Research and Johns Hopkins University 

  67. Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions
    阈值浣熊:来自标准格假设的实用阈值签名

    Shuichi Katsumata, Mary Maller, Rafael del Pino, Fabrice Mouhartem, Thomas Prest, Markku-Juhani Saarinen
    Katsumata水池、Mary Maller、Rafael del Pino、Fabrice Mouhartem、Thomas Prest、Markku Juhani Saarinen
    PQShield LTD & AIST, PQShield LTD & Ethereum Foundation, PQShield SAS, XWiki SAS (CryptPad), PQShield LTD & Tampere University 

  68. Best-of-Both-Worlds Multiparty Quantum Computation with Publicly Verifiable Identifiable Abort  

    Kai-Min Chung, Mi-Ying Huang, Er-Cheng Tang, Jiapeng Zhang  
    Academia Sinica, University of Southern California, University of Washington 

  69. Lower Bounds for Lattice-based Compact Functional Encryption  

    Erkan Tairi, Akin Ünal  
    DIENS, École normale supérieure, CNRS, Inria, PSL University, Paris, France, ISTA, Klosterneuburg, Austria 

  70. Tight Indistinguishability Bounds for the XOR of Independent Random Permutations by Fourier Analysis  

    Itai Dinur  
    Ben-Gurion University 

  71. Cryptanalysis of rank-2 module-LIP in totally real number fields  

    Guilhem Mureau, Alice Pellet-Mary, Georges Pliatsok, Alexandre Wallet  
    Inria, Univ. Bordeaux, CNRS, Univ. Bordeaux, Inria, Univ Rennes, Irisa, CNRS, France 

  72. Provable Dual Attacks on Learning with Errors  

    Amaury Pouly, Yixin Shen  
    French National Centre for Scientific Research (CNRS), Paris, France, King's College London, London, Uk 

  73. Improved Differential Meet-In-The-Middle Cryptanalysis  

    Zahra Ahmadian, Akram Khalesi, Dounia M'foukh, Hossein Moghimi, María Naya-Plasencia  
    Department of Electrical Engineering, Shahid Beheshti University, Tehran, Iran, INRIA Paris 

  74. Ordering Transactions with Bounded Unfairness: Definitions, Complexity and Constructions  

    Aggelos Kiayias, Nikos Leonardos, Yu Shen  
    University of Edinburgh and IOG, National and Kapodistrian University of Athens, University of Edinburgh 

  75. The Hardness of LPN over Any Integer Ring and Field for PCG Applications  

    Hanlin Liu, Xiao Wang, Kang Yang, Yu Yu  
    Shanghai Jiao Tong University, Shanghai Qi Zhi Institute, Northwestern University, State Key Laboratory of Cryptology 

  76. Post-Quantum security of Tweakable Even-Mansour, and Applications  

    Gorjan Alagic, Chen Bai, Jonathan Katz, Christian Majenz, Patrick Struck  
    University of Maryland, NIST, University of Maryland, Google, Technical University of Denmark, University of Konstanz 

  77. Unlocking the lookup singularity with Lasso  

    Srinath Setty, Justin Thaler, Riad Wahby  
    Microsoft Research, a16z crypto research and Georgetown University, CMU 

  78. Succinct Functional Commitments for Circuits from k-Lin  

    Hoeteck Wee, David J. Wu  
    NTT Research and ENS, Paris, UT Austin 

  79. Efficient Pre-processing PIR Without Public-Key Cryptography  

    Mingxun Zhou, Ashrujit Ghoshal, Elaine Shi  
    CMU

  80. Time-Lock Puzzles with Efficient Batch Solving  

    Jesko Dujmovic, Rachit Garg, Giulio Malavolta  
    CISPA Helmholtz Center for Information Security, UT Austin, Bocconi University & Max Planck Institute for Security and Privacy 

  81. Leakage-Tolerant Circuits  

    Yuval Ishai, Yifan Song  
    Technion, Tsinghua University and Shanghai Qi Zhi Institute 

  82. Circuit Bootstrapping: Faster and Smaller  

    Ruida Wang, Yundi Wen, Zhihao Li, Xianhui Lu, Benqiang Wei, Kun Liu, Kunpeng Wang  
    Key Laboratory of Cyberspace Security Defense, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China; School of Cyber Security, University of Chinese Academy of Sciences, Beijing, China, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China 

  83. Probabilistic Extensions: A One-Step Framework for Finding Rectangle Attacks and Beyond  

    Ling Song, Qianqian Yang, Yincen Chen, Lei Hu, Jian Weng  
    College of Cyber Security, Jinan University, Key Laboratory of Cyberspace Security Defense, Institute of Information Engineering 

  84. Pseudorandom Isometries  伪随机异构体

    Prabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu, Yao-Ting Lin  
    UCSB 

  85. Strong Batching for Non-Interactive Statistical Zero-Knowledge
    非交互式统计零知识的强批处理

    Prashant Nalini Vasudevan, Ron D. Rothblum, Shafik Nassar, Changrui Mu
    Prashant Nalini Vasudevan、Ron D.Rothblum、Shafik Nassar、Changrui Mu
    National University of Singapore, Technion, The University of Texas at Austin
    新加坡国立大学,Technion,得克萨斯大学奥斯汀分校

  86. New Limits of Provable Security and Applications to ElGamal Encryption

    Sven Schäge
    Eindhoven University of Technology

  87. Asymptotically Optimal Message Dissemination with Applications to Blockchains

    Chen-Da Liu-Zhang, Christian Matt, Søren Eller Thomsen
    HSLU and Web3 Foundation, Concordium, The Alexandra Institute

  88. Constructing Leakage-resilient Shamir's Secret Sharing: Over Composite Order Fields

    Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Xiuyu Ye
    Purdue University, ETH Zurich, Ariel University

  89. Massive Superpoly Recovery with a Meet-in-the-middle Framework -- Improved Cube Attacks on Trivium and Kreyvium

    Jiahui He, Kai Hu, Meiqin Wang, Hao Lei
    Shandong University, Nanyang Technological University

  90. Integrating Causality in Messaging Channels

    Shan Chen, Marc Fischlin
    Southern University of Science and Technology, TU Darmstadt

  91. Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate

    Pedro Branco, Nico Döttling, Akshayaram Srinivasan
    Max Planck Institute for Security and Privacy, CISPA, University of Toronto

  92. Connecting Leakage-Resilient Secret Sharing to Practice: Scaling Trends and Physical Dependencies of Prime Field Masking

    Sebastian Faust, Loïc Masure, Elena Micheli, Maximilian Orlt, Francois-Xavier Standaert
    Technische Universität Darmstadt, Université de Montpellier, CNRS, LIRMM (France), Université catholique de Louvain

  93. Succinct Homomorphic Secret Sharing

    Damiano Abram, Lawrence Roy, Peter Scholl
    Aarhus University

  94. How to Garble Mixed Circuits that Combine Boolean and Arithmetic Computations

    Hanjun Li, Tianren Liu
    University of Washington, Peking University

  95. From Random Probing to Noisy Leakages Without Field-Size Dependence

    Gianluca Brian, Stefan Dziembowski, Sebastian Faust
    ETH Zürich, University of Warsaw, TU Darmstadt

  96. Reduction from sparse LPN to LPN, Dual Attack 3.0

    Carrier, Debris-Alazard, Meyer-Hilfiger, Tillich
    ETIS laboratory CYU, Inria

  97. Registered Functional Encryptions from Pairings

    Ziqi Zhu, Jiangtao Li, Kai Zhang, Junqing Gong, Haifeng Qian
    East China Normal University, Shanghai University, Shanghai University of Electric Power

  98. Accelerating BGV Bootstrapping for Large $p$ Using Null Polynomials Over $\mathbb{Z}_{p^e}$

    Shihe Ma, Tairong Huang, Anyu Wang, Xiaoyun Wang
    Tsinghua University

  99. Plover: Masking-Friendly Hash-and-Sign Lattice Signatures

    Thomas Prest, Thomas Espitau, Guilhem Niot, Ron Steinfeld, Amin Sakzad, Muhammed F. Esgin
    PQShield, Monash University

  100. A General Framework for Lattice-Based ABE using Evasive Inner Product Functional Encryption
    一种基于格点的规避内积函数加密ABE通用框架

    Yao-Ching Hsieh, Huijia Lin, Ji Luo
    姚庆燮、林惠嘉、季洛
    University of Washington
    华盛顿大学

  101. Updatable Public Key Encryption, Revisited
    可更新公钥加密,再谈

    Joël Alwen, Georg Fuchsbauer, Marta Mularczyk
    Joël Alwen、Georg Fuchsbauer、Marta Mularczyk
    AWS, TU Wien AWS,TU Wien

  102. Symmetric Signcryption and E2EE Messaging in Keybase
    Keybase中的对称签密和E2EE消息

    Joseph Jaeger, Akshaya Kumar, Igors Stepanovs
    Joseph Jaeger、Akshaya Kumar、Igors Stepanovs
    Georgia Institute of Technology,
    乔治亚理工学院,

  103. Proof-of-Work-based Consensus in Expected-Constant Time
    期望恒定时间内基于工作的一致性证明

    Juan Garay, Aggelos Kiayias, Yu Shen
    Juan Garay、Aggelos Kiayias、Yu Shen
    Texas A&M University, University of Edinburgh and IOG, University of Edinburgh
    德克萨斯农工大学、爱丁堡大学和爱丁堡大学IOG

  104. A Direct PRF Construction from Kolmogorov Complexity
    从Kolmogorov复杂性直接构造PRF

    Yanyi Liu, Rafael Pass
    刘燕怡,帕斯
    Cornell tech, Tel-Aviv University and Cornell Tech
    康奈尔大学、特拉维夫大学和康奈尔大学

  105. Diving Deep into the Preimage Security of AES-like Hashing
    类AES哈希的预图像安全性研究

    Shiyao Chen, Jian Guo, Eik List, Danping Shi, Tianyu Zhang
    陈士耀,郭健,艾力斯,史丹萍,张天宇
    Nanyang Technological University, Independent Researcher, Institute of Information Engineering, Chinese Academy of Sciences
    南洋理工大学,中国科学院信息工程研究所独立研究员

欢迎打赏

标签:2024,CNRS,Information,Institute,University,France,Eurocrypt,Security,Accepted
From: https://www.cnblogs.com/3cH0-Nu1L/p/18241057

相关文章

  • 2024年新高考一卷数学第19题答案解析
    题目设\(m\)为正整数,数列\(a_1,a_2,...,a_{4m+2}\)为公差不为\(0\)的等差数列,若从中删去两项\(a_i,a_j(i<j)\)后剩下的\(4m\)项可被分成\(m\)组且每组\(4\)个数都能构成等差数列,则称数列\(a_1,a_2,...,a_{4m+2}\)是\((i,j)\)的一可分数列。写出所有的\((i,j......
  • 2024.6.10(beta阶段的postmortem报告)
    beta阶段的postmortem报告1.每个成员在beta阶段的实践和alpha阶段有何改进?成员Beta阶段的实践和alpha阶段有何改进李天宇beta阶段相对于alpha阶段对调用AI和布置网页到服务器等相关技术更为熟悉。胡翔beta阶段相对于alpha阶段更加熟悉了C#和unity这两门语言,对游......
  • CISCN2024 初赛 wp 部分复现(Re)
    Misc1.火锅链观光打卡答题即可Re1.asm_re感谢智谱清言,可以读出大致加密算法这是输入这是加密部分这里判断找到疑似密文的部分,手动改一下端序#asm_wpdefdec(char):return(((char-0x1E)^0x4D)-0x14)//0x50#return(ord(char)*0x50+0......
  • 2024 JavaScript笔记(精简版)
    系列文章目录文章目录系列文章目录第一章JavaScript简介:1.1特点:1.2JavaScript与Java的区别1.3JavaScript不能做什么1.4JavaScript组成第二章JavaScript必备基础知识JavaScript代码调试方式一、变量2.1.1变量的命名规则:2.1.2变量作用域2.1.3变量提升二、数......
  • 2024年的高考人工智能,你能把握住么?还能卷么?
    背景:随着国家针对人工智能出台的政策越来越多了,很多国企也纷纷进入了该行业进行了布局,就连2024这次的高考的语文作文都是人工智能。高考作文:新课标I卷阅读下面的材料,根据要求写作。(60分)随着互联网的普及、人工智能的应用,越来越多的问题能很快得到答案。那么,我们的......
  • 2024-06-05 拷贝、函数、装饰器、迭代生成器
    一、浅拷贝lists=[1,2,[6]]内存空间不同,浅拷贝内容不变 new_lists=copy(lists)lists.append(7)print(lists,new_lists)//[1,2,[6],7][1,2,[6]]改变列表中内容,内存空间相同,数值改变new_lists=copy(lists)lists[-1].append(7)print(lists,new_lists)//[......
  • 2024-06-06 闭包、常用函、类和实例
    一、闭包1.定义闭包是一个函数内部定义的内部函数,且可以访问外部函数的变量。常用与数据隐藏和信息封装。defhello():username='小小奇'defvoi()://内部函数变量returnusernamereturnvoi2.数据隐藏将变量封装在内部函数......
  • 2024最新最全【大模型技术AGI】入门到精通,看完这一篇就够了!
    学习大模型(例如GPT-3、BERT等)需要一定的数学和编程基础,以及对人工智能、机器学习、自然语言处理等领域的了解。以下是一个学习大模型的基本路线:基础知识储备:数学基础:掌握线性代数、概率论与数理统计、微积分等数学知识。编程基础:熟悉至少一种编程语言,如Python,因为大多......
  • 2024 年 Web 安全最详细学习路线指南,从入门到入职(含书籍、工具包)【建议收藏】
    第一个方向:安全研发你可以把网络安全理解成电商行业、教育行业等其他行业一样,每个行业都有自己的软件研发,网络安全作为一个行业也不例外,不同的是这个行业的研发就是开发与网络安全业务相关的软件。既然如此,那其他行业通用的岗位在安全行业也是存在的,前端、后端、大数据分......
  • NOIP2024模拟11:忠于自我
    NOIP2024模拟11:忠于自我T1一句话题意:有若干个容量为\(L\)的包,从左往右装物品,当前包还能装则装,否则必须重开一个包装进去,对于\(\foralli\in[1,n]\),问想要以此装入第\(i\simn\)个物品需要开多少个包?结论题:倒着装和正着装所需要的包数是一样的.感性理解:在"......