Abstract
The focus of this book is on constructing efficientsecure protocols for the two-party setting. In this introduction, we begin with a general high-level survey of secure multiparty computation. This places the topic of this book in its larger context. Following this, we describe the basic results and techniques related to efficiency in secure computation. Finally, we conclude with a roadmap to the book.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162–167, 1986.
O. Goldreich, S. Micali and A. Wigderson. How to Play Any Mental Game – A Completeness Theorem for Protocols with Honest Majority. In 19th STOC, pages 218–229, 1987.
R. Cleve. Limits on the Security of Coin Flips When Half the Processors Are Faulty. In 18th STOC, pages 364–369, 1986.
S. D. Gordon, C. Hazay, J. Katz and Y. Lindell. Complete Fairness in Secure Two-Party Computation. In 40th STOC, pages 413–422, 2008.
Y. Lindell. Composition of Secure Multi-party Protocols – A Comprehensive Study. Lecture Notes in Computer Science Vol. 2815, Springer-Verlag, 2003.
M. Ben-Or, S. Goldwasser and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computations. In 20th STOC, pages 1-10, 1988.
R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1):143–202, 2000.
Y. Lindell and B. Pinkas. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. In EUROCRYPT’ 07, Springer-Verlag (LNCS 4515), pages 52–78, 2007.
R. Canetti, E. Kushilevitz and Y. Lindell. On the Limitations of Universal Composable Two-Party Computation Without Set-Up Assumptions. Journal of Cryptology, 19(2):135-167, 2006.
B. Pinkas, T. Schneider, N. P. Smart and S. C. Williams. Secure Two- Party Computation Is Practical. In ASIACRYPT 2009, Springer- Verlag (LNCS 5912), pages 250–267, 2009.
S. Goldwasser, S. Micali, and R. L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal on Computing, 17(2):281–308, 1988.
S. Even, O. Goldreich and A. Lempel. A Randomized Protocol for Signing Contracts. In Communications of the ACM, 28(6):637–647, 1985.
R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS, pages 136–145, 2001.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hazay, C., Lindell, Y. (2010). Introduction. In: Efficient Secure Two-Party Protocols. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14303-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-14303-8_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14302-1
Online ISBN: 978-3-642-14303-8
eBook Packages: Computer ScienceComputer Science (R0)