Simple CCA-Secure Public Key Encryption from Any Non-Malleable Identity-Based Encryption
暂无分享,去创建一个
Hideki Imai | Goichiro Hanaoka | Takahiro Matsuda | Kanta Matsuura | Goichiro Hanaoka | H. Imai | Takahiro Matsuda | Kanta Matsuura
[1] Aggelos Kiayias,et al. Self Protecting Pirates and Black-Box Traitor Tracing , 2001, CRYPTO.
[2] Brent Waters,et al. Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.
[3] Jonathan Katz,et al. Chosen-Ciphertext Security from Identity-Based Encryption , 2004, SIAM J. Comput..
[4] Daniel R. Simon,et al. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack , 1991, CRYPTO.
[5] Alfredo De Santis,et al. Advances in Cryptology — EUROCRYPT'94 , 1994, Lecture Notes in Computer Science.
[6] Moni Naor,et al. Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.
[7] Kaoru Kurosawa,et al. Advances in Cryptology - ASIACRYPT 2007, 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007, Proceedings , 2007, International Conference on the Theory and Application of Cryptology and Information Security.
[8] Seungjoo Kim,et al. Information Security and Cryptology - ICISC 2005 , 2005, Lecture Notes in Computer Science.
[9] Tal Malkin. Topics in Cryptology - CT-RSA 2008, The Cryptographers' Track at the RSA Conference 2008, San Francisco, CA, USA, April 8-11, 2008. Proceedings , 2008, CT-RSA.
[10] Ronald Cramer,et al. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.
[11] Yuliang Zheng,et al. Advances in Cryptology — ASIACRYPT 2002 , 2002, Lecture Notes in Computer Science.
[12] Craig Gentry,et al. Hierarchical ID-Based Cryptography , 2002, ASIACRYPT.
[13] Marcos Kiwi,et al. LATIN 2006: Theoretical Informatics , 2006, Lecture Notes in Computer Science.
[14] Ran Canetti,et al. A Forward-Secure Public-Key Encryption Scheme , 2003, Journal of Cryptology.
[15] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[16] Matthew Franklin,et al. Advances in Cryptology – CRYPTO 2004 , 2004, Lecture Notes in Computer Science.
[17] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[18] Clifford C. Cocks. An Identity Based Encryption Scheme Based on Quadratic Residues , 2001, IMACC.
[19] David Galindo,et al. A Separation Between Selective and Full-Identity Security Notions for Identity-Based Encryption , 2006, ICCSA.
[20] Jonathan Katz,et al. Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption , 2005, CT-RSA.
[21] Ben Lynn,et al. Toward Hierarchical Identity-Based Encryption , 2002, EUROCRYPT.
[22] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[23] Eike Kiltz,et al. Chosen-Ciphertext Security from Tag-Based Encryption , 2006, TCC.
[24] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[25] Mihir Bellare,et al. Collision-Resistant Hashing: Towards Making UOWHFs Practical , 1997, CRYPTO.
[26] Information Security and Privacy , 1996, Lecture Notes in Computer Science.
[27] Mihir Bellare,et al. Relations among Notions of Security for Public-Key Encryption Schemes , 1998, IACR Cryptol. ePrint Arch..
[28] Sanjit Chatterjee,et al. Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks , 2007, ProvSec.
[29] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[30] Ronald Cramer,et al. Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings , 2005, EUROCRYPT.
[31] Michael K. Reiter,et al. Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract) , 2004, TCC.
[32] Ronald Cramer,et al. Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption , 2001, EUROCRYPT.
[33] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[34] Mihir Bellare,et al. Optimal Asymmetric Encryption-How to Encrypt with RSA , 1995 .
[35] David Taniar,et al. Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I , 2006, ICCSA.
[36] Arto Salomaa,et al. Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.
[37] David Naccache,et al. Secure and Practical Identity-based Encryption , 2005 .
[38] Serge Vaudenay,et al. Advances in Cryptology - EUROCRYPT 2006 , 2006, Lecture Notes in Computer Science.
[39] Amit Sahai,et al. Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization , 1999, CRYPTO.
[40] Sanjit Chatterjee,et al. Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model , 2005, ICISC.
[41] Kefei Chen,et al. Advances in Cryptology - ASIACRYPT 2006, 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, December 3-7, 2006, Proceedings , 2006, ASIACRYPT.
[42] Alfred Menezes,et al. Topics in Cryptology – CT-RSA 2005 , 2005 .
[43] David Naccache,et al. Topics in Cryptology — CT-RSA 2001 , 2001, Lecture Notes in Computer Science.
[44] David Pointcheval,et al. REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform , 2001, CT-RSA.
[45] Abhi Shelat,et al. Relations Among Notions of Non-malleability for Encryption , 2007, ASIACRYPT.
[46] Yang Cui,et al. Relations Among Notions of Security for Identity Based Encryption Schemes , 2005, LATIN.
[47] Sanjit Chatterjee,et al. HIBE With Short Public Parameters Without Random Oracle , 2006, ASIACRYPT.
[48] Joan Feigenbaum,et al. Advances in Cryptology-Crypto 91 , 1992 .
[49] Craig Gentry,et al. Practical Identity-Based Encryption Without Random Oracles , 2006, EUROCRYPT.
[50] Colin Boyd,et al. Cryptography and Coding , 1995, Lecture Notes in Computer Science.
[51] Dan Boneh,et al. Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles , 2004, IACR Cryptol. ePrint Arch..
[52] Aggelos Kiayias,et al. Traitor Tracing with Constant Transmission Rate , 2002, EUROCRYPT.
[53] Hugo Krawczyk,et al. Advances in Cryptology - CRYPTO '98 , 1998 .
[54] Yehuda Lindell,et al. A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions , 2003, Journal of Cryptology.
[55] 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).
[56] Qixiang Mei,et al. Direct chosen ciphertext security from identity-based techniques , 2005, CCS '05.
[57] Mihir Bellare,et al. Optimal Asymmetric Encryption , 1994, EUROCRYPT.
[58] Brent Waters,et al. Lossy trapdoor functions and their applications , 2008, SIAM J. Comput..
[59] Tatsuaki Okamoto,et al. How to Enhance the Security of Public-Key Encryption at Minimum Cost , 1999, Public Key Cryptography.
[60] Cynthia Dwork,et al. Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III , 2020, Annual International Cryptology Conference.
[61] Eike Kiltz,et al. Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation without Random Oracles , 2006, IACR Cryptol. ePrint Arch..
[62] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[63] Adi Shamir,et al. Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.
[64] Abhi Shelat,et al. Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One , 2006, CRYPTO.
[65] Yevgeniy Vahlis,et al. CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption , 2008, CT-RSA.
[66] Aggelos Kiayias,et al. Traceable Signatures , 2004, EUROCRYPT.
[67] Dan Boneh,et al. Secure Identity Based Encryption Without Random Oracles , 2004, CRYPTO.
[68] Yvo Desmedt,et al. A New Paradigm of Hybrid Encryption Scheme , 2004, CRYPTO.
[69] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[70] Burton S. Kaliski. Advances in Cryptology - CRYPTO '97 , 1997 .