【论文速递】Eurocrypt'24(同源、LWE、签名、信息论安全、安全外包、证明系统、混淆电路)
原创
Kurt Pan
Kurt Pan
XPTY
2024年05月16日 22:58
美国
在小说阅读器中沉浸阅读
https://eurocrypt.iacr.org/2024/program.php
May 26-30, 2024
Isogenies
SQIsignHD: New Dimensions in Cryptography
Pierrick Dartois, Antonin Leroux, Damien Robert, Benjamin Wesolowski
http://dx.doi.org/10.1007/978-3-031-58716-0_1
AprèsSQI: Extra Fast Verification for SQIsign Using Extension-Field Signing
Maria Corte-Real Santos, Jonathan Komada Eriksen, Michael Meyer, Krijn Reijnders
http://dx.doi.org/10.1007/978-3-031-58716-0_3
The Supersingular Endomorphism Ring and One Endomorphism Problems Are Equivalent
Aurel Page, Benjamin Wesolowski
http://dx.doi.org/10.1007/978-3-031-58751-1_14
M&M'S: Mix and Match Attacks on Schnorr-type Blind Signatures with Repetition
Khue Do, Lucjan Hanzlik, Eugenio Paracucchi
https://link.springer.com/chapter/10.1007/978-3-031-58751-1_13
Isogeny Problems with Level Structure
Luca De Feo, Tako Boris Fouotsa, Lorenz Panny
http://dx.doi.org/10.1007/978-3-031-58754-2_7
LWE Encryption and Applications
The Complexity of Algebraic Algorithms for LWE
Matthias Johann Steiner
http://dx.doi.org/10.1007/978-3-031-58734-4_13
Crypto Dark Matter on the Torus: Oblivious PRFs From Shallow PRFs and TFHE
Martin R. Albrecht, Alex Davidson, Amit Deo, Daniel Gardham
https://eprint.iacr.org/2023/232
Evaluating the security of CRYSTALS-Dilithium in the Quantum Random Oracle Model
Kelsey A. Jackson, Carl A. Miller, Daochen Wang
https://link.springer.com/chapter/10.1007/978-3-031-58751-1_15
Digital Signatures
Practical Threshold Signatures from Standard Lattice Assumptions
Shuichi Katsumata, Mary Maller, Rafael del Pino, Fabrice Mouhartem, Thomas Prest, Markku-Juhani Saarinen
https://eprint.iacr.org/2024/184
Twinkle: Threshold Signatures from DDH with Full Adaptive Security
Renas Bacho, Julian Loss, Stefano Tessaro, Benedikt Wagner, Chenzhi Zhu
http://dx.doi.org/10.1007/978-3-031-58716-0_15
Toothpicks: More Efficient Fork-Free Two-Round Multi-Signatures
Jiaxin Pan, Benedikt Wagner
http://dx.doi.org/10.1007/978-3-031-58716-0_16
Foundations of Adaptor Signatures
Paul Gerhart, Dominique Schröder, Pratik Soni, Sri Aravinda Krishnan Thyagarajan
http://dx.doi.org/10.1007/978-3-031-58723-8_6
Signatures with Memory-Tight Security in the Quantum Random Oracle Model
Keita Xagawa
http://dx.doi.org/10.1007/978-3-031-58754-2_2
Schnorr Signatures and Applications
SPRINT: High-Throughput Robust Distributed Schnorr Signatures
Fabrice Benhamouda, Shai Halevi, Hugo Krawczyk, Yiping Ma, Tal Rabin
http://dx.doi.org/10.1007/978-3-031-58740-5_3
Fast Batched Asynchronous Distributed Key Generation
Victor Shoup, Jens Groth
http://dx.doi.org/10.1007/978-3-031-58740-5_13
Concurrently Secure Blind Schnorr Signatures
Georg Fuchsbauer, Mathias Wolf
http://dx.doi.org/10.1007/978-3-031-58723-8_5
Information-Theoretic Security
Pauli Manipulation Detection codes and Applications to Quantum Communication over Adversarial Channels
Thiago Bergamaschi
http://dx.doi.org/10.1007/978-3-031-58734-4_14
Non-malleable Codes with Optimal Rate for Poly-Size Circuits
Marshall Ball, Ronen Shaltiel, Jad Silbak
http://dx.doi.org/10.1007/978-3-031-58737-5_2
Approximate Lower Bound Arguments
Pyrros Chaidos, Aggelos Kiayias, Leonid Reyzin, Anatoliy Zinovyev
http://dx.doi.org/10.1007/978-3-031-58737-5_3
Secure Outsourcing
Probabilistically Checkable Arguments for all NP
Shany Ben-David
http://dx.doi.org/10.1007/978-3-031-58734-4_12
Software with Certified Deletion
James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta, Justin Raizes, Bhaskar Roberts
http://dx.doi.org/10.1007/978-3-031-58737-5_4
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance
Cody Freitag, Omer Paneth, Rafael Pass
http://dx.doi.org/10.1007/978-3-031-58737-5_5
Proof Systems
Witness Semantic Security
Paul Lou, Nathan Manohar, Amit Sahai
http://dx.doi.org/10.1007/978-3-031-58740-5_6
Monotone-Policy Aggregate Signatures
Maya Farber Brodsky, Arka Rai Choudhuri, Abhishek Jain, Omer Paneth
http://dx.doi.org/10.1007/978-3-031-58737-5_7
Strong Batching for Non-Interactive Statistical Zero-Knowledge
Prashant Nalini Vasudevan, Ron D. Rothblum, Shafik Nassar, Changrui Mu
http://dx.doi.org/10.1007/978-3-031-58751-1_9
SNARKs
Unlocking the Lookup Singularity with Lasso
Srinath Setty, Justin Thaler, Riad Wahby
http://dx.doi.org/10.1007/978-3-031-58751-1_7
Jolt: SNARKs for Virtual Machines via Lookups
Arasu Arun, Srinath Setty, Justin Thaler
http://dx.doi.org/10.1007/978-3-031-58751-1_1
Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions
Helger Lipmaa, Roberto Parisella, Janno Siim
http://dx.doi.org/10.1007/978-3-031-58751-1_2
SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions
Martin R. Albrecht, Giacomo Fenzi, Oleksandra Lapiha, Ngoc Khanh Nguyen
http://dx.doi.org/10.1007/978-3-031-58754-2_4
Bulletproofs++: Next Generation Confidential Transactions via Reciprocal Set Membership Arguments
Liam Eagen, Sanket Kanjalkar, Jonas Nick, Tim Ruffing
http://dx.doi.org/10.1007/978-3-031-58740-5_9
Garbled Circuits
Toward Malicious Constant-Rate 2PC via Arithmetic Garbling
Carmit Hazay, Yibin Yang
http://dx.doi.org/10.1007/978-3-031-58740-5_14
How to Garble Mixed Circuits that Combine Boolean and Arithmetic Computations
Hanjun Li, Tianren Liu
http://dx.doi.org/10.1007/978-3-031-58751-1_12
Garbled Circuit Lookup Tables with Logarithmic Number of Ciphertexts
David Heath, Vladimir Kolesnikov, Lucien K. L. Ng
http://dx.doi.org/10.1007/978-3-031-58740-5_7
Efficient Arithmetic in Garbled Circuits
David Heath
https://eprint.iacr.org/2024/139.pdf
阅读原文