Cited By
View all- Tian HJiang ZLiu YWei B(2018)A systematic method to design strong designated verifier signature without random oraclesCluster Computing10.1007/s10586-013-0255-x16:4(817-827)Online publication date: 24-Dec-2018
A new public-key encryption scheme
Authors: 
Hai-Bo Tian, Xi Sun, Yu-Min WangAuthors Info & Claims
Hai-Bo Tian, Xi Sun, Yu-Min WangAuthors Info & ClaimsPages 95 - 102
Abstract
This paper proposes a new public-key encryption scheme which removes one element from the public-key tuple of the original Cramer-Shoup scheme. As a result, a ciphertext is not a quadruple but a triple at the cost of a strong assumption, the third version of knowledge of exponent assumption (KEA3). Under assumptions of KEA3, a decision Diffie-Hellman (DDH) and a variant of target collision resistance (TCRv), the new scheme is proved secure against indistinguishable adaptive chosen ciphertext attack (IND-CCA2). This scheme is as efficient as Damgård ElGamal (DEG) scheme when it makes use of a well-known algorithm for product of exponentiations. The DEG scheme is recently proved IND-CCA1 secure by Bellare and Palacio in ASIACRYPT 2004 under another strong assumption. In addition to our IND-CCA2 secured scheme, we also believe that the security proof procedure itself provides a well insight for ElGamal-based encryption schemes which are secure in real world.
References
[1]
Ronald Cramer, Victor Shoup. A practical public-key cryptosystem provable secure against adaptive chosen ciphertext attack. Lecture Notes in Computer Science, Krawczyk H (ed.), Springer-Verlag, 1998, 1462: 13-15.
[2]
Ran Canetti, Oded Goldreich, Shai Halevi. The random oracle methodology, revisited. J. the ACM, 2004, 51(4): 557-594.
[3]
Mihir Bellare, Alexandra Boldyreva, Adriana Palacio. A uninstantiable random-oracle-model scheme for a hybrid-encryption problem. Lecture Notes in Computer Science, Cachin C, Camenisch J (eds.), Springer-Verlag, 2004, 3027: 171-188.
[4]
Taher Elgamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 1985, 31(4): 469-472.
[5]
Mao Wenbo. Modern cryptography: Theory and Practice. Prentice-Hall PTR, 2003.
[6]
Ronald Cramer, Victor Shoup. Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing, 2003, 33(1): 167-226.
[7]
Shafi Goldwasser, Silvio Micali. Probabilistic encryption. J. Computer and System Sciences, 1984, 28(2): 270-299.
[8]
Naor M, Yung M. Public-key cryptosystems provably secure against chosen ciphertext attacks. In Proc. 22nd ACM Symp. Theory of Computing, Baltimore, Maryland, May 1990, pp. 427-437.
[9]
Charles Rackoff, Daniel Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. Lecture Notes in Computer Science, Feigenbaum J (ed.), Springer-Verlag, 1992, 576: 433-444.
[10]
Yiannis Tsiounis, Moti Yung. On the security of ElGamal based encryption. Lecture Notes in Computer Science, Lmai H, Zheng Y (eds.), Springer-Verlag, 1998, 1431: 117-135.
[11]
Mihir Bellare, Adriana Palacio. The knowledge-of-exponent assumptions and 3-round zero knowledge protocols. Lecture Notes in Computer Science, Franklin M (ed.), Springer-Verlag, 2004, 3152: 273-289.
[12]
Ivan Damgård. Towards practical public key systems secure against chosen ciphertext attacks. Lecture Notes in Computer Science, Feigenbaum J (ed.), Springer-Verlag 1992, 576: 445-456.
[13]
Satoshi Hada, Toshiaki Tanaka. On the existence of 3- round zero-knowledge protocols. IACR Cryptology ePrint Archive, Report 1999/009, 1999. Available at http:// eprint.iacr.org/1999/009/. An earlier version of this paper appears in Lecture Notes in Computer Science, Krawczyk H (ed.), Springer-Verlag, 1998, 1462: 408-423.
[14]
Mihir Bellare, Adriana Palacio. Towards plaintext-aware public-key encryption without random oracles (full version). IACR Cryptology ePrint Archive, Report 2004/221, 2004. Available at http://eprint.iacr.org/2004/221/. An extended abstract of this paper appears in Lecture Notes in Computer Science, Lee P J (ed.), Springer-Verlag 2004, 3329: 48-62.
[15]
Moni Naor. On cryptographic assumptions and challenges. Lecture Notes in Computer Science, Boneh D (ed.), Springer-Verlag, 2003, 2729: 96-109.
Recommendations
Secure public-key encryption scheme without random oracles
Since the first practical and secure public-key encryption scheme without random oracles proposed by Cramer and Shoup in 1998, Cramer-Shoup's scheme and its variants remained the only practical and secure public-key encryption scheme without random ...
Public-Key encryption from ID-Based encryption without one-time signature
OTM'06: Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part IDesign a secure public key encryption scheme and its security proof are one of the main interests in cryptography In 2004, Canetti, Halevi and Katz [8] constructed a public key encryption (PKE) from a selective identity-based encryption scheme with a ...
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 January 2007
Revised: 03 November 2006
Received: 13 January 2005
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Jan 2025
Other Metrics
Citations
Cited By
View all- Tian HJiang ZLiu YWei B(2018)A systematic method to design strong designated verifier signature without random oraclesCluster Computing10.1007/s10586-013-0255-x16:4(817-827)Online publication date: 24-Dec-2018