Abstract is missing.
- Forward-Secure Encryption with Fast ForwardingYevgeniy Dodis, Daniel Jost 0001, Harish Karthikeyan. 3-32 [doi]
- Rate-1 Incompressible Encryption from Standard AssumptionsPedro Branco 0005, Nico Döttling, Jesko Dujmovic. 33-69 [doi]
- Achievable CCA2 Relaxation for Homomorphic EncryptionAdi Akavia, Craig Gentry, Shai Halevi, Margarita Vald. 70-99 [doi]
- Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract)Benny Applebaum, Eliran Kachlon, Arpita Patra. 103-120 [doi]
- Sublinear Secure Computation from New AssumptionsElette Boyle, Geoffroy Couteau, Pierre Meyer. 121-150 [doi]
- How to Obfuscate MPC InputsIan McQuoid, Mike Rosulek, Jiayu Xu. 151-180 [doi]
- Statistical Security in Two-Party Computation RevisitedSaikrishna Badrinarayanan, Sikhar Patranabis, Pratik Sarkar. 181-210 [doi]
- On the Worst-Case Inefficiency of CGKAAlexander Bienstock, Yevgeniy Dodis, Sanjam Garg, Garrison Grogan, Mohammad Hajiabadi, Paul Rösler. 213-243 [doi]
- Adaptive Multiparty NIKEVenkata Koppula, Brent Waters, Mark Zhandry. 244-273 [doi]
- On the Impossibility of Algebraic Vector Commitments in Pairing-Free GroupsDario Catalano, Dario Fiore 0001, Rosario Gennaro, Emanuele Giunta. 274-299 [doi]
- Four-Round Black-Box Non-malleable Schemes from One-Way PermutationsMichele Ciampi, Emmanuela Orsini, Luisa Siniscalchi. 300-329 [doi]
- A Tight Computational Indistinguishability Bound for Product DistributionsNathan Geier. 333-347 [doi]
- Secure Sampling with Sublinear CommunicationSeung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich. 348-377 [doi]
- Secure Non-interactive Simulation from Arbitrary Joint DistributionsHamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen. 378-407 [doi]
- Secure Non-interactive Reducibility is DecidableKaartik Bhushan, Ankit Kumar Misra, Varun Narayanan, Manoj Prabhakaran. 408-437 [doi]
- Round-Optimal Black-Box Secure Computation from Two-Round Malicious OTYuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan. 441-469 [doi]
- Fully-Secure MPC with Minimal TrustYuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan. 470-501 [doi]
- SCALES - MPC with Small Clients and Larger Ephemeral ServersAnasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran. 502-531 [doi]
- On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated RandomnessBar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra. 532-561 [doi]
- Public-Key Encryption from Homogeneous CLWEAndrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen. 565-592 [doi]
- PPAD is as Hard as LWE and Iterated SquaringNir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum. 593-622 [doi]
- Parallelizable Delegation from LWECody Freitag, Rafael Pass, Naomi Sirkin. 623-652 [doi]
- How to Sample a Discrete Gaussian (and more) from a Random OracleGeorge Lu, Brent Waters. 653-682 [doi]
- Anonymous Whistleblowing over Authenticated ChannelsThomas Agrikola, Geoffroy Couteau, Sven Maier. 685-714 [doi]
- Poly Onions: Achieving Anonymity in the Presence of ChurnMegumi Ando, Miranda Christ, Anna Lysyanskaya, Tal Malkin. 715-746 [doi]
- The Price of Verifiability: Lower Bounds for Verifiable Random FunctionsNicholas Brandt, Dennis Hofheinz, Julia Kastner, Akin Ünal. 747-776 [doi]
- Bet-or-Pass: Adversarially Robust Bloom FiltersMoni Naor, Noa Oved. 777-808 [doi]