Secure Multiparty Computation and Secret Sharing
Cramer, Ronald; Damgård, Ivan Bjerre; Nielsen, Jesper Buus
ISBN 10: 1107043050 ISBN 13: 9781107043053
Verlag: Cambridge University Press, 2015
Neu
Hardcover
Verkäufer
Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
AbeBooks-Verkäufer seit 22. Juli 2022
Dieser Artikel ist nicht mehr verfügbar.
Beschreibung
Beschreibung:
Bestandsnummer des Verkäufers ABLIING23Mar2317530265148
Inhaltsangabe:
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.
Über die Autorinnen und Autoren:
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Bibliografische Details
Titel: Secure Multiparty Computation and Secret ...
Verlag: Cambridge University Press
Erscheinungsdatum: 2015
Einband: Hardcover
Zustand: New
Beste Suchergebnisse bei AbeBooks
Beispielbild für diese ISBN
Secure Multiparty Computation and Secret Sharing
Anbieter: Best Price, Torrance, CA, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. SUPER FAST SHIPPING. Bestandsnummer des Verkäufers 9781107043053
Anzahl: 2 verfügbar
Foto des Verkäufers
Secure Multiparty Computation and Secret Sharing
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 23209153-n
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Secure Multiparty Computation and Secret Sharing
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 23209153-n
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Secure Multiparty Computation and Secret Sharing
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9781107043053_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Secure Multiparty Computation and Secret Sharing
Print-on-DemandAnbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Brand New. 1st edition. 381 pages. 10.50x7.50x1.00 inches. In Stock. This item is printed on demand. Bestandsnummer des Verkäufers __1107043050
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Secure Multiparty Computation and Secret Sharing
Anbieter: California Books, Miami, FL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers I-9781107043053
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Secure Multiparty Computation and Secret Sharing
Print-on-DemandAnbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 869. Bestandsnummer des Verkäufers C9781107043053
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Secure Multiparty Computation and Secret Sharing
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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, s. Bestandsnummer des Verkäufers 38234871
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Secure Multiparty Computation and Secret Sharing (Hardcover)
Verlag:
Cambridge University Press, Cambridge, 2015
ISBN 10: 1107043050
ISBN 13: 9781107043053
Neu
Hardcover
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
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. 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
Beispielbild für diese ISBN
Secure Multiparty Computation and Secret Sharing (Hardcover)
Verlag:
Cambridge University Press, Cambridge, 2015
ISBN 10: 1107043050
ISBN 13: 9781107043053
Neu
Hardcover
Anbieter: Grand Eagle Retail, Mason, OH, USA
Verkäuferbewertung 5 von 5 Sternen
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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Bestandsnummer des Verkäufers 9781107043053
Anzahl: 1 verfügbar