Abstract is missing.
- New Ways to Garble Arithmetic CircuitsMarshall Ball, Hanjun Li, Huijia Lin, Tianren Liu. 3-34 [doi]
- Actively Secure Half-Gates with Minimum Overhead Under Duplex NetworksHongrui Cui, Xiao Wang 0012, Kang Yang 0002, Yu Yu 0001. 35-67 [doi]
- Black-Box Reusable NISC with Random OraclesYuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan. 68-97 [doi]
- Maliciously-Secure MrNISC in the Plain ModelRex Fernando, Aayush Jain, Ilan Komargodski. 98-128 [doi]
- Minimizing Setup in Broadcast-Optimal Two Round MPCIvan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov. 129-158 [doi]
- Sublinear-Communication Secure Multiparty Computation Does Not Require FHEElette Boyle, Geoffroy Couteau, Pierre Meyer. 159-189 [doi]
- Actively Secure Arithmetic Computation and VOLE with Constant Computational OverheadBenny Applebaum, Niv Konstantini. 190-219 [doi]
- SuperPack: Dishonest Majority MPC with Constant Online CommunicationDaniel Escudero 0001, Vipul Goyal, Antigoni Polychroniadou, Yifan Song, Chenkai Weng. 220-250 [doi]
- Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected TimeIttai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra. 251-281 [doi]
- An Incremental PoSW for General Weight DistributionsHamza Abusalah, Valerio Cini. 282-311 [doi]
- Witness-Succinct Universally-Composable SNARKsChaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi, Akira Takahashi 0002, Daniel Tschudi. 315-346 [doi]
- Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for DisjunctionsAarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner. 347-378 [doi]
- Proof-Carrying Data from Arithmetized Random OraclesMegan Chen, Alessandro Chiesa, Tom Gur, Jack O'Connor, Nicholas Spooner. 379-404 [doi]
- Supersingular Curves You Can TrustAndrea Basso 0002, Giulio Codogni, Deirdre Connolly, Luca De Feo, Tako Boris Fouotsa, Guido Maria Lido, Travis Morrison, Lorenz Panny, Sikhar Patranabis, Benjamin Wesolowski. 405-437 [doi]
- On Valiant's Conjecture - Impossibility of Incrementally Verifiable Computation from Random OraclesMathias Hall-Andersen, Jesper Buus Nielsen. 438-469 [doi]
- SNARGs and PPAD Hardness from the Decisional Diffie-Hellman AssumptionYael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan. 470-498 [doi]
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom GatesBinyi Chen, Benedikt Bünz, Dan Boneh, Zhenfei Zhang. 499-530 [doi]
- Spartan and Bulletproofs are Simulation-Extractable (for Free!)Quang-Dao, Paul Grubbs. 531-562 [doi]
- Complete Characterization of Broadcast and Pseudo-signatures from CorrelationsVarun Narayanan, Vinod M. Prabhakaran, Neha Sangwan, Shun Watanabe. 563-593 [doi]
- Privacy-Preserving BlueprintsMarkulf Kohlweiss, Anna Lysyanskaya, An Nguyen. 594-625 [doi]