Secure length-saving ELGamal encryption under the computational Diffie-Hellman assumption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1841, Issue , 2000, Pages 49-58

  Baek, Joonsang ^a   Lee, Byoungcheon ^a   Kim, Kwangjo ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

CHOSEN CIPHERTEXT ATTACK; COMPUTATIONAL ASSUMPTIONS; DECISIONAL DIFFIE HELLMAN ASSUMPTION; DIFFIE-HELLMAN ASSUMPTION; ELGAMAL ENCRYPTION; PROVABLY SECURE; PUBLIC-KEY ENCRYPTION SCHEME; RANDOM ORACLE MODEL;

CRYPTOGRAPHY;

EID: 84958964819     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10718964_5     Document Type: Conference Paper

References (15)

1. M. Abdalla, M. Bellare, and P. Rogaway, "DHAES: An Encryption Scheme Based on Diffie-Hellman Problem", IEEE P1363a Submission, 1998, Available at http://grouper.ieee.org/groups/1363/addendum.html.
2. M. Bellare, "Practice-Oriented Provable-Security", In the First International Workshop on Information Security - Proceedings of ISW'97, LNCS 1396, Springer-Verlag, 1998.
3. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, "Relations Among Notions of Security for Public-Key Encryption Schemes", In Advances in Cryptology -Proceedings of Crypto'98, LNCS 1462, pp.26-45, Springer-Verlag, 1998.
4. M. Bellare and P. Rogaway, "Random Oracles are Practical:AParadigm for Designing Efficient Protocols", ACM Conference on Computer and Communications Security, pp.62-73, 1993.
5. M. Bellare and P. Rogaway, "Optimal Asymmetric Encryption - How to Encrypt with RSA", In Advances in Cryptology - Proceedings of Eurocrypt'94, LNCS 950, pp.92-111, Springer-Verlag, 1995.
6. R. Canetti, O. Goldreich, and S. Halevi, "The Random Oracle Methodology, Revisited", Proceedings of the 30th Annual Symposium on the Theory of Computing, ACM, 1998.
7. R. Cramer and V. Shoup, "A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack", In Advances in Cryptology -Proceedings of Crypto'98, LNCS 1462, pp. 13-25, Springer-Verlag, 1998.
8. D. Dolev, C. Dwork, and M. Naor, "Non-Malleable Cryptography", Proceedings of 23rd STOC., ACM Press 1991.
9. W. Dime and M. Hellman, "New Directions in Cryptography", IEEE Transactions on Information Theory, IT-22(6), pp.644-654, 1976.
10. T. ElGamal, "A Public Key Cryptosystems and a Signature Schems Based on Discrete Logarithms", IEEE Transactions on Information Theory, IT-31(4), pp.469-472, 1985.
11. E. Fujisaki and T. Okamoto, "How to Enhance the Security of Public-Key Encryption at Minimum Cost", PKC'99, LNCS 1560, pp.53-68, Springer-Verlag, 1999.
12. S. Goldwasser and S. Micali, "A Probabilistic Encryption", Journal of Computer and System Sciences, 28, pp. 270-299, 1984.
13. D. Pointcheval, "Chosen-Ciphertext Security for any One-Way Cryptosystem", PKC'2000, LNCS 1751, pp.129-146, Springer-Verlag, 2000.
14. Y. Tsiounis and M. Yung, "On the Security of ElGamal Based Encryption", PKC'98, LNCS 1431, pp.117-134, Springer-Verlag, 1998.
15. Y. Zheng and J. Seberry. "Practical Approaches to Attaining Security Against Adaptively Chosen Ciphertext Attacks", In Advances in Cryptology - Proceedings of Crypto'92, LNCS 740, pp. 292-304, Springer-Verlag, 1993.