Abstract is missing.
- Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded EncodingsRafael Pass, Abhi Shelat. 3-17 [doi]
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized ModelsMohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji. 18-48 [doi]
- Lower Bounds on Assumptions Behind Indistinguishability ObfuscationMohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji, Rafael Pass, Abhi Shelat. 49-66 [doi]
- Indistinguishability Obfuscation: From Approximate to ExactNir Bitansky, Vinod Vaikuntanathan. 67-95 [doi]
- Output-Compressing Randomized Encodings and ApplicationsHuijia Lin, Rafael Pass, Karn Seth, Sidharth Telang. 96-124 [doi]
- Functional Encryption for Turing MachinesPrabhanjan Vijendra Ananth, Amit Sahai. 125-153 [doi]
- The Complexity of Computing the Optimal Composition of Differential PrivacyJack Murtagh, Salil P. Vadhan. 157-175 [doi]
- Order-Revealing Encryption and the Hardness of Private LearningMark Bun, Mark Zhandry. 176-206 [doi]
- On the Hardness of Learning with Rounding over Small ModulusAndrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen. 209-224 [doi]
- Two-Round Man-in-the-Middle Security from LPNDavid Cash, Eike Kiltz, Stefano Tessaro. 225-248 [doi]
- Algebraic Partitioning: Fully Compact and (almost) Tightly Secure CryptographyDennis Hofheinz. 251-281 [doi]
- Standard Security Does Imply Security Against Selective Opening for Markov DistributionsGeorg Fuchsbauer, Felix Heuer, Eike Kiltz, Krzysztof Pietrzak. 282-305 [doi]
- Non-Malleable Encryption: Simpler, Shorter, StrongerSandro Coretti, Yevgeniy Dodis, Björn Tackmann, Daniele Venturi. 306-335 [doi]
- Verifiable Random Functions from Standard AssumptionsDennis Hofheinz, Tibor Jager. 336-362 [doi]
- Homomorphic Evaluation Requires DepthAndrej Bogdanov, Chin Ho Lee. 365-371 [doi]
- On Basing Private Information Retrieval on NP-HardnessTianren Liu, Vinod Vaikuntanathan. 372-386 [doi]
- On the Correlation Intractability of Obfuscated Pseudorandom FunctionsRan Canetti, Yilei Chen, Leonid Reyzin. 389-415 [doi]
- Reconfigurable Cryptography: A Flexible Approach to Long-Term SecurityJulia Hesse, Dennis Hofheinz, Andy Rupp. 416-445 [doi]
- Multilinear Maps from ObfuscationMartin R. Albrecht, Pooya Farshim, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson. 446-473 [doi]
- Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability ObfuscationNir Bitansky, Omer Paneth, Daniel Wichs. 474-502 [doi]
- Cryptographic Assumptions: A Position PaperShafi Goldwasser, Yael Tauman Kalai. 505-522 [doi]
- Adaptive Security with Quasi-Optimal RateBrett Hemenway, Rafail Ostrovsky, Silas Richelson, Alon Rosen. 525-541 [doi]
- On the Complexity of Additively Homomorphic UC CommitmentsTore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Roberto Trifiletti. 542-565 [doi]
- Simplified Universal Composability FrameworkDouglas Wikström. 566-595 [doi]
- Characterization of Secure Multiparty Computation Without BroadcastRan Cohen, Iftach Haitner, Eran Omri, Lior Rotem. 596-616 [doi]