Abstract is missing.
- Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader ElectionKai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi. 3-32 [doi]
- Computational Hardness of Optimal Fair Computation: Beyond MinicryptHemanta K. Maji, Mingyuan Wang. 33-63 [doi]
- YOSO: You Only Speak Once - Secure MPC with Stateless Ephemeral RolesCraig Gentry, Shai Halevi, Hugo Krawczyk, Bernardo Magri, Jesper Buus Nielsen, Tal Rabin, Sophia Yakoubov. 64-93 [doi]
- Fluid MPC: Secure Multiparty Computation with Dynamic ParticipantsArka Rai Choudhuri, Aarushi Goel, Matthew Green 0001, Abhishek Jain 0002, Gabriel Kaptchuk. 94-123 [doi]
- Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentrationShweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen. 124-154 [doi]
- Broadcast-Optimal Two Round MPC with an Honest MajorityIvan Damgård, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov. 155-184 [doi]
- Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious TransferArpita Patra, Akshayaram Srinivasan. 185-213 [doi]
- On the Round Complexity of Black-Box Secure MPCYuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan. 214-243 [doi]
- ATLAS: Efficient and Scalable MPC in the Honest Majority SettingVipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, Yifan Song. 244-274 [doi]
- Unconditional Communication-Efficient MPC via Hall's Marriage TheoremVipul Goyal, Antigoni Polychroniadou, Yifan Song. 275-304 [doi]
- Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and ExtensionsReo Eriguchi, Kazuma Ohara, Shota Yamada 0001, Koji Nuida. 305-334 [doi]
- Efficient Information-Theoretic Multi-party Computation over Non-commutative RingsDaniel Escudero 0001, Eduardo Soria-Vazquez. 335-364 [doi]
- Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More CompactHanlin Liu, Yu Yu 0001, Shuoyao Zhao, Jiang Zhang 0001, Wenling Liu, Zhenkai Hu. 365-394 [doi]
- Oblivious Key-Value Stores and Amplification for Private Set IntersectionGayathri Garimella, Benny Pinkas, Mike Rosulek, Ni Trieu, Avishay Yanai. 395-425 [doi]
- MHz2k: MPC from HE over $\mathbb {Z}_{2^k}$ with New Packing, Simpler Reshare, and Better ZKPJung Hee Cheon, Dongwoo Kim 0003, Keewoo Lee. 426-456 [doi]
- Sublinear GMW-Style Compiler for MPC with PreprocessingElette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof. 457-485 [doi]
- Limits on the Adaptive Security of Yao's GarblingChethan Kamath, Karen Klein, Krzysztof Pietrzak, Daniel Wichs. 486-515 [doi]
- Subtractive Sets over Cyclotomic Rings - Limits of Schnorr-Like Arguments over LatticesMartin R. Albrecht, Russell W. F. Lai. 519-548 [doi]
- A Compressed $\varSigma $-Protocol Theory for LatticesThomas Attema, Ronald Cramer, Lisa Kohl. 549-579 [doi]
- A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKsShuichi Katsumata. 580-610 [doi]
- SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential TransactionsVadim Lyubashevsky, Ngoc Khanh Nguyen 0001, Gregor Seiler. 611-640 [doi]
- Deniable Fully Homomorphic Encryption from Learning with ErrorsShweta Agrawal, Shafi Goldwasser, Saleet Mossel. 641-670 [doi]
- Counterexamples to New Circular Security Assumptions Underlying iOSamuel B. Hopkins, Aayush Jain, Huijia Lin. 673-700 [doi]
- How to Meet Ternary LWE KeysAlexander May 0001. 701-731 [doi]
- Lattice Reduction with Approximate Enumeration Oracles - Practical Algorithms and Concrete PerformanceMartin R. Albrecht, Shi Bai, Jianwei Li, Joe Rowell. 732-759 [doi]
- Towards Faster Polynomial-Time Lattice ReductionPaul Kirchner, Thomas Espitau, Pierre-Alain Fouque. 760-790 [doi]
- Lower Bounds on Lattice Sieving and Information Set DecodingElena Kirshanova, Thijs Laarhoven. 791-820 [doi]