Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Punto Poste 5.49 € Punto Poste 5.49 € Corriere DHL 6.99 € Corriere GLS 5.99 € Punto GLS 4.49 € Corriere Bartolini 4.49 € Punto Bartolini 3.49 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Secure Multiparty Computation and Secret Sharing

Name: Secure Multiparty Computation and Secret Sharing
Brand: Cambridge University Press
SKU: 40004024
Price: 82.39 EUR
Availability: InStock
Author: Ronald Cramer
ISBN: 9781316365403

Ronald Cramer

Ivan Bjerre Damgard

Jesper Buus Nielsen

Lingua

Inglese

Libro elettronico Adobe ePub DRM

Codice Libristo: 40004024

Casa editrice Cambridge University Press, luglio 2015

In a data-driven society, individuals and companies encounter numerous situations where private info... Descrizione completa

Codice Libristo: 40004024

202 b

82.39 €

Disponibile Consegna digitale immediata

I clienti hanno acquistato anche

Chefs-d'Oeuvre de P. Et Th. Corneille. Tome 4 Corneille-T

In brossura

17.19 €

Selbstanalyse Horney Karen

In brossura

20.79 €

Journal d'Une Promenade Autour Du Monde En 118 Jours SANS AUTEUR

In brossura

28.19 €

Bessarabo Bernède Libro

In brossura

10.89 €

Einer für alles Meinrad Neunkirchner

Adobe ePub DRM

9.19 €

Unternehmenskultur Frankreich Katja Ehrenmüller

In brossura

14.09 €

Patologia da glândula mamária em vacas Benjamin Cengic

In brossura

31.09 €

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.