Abstract is missing.
- Homomorphic Secret Sharing from Lattices Without FHEElette Boyle, Lisa Kohl, Peter Scholl. 3-33 [doi]
- Improved Bootstrapping for Approximate Homomorphic EncryptionHao Chen 0030, Ilaria Chillotti, Yongsoo Song. 34-54 [doi]
- Minicrypt Primitives with Algebraic Structure and ApplicationsNavid Alamati, Hart Montgomery, Sikhar Patranabis, Arnab Roy 0003. 55-82 [doi]
- Attacks only Get Better: How to Break FF3 on Large DomainsViet Tung Hoang, David Miller, Ni Trieu. 85-116 [doi]
- Session Resumption Protocols and Efficient Forward Security for TLS 1.3 0-RTTNimrod Aviram, Kai Gellert, Tibor Jager. 117-150 [doi]
- An Analysis of NIST SP 800-90AJoanne Woodage, Dan Shumow. 151-180 [doi]
- Computationally Volume-Hiding Structured EncryptionSeny Kamara, Tarik Moataz. 183-213 [doi]
- Locality-Preserving Oblivious RAMGilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren 0001, Elaine Shi. 214-243 [doi]
- Private Anonymous Data AccessAriel Hamlin, Rafail Ostrovsky, Mor Weiss, Daniel Wichs. 244-273 [doi]
- Reversible Proofs of Sequential WorkHamza Abusalah, Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter. 277-291 [doi]
- Incremental Proofs of Sequential WorkNico Döttling, Russell W. F. Lai, Giulio Malavolta. 292-323 [doi]
- Tight Proofs of Space and ReplicationBen Fisch. 324-348 [doi]
- Founding Secure Computation on BlockchainsArka Rai Choudhuri, Vipul Goyal, Abhishek Jain 0002. 351-380 [doi]
- Uncovering Algebraic Structures in the MPC LandscapeNavneet Agarwal, Sanat Anand, Manoj Prabhakaran. 381-406 [doi]
- Quantum Circuits for the CSIDH: Optimizing Quantum Evaluation of IsogeniesDaniel J. Bernstein, Tanja Lange 0001, Chloe Martindale, Lorenz Panny. 409-441 [doi]
- A Quantum-Proof Non-malleable Extractor - With Application to Privacy Amplification Against Active Quantum AdversariesDivesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick. 442-469 [doi]
- A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness ModelGeoffroy Couteau. 473-503 [doi]
- Degree 2 is Complete for the Round-Complexity of Malicious MPCBenny Applebaum, Zvika Brakerski, Rotem Tsabary. 504-531 [doi]
- Two Round Information-Theoretic MPC with Malicious SecurityPrabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain 0002. 532-561 [doi]
- Designated-Verifier Pseudorandom Generators, and Their ApplicationsGeoffroy Couteau, Dennis Hofheinz. 562-592 [doi]
- Reusable Designated-Verifier NIZKs for all NP from CDHWilly Quach, Ron D. Rothblum, Daniel Wichs. 593-621 [doi]
- Designated Verifier/Prover and Preprocessing NIZKs from Diffie-Hellman AssumptionsShuichi Katsumata, Ryo Nishimaki, Shota Yamada 0001, Takashi Yamakawa. 622-651 [doi]
- Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and MoreNicholas Genise, Daniele Micciancio, Yuriy Polyakov. 655-684 [doi]
- Approx-SVP in Ideal Lattices with Pre-processingAlice Pellet-Mary, Guillaume Hanrot, Damien Stehlé. 685-716 [doi]
- The General Sieve Kernel and New Records in Lattice ReductionMartin R. Albrecht, Léo Ducas, Gottfried Herold, Elena Kirshanova, Eamonn W. Postlethwaite, Marc Stevens. 717-746 [doi]
- Misuse Attacks on Post-quantum CryptosystemsCiprian Baetu, F. Betül Durak, Loïs Huguenin-Dumittan, Abdullah Talayhan, Serge Vaudenay. 747-776 [doi]