Abstract is missing.
- Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain ModelCarmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam. 3-39 [doi]
- Adaptively Indistinguishable Garbled CircuitsZahra Jafargholi, Alessandra Scafuro, Daniel Wichs. 40-71 [doi]
- Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMsT.-H. Hubert Chan, Elaine Shi. 72-107 [doi]
- Resettably-Sound Resettable Zero Knowledge in Constant RoundsWutichai Chongchitmate, Rafail Ostrovsky, Ivan Visconti. 111-138 [doi]
- Round Optimal Concurrent Non-malleability from Polynomial HardnessDakshita Khurana. 139-171 [doi]
- Zero Knowledge Protocols from Succinct Constraint DetectionEli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner. 172-206 [doi]
- How to Construct a Leakage-Resilient (Stateless) Trusted PartyDaniel Genkin, Yuval Ishai, Mor Weiss. 209-244 [doi]
- Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and LearnersSaeed Mahloujifar, Mohammad Mahmoody. 245-279 [doi]
- On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive ArgumentsOmer Paneth, Guy N. Rothblum. 283-315 [doi]
- Inception Makes Non-malleable Codes StrongerDivesh Aggarwal, Tomasz Kazana, Maciej Obremski. 319-343 [doi]
- Four-State Non-malleable Codes with Explicit Constant RateBhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar. 344-375 [doi]
- Evolving Secret Sharing: Dynamic Thresholds and RobustnessIlan Komargodski, Anat Paskin-Cherniavsky. 379-393 [doi]
- Linear Secret-Sharing Schemes for Forbidden Graph Access StructuresAmos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter. 394-423 [doi]
- Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0Kuan Cheng, Yuval Ishai, Xin Li 0006. 424-458 [doi]
- Resource-Efficient OT Combiners with Active SecurityIgnacio Cascudo, Ivan Damgård, Oriol Farràs, Samuel Ranellucci. 461-486 [doi]
- An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for BothRotem Tsabary. 489-518 [doi]
- On the One-Per-Message Unforgeability of (EC)DSA and Its VariantsManuel Fersch, Eike Kiltz, Bertram Poettering. 519-534 [doi]
- A Generic Approach to Constructing and Proving Verifiable Random FunctionsRishab Goyal, Susan Hohenberger, Venkata Koppula, Brent Waters. 537-566 [doi]
- Verifiable Random Functions from Non-interactive Witness-Indistinguishable ProofsNir Bitansky. 567-594 [doi]
- Batched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext ExtensionLong Chen, Zhenfeng Zhang, Xueqing Wang. 597-627 [doi]
- Strengthening the Security of Encrypted Databases: Non-transitive JOINsIlya Mironov, Gil Segev, Ido Shahaf. 631-661 [doi]
- Can We Access a Database Both Locally and Privately?Elette Boyle, Yuval Ishai, Rafael Pass, Mary Wootters. 662-693 [doi]
- Towards Doubly Efficient Private Information RetrievalRan Canetti, Justin Holmgren, Silas Richelson. 694-726 [doi]
- On Iterative Collision Search for LPN and Subset SumSrinivas Devadas, Ling Ren 0001, Hanshen Xiao. 729-746 [doi]
- Can PPAD Hardness be Based on Standard Cryptographic Assumptions?Alon Rosen, Gil Segev, Ido Shahaf. 747-776 [doi]