<--- Back to Details
First PageDocument Content
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
Date: 2014-06-25 08:00:47
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

Add to Reading List

Source URL: work.debayangupta.com

Download Document from Source Website

File Size: 668,10 KB

Share Document on Facebook

Similar Documents

Universal Composability Proving the Correctness of Blockchain Protocols Abhiram Kothapalli

Universal Composability Proving the Correctness of Blockchain Protocols Abhiram Kothapalli

DocID: 1ulMc - View Document

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

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

DocID: 1rpD9 - View Document

LNCSPractical Private Information Aggregation in Large Networks

LNCSPractical Private Information Aggregation in Large Networks

DocID: 1pxiz - View Document

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

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

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