Abstract is missing.
- Thunderella: Blockchains with Optimistic Instant ConfirmationRafael Pass, Elaine Shi. 3-33 [doi]
- But Why Does It Work? A Rational Protocol Design Treatment of BitcoinChristian Badertscher, Juan A. Garay, Ueli Maurer, Daniel Tschudi, Vassilis Zikas. 34-65 [doi]
- Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake BlockchainBernardo David, Peter Gazi, Aggelos Kiayias, Alexander Russell. 66-98 [doi]
- Sustained Space ComplexityJoël Alwen, Jeremiah Blocki, Krzysztof Pietrzak. 99-130 [doi]
- Multi-Collision Resistant Hash Functions and Their ApplicationsItay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan. 133-161 [doi]
- Collision Resistant Hashing for Paranoids: Dealing with Multiple CollisionsIlan Komargodski, Moni Naor, Eylon Yogev. 162-194 [doi]
- Synchronized Aggregate Signatures from the RSA AssumptionSusan Hohenberger, Brent Waters. 197-229 [doi]
- More Efficient (Almost) Tightly Secure Structure-Preserving SignaturesRomain Gay, Dennis Hofheinz, Lisa Kohl, Jiaxin Pan. 230-258 [doi]
- The Communication Complexity of Private Simultaneous Messages, RevisitedBenny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz. 261-286 [doi]
- The Complexity of Multiparty PSM Protocols and Related ModelsAmos Beimel, Eyal Kushilevitz, Pnina Nissim. 287-318 [doi]
- Formal Verification of Masked Hardware Implementations in the Presence of GlitchesRoderick Bloem, Hannes Groß, Rinat Iusupov, Bettina Könighofer, Stefan Mangard, Johannes Winter. 321-353 [doi]
- Masking the GLP Lattice-Based Signature Scheme at Any OrderGilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, Mehdi Tibouchi. 354-384 [doi]
- Masking Proofs Are Tight and How to Exploit it in Security EvaluationsVincent Grosso, François-Xavier Standaert. 385-412 [doi]
- The Discrete-Logarithm Problem with PreprocessingHenry Corrigan-Gibbs, Dmitry Kogan. 415-447 [doi]
- Simple Proofs of Sequential WorkBram Cohen, Krzysztof Pietrzak. 451-467 [doi]
- Two-Round Multiparty Secure Computation from Minimal AssumptionsSanjam Garg, Akshayaram Srinivasan. 468-499 [doi]
- k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive CircuitsFabrice Benhamouda, Huijia Lin. 500-532 [doi]
- Adaptively Secure Garbling with Near Optimal Online ComplexitySanjam Garg, Akshayaram Srinivasan. 535-565 [doi]
- A New Approach to Black-Box Concurrent Secure ComputationSanjam Garg, Susumu Kiyoshima, Omkant Pandey. 566-599 [doi]
- Obfustopia Built on Secret-Key Functional EncryptionFuyuki Kitagawa, Ryo Nishimaki, Keisuke Tanaka. 603-648 [doi]
- Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation)Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh K. Kothari. 649-679 [doi]
- Boomerang Connectivity Table: A New Cryptanalysis ToolCarlos Cid, Tao Huang, Thomas Peyrin, Yu Sasaki, Ling Song. 683-714 [doi]
- Correlation Cube Attacks: From Weak-Key Distinguisher to Key RecoveryMeicheng Liu, Jingchun Yang, Wenhao Wang, Dongdai Lin. 715-744 [doi]
- The Missing Difference Problem, and Its Applications to Counter Mode EncryptionGaëtan Leurent, Ferdinand Sibleyras. 745-770 [doi]
- Fast Near Collision Attack on the Grain v1 Stream CipherBin Zhang, Chao Xu, Willi Meier. 771-802 [doi]