Provably secure length-saving public-key encryption scheme under the computational Diffie-Hellman assumption

ETRI Journal

Volumn 22, Issue 4, 2000, Pages 25-31

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

^a SECUicom Corporation   (South Korea)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COMPUTER SYSTEM FIREWALLS; DATA PRIVACY; SECURITY OF DATA;

CHIPERTEXT SECURITY; COMPUTATIONAL DIFFIE-HELLMAN ASSUMPTION; DECISIONAL DIFFIE-HELLMAN ASSUMPTION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0034513604     PISSN: 12256463     EISSN: None     Source Type: Journal    
DOI: 10.4218/etrij.00.0100.0403     Document Type: Article

References (17)

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, Springer-Verlag, 1998, pp.26-45.
4. M. Bellare and P. Rogaway, "Random Oracles are Practical: A Paradigm for Designing Efficient Protocols," ACM Conference on Computer and Communications Security, 1993, pp.62-73.
5. M. Bellare and P. Rogaway, "Optimal Asymmetric Encryption -How to Encrypt with RSA," In Advances in Cryptology -Proceedings of Eurocrypt '94, LNCS 950, Springer-Verlag, 1995, pp. 92-111.
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. J. Cheon, S. Park, C. Park, and S. Hahn, "Scalar Multiplication on Elliptic Curves by Frobenius Expansions," ETRI J., Vol. 21, No. 1, March 1999, pp. 27-38.
8. 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, Springer-Verlag, 1998, pp. 13-25.
9. D. Dolev, C. Dwork, and M. Naor, "Non-malleable Cryptography," Proceedings of 23rd STOC., ACM Press, 1991.
10. W. Diffie and M.Hellman, "New Directions in Cryptography," IEEE Transactions on Information Theory, IT-22(6), 1976, pp. 644-654.
11. T. ElGamal, "A Public Key Cryptosystems and a Signature Schems Based on Discrete Logarithms," IEEE Transactions on Information Theory, IT-31(4), 1985, pp. 469-472.
12. E. Fujisaki and T. Okamoto, "How to Enhance the Security of Public-key Encryption at Minimum Cost," PKC '99, LNCS 1560, Springer-Verlag, 1999, pp. 53-68.
13. E. Fujisaki and T. Okamoto, "Secure Integration of Asymmetric and Symmetric Encryption Schemes," In Advances in Cryptology - Proceedings of Crypto '99, LNCS 1666, Springer-Verlag, 1999, pp. 537-554.
14. S. Goldwasser and S. Micali, "A Probabilistic Encryption," Journal of Computer and System Sciences, Vol. 28, 1984, pp. 270-299.
15. D. Pointcheval, "Chosen-ciphertext Security for any One-way Cryptosystem," PKC '2000, LNCS 1751, Springer-Verlag, 2000, pp. 129-146.
16. Y. Tsiounis and M. Yung, "On the Security of ElGamal Based Encryption," PKC '98, LNCS 1431, Springer-Verlag, 1998, pp.117-134.
17. 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, Springer-Verlag, 1993, pp. 292-304.