Abstract is missing.
- Dory: Efficient, Transparent Arguments for Generalised Inner Products and Polynomial CommitmentsJonathan Lee. 1-34 [doi]
- On Communication-Efficient Asynchronous MPC with Adaptive SecurityAnnick Chopard, Martin Hirt, Chen-Da Liu Zhang. 35-65 [doi]
- Efficient Perfectly Secure Computation with Optimal ResilienceIttai Abraham, Gilad Asharov, Avishay Yanai. 66-96 [doi]
- On Communication Models and Best-Achievable Security in Two-Round MPCAarushi Goel, Abhishek Jain 0002, Manoj Prabhakaran, Rajeev Raghunath. 97-128 [doi]
- Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure ComputationFabrice Benhamouda, Elette Boyle, Niv Gilboa, Shai Halevi, Yuval Ishai, Ariel Nof. 129-161 [doi]
- Blockchains Enable Non-interactive MPCVipul Goyal, Elisaweta Masserova, Bryan Parno, Yifan Song. 162-193 [doi]
- Multi-party PSM, Revisited: - Improved Communication and Unbalanced CommunicationLéonard Assouline, Tianren Liu. 194-223 [doi]
- Multi-Party Functional EncryptionShweta Agrawal, Rishab Goyal, Junichi Tomida. 224-255 [doi]
- Succinct LWE Sampling, Random Polynomials, and ObfuscationLalita Devadas, Willy Quach, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs. 256-287 [doi]
- ABE for DFA from LWE Against Bounded Collusions, RevisitedHoeteck Wee. 288-309 [doi]
- Distributed Merkle's PuzzlesItai Dinur, Ben Hasson. 310-332 [doi]
- Continuously Non-malleable Secret Sharing: Joint Tampering, Plain Model and CapacityGianluca Brian, Antonio Faonio, Daniele Venturi 0001. 333-364 [doi]
- Disappearing Cryptography in the Bounded Storage ModelJiaxin Guan, Mark Zhandry. 365-396 [doi]
- Trojan-Resilience Without CryptographySuvradip Chakraborty, Stefan Dziembowski, Malgorzata Galazka, Tomasz Lizurej, Krzysztof Pietrzak, Michelle Yeo. 397-428 [doi]
- On Derandomizing Yao's Weak-to-Strong OWF ConstructionChris Brzuska, Geoffroy Couteau, Pihla Karanko, Felix Rohrbach. 429-456 [doi]
- Simple Constructions from (Almost) Regular One-Way FunctionsNoam Mazor, Jiapeng Zhang. 457-485 [doi]
- On Treewidth, Separators and Yao's GarblingChethan Kamath, Karen Klein, Krzysztof Pietrzak. 486-517 [doi]
- Oblivious Transfer from Trapdoor Permutations in Minimal RoundsArka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain 0002, Rafail Ostrovsky. 518-549 [doi]
- The Cost of Adaptivity in Security Games on GraphsChethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter 0001. 550-581 [doi]
- Concurrent Composition of Differential PrivacySalil P. Vadhan, Tianhao Wang. 582-604 [doi]
- Direct Product Hardness AmplificationDavid Lanzenberger, Ueli Maurer. 605-625 [doi]
- On the (Ir)Replaceability of Global Setups, or How (Not) to Use a Global LedgerChristian Badertscher, Julia Hesse, Vassilis Zikas. 626-657 [doi]
- BKW Meets Fourier New Algorithms for LPN with Sparse ParitiesDana Dachman-Soled, Huijing Gong, Hunter Kippen, Aria Shahverdi. 658-688 [doi]
- Computational Robust (Fuzzy) Extractors for CRS-Dependent Sources with Minimal Min-entropyHanwen Feng, Qiang Tang. 689-717 [doi]
- Polynomial-Time Targeted Attacks on Coin Tossing for Any Number of CorruptionsOmid Etesami, Ji Gao, Saeed Mahloujifar, Mohammad Mahmoody. 718-750 [doi]