Lecture Notes in Computer Science 6597

Transcription

1 Lecture Notes in Computer Science 6597 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany

2 Yuval Ishai (Ed.) Theory of Cryptography 8th Theory of Cryptography Conference, TCC 2011 Providence, RI, USA, March 28-30, 2011 Proceedings 13

3 Volume Editor Yuval Ishai Technion Computer Science Department Haifa 32000, Israel ISSN e-issn ISBN e-isbn DOI / Springer Heidelberg Dordrecht London New York Library of Congress Control Number: CR Subject Classification (1998): E.3, C.2, D.4.6, K.6.5, G.2, I.1 LNCS Sublibrary: SL 4 Security and Cryptology International Association for Cryptologic Research 2011 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (

4 Preface These are the proceedings of TCC 2011, the 8th Theory of Cryptography Conference, which was held in Brown University, Providence, RI, during March 28 30, The conference was sponsored by the International Association for Cryptologic Research (IACR). The General Chair was Anna Lysyanskaya. The Program Committee, consisting of 18 members, selected 35 of 108 submissions for presentation at the conference. Two closely related submissions were presented by a single joint talk, resulting in a technical program with 34 talks. The program also included two invited lectures: by Luca Trevisan, titled Dense Model Theorems and Their Applications, and by Rafael Pass, titled Concurrent Security and Non-Malleability. The conference featured a rump session for informal short presentations of new results, chaired by Tal Malkin. The Best Student Paper Award was given to Stefano Tessaro for his paper Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma. Three additional papers were selected for invitation to the Journal of Cryptology: Input Locality and Hardness Amplification, by Andrej Bogdanov and Alon Rosen, PCPs and the Hardness of Generating Private Synthetic Data, by Jonathan Ullman and Salil Vadhan, and Round-Optimal Password-Based Authenticated Key Exchange, by Jonathan Katz and Vinod Vaikuntanathan. I am grateful to all those who helped make this conference possible. First and foremost I wish to thank all authors who contributed to the excellent pool of submissions. There were more high-quality submissions than we could fit into the program, a clear indication that the TCC conference is going strong. I deeply thank the Program Committee members for their dedication and hard work. The initial review stage was followed by intensive discussions which helped shape the program and resulted in additional feedback to the authors. Many of the reviews were provided by external reviewers whose names are listed in the following page. I thank them all for their time and effort. Special thanks go to Anna Lysyanskaya, who as a General Chair was in charge of the local arrangements and also doubled as a Program Committee member, to Geetha Jagannathan for administering the conference website, and to Tal Malkin for chairing the rump session. I thank Vipul Goyal, Krzysztof Pietrzak, Mike Rosulek, and Dominique Unruh for their help with shepherding and verifying accepted papers. We had the pleasure of using the submissions and review software developed by Shai Halevi. I thank Shai for providing quick technical assistance whenever it was needed. Finally, I am indebted to Oded Goldreich, the Chair of the TCC Steering Committee, as well as the recent TCC Chairs Tal Rabin, Shai Halevi, Salil Vadhan, Ran Canetti, Omer Reingold, and Daniele Micciancio for their help and advice. January 2011 Yuval Ishai

5 TCC 2011 The 8th Theory of Cryptography Conference Brown University, Providence, RI March 28 30, 2011 Sponsored by the International Association for Cryptologic Research (IACR). General Chair Anna Lysyanskaya Brown University, USA Program Chair Yuval Ishai Technion and UCLA, Israel and USA Program Committee Benny Applebaum Boaz Barak Melissa Chase Ronald Cramer Juan Garay Vipul Goyal Shai Halevi Yuval Ishai Hugo Krawczyk Anna Lysyanskaya Vadim Lyubashevsky Mohammad Mahmoody Chris Peikert Krzysztof Pietrzak Manoj Prabhakaran Guy Rothblum Gil Segev Dominique Unruh Weizmann Institute and Tel-Aviv University, Israel Microsoft Research and Princeton University, USA Microsoft Research Redmond, USA CWI Amsterdam and Leiden University, The Netherlands AT&T Labs Research, USA Microsoft Research India IBM Research, USA Technion and UCLA, Israel and USA IBM Research, USA Brown University, USA INRIA and ENS Paris, France Cornell University, USA Georgia Institute of Technology, USA CWI Amsterdam, The Netherlands University of Illinois, Urbana-Champaign, USA Princeton University, USA Microsoft Research SVC, USA Saarland University, Germany

6 VIII TCC 2011 External Reviewers Foteini Baldimtsi Amos Beimel Sasha Berkoff Bruno Blanchet Xavier Boyen Elette Boyle Zvika Brakerski Ran Canetti Ignacio Cascudo André Chailloux Nishanth Chandran Seung Geol Choi Ashish Choudhary Kai-Min Chung Véronique Cortier Dana Dachman-Soled Ivan Damgård Yevgeniy Dodis Orr Dunkelman Omid Etesami Sebastian Faust Serge Fehr Dario Fiore Matthias Fitzi Georg Fuchsbauer Sebastian Gajek Clint Givens Dov Gordon Ronen Gradwohl Jens Groth Iftach Haitner Gerhard Hancke Kristiyan Haralambiev Moritz Hardt Danny Harnik Carmit Hazay Nadia Heninger Martin Hirt Dennis Hofheinz Susan Hohenberger Thomas Holenstein Abhishek Jain Charanjit Jutla Yael Tauman Kalai Seny Kamara Aniket Kate Jonathan Katz Markulf Kohlweiss Vladimir Kolesnikov Boris Köpf Daniel Kraschewski Sara Krehbiel Steve Kremer Ralf Kuesters Ranjit Kumaresan Eyal Kushilevitz Allison Lewko Huijia Rachel Lin Yehuda Lindell Eran Omri Feng-Hao Liu Hemanta Maji Sarah Meiklejohn Ilya Mironov Tal Moran Daisuke Moriyama Steven A. Myers Jesper Buus Nielsen Tatsuaki Okamoto Claudio Orlandi Ilan Orlov Carles Padró Rafael Pass Arpita Patra Tal Rabin Dominik Raub Mariana Raykova Alon Rosen Mike Rosulek Arnab Roy Amit Sahai Christian Schaffner Aaron Segal Adam Smith Marc Stevens Madhur Tulsiani Yevgeniy Vahlis Vinod Vaikuntanathan Muthu Venkitasubramaniam Oriol Farrás Ventura Damien Vergnaud Ivan Visconti Bogdan Warinschi Brent Waters Daniel Wichs Jürg Wullschleger Arkady Yerukhimovich Hila Zarosim Hong-Sheng Zhou

7 Table of Contents Hardness Amplification Input Locality and Hardness Amplification... 1 Andrej Bogdanov and Alon Rosen General Hardness Amplification of Predicates and Puzzles Thomas Holenstein and Grant Schoenebeck Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma Stefano Tessaro Invited Talk 1 Dense Model Theorems and Their Applications Luca Trevisan Leakage Resilience Parallel Repetition for Leakage Resilience Amplification Revisited Abhishek Jain and Krzysztof Pietrzak Achieving Leakage Resilience through Dual System Encryption Allison Lewko, Yannis Rouselakis, and Brent Waters Signatures Resilient to Continual Leakage on Memory and Computation 89 Tal Malkin, Isamu Teranishi, Yevgeniy Vahlis, and Moti Yung After-the-Fact Leakage in Public-Key Encryption Shai Halevi and Huijia Lin Tamper Resilience One-Time Computable Self-erasing Functions Stefan Dziembowski, Tomasz Kazana, and Daniel Wichs Perfectly Secure Oblivious RAM without Random Oracles Ivan Damgård, Sigurd Meldgaard, and Jesper Buus Nielsen Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token Nico Döttling, Daniel Kraschewski, and Jörn Müller-Quade

8 X Table of Contents Correlated-Input Secure Hash Functions Vipul Goyal, Adam O Neill, and Vanishree Rao Encryption Black-Box Circular-Secure Encryption beyond Affine Functions Zvika Brakerski, Shafi Goldwasser, and Yael Tauman Kalai Homomorphic Encryption: From Private-Key to Public-Key Ron Rothblum Identity-Based Encryption Secure against Selective Opening Attack Mihir Bellare, Brent Waters, and Scott Yilek Functional Encryption: Definitions and Challenges Dan Boneh, Amit Sahai, and Brent Waters Composable Security Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs Huijia Lin and Rafael Pass Round-Optimal Password-Based Authenticated Key Exchange Jonathan Katz and Vinod Vaikuntanathan Bringing People of Different Beliefs Together to Do UC Sanjam Garg, Vipul Goyal, Abhishek Jain, and Amit Sahai Secure Computation Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer Yehuda Lindell and Benny Pinkas Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green and Susan Hohenberger Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions Daniel Kraschewski and Jörn Müller-Quade A Zero-One Law for Secure Multi-party Computation with Ternary Outputs Gunnar Kreitz

9 Table of Contents XI Privacy PCPs and the Hardness of Generating Private Synthetic Data Jonathan Ullman and Salil Vadhan Limits of Computational Differential Privacy in the Client/Server Setting Adam Groce, Jonathan Katz, and Arkady Yerukhimovich Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy Johannes Gehrke, Edward Lui, and Rafael Pass Coin Tossing and Pseudorandomness On the Black-Box Complexity of Optimally-Fair Coin Tossing Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, and Tal Malkin Tight Bounds for Classical and Quantum Coin Flipping Esther Hänggi and Jürg Wullschleger Exploring the Limits of Common Coins Using Frontier Analysis of Protocols Hemanta K. Maji, Pichayoot Ouppaphan, Manoj Prabhakaran, and Mike Rosulek Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators Josh Bronson, Ali Juma, and Periklis A. Papakonstantinou On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators Eric Miles and Emanuele Viola Invited Talk 2 Concurrent Security and Non-malleability (Abstract) Rafael Pass Black-Box Constructions and Separations (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks David Xiao

10 XII Table of Contents Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions Zvika Brakerski, Jonathan Katz, Gil Segev, and Arkady Yerukhimovich Towards Non-black-Box Lower Bounds in Cryptography Rafael Pass, Wei-Lung Dustin Tseng, and Muthuramakrishnan Venkitasubramaniam Black-Box Separations On Black-Box Separations among Injective One-Way Functions Takahiro Matsuda and Kanta Matsuura Impossibility of Blind Signatures from One-Way Permutations Jonathan Katz, Dominique Schröder, and Arkady Yerukhimovich Author Index