Formalizing human ignorance collision-resistant hashing without the keys

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

Volumn 4341 LNCS, Issue , 2006, Pages 211-228

  Rogaway, Phillip ^a,b  

^a University of California Davis   (United States)

^b CHIANG MAI UNIVERSITY   (Thailand)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BLACK BOXES; COLLISION-FINDING ALGORITHMS; COLLISION-RESISTANT HASH FUNCTIONS; COLLISION-RESISTANT HASHING; FORMAL DEFINITION; FOUNDATIONAL PROBLEMS; HUMAN BEING; PSEUDO-RANDOM FUNCTIONS;

HASH FUNCTIONS;

EID: 84887264252     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11958239_14     Document Type: Conference Paper

References (32)

1. M. Bellare, R. Guérin, and P. Rogaway. XOR MACs: New methods for message authentication using finite pseudorandom functions. Full version of CRYPTO '95 paper. Available on-line from the author's web page.
2. M. Bellare, J. Kilian, and P. Rogaway. The security of the cipher block chaining message authentication code. J. of Computer and System Sciences (JCSS), Vol. 61, no. 3, pp. 362-399, 2000.
3. M. Bellare and P. Rogaway. Collision-resistant hashing: towards making UOWHFs practical. Advances in Cryptology - CRYPTO '97, LNCS, Springer, 1997.
4. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. First ACM Conference on Computer and Communications Security (CCS '93), ACM Press, pp. 62-73, 1993.
5. D. Brown. Generic groups, collision resistance, and ECDSA. Designs, Codes and Cryptography, Vol. 35, no. 1, pp. 119-152, 2005.
6. C. Cipolla. Le leggi fondamentali della stupidità (The fundamental laws of human stupidity). In Allegro ma non troppo con Le leggi fondamentali della stupidità, Società editrice il Malino, Bologna, 1988.
7. I. Damgard. Collision free hash functions and public key signature schemes. Advance in Cryptology - EUROCRYPT '87, LNCS Vol. 304, Springer, pp. 203-216, 1987.
8. I. Damgard. A design principle for hash functions. Advances in Cryptology - CRYPTO '89, LNCS Vol. 435, Springer, 1990.
9. A. De Santis and M. Yung. On the design of provably secure cryptographic hash functions. Advance in Cryptology - EUROCRYPT '90, LNCS Vol. 473, Springer, pp. 412-431, 1991.
10. P. Devanbu, M. Gertz, A. Kwong, C. Martel, G. Nuckolls, and S. Stubblebine. Flexible authentication of XML documents. J. of Computer Security, Vol. 12, no. 6, pp. 841-864, 2004.
11. O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIAM Journal on Computing, Vol. 25, no. 1, pp. 169-192, Feb 1997.
12. O. Goldreich and Y. Oren. Definitions and properties of zero-knowledge proof systems. J. of Cryptology, Vol. 7, no. 1, pp. 1-32, 1994.
13. S. Goldwasser and S. Micali. Probabilistic encryption. J. Comput. Syst. Sci., Vol. 28, no. 2, pp. 270-299, 1984.
14. Earlier version in STOC 82.
15. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, Vol. 18, no. 1, pp. 186-208, 1989.
16. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. on Comp., Vol. 17, pp. 281-308, 1988.
17. S. Halevi and H. Krawczyk. Strengthening digital signatures by randomized hashing. Manuscript dated 6 June 2006.
18. Proceedings version in Advances in Cryptol-ogy - CRYPTO 06, LNCS, Springer, 2006.
19. R. Merkle. Method of providing digital signatures. US Patent #4,309,569, 1982.
20. R. Merkle. One way hash functions and DES. Advances in Cryptology - CRYPTO 89, LNCS Vol. 435, Springer, pp. 428-446, 1990.
21. R. Merkle. Protocols for public key cryptosystems. Proceedings of the 1980 IEEE Symposium on Security and Privacy, IEEE Press, pp. 122-134, 1980.
22. S. Matyas, C. Meyer, and J. Oseas. Generating strong one-way functions with cryptographic algorithm. IBM Tech. Disclosure Bulletin, 27, pp. 5658-5659, 1985.
23. National Institute of Standards and Technology. FIPS PUB 180-2, Secure Hash Standard, Aug 1, 2002.
24. Y. Oren. On the cunning power of cheating verifiers: some observations about zero-knowledge proofs. 28th Annual Symposium on the Foundations of Computer Science (FOCS 87), IEEE Press, pp. 462-471, 1987.
25. M. Rabin. Digital signatures. In Foundations of secure computation, R. DeMillo, D. Dobkin, A. Jones, and R. Lipton, editors, Academic Press, pp. 155-168, 1978.
26. O. Reingold, L. Trevisan, and S. Vadhan. Notions of reducibility between cryptographic primitives. Theory of Cryptography Conference, TCC 2004, LNCS Vol. 2951, Springer, pp. 1-20, 2004.
27. R. Rivest. The MD4 message digest algorithm. Advance in Cryptology - CRYPTO '90, LNCS Vol. 537, Springer, pp. 303-311, 1991.
28. P. Rogaway and T. Shrimpton. Cryptographic hash-function basics: definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance. Fast Software Encryption (FSE 2004), LNCS Vol. 3017, Springer, pp. 371-388, 2004.
29. A. Russell. Necessary and sufficient conditions for collision-free hashing. J. of Cryp-tology, Vol. 8, no. 2, pp. 87-99, 1995.
30. X. Wang, X. Lai, D. Feng, H. Chen, and X. Yu. Cryptanalysis of the hash functions MD4 and RIPEMD. Advances in Cryptology - EUROCRYPT '05, LNCS Vol. 3494, Springer, pp. 1-18, 2005.
31. X. Wang, Y. Yin, and H. Yu. Finding Collisions in the Full SHA-1. Advances in Cryptology - CRYPTO '05, LNCS Vol. 3621, Springer, pp. 17-36, 2005.
32. R. Winternitz. A secure one-way hash function built from DES. Proceedings of the IEEE Symposium on Inf. Security and Privacy, pp. 88-90, IEEE Press, 1984.