Abstract is missing.
- Efficient Arithmetic in Garbled CircuitsDavid Heath. 3-31 [doi]
- Can Alice and Bob Guarantee Output to Carol?Bar Alon, Eran Omri, Muthuramakrishnan Venkitasubramaniam. 32-61 [doi]
- SPRINT: High-Throughput Robust Distributed Schnorr SignaturesFabrice Benhamouda, Shai Halevi, Hugo Krawczyk, Yiping Ma 0001, Tal Rabin. 62-91 [doi]
- Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database SearchReo Eriguchi, Kaoru Kurosawa, Koji Nuida. 92-121 [doi]
- Constant-Round Simulation-Secure Coin Tossing Extension with Guaranteed OutputDamiano Abram, Jack Doerner, Yuval Ishai, Varun Narayanan. 122-154 [doi]
- Witness Semantic SecurityPaul Lou, Nathan Manohar, Amit Sahai. 155-184 [doi]
- Garbled Circuit Lookup Tables with Logarithmic Number of CiphertextsDavid Heath, Vladimir Kolesnikov, Lucien K. L. Ng. 185-215 [doi]
- Publicly Verifiable Secret Sharing Over Class Groups and Applications to DKG and YOSOIgnacio Cascudo, Bernardo David. 216-248 [doi]
- Bulletproofs++: Next Generation Confidential Transactions via Reciprocal Set Membership ArgumentsLiam Eagen, Sanket Kanjalkar, Tim Ruffing, Jonas Nick. 249-279 [doi]
- Perfect Asynchronous MPC with Linear Communication OverheadIttai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra. 280-309 [doi]
- Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSSGilad Asharov, Anirudh Chandramouli. 310-339 [doi]
- Fuzzy Private Set Intersection with Large HyperballsAron van Baarsen, Sihang Pu. 340-369 [doi]
- Fast Batched Asynchronous Distributed Key GenerationJens Groth, Victor Shoup. 370-400 [doi]
- Toward Malicious Constant-Rate 2PC via Arithmetic GarblingCarmit Hazay, Yibin Yang 0001. 401-431 [doi]
- Closing the Efficiency Gap Between Synchronous and Network-Agnostic ConsensusGiovanni Deligios, Mose Mizrahi Erbes. 432-461 [doi]