Abstract is missing.
- Tracing Quantum State Distinguishers via BacktrackingMark Zhandry. 3-36 [doi]
- Black-Hole Radiation Decoding Is Quantum CryptographyZvika Brakerski. 37-65 [doi]
- Cloning Games: A General Framework for Unclonable PrimitivesPrabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu 0001. 66-98 [doi]
- Publicly-Verifiable Deletion via Target-Collapsing FunctionsJames Bartusek, Dakshita Khurana, Alexander Poremba. 99-128 [doi]
- On Concurrent Multi-party Quantum ComputationVipul Goyal, Xiao Liang 0014, Giulio Malavolta. 129-161 [doi]
- Simple Tests of Quantumness Also Certify QubitsZvika Brakerski, Alexandru Gheorghiu, Gregory D. Kahanamoku-Meyer, Eitan Porat, Thomas Vidick. 162-191 [doi]
- Cryptography with Certified DeletionJames Bartusek, Dakshita Khurana. 192-223 [doi]
- Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)James Bartusek, Dakshita Khurana, Akshayaram Srinivasan. 224-257 [doi]
- Quantum Linear Key-Recovery Attacks Using the QFTAndré Schrottenloher. 258-291 [doi]
- Tighter QCCA-Secure Key Encapsulation Mechanism with Explicit Rejection in the Quantum Random Oracle ModelJiangxia Ge, Tianshu Shan, Rui Xue 0001. 292-324 [doi]
- A Detailed Analysis of Fiat-Shamir with AbortsJulien Devevey, Pouria Fallahpour, Alain Passelègue, Damien Stehlé. 327-357 [doi]
- Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and DilithiumManuel Barbosa, Gilles Barthe, Christian Doczkal, Jelle Don, Serge Fehr, Benjamin Grégoire, Yu-Hsuan Huang, Andreas Hülsing, Yi Lee, Xiaodi Wu. 358-389 [doi]
- Compact Lattice Gadget and Its Applications to Hash-and-Sign SignaturesYang Yu 0008, Huiwen Jia, Xiaoyun Wang. 390-420 [doi]
- Machine-Checked Security for rmXMSS as in RFC 8391 and $\mathrm {SPHINCS^{+}} $Manuel Barbosa, François Dupressoir, Benjamin Grégoire, Andreas Hülsing, Matthias Meijers, Pierre-Yves Strub. 421-454 [doi]
- + and XMSSKaiyi Zhang, Hongrui Cui, Yu Yu 0001. 455-483 [doi]
- Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFsMuhammed F. Esgin, Ron Steinfeld, Dongxi Liu, Sushmita Ruj. 484-517 [doi]
- LaBRADOR: Compact Proofs for R1CS from Module-SISWard Beullens, Gregor Seiler. 518-548 [doi]
- Toward Practical Lattice-Based Proof of Knowledge from Hint-MLWEDuhyeong Kim, Dongwon Lee, Jinyeong Seo, Yongsoo Song. 549-580 [doi]
- Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-HeadCarsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl. 581-615 [doi]
- Lattice-Based Authenticated Key Exchange with Tight SecurityJiaxin Pan, Benedikt Wagner, Runzhi Zeng. 616-647 [doi]
- Error Correction and Ciphertext Quantization in Lattice CryptographyDaniele Micciancio, Mark Schultz. 648-681 [doi]
- Almost Tight Multi-user Security Under Adaptive Corruptions from LWE in the Standard ModelShuai Han 0001, Shengli Liu 0001, Zhedong Wang, Dawu Gu. 682-715 [doi]
- sfDualMS: Efficient Lattice-Based Two-Round Multi-signature with Trapdoor-Free SimulationYanbo Chen. 716-747 [doi]
- Revisiting Security Estimation for LWE with Hints from a Geometric PerspectiveDana Dachman-Soled, Huijing Gong, Tom Hanson, Hunter Kippen. 748-781 [doi]
- Lattice-Based Timed CryptographyRussell W. F. Lai, Giulio Malavolta. 782-804 [doi]
- A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial ModulusParker Newton, Silas Richelson. 805-835 [doi]
- Reductions from Module Lattices to Free Module Lattices, and Application to Dequantizing Module-LLLGabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary, Nam Tran. 836-865 [doi]