How to enhance the security of public-key encryption at minimum cost

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E83-A, Issue 1, 2000, Pages 24-32

  Fujisaki, Eiichiro ^a   Okamoto, Tatsuaki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

Adaptive chosen ciphertext attack; Chosen plaintext attack; Indistinguishability; Random oracle model

Indexed keywords

MATHEMATICAL MODELS; RANDOM PROCESSES; SECURITY OF DATA;

ADAPTIVE CHOSEN-CHIRPTEXT ATTACK; CHOSEN-PLAINTEXT ATTACK; PUBLIC-KEY ENCRYPTION SCHEME; RANDOM ORACLE MODEL;

CRYPTOGRAPHY;

EID: 0033908504     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. M. Bellare and P. Rogaway.Random oracles are practical: A paradigm for designing efficient protocols," Proc. First ACM Conference on Computer and Communications Security, pp.62-73, 1993.
2. M. Bellare and P. Rogaway, ''Optimal asymmetric encryption -How to encrypt with RSA," Advances in Cryptology -EUROCRYPT'94.
3. M. Bellare and P. Rogaway.The exact security of digital signatures -How to sign with RSA and Rabin," Advances in Cryptology -EUROCRYPT96, pp.309-416, Proc. Lecture Notes in Computer Science, no. 1070, Springer-Verlag, 1996.
4. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway.Relations among notions of security for public-key encryption schemes," Advances in Cryptology -CRYPTO'98.
5. M. Blum and S. Goldwasser.An efficient probabilistic public-key encryption scheme which hides all partial information," Proc. CRYPTO'84, LNCS 196, Springer-Verlag, pp.289-299, 1985.
6. D. Bleichenbacher.Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS#1," Advances in Cryptology -CRYPTO'98, Springer-Verlag, 1998.
7. R. Canetti, O. Goldreich, and S. Halevi.The random oracle methodology, revisited," Proc. STOC, ACM Press, pp.209-218, 1998.
8. R. Cramer and V. Shoup.A practical public key cryptosystem provably secure against adaptive chosen message attack," Advances in Cryptology -CRYPTO'98, SpringerVerlag, 1998.
9. I. Damgârd.Towards practical public key systems secure against chosen ciphertext attacks," Advances in Cryptology -CRYPTO'91, pp.445-456, Proc. Lecture Notes in Computer Science, no.576, Springer-Verlag, 1992.
10. D. Dolev, C. Dwork, and M. Naor.Non-malleable cryptography," Proc. STOC'91, pp.542-552.
11. T. ElGamal.A public key cryptosystem and a signature scheme based on discrete logarithms," IEEE Trans. Inf. Theory, vol.IT-31, no.4, pp.469-472, 1985.
12. E. Fujisaki and T. Okamoto.How to enhance the security of public-key encryption at minimum cost," Proc. PKC'99, LNCS, Springer-Verlag, 1999.
13. A. Fiat and A. Shamir.How to prove yourself: Practical solutions to identification and signature problems," Advances in Cryptology-CRYPTO'86, pp.186-194, Proc. Lecture Notes in Computer Science, no.2C3, Springer-Verlag, 1986.
14. O. Goldreich, S. Goldwasser, and S. Micali.How to construct random functions," Proc. FOCS'84, pp.464-479, IEEE, 1984.
15. O. Goldreich, S. Goldwasser, and S. Micali.On the cryptographic applications of random functions," Advances in Cryptology -CRYPTO'84, pp.276-288, Proc. Lecture Notes in Computer Science, no. 196, Springer, 1985.
16. S. Goldwasser and S. Micali.Probabilistic encryption," JCSS, vol.28, pp.270-299, 1984.
17. M. Naor and M. Yung.Public-key cryptosystems provably secure against chosen ciphertext attacks," Proc. 22nd Annual Symposium on Theory of Computing, ACM (STOC), pp.427-437, 1990.
18. T. Okamoto and S. Uchiyama.A new public-key cryptosystem as secure as factoring," Advances in Cryptology -EUROCRYPT'98, Springer-Verlag, 1998.
19. D. Pointcheval.Strengthened security for blind signature schemes," Advances in Cryptology -EUROCRYPT'98, Springer-Verlag, 1998.
20. D. Pointchcval and J. Stern.Provably secure blind signature schemes," Advances in Cryptology -ASIACRYPT'96, pp.252-265, Proc. Lecture Notes in Computer Science, no. 1163, Springer-Verlag, 1996.
21. D. Pointcheval and J. Stern.Security proofs for signa-ture schemes," Advances in Cryptology -EUROCRYPT'96, pp.387-398, Proc. Lecture Notes in Computer Science, no. 1070, Springer-Verlag, 1996.
22. C. RackofT and D.R. Simon.Non-interactive zeroknowledge proof of knowledge and chosen ciphertext attack," Advances in Cryptology -CRYPTO'91, pp.433-444, Proc. Lecture Notes in Computer Science, no.576, SpringerVerlag, 1992.
23. R. Rivest, A. Shamir, and L. Adleman.A method for obtaining digital signatures and public key cryptosystems," Communications of ACM, vol.21, no.2, pp.120-126, 1978.
24. V. Shoup and R. Gcnnaro.Securing threshold cryptosystems against chosen ciphertext attack," Advances in Cryptology -EUROCRYP'F98, Springer-Verlag, 1998.
25. Y. Tsiounis and M. Yung.On the security of ElGamal based encryption," PKC'98, Jan. 1998.
26. Y. Zheng and J. Seberry.Practical approaches to attaining security against adaptively chosen ciphertext attacks," Advances in Cryptology -CRYPTO'92, pp.292-304, Proc. Lecture Notes in Computer Science, no.740, Springer-Verlag, 1992.