Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization
暂无分享,去创建一个
[1] N. S. Barnett,et al. Private communication , 1969 .
[2] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[3] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[4] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[5] Silvio Micali,et al. The Notion of Security for Probabilistic Cryptosystems , 1986, CRYPTO.
[6] Moni Naor,et al. Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.
[7] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[8] Daniel R. Simon,et al. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack , 1991, CRYPTO.
[9] Mihir Bellare,et al. Optimal Asymmetric Encryption-How to Encrypt with RSA , 1995 .
[10] Hugo Krawczyk,et al. A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract) , 1998, STOC '98.
[11] Ronald Cramer,et al. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.
[12] Mihir Bellare,et al. Relations among Notions of Security for Public-Key Encryption Schemes , 1998, IACR Cryptol. ePrint Arch..
[13] Hugo Krawczyk,et al. Public-key cryptography and password protocols , 1999 .