Abstract is missing.
- TinyKeys: A New Approach to Efficient Multi-Party ComputationCarmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez. 3-33 [doi]
- Fast Large-Scale Honest-Majority MPC for Malicious AdversariesKoji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof. 34-64 [doi]
- Quantum FHE (Almost) As Secure As ClassicalZvika Brakerski. 67-95 [doi]
- IND-CCA-Secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, RevisitedHaodong Jiang, Zhenfeng Zhang, Long Chen, Hong Wang, Zhi Ma. 96-125 [doi]
- Pseudorandom Quantum StatesZhengfeng Ji, Yi-Kai Liu, Fang Song 0001. 126-152 [doi]
- Quantum Attacks Against Indistinguishablility Obfuscators Proved Secure in the Weak Multilinear Map ModelAlice Pellet-Mary. 153-183 [doi]
- Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU ProblemJung Hee Cheon, Minki Hhan, Jiseung Kim, Changmin Lee. 184-210 [doi]
- An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret SharingItai Dinur, Nathan Keller, Ohad Klein. 213-242 [doi]
- Must the Communication Graph of MPC Protocols be an Expander?Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek. 243-272 [doi]
- Two-Round Multiparty Secure Computation Minimizing Public Key OperationsSanjam Garg, Peihan Miao, Akshayaram Srinivasan. 273-301 [doi]
- Limits of Practical Sublinear Secure ComputationElette Boyle, Yuval Ishai, Antigoni Polychroniadou. 302-332 [doi]
- Limits on the Power of Garbling Techniques for Public-Key EncryptionSanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ameer Mohammed. 335-364 [doi]
- Optimizing Authenticated Garbling for Faster Secure Two-Party ComputationJonathan Katz, Samuel Ranellucci, Mike Rosulek, Xiao Wang 0012. 365-391 [doi]
- Amortized Complexity of Information-Theoretically Secure MPC RevisitedIgnacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan. 395-426 [doi]
- Private Circuits: A Modular ApproachPrabhanjan Ananth, Yuval Ishai, Amit Sahai. 427-455 [doi]
- A New Public-Key Cryptosystem via Mersenne NumbersDivesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha. 459-482 [doi]
- Fast Homomorphic Evaluation of Deep Discretized Neural NetworksFlorian Bourse, Michele Minelli, Matthias Minihold, Pascal Paillier. 483-512 [doi]
- Adaptive Garbled RAM from Laconic Oblivious TransferSanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan. 515-544 [doi]
- On the Round Complexity of OT ExtensionSanjam Garg, Mohammad Mahmoody, Daniel Masny, Izaak Meckler. 545-574 [doi]
- Non-Malleable Codes for Partial Functions with Manipulation DetectionAggelos Kiayias, Feng-Hao Liu, Yiannis Tselekounis. 577-607 [doi]
- Continuously Non-Malleable Codes in the Split-State Model from Minimal AssumptionsRafail Ostrovsky, Giuseppe Persiano, Daniele Venturi 0001, Ivan Visconti. 608-639 [doi]
- Non-Interactive Zero-Knowledge Proofs for Composite StatementsShashank Agrawal, Chaya Ganesh, Payman Mohassel. 643-673 [doi]
- From Laconic Zero-Knowledge to Public-Key Cryptography - Extended AbstractItay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan. 674-697 [doi]
- Updatable and Universal Common Reference Strings with Applications to zk-SNARKsJens Groth, Markulf Kohlweiss, Mary Maller, Sarah Meiklejohn, Ian Miers. 698-728 [doi]
- A Simple Obfuscation Scheme for Pattern-Matching with WildcardsAllison Bishop, Lucas Kowalczyk, Tal Malkin, Valerio Pastro, Mariana Raykova 0001, Kevin Shi. 731-752 [doi]
- On the Complexity of Compressing ObfuscationGilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass. 753-783 [doi]