New Compact CCA Secure Elgamal Scheme in the Random Oracle Model
作者： Xu An Wang , Jianfeng Ma , Xiaoyuan Yang
关键词:
摘要: Chosen ciphertext security (CCA security) is a very important notion for public key encryption. Until now, there are numerous ways to construct CCA secure encryption (PKE) or encapsulation mechanism (KEM) schemes. In this paper, we propose new Elgmal scheme, which proved in the random oracle based on CDH assumption, has almost no additional overhead compared with traditional IND-CPA Elgamal except one more modular exponentiation decryption. To best of our knowledge, first scheme runs like basic Elgsmal but security.
sci-hub.se 参考文章(17)
Cynthia Dwork, Moni Naor, Danny Dolev, Non-Malleable Cryptography (Extended Abstract) symposium on the theory of computing. pp. 542- 552 ,(1991)
Tatsuaki Okamoto, Authenticated key exchange and key encapsulation in the standard model international conference on the theory and application of cryptology and information security. pp. 474- 484 ,(2007) , 10.1007/978-3-540-76900-2_29
Masayuki Abe, Eike Kiltz, Tatsuaki Okamoto, Chosen Ciphertext Security with Optimal Ciphertext Overhead international conference on the theory and application of cryptology and information security. pp. 355- 371 ,(2008) , 10.1007/978-3-540-89255-7_22
Eike Kiltz, Chosen-ciphertext secure key-encapsulation based on gap hashed Diffie-Hellman public key cryptography. pp. 282- 297 ,(2007) , 10.1007/978-3-540-71677-8_19
Goichiro Hanaoka, Kaoru Kurosawa, Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption international conference on the theory and application of cryptology and information security. pp. 308- 325 ,(2008) , 10.1007/978-3-540-89255-7_19
Charles Rackoff, Daniel R. Simon, Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack international cryptology conference. pp. 433- 444 ,(1991) , 10.1007/3-540-46766-1_35
Kaoru Kurosawa, Yvo Desmedt, A New Paradigm of Hybrid Encryption Scheme Advances in Cryptology – CRYPTO 2004. ,vol. 3152, pp. 426- 442 ,(2004) , 10.1007/978-3-540-28628-8_26
Ran Canetti, Oded Goldreich, Shai Halevi, The random oracle methodology, revisited (preliminary version) symposium on the theory of computing. pp. 209- 218 ,(1998) , 10.1145/276698.276741
Xavier Boyen, Qixiang Mei, Brent Waters, Direct chosen ciphertext security from identity-based techniques Proceedings of the 12th ACM conference on Computer and communications security - CCS '05. pp. 320- 329 ,(2005) , 10.1145/1102120.1102162
Mihir Bellare, Phillip Rogaway, Random oracles are practical: a paradigm for designing efficient protocols computer and communications security. pp. 62- 73 ,(1993) , 10.1145/168588.168596