menu
{ "item_title" : "Secure Multiparty Computation and Secret Sharing", "item_author" : [" Ronald Cramer", "Ivan Bjerre Damgård", "Jesper Buus Nielsen "], "item_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.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/1/10/704/305/1107043050_b.jpg", "price_data" : { "retail_price" : "96.00", "online_price" : "96.00", "our_price" : "96.00", "club_price" : "96.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Secure Multiparty Computation and Secret Sharing|Ronald Cramer

Secure Multiparty Computation and Secret Sharing

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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 item is Non-Returnable

Details

  • ISBN-13: 9781107043053
  • ISBN-10: 1107043050
  • Publisher: Cambridge University Press
  • Publish Date: July 2015
  • Dimensions: 10 x 7 x 1 inches
  • Shipping Weight: 1.85 pounds
  • Page Count: 381

Related Categories

You May Also Like...

    1

BAM Customer Reviews