Merkle-Damgård Revisited: How to Construct a Hash Function
By Jean-Sébastien Coron, Yevgeniy Dodis, Cécile Malinaud, P. Puniya. Annual International Cryptology Conference, 2005
603 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/1ddb640116b1dffba839c4f868176a69de768187
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Srinath T. V. Setty
- Michael Walfish
- Andrew Justin Blumberg
- Mihir Bellare
- Sriram Keelveedhi
- Phillip Rogaway
- Ariel J. Feldman
- María Naya-Plasencia
In Computer Vision and Pattern Recognition
- Mihir Bellare
- Sriram Keelveedhi
- Phillip Rogaway
- Joan Daemen
- Guido Marco Bertoni
- Gilles Van Assche
- Michaël Peeters
- María Naya-Plasencia
Citations in the corpus
- Efficient Garbling from a Fixed-Key Blockcipher (2013, background): “We have preferred them to constructions that are indifferentiable from ROs because the latter are less efficient.”
- Introduction to Modern Cryptography, Second Edition (2014, neutral): “Proper instantiation of a random oracle based on concrete cryptographic hash functions is discussed in [21, 22, 23, 48].”
- Verifying computations with state (2013, background): “[13], that prepends the input with its length.”
- Secure Multiparty Computations on Bitcoin (2014, neutral): “susceptible to the length extension attack [21].”
- Duplexing the sponge: single-pass authenticated encryption and other applications (2011, background): “The chop-MD construction [16,15] is a good candidate for duplexing.”
- On the Indifferentiability of the Sponge Construction (2008, methodology): “In this paper we apply the approach of [7] to the sponge construction and demonstrate that the advantage of an adversary in differentiating the sponge construction from a random oracle is about N(N + 1)/2 if the underlying f is a random transformation and an even smaller upper bound if it is a rando”
- Quark: A Lightweight Hash (2010, background): “It has complexity equivalent to more than 2c/2+1 evaluations of P and so to more than b2c/2+3 clocks of P ’s mechanism, that is, 274, 290, and 2123 clocks for u-, d-, and t-Quark respectively.”
- Foundations of garbled circuits (2012, background): “Such constructions are not indifferentiable from ROs [31, 33], necessitating considerable caution.”
- The Skein Hash Function Family (2009, background): “Indifferentiability [72, 24] is a technical term underlain by a formal definition.”