Abstract is missing.
- From Indifferentiability to Constructive Cryptography (and Back)Ueli Maurer, Renato Renner. 3-24 [doi]
- Fast Pseudorandom Functions Based on Expander GraphsBenny Applebaum, Pavel Raykov. 27-56 [doi]
- 3-Message Zero Knowledge Against Human IgnoranceNir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan. 57-83 [doi]
- The GGM Function Family Is a Weakly One-Way Family of FunctionsAloni Cohen, Saleet Klein. 84-107 [doi]
- On the (In)Security of SNARKs in the Presence of OraclesDario Fiore, Anca Nitulescu. 108-138 [doi]
- Leakage Resilient One-Way Functions: The Auxiliary-Input SettingIlan Komargodski. 139-158 [doi]
- Simulating Auxiliary Inputs, RevisitedMaciej Skórski. 159-179 [doi]
- Pseudoentropy: Lower-Bounds for Chain Rules and TransformationsKrzysztof Pietrzak, Maciej Skórski. 183-203 [doi]
- Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key AgreementIgnacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci. 204-234 [doi]
- Simultaneous Secrecy and Reliability Amplification for a General Channel ModelRussell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro. 235-261 [doi]
- Proof of Space from Stacked ExpandersLing Ren, Srinivas Devadas. 262-285 [doi]
- Perfectly Secure Message Transmission in Two RoundsGabriele Spini, Gilles Zémor. 286-304 [doi]
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters MaliciousBar Alon, Eran Omri. 307-335 [doi]
- Binary AMD Circuits from Secure Multiparty ComputationDaniel Genkin, Yuval Ishai, Mor Weiss. 336-366 [doi]
- Composable Security in the Tamper-Proof Hardware Model Under Minimal ComplexityCarmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam. 367-399 [doi]
- Composable Adaptive Secure Protocols Without Setup Under Polytime AssumptionsCarmit Hazay, Muthuramakrishnan Venkitasubramaniam. 400-432 [doi]
- Adaptive Security of Yao's Garbled CircuitsZahra Jafargholi, Daniel Wichs. 433-458 [doi]
- Efficient Secure Multiparty Computation with Identifiable AbortCarsten Baum, Emmanuela Orsini, Peter Scholl. 461-490 [doi]
- Secure Multiparty RAM Computation in Constant RoundsSanjam Garg, Divya Gupta 0001, Peihan Miao, Omkant Pandey. 491-520 [doi]
- Constant-Round Maliciously Secure Two-Party Computation in the RAM ModelCarmit Hazay, Avishay Yanai. 521-553 [doi]
- More Efficient Constant-Round Multi-party Computation from BMR and SHEYehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez. 554-581 [doi]
- Cross and Clean: Amortized Garbled Circuits with Constant OverheadJesper Buus Nielsen, Claudio Orlandi. 582-603 [doi]
- Separating Computational and Statistical Differential Privacy in the Client-Server ModelMark Bun, Yi-Hsiu Chen, Salil P. Vadhan. 607-634 [doi]
- Concentrated Differential Privacy: Simplifications, Extensions, and Lower BoundsMark Bun, Thomas Steinke. 635-658 [doi]
- Strong Hardness of Privacy from Weak Traitor TracingLucas Kowalczyk, Tal Malkin, Jonathan Ullman, Mark Zhandry. 659-689 [doi]