Basing Weak Public-Key Cryptography on Strong One-Way Functions
In one of the pioneering papers on public-key cryptography, Ralph Merkle suggested a heuristic protocol for exchanging a secret key over an insecure channel by using an idealized private-key encryption scheme. Merkle’s protocol is presumed to remain secur
- PDF / 9,521,936 Bytes
- 655 Pages / 430 x 659.996 pts Page_size
- 116 Downloads / 220 Views
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 University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany
4948
Ran Canetti (Ed.)
Theory of Cryptography Fifth Theory of Cryptography Conference, TCC 2008 New York, USA, March 19-21, 2008 Proceedings
13
Volume Editor Ran Canetti IBM T.J. Watson Research Center NY, USA E-mail: [email protected]
Library of Congress Control Number: 2008921565 CR Subject Classification (1998): E.3, F.2.1-2, C.2.0, G, D.4.6, K.4.1, K.4.3, K.6.5 LNCS Sublibrary: SL 4 – Security and Cryptology ISSN ISBN-10 ISBN-13
0302-9743 3-540-78523-X Springer Berlin Heidelberg New York 978-3-540-78523-1 Springer Berlin Heidelberg New York
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. Springer is a part of Springer Science+Business Media springer.com ©International Association for Cryptologic Research 2008 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: 12237708 06/3180 543210
Preface
TCC 2008, the 5th Theory of Cryptography Conference, was held in New York, New York, March 19–21, 2008, at New York University. TCC 2008 was sponsored by the International Association for Cryptologic Research (IACR) and was organized in cooperation with the Department of Computer Science at New York University and the Courant Institute for Mathematical Sciences. The General Chairs of the conference were Yevgeniy Dodis and Victor Shoup. The conference received 81 submissions, of which the Program Committee selected 34 for presentation at the conference. The authors of two papers then decided to merge their papers, resulting in a total of 33 presented papers. The Best Student Paper Award was given to Paul Valiant for his paper “Incrementally Verifiable Computati
Data Loading...
