Abstract is missing.
- Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded AdversariesStefano Tessaro, Aishwarya Thiruvengadam. 3-32 [doi]
- Static-Memory-Hard Functions, and Modeling the Cost of Space vs. TimeThaddeus Dryja, Quanquan C. Liu, Sunoo Park. 33-66 [doi]
- No-signaling Linear PCPsSusumu Kiyoshima. 67-97 [doi]
- On Basing Search SIVP on NP-HardnessTianren Liu. 98-119 [doi]
- Two-Round MPC: Information-Theoretic and Black-BoxSanjam Garg, Yuval Ishai, Akshayaram Srinivasan. 123-151 [doi]
- Perfect Secure Computation in Two RoundsBenny Applebaum, Zvika Brakerski, Rotem Tsabary. 152-174 [doi]
- Two-Round Adaptively Secure Multiparty Computation from Standard AssumptionsFabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam. 175-205 [doi]
- One-Message Zero Knowledge and Non-malleable CommitmentsNir Bitansky, Huijia Lin. 209-234 [doi]
- Smooth NIZK ArgumentsCharanjit S. Jutla, Arnab Roy 0003. 235-262 [doi]
- Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way PermutationsCarmit Hazay, Muthuramakrishnan Venkitasubramaniam. 263-285 [doi]
- Round Optimal Black-Box "Commit-and-Prove"Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan. 286-313 [doi]
- On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information RateBenny Applebaum, Barak Arkis. 317-344 [doi]
- Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality RatioDaniel Jost, Ueli Maurer, João L. Ribeiro. 345-369 [doi]
- Information-Theoretic Broadcast with Dishonest Majority for Long MessagesWutichai Chongchitmate, Rafail Ostrovsky. 370-388 [doi]
- Oblivious Transfer in Incomplete NetworksVarun Narayanan, Vinod M. Prabhakaran. 389-418 [doi]
- Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?Lior Rotem, Gil Segev. 421-447 [doi]
- Enhancements are Blackbox Non-trivial: Impossibility of Enhanced Trapdoor Permutations from Standard Trapdoor PermutationsMohammad Hajiabadi. 448-475 [doi]
- Certifying Trapdoor Permutations, RevisitedRan Canetti, Amit Lichtenberg. 476-506 [doi]
- On the Security Loss of Unique SignaturesAndrew Morgan, Rafael Pass. 507-536 [doi]
- On the Complexity of Fair Coin FlippingIftach Haitner, Nikolaos Makriyannis, Eran Omri. 539-562 [doi]
- Game Theoretic Notions of Fairness in Multi-party Coin TossKai-Min Chung, Yue Guo, Wei-Kai Lin, Rafael Pass, Elaine Shi. 563-596 [doi]
- Achieving Fair Treatment in Algorithmic ClassificationAndrew Morgan, Rafael Pass. 597-625 [doi]
- Upgrading to Functional EncryptionSaikrishna Badrinarayanan, Dakshita Khurana, Amit Sahai, Brent Waters. 629-658 [doi]
- Impossibility of Simulation Secure Functional Encryption Even with Random OraclesShashank Agrawal, Venkata Koppula, Brent Waters. 659-688 [doi]
- Registration-Based Encryption: Removing Private-Key Generator from IBESanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi. 689-718 [doi]