Abstract is missing.
- Post-quantum Anonymity of KyberVarun Maram, Keita Xagawa. 3-35 [doi]
- QCCA-Secure Generic Transformations in the Quantum Random Oracle ModelTianshu Shan, Jiangxia Ge, Rui Xue 0001. 36-64 [doi]
- A Thorough Treatment of Highly-Efficient NTRU InstantiationsJulien Duman, Kathrin Hövelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler, Dominique Unruh. 65-94 [doi]
- A Lightweight Identification Protocol Based on LatticesSamed Düzlü, Juliane Krämer, Thomas Pöppelmann, Patrick Struck. 95-113 [doi]
- POLKA: Towards Leakage-Resistant Post-quantum CCA-Secure Public Key EncryptionClément Hoffmann, Benoît Libert, Charles Momin, Thomas Peters, François-Xavier Standaert. 114-144 [doi]
- The Hidden Number Problem with Small Unknown Multipliers: Cryptanalyzing MEGA in Six Queries and Other ApplicationsNadia Heninger, Keegan Ryan. 147-176 [doi]
- Hull Attacks on the Lattice Isomorphism ProblemLéo Ducas, Shane Gibbons. 177-204 [doi]
- A Key-Recovery Attack Against Mitaka in the t-Probing ModelThomas Prest. 205-220 [doi]
- Hardening Signature Schemes via Derive-then-Derandomize: Stronger Security Proofs for EdDSAMihir Bellare, Hannah Davis, Zijing Di. 223-250 [doi]
- Security Analysis of RSA-BSSAAnna Lysyanskaya. 251-280 [doi]
- Extendable Threshold Ring Signatures with Enhanced AnonymityGennaro Avitabile, Vincenzo Botta, Dario Fiore. 281-311 [doi]
- Tracing a Linear Subspace: Application to Linearly-Homomorphic Group SignaturesChloé Hébant, David Pointcheval, Robert Schädlich. 312-341 [doi]
- SCALLOP: Scaling the CSI-FiShLuca De Feo, Tako Boris Fouotsa, Péter Kutas, Antonin Leroux, Simon-Philipp Merz, Lorenz Panny, Benjamin Wesolowski. 345-375 [doi]
- Round-Optimal Oblivious Transfer and MPC from Computational CSIDHSaikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee, Sikhar Patranabis, Srinivasan Raghuraman, Pratik Sarkar. 376-405 [doi]
- Generic Models for Group ActionsJulien Duman, Dominik Hartmann, Eike Kiltz, Sabrina Kunzweiler, Jonas Lehmann, Doreen Riepel. 406-435 [doi]
- CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From TimeCarsten Baum, Bernardo David, Rafael Dowsley, Ravi Kishore, Jesper Buus Nielsen, Sabine Oechsner. 439-470 [doi]
- Efficient and Universally Composable Single Secret Leader Election from PairingsDario Catalano, Dario Fiore 0001, Emanuele Giunta. 471-499 [doi]
- Simple, Fast, Efficient, and Tightly-Secure Non-malleable Non-interactive Timed CommitmentsPeter Chvojka, Tibor Jager. 500-529 [doi]
- Certifying Giant NonprimesCharlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak. 530-553 [doi]
- Transparent Batchable Time-lock Puzzles and Applications to Byzantine ConsensusShravan Srinivasan, Julian Loss, Giulio Malavolta, Kartik Nayak, Charalampos Papamanthou, Sri Aravinda Krishnan Thyagarajan. 554-584 [doi]
- Decentralized Multi-Authority Attribute-Based Inner-Product FE: Large Universe and UnboundedPratish Datta, Tapas Pal. 587-621 [doi]
- Multi-Client Inner Product Encryption: Function-Hiding Instantiations Without Random OraclesElaine Shi, Nikhil Vanjani. 622-651 [doi]
- GLUE: Generalizing Unbounded Attribute-Based Encryption for Flexible Efficiency Trade-OffsMarloes Venema, Greg Alpár. 652-682 [doi]
- EKE Meets Tight Security in the Universally Composable FrameworkXiangyu Liu, Shengli Liu 0001, Shuai Han 0001, Dawu Gu. 685-713 [doi]
- A Universally Composable PAKE with Zero Communication Cost - (And Why It Shouldn't Be Considered UC-Secure)Lawrence Roy, Jiayu Xu. 714-743 [doi]
- Sender-binding Key EncapsulationLaurin Benz, Wasilij Beskorovajnov, Sarai Eilebrecht, Jörn Müller-Quade, Astrid Ottenhues, Rebecca Schwerdt. 744-773 [doi]
- Pattern Matching in Encrypted Stream from Inner Product EncryptionElie Bouscatié, Guilhem Castagnos, Olivier Sanders. 774-801 [doi]