Abstract is missing.
- Randomized Agreement, Verifiable Secret Sharing and Multi-party Computation in Granular SynchronyAnanya Appan, David Heath, Ling Ren 0001. 3-34 [doi]
- Towards Building Efficient SCALES ProtocolsAnasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran 0001. 35-67 [doi]
- Towards Scalable YOSO MPC via Packed Secret-SharingDaniel Escudero 0001, Elisaweta Masserova, Antigoni Polychroniadou. 68-101 [doi]
- Rumors MPC: GOD for Dynamic Committees, Low Communication via Constant-Round ChatBernardo David, Arup Mondal, Rahul Satish. 102-132 [doi]
- Broadcast-Optimal Secure Computation from Black-Box Oblivious TransferMichele Ciampi, Divya Ravi 0001, Luisa Siniscalchi, Yu Xia 0008. 133-162 [doi]
- Optimal Byzantine Agreement in the Presence of Message DropsHanwen Feng 0001, Zhenliang Lu, Qiang Tang 0005, Yuchen Ye. 163-195 [doi]
- List-Decodable Byzantine Robust PIR: Lower Communication Complexity, Higher Byzantine Tolerance, Smaller List SizePengzhen Ke, Liang Feng Zhang, Huaxiong Wang, Li-Ping Wang. 196-227 [doi]
- Laconic Cryptography with PreprocessingRishabh Bhadauria, Nico Döttling, Carmit Hazay, Chuanwei Lin. 228-261 [doi]
- Laconic PSI on Authenticated Inputs and ApplicationsJames Bartusek, Sanjam Garg, Abhishek Jain 0002, Guru-Vamsi Policharla. 262-293 [doi]
- New Framework for Structure-Aware PSI From Distributed Function Secret SharingDung Bui, Gayathri Garimella, Peihan Miao 0001, Van Long Phuoc Pham. 294-326 [doi]
- Fuzzy Private Set Intersection from VOLEAron van Baarsen, Sihang Pu. 327-360 [doi]
- Scalable zkSNARKs for Matrix Computations - A Generic Framework for Verifiable Deep LearningMingshu Cong, Sherman S. M. Chow, Siu-Ming Yiu, Tsz Hon Yuen. 363-395 [doi]
- A Crack in the Firmament: Restoring Soundness of the Orion Proof System and MoreThomas den Hollander, Daniel Slamanig. 396-426 [doi]
- BrakingBase - A Linear Prover, Poly-Logarithmic Verifier, Field Agnostic Polynomial Commitment SchemeVineet Nair, Ashish Sharma, Bhargav Thankey. 427-455 [doi]
- Samaritan: Linear-Time Prover SNARK from New Multilinear Polynomial CommitmentsChaya Ganesh, Sikhar Patranabis, Nitin Singh. 456-489 [doi]
- sfFREPack: Improved SNARK Frontend for Highly Repetitive ComputationsSriram Sridhar 0001, Yi-Nuo Zhang. 490-520 [doi]
- Inner-Product Commitments Over Integers With Applications to Succinct ArgumentsShihui Fu. 521-553 [doi]
- Pairing-Based Batch Arguments for NP with a Linear-Size CRSBinyi Chen, Noel Elias, David J. Wu 0001. 554-577 [doi]
- Succinct Line-Point Zero-Knowledge Arguments from Homomorphic Secret SharingZhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan 0003, Mengmeng Zhou. 578-609 [doi]