Abstract is missing.
- Broadcast-Optimal Four-Round MPC in the Plain ModelMichele Ciampi, Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Yu Xia 0005, Sophia Yakoubov. 3-32 [doi]
- Taming Adaptivity in YOSO Protocols: The Modular WayRan Canetti, Sebastian Kolby, Divya Ravi, Eduardo Soria-Vazquez, Sophia Yakoubov. 33-62 [doi]
- Network Agnostic MPC with Statistical SecurityAnanya Appan, Ashish Choudhury. 63-93 [doi]
- On Secure Computation of Solitary Output Functionalities with and Without BroadcastBar Alon, Eran Omri. 94-123 [doi]
- On the Round Complexity of Fully Secure Solitary MPC with Honest MajoritySaikrishna Badrinarayanan, Peihan Miao 0001, Pratyay Mukherjee, Divya Ravi. 124-155 [doi]
- Three Party Secure Computation with Friends and FoesBar Alon, Amos Beimel, Eran Omri. 156-185 [doi]
- CASE: A New Frontier in Public-Key Authenticated EncryptionShashank Agrawal, Shweta Agrawal, Manoj Prabhakaran, Rajeev Raghunath, Jayesh Singla. 189-219 [doi]
- Revisiting Updatable Encryption: Controlled Forward Security, Constructions and a Puncturable PerspectiveDaniel Slamanig, Christoph Striecks. 220-250 [doi]
- Combinatorially Homomorphic EncryptionYuval Ishai, Eyal Kushnir, Ron D. Rothblum. 251-278 [doi]
- Security with Functional Re-encryption from CPAYevgeniy Dodis, Shai Halevi, Daniel Wichs. 279-305 [doi]
- Lower Bounds on Assumptions Behind Registration-Based EncryptionMohammad Hajiabadi, Mohammad Mahmoody, Wei Qi, Sara Sarfaraz. 306-334 [doi]
- Proactive Secret Sharing with Constant CommunicationBrett Hemenway Falk, Daniel Noble, Tal Rabin. 337-373 [doi]
- Improved Polynomial Secret-Sharing SchemesAmos Beimel, Oriol Farràs, Or Lasri. 374-405 [doi]
- Near-Optimal Private Information Retrieval with PreprocessingArthur Lazzaretti, Charalampos Papamanthou. 406-435 [doi]
- Memory Checking for Parallel RAMsSurya Mathialagan. 436-464 [doi]