Results 1  10
of
3,515
On building hash functions from multivariate quadratic equations
 of Lecture Notes in Computer Science
, 2007
"... Abstract. Recent advances in hash functions cryptanalysis provide a strong impetus to explore new designs. This paper describes a new hash function mqhash that depends for its security on the difficulty of solving randomly drawn systems of multivariate equations over a finite field. While provably ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
property we seek while retaining provable preimage resistance. Therefore, mqhash offers an intriguing companion proposal to the provably collisionfree hash function vsh. 1
Collisionfree hashing from lattice problems
 Electronic Colloquium on Computational Complexity (ECCC) 3
, 1996
"... Abstract. In 1995, Ajtai described a construction of oneway functions whose security is equivalent to the difficulty of some well known approximation problems in lattices. We show that essentially the same construction can also be used to obtain collisionfree hashing. This paper contains a selfco ..."
Abstract

Cited by 65 (1 self)
 Add to MetaCart
Abstract. In 1995, Ajtai described a construction of oneway functions whose security is equivalent to the difficulty of some well known approximation problems in lattices. We show that essentially the same construction can also be used to obtain collisionfree hashing. This paper contains a self
How to break MD5 and other hash functions
 In EUROCRYPT
, 2005
"... Abstract. MD5 is one of the most widely used cryptographic hash functions nowadays. It was designed in 1992 as an improvement of MD4, and its security was widely studied since then by several authors. The best known result so far was a semi freestart collision, in which the initial value of the has ..."
Abstract

Cited by 317 (7 self)
 Add to MetaCart
Abstract. MD5 is one of the most widely used cryptographic hash functions nowadays. It was designed in 1992 as an improvement of MD4, and its security was widely studied since then by several authors. The best known result so far was a semi freestart collision, in which the initial value
A new paradigm for collisionfree hashing: incrementality at reduced cost
 In Eurocrypt97
, 1997
"... We present a simple, new paradigm for the design of collisionfree hash functions. Any function emanating from this paradigm is incremental. (This means that if a message x which Ihave previously hashed is modi ed to x 0 then rather than having to recompute the hash of x 0 from scratch, I can quick ..."
Abstract

Cited by 99 (3 self)
 Add to MetaCart
We present a simple, new paradigm for the design of collisionfree hash functions. Any function emanating from this paradigm is incremental. (This means that if a message x which Ihave previously hashed is modi ed to x 0 then rather than having to recompute the hash of x 0 from scratch, I can
Necessary and Sufficient Conditions for CollisionFree Hashing
 Journal of Cryptology
, 1995
"... This paper determines an exact relationship between collisionfree hash functions and other cryptographic primitives. Namely, it introduces a new concept, the pseudopermutation, and shows that the existence of collisionfree hash functions is equivalent to the existence of clawfree pairs of pseudo ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
This paper determines an exact relationship between collisionfree hash functions and other cryptographic primitives. Namely, it introduces a new concept, the pseudopermutation, and shows that the existence of collisionfree hash functions is equivalent to the existence of clawfree pairs of pseudo
FFTHashII is not yet Collisionfree
, 1992
"... . In this paper, we show that the FFTHash function proposed by Schnorr [2] is not collision free. Finding a collision requires about 2 24 computation of the basic function of FFT. This can be done in few hours on a SUN4workstation. In fact, it is at most as strong as a oneway hash function whic ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
. In this paper, we show that the FFTHash function proposed by Schnorr [2] is not collision free. Finding a collision requires about 2 24 computation of the basic function of FFT. This can be done in few hours on a SUN4workstation. In fact, it is at most as strong as a oneway hash function
Practical and ProvablySecure Commitment Schemes from CollisionFree Hashing
 in Advances in Cryptology  CRYPTO96, Lecture Notes in Computer Science 1109
, 1996
"... . We present a very practical stringcommitment scheme which is provably secure based solely on collisionfree hashing. Our scheme enables a computationally bounded party to commit strings to an unbounded one, and is optimal (within a small constant factor) in terms of interaction, communication, a ..."
Abstract

Cited by 77 (5 self)
 Add to MetaCart
, and computation. Our result also proves that constant round statistical zeroknowledge arguments and constantround computational zeroknowledge proofs for NP exist based on the existence of collisionfree hash functions. 1 Introduction String commitment is a fundamental primitive for cryptographic protocols. A
CollisionFree Hashing from Lattice Problems
 Electronic Colloquium on Computational Complexity (ECCC
, 1996
"... Recently Ajtai described a construction of oneway functions whose security is equivalent to the difficulty of some well known approximation problems in lattices. We show that essentially the same construction can also be used to obtain collisionfree hashing. On sabatical leave from Weizmann Ins ..."
Abstract
 Add to MetaCart
Recently Ajtai described a construction of oneway functions whose security is equivalent to the difficulty of some well known approximation problems in lattices. We show that essentially the same construction can also be used to obtain collisionfree hashing. On sabatical leave from Weizmann
VSH, an efficient and provable collisionresistant hash function
"... We introduce VSH, very smooth hash, a new Sbit hash function that is provably collisionresistant assuming the hardness of finding nontrivial modular square roots of very smooth numbers modulo an Sbit composite. By very smooth, we mean that the smoothness bound is some fixed polynomial function ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
We introduce VSH, very smooth hash, a new Sbit hash function that is provably collisionresistant assuming the hardness of finding nontrivial modular square roots of very smooth numbers modulo an Sbit composite. By very smooth, we mean that the smoothness bound is some fixed polynomial function
Hash Functions from Sigma Protocols and Improvements to VSH
, 2008
"... We present a general way to get a provably collisionresistant hash function from any (suitable) Σprotocol. This enables us to both get new designs and to unify and improve previous work. In the first category, we obtain, via a modified version of the FiatShamir protocol, the fastest known hash fu ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
function that is provably collisionresistant based on the standard factoring assumption. In the second category, we provide a modified version VSH * of VSH which is faster when hashing short messages. (Most Internet packets are short.) We also show that Σhash functions are chameleon, thereby obtaining
Results 1  10
of
3,515