A critical look at cryptographic hash function literature

A critical look at cryptographic hash function literature (2007)

Cached

Download Links

[events.iaik.tugraz.at]

by Scott Contini , Ron Steinfeld , Josef Pieprzyk , Krystian Matusiewicz

Venue:	ECRYPT Hash Workshop
Citations:	2 - 1 self

BibTeX

@INPROCEEDINGS{Contini07acritical,
    author = {Scott Contini and Ron Steinfeld and Josef Pieprzyk and Krystian Matusiewicz},
    title = {A critical look at cryptographic hash function literature},
    booktitle = {ECRYPT Hash Workshop},
    year = {2007}
}

Bookmark

OpenURL

Abstract

Abstract. The cryptographic hash function literature has numerous hash function definitions and hash function requirements, and many of them disagree. This survey talks about the various definitions, and takes steps towards cleaning up the literature by explaining how the field has evolved and accurately depicting the research aims people have today. 1

Citations

2292	New Directions in Cryptography - Diffie, Hellman
2057	Handbook of Applied Cryptography - Menezes, Oorschot, et al.
1130	Random oracles are practical: A paradigm for designing efficient protocols - Bellare, Rogaway - 1993
711	A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
706	A.: How to prove yourself: Practical solutions to identification and signature problems - Fiat, Shamir - 1986
404	Keying hash functions for message authentication - Bellare, Canetti, et al. - 1996
394	A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack - Cramer, Shoup - 1998
288	The exact security of digital signatures - how to sign with rsa and rabin - Bellare, Rogaway - 1996
284	M.: Universal one-way hash functions and their cryptographic applications - Naor, Yung - 1989
231	A design principle for hash functions - Damgård - 1989
206	The random oracle methodology, revisited - Canetti, Halevi
200	Optimal Asymmetric Encryption - Bellare, Rogaway - 1994
198	Chosen ciphertext attacks against protocols based on the RSA encryption standard - Bleichenbacher - 1998
138	One way hash functions and DES - Merkle
99	RSA-OAEP is Secure under the RSA Assumption - Fujisaki, Okamoto, et al. - 2001
93	Analysis and Design of Cryptographic Hash Functions - Preneel - 1993
88	P.: Collision-Resistant Hashing: Towards Making UOWHFs Practical - Bellare, Rogaway - 1997
87	Collision free hash functions and public key signature schemes - Damg˚ard
84	Digitalized signatures - Rabin - 1978
80	Towards realizing random oracles: Hash functions that hide all partial information - Canetti - 1997
60	An uninstantiable random-oracle-model scheme for a hybridencryption problem - Bellare, Boldyreva, et al. - 2004
57	New proofs for NMAC and HMAC: Security without collision-resistance - Bellare - 2006
54	Practical and provably-secure commitment schemes from collision-free hashing - Halevi, Micali - 1996
53	Perfectly one-way probabilistic hash functions (preliminary version - Canetti, Micciancio, et al. - 1998
49	T.: Cryptographic hash-function basics: Definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance - Rogaway, Shrimpton
48	Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA - 62 - 1999
47	Another look at “provable security - Koblitz, Menezes - 2006
46	On the cryptographic applications of random functions - Goldreich, Goldwasser, et al. - 1985
40	Strengthening digital signatures via randomized hashing - Halevi, Krawczyk - 2006
34	A failure-friendly design principle for hash functions - Lucks - 2005
31	Secrecy, authentication, and public key systems - Merkle - 1979
29	A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes - Desmedt, Odlyzko - 1985
28	Digital signatures with RSA and other public-key cryptosystems - Denning - 1984
27	Chosen signature cryptanalysis of the RSA (MIT) public key cryptosystem - Davida - 1982
27	Preimages on n-Bit Hash Functions for Much Less than 2 n Work - Second
23	Some observations on the theory of cryptographic hash functions - Stinson
19	The composite discrete logarithm and secure authentication - Pointcheval - 2000
18	Producing a one-way hash function from DES - Winternitz - 1984
11	A practice-oriented treatment of pseudorandom number generators - Desai, Hevia, et al. - 2002
10	Proofs of security for the Unix password hashing algorithm - Wagnera, Goldberg - 1976
9	Formalizing human ignorance - Rogaway
7	On the generic insecurity of the full domain hash - Dodis, Oliveira, et al. - 2005
6	On the security of OAEP - Boldyreva, Fischlin - 2006
6	an efficient and provable collision-resistant hash function - Contini, Lenstra, et al. - 2006
5	The security of DSA and ECDSA - Vaudenay - 2002
4	Analysis of random oracle instantiation scenarios for OAEP and other practical schemes - Boldyreva, Fischlin - 2005
4	2002: The Keyed-Hash Message Authentication Code (HMAC) NIST Special (SP) Publications NIST special publications are obtainable from - PUB - 2002
1	The Salsa20 hash function - Bernstein
1	Unprovable security of RSA-OAEP in the standard model. Cryptology ePrint Archive, Report 2006/223 - Brown - 2006
1	Private email - Desmedt - 2005