Secure Multiparty Computation and Secret Sharing - Ronald Cramer

Instant online reading.
Don't wait for delivery!

Secure Multiparty Computation and Secret Sharing

By: Ronald Cramer, Ivan Bjerre DamgÃ¥rd, Jesper Buus Nielsen

Write A Review

Hardcover | 15 July 2015

At a Glance

Hardcover
384 Pages

Dimensions(cm)
25.4 x 17.78 x 2.24

Hardcover

RRP $137.95

$124.75

10%OFF

or 4 interest-free payments of $31.19 with

Ships in 5 to 7 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.