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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: medimops, Berlin, Alemania
Condición: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present. Nº de ref. del artículo: M01107043050-G
Cantidad disponible: 1 disponibles
Librería: WorldofBooks, Goring-By-Sea, WS, Reino Unido
Paperback. Condición: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. Nº de ref. del artículo: GOR014762554
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 23209153-n
Cantidad disponible: Más de 20 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Hardcover. Condición: new. 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9781107043053
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 23209153
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9781107043053_new
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 1st edition. 381 pages. 10.50x7.50x1.00 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __1107043050
Cantidad disponible: 1 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 23209153-n
Cantidad disponible: Más de 20 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. This book provides information on theoretically secure multiparty computation (MPC) and secret sharing, and the fascinating relationship between the two concepts. Num Pages: 381 pages, 9 b/w illus. 41 exercises. BIC Classification: UR. Category: (U) Tertiary Education (US: College). Dimension: 263 x 186 x 26. Weight in Grams: 862. . 2015. Hardcover. . . . . Nº de ref. del artículo: V9781107043053
Cantidad disponible: Más de 20 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Nº de ref. del artículo: C9781107043053
Cantidad disponible: Más de 20 disponibles