Using hash functions as a hedge against chosen ciphertext attack

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

Volumn 1807, Issue , 2000, Pages 275-288

  Shoup, Victor ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

CHOSEN CIPHERTEXT ATTACK; DECISIONAL DIFFIE HELLMAN ASSUMPTION; DIFFIE-HELLMAN ASSUMPTION; HYBRID SCHEME; PUBLIC KEY CRYPTOSYSTEMS; RANDOM ORACLE MODEL; SECURITY PROOFS;

COMPUTATION THEORY;

EID: 84948976239     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45539-6_19     Document Type: Conference Paper

References (29)

1. ABR98. M. Abdalla, M. Bellare, and P. Rogaway. DHAES: an encryption scheme based on the Diffie-Hellma problem. Submission, to IEEE P13631998.
2. BCK98. M. Bellare, R. Canetti, and H. Krawczyk. A modular approach to the design and analysis of authentication and key exchange protocols. In 30th Annual ACM Symposium on Theory of Computing, 1998.
3. Bon98. D. Boneh. The Decision Diffie-Hellman Problem. In Ants-III, pages 48-63, 1998. Springer LNCS 1423.
4. BR93. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing Efficient protocols. In First ACM Conference on Computer and Communications Security, pages 62-73, 1993.
5. BR94. M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology|Crypto ’94, pages 92-111, 1994.
6. BR97. M. Bellare and P. Rogaway. Collision-resistant hashing: towards making UOWHFs practical. In Advances in Cryptology-Crypto ’97, 1997.
7. Bra93. S. Brands. An Efficient off-line electronic cash system based on the representation problem, 1993. CWI Technical Report, CS-R9323.
8. CS98. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances in Cryptology-Crypto ’98, pages 13-25, 1998.
9. CS99. R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In 6th ACM Conf. on Computer and Communications Security, 1999.
10. DDN91. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In 23rd Annual ACM Symposium on Theory of Computing, pages 542-552, 1991.
11. DH76. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. Info. Theory, 22:644-654, 1976.
12. DvOW92. W. Diffie, P. van Oorschot, and M. Wiener. Authentication and authenticated key exchange. Designs, Code, and Cryptography, 2:107-125, 1992.
13. FO99. E. Fujisaki and T. Okamoto. Secure integration of asymmetric and symmetric encryption schemes. In Advances in Cryptology-Crypto ’99, pages 537-554, 1999.
14. IZ89. R. Impagliazzo and D. Zuckermann. How to recycle random bits. In 30th Annual Symposium on Foundations of Computer Science, pages 248-253, 1989.
15. Kra94. H. Krawczyk. LFSR-based hashing and authentication. In Advances in Cryptology|Crypto ’94, pages 129-139, 1994.
16. LL94. C. H. Lim and P. J. Lee. More flexible exponentiation with precomputation. In Advances in Cryptology-Crypto ’94, pages 95-107, 1994.
17. Lub96. M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
18. Mau94. U. Maurer. Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In Advances in Cryptology-Crypto ’94, pages 271-281, 1994.
19. MW96. U. Maurer and S. Wolf. Diffie-Hellman oracles. In Advances in Cryptology-Crypto ’96, pages 268-282, 1996.
20. NR97. M. Naor and O. Reingold. Number-theoretic constructions of Efficient pseudo-random functions. In 38th Annual Symposium on Foundations of Computer Science, 1997.
21. NY89. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In 21st Annual ACM Symposium on Theory of Computing, 1989.
22. RS91. C. Rackoff and D. Simon. Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in Cryptology-Crypto ’91, pages 433-444, 1991.
23. SG98. V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. In Advances in Cryptology-Eurocrypt ’98, 1998.
24. Sho97. V. Shoup. Lower bounds for discrete logarithms and related problems. In Advances in Cryptology-Eurocrypt ’97, 1997.
25. Sho99. V. Shoup. On formal models for secure key exchange. IBM Research Report RZ 3120, April 1999.
26. Sho00. V. Shoup. A composition theorem for universal one-way hash functions. In Advances in Cryptology-Eurocrypt 2000, pages 445-452, 2000.
27. Sta96. M. Stadler. Publicly verifiable secret sharing. In Advances in Cryptology-Eurocrypt ’96, pages 190-199, 1996.
28. TY98. Y. Tsiounis and M. Yung. On the security of ElGamal based encryption. In PKC ’98, 1998.
29. ZS92. Y. Zheng and J. Seberry. Practical approaches to attaining security against adaptively chosen ciphertext attacks. In Advances in Cryptology-Crypto ’92, pages 292-304, 1992.