Abstract is missing.
- Completeness Theorems for Adaptively Secure BroadcastRan Cohen, Juan A. Garay, Vassilis Zikas. 3-38 [doi]
- Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key GenerationIttai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern. 39-70 [doi]
- Network-Agnostic Security Comes (Almost) for Free in DKG and MPCRenas Bacho, Daniel Collins 0001, Chen-Da Liu Zhang, Julian Loss. 71-106 [doi]
- Practical Settlement Bounds for Longest-Chain ConsensusPeter Gazi, Ling Ren 0001, Alexander Russell. 107-138 [doi]
- New Bounds on the Local Leakage Resilience of Shamir's Secret Sharing SchemeOhad Klein, Ilan Komargodski. 139-170 [doi]
- Arithmetic SketchingDan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai. 171-202 [doi]
- Additive Randomized Encodings and Their ApplicationsShai Halevi, Yuval Ishai, Eyal Kushilevitz, Tal Rabin. 203-235 [doi]
- How to Recover a Secret with O(n) AdditionsBenny Applebaum, Oded Nir, Benny Pinkas. 236-262 [doi]
- On Linear Communication Complexity for (Maximally) Fluid MPCAlexander Bienstock, Daniel Escudero 0001, Antigoni Polychroniadou. 263-294 [doi]
- Cryptography with Weights: MPC, Encryption and SignaturesSanjam Garg, Abhishek Jain 0002, Pratyay Mukherjee, Rohit Sinha 0001, Mingyuan Wang, Yinuo Zhang. 295-327 [doi]
- Best of Both Worlds - Revisiting the Spymasters Double Agent ProblemAnasuya Acharya, Carmit Hazay, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam. 328-359 [doi]
- Perfect MPC over Layered GraphsBernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushilevitz, Chen-Da Liu Zhang, Varun Narayanan. 360-392 [doi]
- Round-Optimal Black-Box MPC in the Plain ModelYuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan. 393-426 [doi]
- Reusable Secure Computation in the Plain ModelVipul Goyal, Akshayaram Srinivasan, Mingyuan Wang. 427-458 [doi]
- List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin TossingMichele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner. 459-488 [doi]
- Security-Preserving Distributed Samplers: How to Generate Any CRS in One Round Without Random OraclesDamiano Abram, Brent Waters, Mark Zhandry. 489-514 [doi]
- One-Message Secure Reductions: On the Cost of Converting CorrelationsYuval Ishai, Mahimna Kelkar, Varun Narayanan, Liav Zafar. 515-547 [doi]
- A Framework for Statistically Sender Private OT with Optimal RatePedro Branco 0005, Nico Döttling, Akshayaram Srinivasan. 548-576 [doi]
- Malicious Secure, Structure-Aware Private Set IntersectionGayathri Garimella, Mike Rosulek, Jaspal Singh. 577-610 [doi]
- Secure Multiparty Computation from Threshold Encryption Based on Class GroupsLennart Braun, Ivan Damgård, Claudio Orlandi. 613-645 [doi]
- Two-Round Stateless Deterministic Two-Party Schnorr Signatures from Pseudorandom Correlation FunctionsYashvanth Kondi, Claudio Orlandi, Lawrence Roy. 646-677 [doi]
- Fully Adaptive Schnorr Threshold SignaturesElizabeth C. Crites, Chelsea Komlo, Mary Maller. 678-709 [doi]
- Snowblind: A Threshold Blind Signature in Pairing-Free GroupsElizabeth C. Crites, Chelsea Komlo, Mary Maller, Stefano Tessaro, Chenzhi Zhu. 710-742 [doi]
- Practical Schnorr Threshold Signatures Without the Algebraic Group ModelHien Chu, Paul Gerhart, Tim Ruffing, Dominique Schröder. 743-773 [doi]