Secure Multiparty Computation and Secret Sharing (Hardcover)

Ronald Cramer

ISBN 10: 1107043050 / ISBN 13: 9781107043053

Edité par Cambridge University Press, Cambridge, 2015

A propos de cet article

Hardcover. In 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. This text is the first to present a comprehensive treatment of unconditionally secure techniques for multiparty computation and secret sharing. The authors present feasibility results from the last 30 years, generalizations to arbitrary access structures, some techniques for efficiency improvements, and a general treatment of the theory of secret sharing. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

N° de réf. du vendeur 9781107043053

Détails bibliographiques

• Titre: Secure Multiparty Computation and Secret Sharing (Hardcover)
• Éditeur: Cambridge University Press, Cambridge
• Date de parution: 2015
• Langue: anglais
• ISBN à 10 chiffres: 1107043050
• ISBN à 13 chiffres: 9781107043053
• Reliure: Hardcover
• État de l'article: new

A propos de ce titre

Synopsis

In 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.

À propos des auteurs

Ronald Cramer leads the Cryptology Group at CWI Amsterdam, the national research institute for mathematics and computer science in the Netherlands, and is Professor at the Mathematical Institute, Leiden University. He is Fellow of the International Association for Cryptologic Research (IACR) and Member of the Royal Netherlands Academy of Arts and Sciences (KNAW).

Ivan Bjerre Damgård leads the Cryptology Group at Department of Computer Science, Aarhus University, and is a professor at the same department. He is a fellow of the International Association for Cryptologic Research and has received the RSA conference 2015 award for outstanding achievements in mathematics. He is a co-founder of the companies Cryptomathic and Partisia.

Jesper Buus Nielsen is an associate professor in the Department of Computer Science, Aarhus University. He is a co-founder of the company Partisia.