Abstract is missing.
- Stronger Security for Reusable Garbled Circuits, General Definitions and AttacksShweta Agrawal. 3-35 [doi]
- Generic Transformations of Predicate Encodings: Constructions and ApplicationsMiguel Ambrona, Gilles Barthe, Benedikt Schmidt. 36-66 [doi]
- Practical Functional Encryption for Quadratic Functions with Applications to Predicate EncryptionCarmen Elisabetta Zaira Baltico, Dario Catalano, Dario Fiore, Romain Gay. 67-98 [doi]
- Memory-Tight ReductionsBenedikt Auerbach, David Cash, Manuel Fersch, Eike Kiltz. 101-132 [doi]
- Be Adaptive, Avoid OvercommittingZahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs. 133-163 [doi]
- The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling RevisitedIvan Damgård, Jesper Buus Nielsen, Michael Nielsen 0001, Samuel Ranellucci. 167-187 [doi]
- Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-TheoreticYashvanth Kondi, Arpita Patra. 188-222 [doi]
- Secure Arithmetic Computation with Constant Computational OverheadBenny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen 0001, Lior Zichron. 223-254 [doi]
- Encryption Switching Protocols Revisited: Switching Modulo pGuilhem Castagnos, Laurent Imbert, Fabien Laguillaumie. 255-287 [doi]
- The Bitcoin Backbone Protocol with Chains of Variable DifficultyJuan A. Garay, Aggelos Kiayias, Nikos Leonardos. 291-323 [doi]
- Bitcoin as a Transaction Ledger: A Composable TreatmentChristian Badertscher, Ueli Maurer, Daniel Tschudi, Vassilis Zikas. 324-356 [doi]
- Ouroboros: A Provably Secure Proof-of-Stake Blockchain ProtocolAggelos Kiayias, Alexander Russell, Bernardo David, Roman Oliynykov. 357-388 [doi]
- Robust Non-interactive Multiparty Computation Against Constant-Size CollusionFabrice Benhamouda, Hugo Krawczyk, Tal Rabin. 391-419 [doi]
- The Price of Low Communication in Secure Multi-party ComputationJuan A. Garay, Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas. 420-446 [doi]
- Topology-Hiding Computation on All GraphsAdi Akavia, Rio LaVigne, Tal Moran. 447-467 [doi]
- A New Approach to Round-Optimal Secure Multiparty ComputationPrabhanjan Ananth, Arka Rai Choudhuri, Abhishek Jain 0002. 468-499 [doi]
- Watermarking Cryptographic Functionalities from Standard Lattice AssumptionsSam Kim, David J. Wu. 503-536 [doi]
- Identity-Based Encryption from the Diffie-Hellman AssumptionNico Döttling, Sanjam Garg. 537-569 [doi]
- The First Collision for Full SHA-1Marc Stevens, Elie Bursztein, Pierre Karpman, Ange Albertini, Yarik Markov. 570-596 [doi]
- Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGsHuijia Lin. 599-629 [doi]
- Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGsHuijia Lin, Stefano Tessaro. 630-660 [doi]
- Lower Bounds on Obfuscation from All-or-Nothing Encryption PrimitivesSanjam Garg, Mohammad Mahmoody, Ameer Mohammed. 661-695 [doi]
- Structure vs. Hardness Through the Obfuscation LensNir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan. 696-723 [doi]
- Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and SeparationsBenny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan. 727-757 [doi]
- Conditional Disclosure of Secrets via Non-linear ReconstructionTianren Liu, Vinod Vaikuntanathan, Hoeteck Wee. 758-790 [doi]