Abstract
Secure multi-party computation is an area of cryptography which deals with two or more parties computing a function on their private inputs. They wish to do so in a way that means that their private inputs still remain private. Of course depending on the function being computed, some information about the inputs may leak. The classical example is the so-called millionaires problem; suppose a bunch of millionaires have a lunch time meeting at an expensive restaurant and decide that the richest of them will pay the bill. However, they do not want to reveal their actual wealth to each other. This is an example of a secure multi-party computation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Smart, N.P. (2016). Secure Multi-party Computation. In: Cryptography Made Simple. Information Security and Cryptography. Springer, Cham. https://doi.org/10.1007/978-3-319-21936-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-21936-3_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21935-6
Online ISBN: 978-3-319-21936-3
eBook Packages: Computer ScienceComputer Science (R0)