Abstract is missing.
- Lossiness and Entropic Hardness for Ring-LWEZvika Brakerski, Nico Döttling. 1-27 [doi]
- Multi-key Fully-Homomorphic Encryption in the Plain ModelPrabhanjan Ananth, Abhishek Jain 0002, Zhengzhong Jin, Giulio Malavolta. 28-57 [doi]
- Constant Ciphertext-Rate Non-committing Encryption from Standard AssumptionsZvika Brakerski, Pedro Branco 0005, Nico Döttling, Sanjam Garg, Giulio Malavolta. 58-87 [doi]
- Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and MoreSanjam Garg, Mohammad Hajiabadi, Rafail Ostrovsky. 88-116 [doi]
- CP-ABE for Circuits (and More) in the Symmetric Key SettingShweta Agrawal, Shota Yamada 0001. 117-148 [doi]
- Optimal Broadcast Encryption from LWE and Pairings in the Standard ModelShweta Agrawal, Daniel Wichs, Shota Yamada 0001. 149-178 [doi]
- Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark)Ryo Nishimaki. 179-209 [doi]
- Functional Encryption for Quadratic Functions from k-Lin, RevisitedHoeteck Wee. 210-228 [doi]
- On Perfect Correctness in (Lockable) ObfuscationRishab Goyal, Venkata Koppula, Satyanarayana Vusirikala, Brent Waters. 229-259 [doi]
- Can a Public Blockchain Keep a Secret?Fabrice Benhamouda, Craig Gentry, Sergey Gorbunov 0001, Shai Halevi, Hugo Krawczyk, Chengyu Lin 0001, Tal Rabin, Leonid Reyzin. 260-290 [doi]
- Blockchains from Non-idealized Hash FunctionsJuan A. Garay, Aggelos Kiayias, Giorgos Panagiotakos. 291-321 [doi]
- Ledger Combiners for Fast SettlementMatthias Fitzi, Peter Gazi, Aggelos Kiayias, Alexander Russell. 322-352 [doi]
- Asynchronous Byzantine Agreement with Subquadratic CommunicationErica Blum, Jonathan Katz, Chen-Da Liu Zhang, Julian Loss. 353-380 [doi]
- Expected Constant Round Byzantine Broadcast Under Dishonest MajorityJun Wan, Hanshen Xiao, Elaine Shi, Srinivas Devadas. 381-411 [doi]
- Round-Efficient Byzantine Broadcast Under Strongly Adaptive and Majority CorruptionsJun Wan, Hanshen Xiao, Srinivas Devadas, Elaine Shi. 412-456 [doi]
- A Lower Bound for One-Round Oblivious RAMDavid Cash, Andrew Drucker, Alexander Hoover. 457-485 [doi]
- Lower Bounds for Multi-server Oblivious RAMsKasper Green Larsen, Mark Simkin 0001, Kevin Yeo. 486-503 [doi]
- On Computational Shortcuts for Information-Theoretic PIRMatthew M. Hong, Yuval Ishai, Victor I. Kolobov, Russell W. F. Lai. 504-534 [doi]
- Characterizing Deterministic-Prover Zero KnowledgeNir Bitansky, Arka Rai Choudhuri. 535-566 [doi]
- NIZK from SNARGFuyuki Kitagawa, Takahiro Matsuda 0002, Takashi Yamakawa. 567-595 [doi]
- Weakly Extractable One-Way FunctionsNir Bitansky, Noa Eizenstadt, Omer Paneth. 596-626 [doi]
- Towards Non-interactive Witness HidingBenjamin Kuykendall, Mark Zhandry. 627-656 [doi]
- FHE-Based Bootstrapping of Designated-Prover NIZKZvika Brakerski, Sanjam Garg, Rotem Tsabary. 657-683 [doi]
- Perfect Zero Knowledge: New Upperbounds and Relativized SeparationsPeter Dixon 0002, Sutanu Gayen, Aduri Pavan, N. V. Vinodchandran. 684-704 [doi]