Collision resistance

Known as: Collision resistant, Collision-resistant 
Collision resistance is a property of cryptographic hash functions: a hash function H is collision resistant if it is hard to find two inputs that… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
In FOCS 2001, Barak, Goldreich, Goldwasser and Lindell conjectured that the existence of ZAPs, introduced by Dwork and Naor in… (More)
  • figure 1
  • figure 6
Is this relevant?
Highly Cited
2011
Highly Cited
2011
The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationally-sound proofs where the verifier… (More)
  • figure 1
Is this relevant?
2011
2011
In this paper, we analyze collision resistance of the JH hash function in the ideal primitive model. The JH hash function is one… (More)
Is this relevant?
2010
2010
At CRYPTO 2008 Stam [7] made the following conjecture: if an m + s-bit to s-bit compression function F makesr calls to a… (More)
  • figure 1
Is this relevant?
2007
2007
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the… (More)
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We introduce VSH, very smooth hash, a new hash function for which finding collisions is provably reducible to finding nontrivial… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The generalized knapsack function is defined as fa(x) = ∑ i ai · xi, where a = (a1, . . . , am) consists of m elements from some… (More)
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The generalized knapsack problem is the following: given m random elements a1, . . . , am in a ring R, and a target t ∈ R, find… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider basic notions of security for cryptographic hash functions: collision resistance, preimage resistance, and second… (More)
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Recent attacks on the cryptographic hash functions MD andMD make it clear that strong collision resistance is a hard to achieve… (More)
Is this relevant?