<--- Back to Details
First PageDocument Content
Public-key cryptography / Cryptography / Secret sharing / Homeomorphisms / Homomorphic encryption / Cryptographic protocol / Digital signature / Communications protocol / Secure multi-party computation / Universal composability
Date: 2012-05-30 08:54:47
Public-key cryptography
Cryptography
Secret sharing
Homeomorphisms
Homomorphic encryption
Cryptographic protocol
Digital signature
Communications protocol
Secure multi-party computation
Universal composability

LNCSPractical Private Information Aggregation in Large Networks

Add to Reading List

Source URL: www.nada.kth.se

Download Document from Source Website

File Size: 259,88 KB

Share Document on Facebook

Similar Documents

Universal Composability Proving the Correctness of Blockchain Protocols Abhiram Kothapalli

DocID: 1ulMc - View Document

Cryptography / Secure multi-party computation / Secret sharing / Public-key cryptography / Universal composability / Communications protocol / Cryptographic protocol / Cartesian coordinate system / Transmission Control Protocol / Secure two-party computation

Systematizing Secure Computation for Research and Decision Support Jason Perry1 , Debayan Gupta2 , Joan Feigenbaum2 and Rebecca N. Wright1 1

DocID: 1rpD9 - View Document

Public-key cryptography / Cryptography / Secret sharing / Homeomorphisms / Homomorphic encryption / Cryptographic protocol / Digital signature / Communications protocol / Secure multi-party computation / Universal composability

LNCSPractical Private Information Aggregation in Large Networks

DocID: 1pxiz - View Document

Cryptography / Secure multi-party computation / Secret sharing / Public-key cryptography / Universal composability / Communications protocol / Cryptographic protocol / Cartesian coordinate system / Transmission Control Protocol / Secure two-party computation

Systematizing Secure Computation for Research and Decision Support Jason Perry1 , Debayan Gupta2 , Joan Feigenbaum2 and Rebecca N. Wright1 1

DocID: 1oJIr - View Document

Universally Composable Commitments Using Random Oracles Dennis Hofheinz† and J¨orn M¨ uller-Quade† Abstract. In the setting of universal composability [Can01], commitments cannot be implemented without additional

DocID: 1nBvB - View Document