A Proof of Yao's Protocol for Secure Two-Party Computation
作者： Yehuda Lindell , Benny Pinkas
DOI:
关键词: Computer security 、 Secure multi-party computation 、 Secure two-party computation 、 Protocol (object-oriented programming) 、 Computer science 、 Divide and choose 、 Commitment scheme
摘要:
参考文章(12)
Cynthia Dwork, Moni Naor, Omer Reingold, Immunizing Encryption Schemes from Decryption Errors theory and application of cryptographic techniques. pp. 342- 360 ,(2004) , 10.1007/978-3-540-24676-3_21
Donald Beaver, Foundations of Secure Interactive Computing international cryptology conference. pp. 377- 391 ,(1991) , 10.1007/3-540-46766-1_31
Shimon Even, Oded Goldreich, Abraham Lempel, A randomized protocol for signing contracts Communications of the ACM. ,vol. 28, pp. 637- 647 ,(1985) , 10.1145/3812.3818
Donald Beaver, Correlated pseudorandomness and the complexity of private computations symposium on the theory of computing. pp. 479- 488 ,(1996) , 10.1145/237814.237996
Ran Canetti, Security and Composition of Multiparty Cryptographic Protocols Journal of Cryptology. ,vol. 13, pp. 143- 202 ,(2000) , 10.1007/S001459910006
Goldreich Oded, Foundations of Cryptography: Volume 2, Basic Applications ,(2004)
D. Beaver, S. Micali, P. Rogaway, The round complexity of secure protocols symposium on the theory of computing. pp. 503- 513 ,(1990) , 10.1145/100216.100287
Moni Naor, Benny Pinkas, Reuban Sumner, Privacy preserving auctions and mechanism design Proceedings of the 1st ACM conference on Electronic commerce - EC '99. pp. 129- 139 ,(1999) , 10.1145/336992.337028
Andrew Chi-Chih Yao, How to generate and exchange secrets 27th Annual Symposium on Foundations of Computer Science (sfcs 1986). pp. 162- 167 ,(1986) , 10.1109/SFCS.1986.25
Oded Goldreich, Shafi Goldwasser, Silvio Micali, How to construct random functions Journal of the ACM. ,vol. 33, pp. 792- 807 ,(1986) , 10.1145/6490.6503