On Adaptive vs. Non-adaptive Security of Multiparty Protocols
暂无分享,去创建一个
Yuval Ishai | Ran Canetti | Ivan Damgård | Tal Malkin | Stefan Dziembowski | R. Canetti | I. Damgård | Stefan Dziembowski | T. Malkin | Y. Ishai
[1] Birgit Pfitzmann,et al. Secure Reactive Systems , 2000 .
[2] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[3] Ivan Damgård,et al. Improved Non-committing Encryption Schemes Based on a General Complexity Assumption , 2000, Annual International Cryptology Conference.
[4] Amit Sahai,et al. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[5] Shafi Goldwasser,et al. Advances in Cryptology — CRYPTO’ 88: Proceedings , 1990, Lecture Notes in Computer Science.
[6] Donald Beaver,et al. Plug and Play Encryption , 1997, CRYPTO.
[7] Ronald Cramer,et al. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.
[8] Ran Canetti. A unified framework for analyzing security of protocols , 2001, Electron. Colloquium Comput. Complex..
[9] Birgit Pfitzmann,et al. A General Framework for Formal Notions of "Secure" Systems , 1994 .
[10] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[11] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[12] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[13] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[14] Donald Beaver,et al. Cryptographic Protocols Provably Secure Against Dynamic Adversaries , 1992, EUROCRYPT.
[15] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[16] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[17] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[18] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.
[19] Oded Goldreich,et al. Foundations of Cryptography (Fragments of a Book) , 1995 .
[20] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[21] Silvio Micali,et al. Parallel Reducibility for Information-Theoretically Secure Computation , 2000, CRYPTO.
[22] Ivan Damgård,et al. Improved Non-committing Encryption Schemes Based on a General Complexity Assumption , 2000, CRYPTO.
[23] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.