Efficient Secure Two-Party Protocols Techniques and Constructions
The authors present a comprehensive study of efficient protocols and techniques for secure two-party computation – both general constructions that can be used to securely compute any functionality, and protocols for specific problems of interest. The book
- PDF / 3,841,164 Bytes
- 270 Pages / 439.37 x 666.142 pts Page_size
- 4 Downloads / 188 Views
For further volumes: http://www.springer.com/series/4752
Carmit Hazay · Yehuda Lindell
Efficient Secure Two-Party Protocols Techniques and Constructions
123
Dr. Carmit Hazay Department of Computer Science and Applied Mathematics Faculty of Mathematics and Computer Science Weizmann Institute Rehovot Israel and Interdisciplinary Center (IDC) Herzliya 46150 Israel [email protected]
Professor Yehuda Lindell Bar Ilan University Department of Computer Science Ramat Gan 52900 Israel [email protected]
Series Editors Prof. Dr. David Basin Prof. Dr. Ueli Maurer ETH Zürich Switzerland [email protected] [email protected]
ISSN 1619-7100 ISBN 978-3-642-14302-1 e-ISBN 978-3-642-14303-8 DOI 10.1007/978-3-642-14303-8 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2010938964 ACM Computing Classification (1998): E.3, C.2, H.2.8 c Springer-Verlag Berlin Heidelberg 2010 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, reuse of illustrations, recitation, broadcasting, reproduction on microfilm 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. Cover design: KuenkelLopka GmbH, Heidelberg Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
To our families, for all their support
Preface
In the setting of multiparty computation, sets of two or more parties with private inputs wish to jointly compute some (predetermined) function of their inputs. The computation should be such that the outputs received by the parties are correctly distributed, and furthermore, that the privacy of each party’s input is preserved as much as possible, even in the presence of adversarial behavior. This encompasses any distributed computing task and includes computations as simple as coin-tossing and broadcast, and as complex as electronic voting, electronic auctions, electronic cash schemes and anonymous transactions. The feasibility (and infeasibility) of multiparty computation has been extensively studied, resulting in a rather comprehensive understanding of what can and cannot be securely computed, and under what assumptions. The theory of cryptography in general, and secure multiparty computation in particular, is rich and elegant. Indeed, the mere fact that it is possible to actually achieve the aforementioned task is both surprising and intriguing. However, the focus of this book is not on the t
Data Loading...
