Get Free Shipping on orders over $79
Secure Multiparty Computation and Secret Sharing - Ronald Cramer

Secure Multiparty Computation and Secret Sharing

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

eText | 15 July 2015 | Edition Number 1

At a Glance

eText


$137.95

or 4 interest-free payments of $34.49 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.

on
Desktop
Tablet
Mobile

More in Data Encryption

The Book of Mitigations - Felipe Reitz

eBOOK

Cybersecurity Explained - Anders Askåsen

eBOOK