Secure multiparty computation and secret sharing / Ronald Cramer, Ivan Damgaard and Jesper Buus Nielsen.
Material type: TextPublication details: New York : Cambridge University Press, 2015.Description: x, 373 pages : illustrations ; 27 cmISBN:- 9781107043053
- 005.8 23 C889
Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
Books | ISI Library, Kolkata | 005.8 C889 (Browse shelf(Opens below)) | Checked out | 07/02/2025 | 137467 |
Includes bibliographical references and index.
1. Introduction --
2. Preliminaries --
3. MPC protocols with passive security --
4. Models --
5. Information-theoretic robust MPC protocols --
6. MPC form general linear secret-sharing schemes --
7. Cryptography MPC protocols --
8. Some techniques for efficiency improvements --
9. Applications of MPC --
10. Algebraic preliminaries --
11. Secret sharing --
12. Arithmetic codices.
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.
There are no comments on this title.