Secure Multiparty Computation and Secret Sharing; Ronald Cramer, Ivan Bjerre Damgård, Jesper Buus Nielsen; 2015
endast ny

Secure Multiparty Computation and Secret Sharing

av Ronald Cramer, Ivan Bjerre Damgård, Jesper Buus Nielsen
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.
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.
Utgiven: 2015
ISBN: 9781107043053
Förlag: Cambridge University Press
Format: Inbunden
Språk: Engelska
Sidor: 381 st
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.
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.
Ny bok
890 kr936 kr
5% studentrabatt med Studentapan
Begagnad bok (0 st)

Om Secure Multiparty Computation and Secret Sharing (2015)

I juli 2015 släpptes boken Secure Multiparty Computation and Secret Sharing skriven av Ronald Cramer, Ivan Bjerre Damgård, Jesper Buus Nielsen. Den är skriven på engelska och består av 381 sidor djupgående information. Förlaget bakom boken är Cambridge University Press.

Köp boken Secure Multiparty Computation and Secret Sharing direkt från en annan student på Studentapan och spara pengar.

Bokens omdömen
Ingen har recenserat den här boken ännu.

Sälj vidare boken när du är klar

När du är klar med boken säljer du enkelt vidare och tjänar pengar på nolltid med Studentapan. Vi tar hand om allt det krångliga så att du får mer tid över till annat. På det sättet kan du tjäna tillbaka det mesta av kostnaden för boken.
Värdera & sälj böcker

Klimatsmart kurslitteratur

Bli en miljöhjälte under din studietid och ge dina gamla kursböcker ett nytt liv. Genom att återanvända dina kursböcker minskar du utsläppen av koldioxid (CO2) med hela 59%. För en psykologstudent skulle det innebära minskade CO2-utsläpp med cirka 240 kg under studietiden. En stor vinst för din plånbok och miljön. Det kallar vi klimatsmart kurslitteratur.

Liknande kurslitteratur

Ny bok
890 kr936 kr
5% studentrabatt med Studentapan
Begagnad bok (0 st)