This book provides information on theoretically secure multiparty computation (MPC) and secret sharing, and the fascinating relationship between the two concepts.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
FREE shipping within United Kingdom
Destination, rates & speedsSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 23209153-n
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9781107043053_new
Quantity: Over 20 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 869. Seller Inventory # C9781107043053
Quantity: Over 20 available
Seller: CitiRetail, Stevenage, United Kingdom
Hardcover. Condition: 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. Seller Inventory # 9781107043053
Quantity: 1 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 1st edition. 381 pages. 10.50x7.50x1.00 inches. In Stock. This item is printed on demand. Seller Inventory # __1107043050
Quantity: 1 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9781107043053
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 23209153-n
Quantity: Over 20 available
Seller: moluna, Greven, Germany
Gebunden. Condition: 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. Seller Inventory # 38234871
Quantity: Over 20 available
Seller: Rarewaves.com UK, London, United Kingdom
Hardback. Condition: 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. Seller Inventory # LU-9781107043053
Quantity: Over 20 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 1st edition. 381 pages. 10.50x7.50x1.00 inches. In Stock. Seller Inventory # x-1107043050
Quantity: 2 available