This book provides information on theoretically secure multiparty computation (MPC) and secret sharing, and the fascinating relationship between the two concepts.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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).
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New. Bestandsnummer des Verkäufers 23209153-n
Anzahl: Mehr als 20 verfügbar
Anbieter: California Books, Miami, FL, USA
Zustand: New. Bestandsnummer des Verkäufers I-9781107043053
Anzahl: Mehr als 20 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In English. Bestandsnummer des Verkäufers ria9781107043053_new
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: New. Bestandsnummer des Verkäufers 23209153-n
Anzahl: Mehr als 20 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: 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. . . . . Bestandsnummer des Verkäufers V9781107043053
Anzahl: Mehr als 20 verfügbar
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
Hardback. Zustand: New. 1st. 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. Bestandsnummer des Verkäufers LU-9781107043053
Anzahl: Mehr als 20 verfügbar
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Hardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Bestandsnummer des Verkäufers C9781107043053
Anzahl: Mehr als 20 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: 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. . . . . Books ship from the US and Ireland. Bestandsnummer des Verkäufers V9781107043053
Anzahl: Mehr als 20 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. Bestandsnummer des Verkäufers 26371886173
Anzahl: 4 verfügbar
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
Hardcover. Zustand: 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 our UK warehouse or from our Australian or US warehouses, depending on stock availability. Bestandsnummer des Verkäufers 9781107043053
Anzahl: 1 verfügbar