On the Complexity of UC Commitments
Motivated by applications to secure multiparty computation, we study the complexity of realizing universally composable (UC) commitments. Several recent works obtain practical UC commitment protocols in the common reference string (CRS) model under the DD
- PDF / 10,922,434 Bytes
- 728 Pages / 439.37 x 666.142 pts Page_size
- 34 Downloads / 205 Views
Phong Q. Nguyen Elisabeth Oswald (Eds.)
Advances in Cryptology – EUROCRYPT 2014 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques Copenhagen, Denmark, May 11–15, 2014, Proceedings
123
Lecture Notes in Computer Science 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 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
8441
Phong Q. Nguyen Elisabeth Oswald (Eds.)
Advances in Cryptology – EUROCRYPT 2014 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques Copenhagen, Denmark, May 11-15, 2014 Proceedings
13
Volume Editors Phong Q. Nguyen Ecole normale supérieure Départment d’informatique 45, rue d’Ulm, 75230 Paris Cedex 05, France E-mail: [email protected] Elisabeth Oswald University of Bristol Department of Computer Science Merchant Venturers Building, Woodland Road, Bristol BS8 1UB, UK E-mail: [email protected]
ISSN 0302-9743 e-ISSN 1611-3349 ISBN 978-3-642-55219-9 e-ISBN 978-3-642-55220-5 DOI 10.1007/978-3-642-55220-5 Springer Heidelberg New York Dordrecht London Library of Congress Control Number: 2014936637 LNCS Sublibrary: SL 4 – Security and Cryptology © International Association for Cryptologic Research 2014 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in ist current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Ce
Data Loading...
