<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2006-10-01 16:24:33Universal composability Zero-knowledge proof Secure two-party computation Communications protocol Commitment scheme Actor model Proof of knowledge IP PP Cryptography Cryptographic protocols Secure multi-party computation |
Add to Reading List |
Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model Yehuda Lindell∗ Department of Computer Science Bar-Ilan University Ramat Gan, 52900, Israel | Universal Composability Proving the Correctness of Blockchain Protocols Abhiram KothapalliDocID: 1ulMc - View Document |
 | Systematizing Secure Computation for Research and Decision Support Jason Perry1 , Debayan Gupta2 , Joan Feigenbaum2 and Rebecca N. Wright1 1DocID: 1rpD9 - View Document |
 | LNCSPractical Private Information Aggregation in Large NetworksDocID: 1pxiz - View Document |
 | Systematizing Secure Computation for Research and Decision Support Jason Perry1 , Debayan Gupta2 , Joan Feigenbaum2 and Rebecca N. Wright1 1DocID: 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](https://www.pdfsearch.io/img/87254c3e4604406890b0312a9902ebcc.jpg "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 additionalDocID: 1nBvB - View Document |