Abstract is missing.
- Recursive Proof Composition from Accumulation SchemesBenedikt Bünz, Alessandro Chiesa, Pratyush Mishra, Nicholas Spooner. 1-18 [doi]
- Linear-Time Arguments with Sublinear Verification from Tensor CodesJonathan Bootle, Alessandro Chiesa, Jens Groth. 19-46 [doi]
- Barriers for Succinct Arguments in the Random Oracle ModelAlessandro Chiesa, Eylon Yogev. 47-76 [doi]
- Accumulators in (and Beyond) Generic Groups: Non-trivial Batch Verification Requires InteractionGili Schul-Ganz, Gil Segev 0001. 77-107 [doi]
- Batch Verification and Proofs of Proximity with Polylog OverheadGuy N. Rothblum, Ron D. Rothblum. 108-138 [doi]
- Batch Verification for Statistical Zero Knowledge ProofsInbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan. 139-167 [doi]
- Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space OverheadsAlexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni. 168-197 [doi]
- On the Price of Concurrency in Group Ratcheting ProtocolsAlexander Bienstock, Yevgeniy Dodis, Paul Rösler. 198-228 [doi]
- Stronger Security and Constructions of Multi-designated Verifier SignaturesIvan Damgård, Helene Haagh, Rebekah Mercer, Anca Nitulescu, Claudio Orlandi, Sophia Yakoubov. 229-260 [doi]
- Continuous Group Key Agreement with Active SecurityJoël Alwen, Sandro Coretti, Daniel Jost 0001, Marta Mularczyk. 261-290 [doi]
- Round Optimal Secure Multiparty Computation from Minimal AssumptionsArka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain 0002, Rafail Ostrovsky. 291-319 [doi]
- Reusable Two-Round MPC from DDHJames Bartusek, Sanjam Garg, Daniel Masny, Pratyay Mukherjee. 320-348 [doi]
- Mr NISC: Multiparty Reusable Non-Interactive Secure ComputationFabrice Benhamouda, Huijia Lin. 349-378 [doi]
- Secure Massively Parallel Computation for Dishonest MajorityRex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi. 379-409 [doi]
- Towards Multiparty Computation Withstanding Coercion of All PartiesRan Canetti, Oxana Poburinnaya. 410-438 [doi]
- Synchronous Constructive CryptographyChen-Da Liu Zhang, Ueli Maurer. 439-472 [doi]
- Topology-Hiding Communication from Minimal AssumptionsMarshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran. 473-501 [doi]
- Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and MoreHuijia Lin, Tianren Liu, Hoeteck Wee. 502-531 [doi]
- On Statistical Security in Two-Party ComputationDakshita Khurana, Muhammad Haris Mughees. 532-561 [doi]
- The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract)Benny Applebaum, Eliran Kachlon, Arpita Patra. 562-594 [doi]
- Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial StructuresDana Dachman-Soled. 595-620 [doi]
- On the Power of an Honest Majority in Three-Party Computation Without BroadcastBar Alon, Ran Cohen, Eran Omri, Tom Suad. 621-651 [doi]
- A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized ComplexityIgnacio Cascudo, Jaron Skovsted Gundersen. 652-682 [doi]
- On the Round Complexity of the Shuffle ModelAmos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer. 683-712 [doi]