Ronald Cramer, Ivan Bjerre Damgård, Jesper Buus NielsenCambridge University Press, 7/15/2015EAN 9781107043053, ISBN10: 1107043050Hardcover, 381 pages, 25.4 x 17.8 x 2.2 cmLanguage: EnglishOriginally published in EnglishIn a data-driven society, individuals and companies encounter numerous situations where private information is an important resource. How can parties handle confidential data if they do not trust everyone involved? This text is the first to present a comprehensive treatment of unconditionally secure techniques for multiparty computation (MPC) and secret sharing. In a secure MPC, each party possesses some private data, while secret sharing provides a way for one party to spread information on a secret such that all parties together hold full information, yet no single party has all the information. The authors present basic feasibility results from the last 30 years, generalizations to arbitrary access structures using linear secret sharing, some recent techniques for efficiency improvements, and a general treatment of the theory of secret sharing, focusing on asymptotic results with interesting applications related to MPC.Part I. Secure Multiparty Computation1. Introduction2. Preliminaries3. MPC protocols with passive security4. Models5. Information theoretic robust MPC protocols6. MPC from general linear secret sharing schemes7. Cryptographic MPC protocols8. Some techniques for efficiency improvements9. Applications of MPCPart II. Secret Sharing10. Algebraic preliminaries11. Secret sharing12. Arithmetic codicesPart III. Back Material.
