Abstract is missing.
- Succinct Arguments in the Quantum Random Oracle ModelAlessandro Chiesa, Peter Manohar, Nicholas Spooner. 1-29 [doi]
- Delegating Quantum Computation in the Quantum Random Oracle ModelJiayu Zhang. 30-60 [doi]
- Tighter Proofs of CCA Security in the Quantum Random Oracle ModelNina Bindel, Mike Hamburg, Kathrin Hövelmanns, Andreas Hülsing, Edoardo Persichetti. 61-90 [doi]
- Attribute Based Encryption for Deterministic Finite Automata from \mathsfDLINShweta Agrawal, Monosij Maitra, Shota Yamada 0001. 91-117 [doi]
- CPA-to-CCA Transformation for KDM SecurityFuyuki Kitagawa, Takahiro Matsuda 0002. 118-148 [doi]
- New Approaches to Traitor Tracing with Embedded IdentitiesRishab Goyal, Venkata Koppula, Brent Waters. 149-179 [doi]
- A Unified and Composable Take on RatchetingDaniel Jost, Ueli Maurer, Marta Mularczyk. 180-210 [doi]
- Continuously Non-malleable Secret Sharing for General Access StructuresGianluca Brian, Antonio Faonio, Daniele Venturi 0001. 211-232 [doi]
- Interactive Non-malleable CodesNils Fleischhacker, Vipul Goyal, Abhishek Jain 0002, Anat Paskin-Cherniavsky, Slava Radune. 233-263 [doi]
- Stronger Lower Bounds for Online ORAMPavel Hubácek, Michal Koucký, Karel Král 0002, Veronika Slívová. 264-284 [doi]
- Adaptively Secure Garbling Schemes for Parallel ComputationsKai-Min Chung, Luowen Qian. 285-310 [doi]
- Statistical Difference Beyond the Polarizing RegimeItay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan. 311-332 [doi]
- Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and HardnessHamidreza Amini Khorasgani, Hemanta K. Maji, Tamalika Mukherjee. 333-355 [doi]
- Fully Homomorphic NIZK and NIWI ProofsPrabhanjan Ananth, Apoorvaa Deshpande, Yael Tauman Kalai, Anna Lysyanskaya. 356-385 [doi]
- Lower and Upper Bounds on the Randomness Complexity of Private Computations of ANDEyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, Damien Vergnaud. 386-406 [doi]
- Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock PuzzlesZvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta. 407-437 [doi]
- Compressible FHE with Applications to PIRCraig Gentry, Shai Halevi. 438-464 [doi]
- Permuted Puzzles and Cryptographic HardnessElette Boyle, Justin Holmgren, Mor Weiss. 465-493 [doi]
- Linear-Size Constant-Query IOPs for Delegating ComputationEli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner. 494-521 [doi]
- On the (In)security of Kilian-Based SNARGsJames Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, Ron D. Rothblum. 522-551 [doi]
- Incrementally Verifiable Computation via Incremental PCPsMoni Naor, Omer Paneth, Guy N. Rothblum. 552-576 [doi]