Advances in Cryptology – CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part II

Description

The three volume-set, LNCS 10991, LNCS 10992, and LNCS 10993, constitutes the refereed proceedings of the 38th Annual International Cryptology Conference, CRYPTO 2018, held in Santa Barbara, CA, USA, in August 2018. The 79 revised full papers presented were carefully reviewed and selected from 351 submissions. The papers are organized in the following topical sections: secure messaging; implementations and physical attacks prevention; authenticated and format-preserving encryption; cryptoanalysis; searchable encryption and differential privacy; secret sharing; encryption; symmetric cryptography; proofs of work and proofs of stake; proof tools; key exchange; symmetric cryptoanalysis; hashes and random oracles; trapdoor functions; round optimal MPC; foundations; lattices; lattice-based ZK; efficient MPC; quantum cryptography; MPC; garbling; information-theoretic MPC; oblivious transfer; non-malleable codes; zero knowledge; and obfuscation. Front Matter ....Pages I-XV Front Matter ....Pages 1-1 Simplifying Game-Based Definitions (Phillip Rogaway, Yusi Zhang)....Pages 3-32 The Algebraic Group Model and its Applications (Georg Fuchsbauer, Eike Kiltz, Julian Loss)....Pages 33-62 Front Matter ....Pages 63-63 On Tightly Secure Non-Interactive Key Exchange (Julia Hesse, Dennis Hofheinz, Lisa Kohl)....Pages 65-94 Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange (Kristian Gjøsteen, Tibor Jager)....Pages 95-125 Front Matter ....Pages 127-127 Fast Correlation Attack Revisited (Yosuke Todo, Takanori Isobe, Willi Meier, Kazumaro Aoki, Bin Zhang)....Pages 129-159 A Key-Recovery Attack on 855-round Trivium (Ximing Fu, Xiaoyun Wang, Xiaoyang Dong, Willi Meier)....Pages 160-184 Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities (Achiya Bar-On, Orr Dunkelman, Nathan Keller, Eyal Ronen, Adi Shamir)....Pages 185-212 Bernstein Bound on WCS is Tight (Mridul Nandi)....Pages 213-238 Front Matter ....Pages 239-239 Correcting Subverted Random Oracles (Alexander Russell, Qiang Tang, Moti Yung, Hong-Sheng Zhou)....Pages 241-271 Combiners for Backdoored Random Oracles (Balthazar Bauer, Pooya Farshim, Sogol Mazaheri)....Pages 272-302 On Distributional Collision Resistant Hashing (Ilan Komargodski, Eylon Yogev)....Pages 303-327 Front Matter ....Pages 329-329 Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries (Tore Kasper Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas)....Pages 331-361 Trapdoor Functions from the Computational Diffie-Hellman Assumption (Sanjam Garg, Mohammad Hajiabadi)....Pages 362-391 Front Matter ....Pages 393-393 Round-Optimal Secure Multiparty Computation with Honest Majority (Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain)....Pages 395-424 On the Exact Round Complexity of Secure Three-Party Computation (Arpita Patra, Divya Ravi)....Pages 425-458 Promise Zero Knowledge and Its Applications to Round Optimal MPC (Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai)....Pages 459-487 Round-Optimal Secure Multi-Party Computation (Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam)....Pages 488-520 Front Matter ....Pages 521-521 Yes, There is an Oblivious RAM Lower Bound! (Kasper Green Larsen, Jesper Buus Nielsen)....Pages 523-542 Constrained PRFs for \(\mathrm{NC}^1\) in Traditional Groups (Nuttapong Attrapadung, Takahiro Matsuda, Ryo Nishimaki, Shota Yamada, Takashi Yamakawa)....Pages 543-574 Front Matter ....Pages 575-575 GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates (Yilei Chen, Vinod Vaikuntanathan, Hoeteck Wee)....Pages 577-607 Lower Bounds on Lattice Enumeration with Extreme Pruning (Yoshinori Aono, Phong Q. Nguyen, Takenobu Seito, Junji Shikata)....Pages 608-637 Dissection-BKW (Andre Esser, Felix Heuer, Robert Kübler, Alexander May, Christian Sohler)....Pages 638-666 Front Matter ....Pages 667-667 Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits (Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafael del Pino, Jens Groth, Vadim Lyubashevsky)....Pages 669-699 Lattice-Based Zero-Knowledge Arguments for Integer Relations (Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang)....Pages 700-732 Multi-Theorem Preprocessing NIZKs from Lattices (Sam Kim, David J. Wu)....Pages 733-765 Front Matter ....Pages 767-767 SPD\(\mathbb {Z}_{2^k}\): Efficient MPC mod \(2^k\) for Dishonest Majority (Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing)....Pages 769-798 Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings (Ivan Damgård, Claudio Orlandi, Mark Simkin)....Pages 799-829 Back Matter ....Pages 831-833