- We will send in 10–14 business days.
/images/books/5622759/9781107043053.jpg)
- Author: Ronald Cramer
- Publisher: Cambridge University Press
- ISBN-10: 1107043050
- ISBN-13: 9781107043053
- Format: 17.8 x 25.4 x 2.5 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.01:45:58
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Ronald Cramer
- Publisher: Cambridge University Press
- ISBN-10: 1107043050
- ISBN-13: 9781107043053
- Format: 17.8 x 25.4 x 2.5 cm, hardcover
- Language: English English
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.
Reviews