搜索结果: 1-15 共查到“密码学 Collision Resistance”相关记录18条 . 查询时间(0.14 秒)
Distributional Collision Resistance Beyond One-Way Functions
statistically hiding commitments distributional collision resistance
2019/2/27
Distributional collision resistance is a relaxation of collision resistance that only requires that it is hard to sample a collision (x,y) where x is uniformly random and y is uniformly random conditi...
Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness
post-quantum cryptography one-way permutation one-way trapdoor permutation
2018/11/12
Since the celebrated work of Impagliazzo and Rudich (STOC 1989), a number of black-box impossibility results have been established. However, these works only ruled out classical black-box reductions a...
Better Than Advertised: Improved Collision-Resistance Guarantees for MD-Based Hash Functions
hash functions MD transform SHA
2018/6/25
The MD transform that underlies the MD and SHA families iterates a compression function hh to get a hash function HH. The question we ask is, what property X of hh guarantees collision resistance (CR)...
Quantum Collision-Resistance of Non-uniformly Distributed Functions: Upper and Lower Bounds
Quantum Collision Non-uniform distribution
2017/6/22
We study the quantum query complexity of finding a collision for a function ff whose outputs are chosen according to a non-uniform distribution DD. We derive some upper bounds and lower bounds dependi...
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions
hash functions zero knowledge succinct arguments
2017/6/1
We study multi-collision-resistant hash functions --- a natural relaxation of collision-resistant hashing that only guarantees the intractability of finding many (rather than two) inputs that map to t...
Quantum preimage, 2nd-preimage, and collision resistance of SHA3
Post-quantum cryptography SHA3,SHAKE
2017/4/11
SHA3 and its extendable output variant SHAKE belong to the family of sponge functions. In this work, we present formal security arguments for the quantum preimage, 2nd2nd-preimage, and collision resis...
Continuous Collision Resistance and its Applications
ID-KEM Continuous collision resistance
2017/2/20
We introduce a new, simple and non-interactive complexity assumption for cryptographic hash functions, which seems very reasonable for standard functions like SHA-3. We describe how this assumption ca...
On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography
monotone boolean circuits negation complexity one-way functions
2016/2/24
Goldreich and Izsak (Theory of Computing, 2012) initiated the research on understanding
the role of negations in circuits implementing cryptographic primitives, notably, considering
one-way function...
Quantum Collision-Resistance of Non-Uniformly Distributed Functions
Quantum Collision Non-uniform Distribution
2016/1/27
We study the quantum query complexity of finding a collision
for a function f whose outputs are chosen according to a distribution
with min-entropy k. We prove that з(2k/9
) quantum queries are
ne...
Constant-round Leakage-resilient Zero-knowledge from Collision Resistance
zero-knowledge leakage-resistance
2016/1/26
We construct a constant-round leakage-resilient zero-knowledge argument system under the
existence of collision-resistant hash function family. That is, using collision-resistant hash functions,
we ...
From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again
foundations / CS proofs proofs of knowledge knowledge assumptions knowledge of exponent knapsack
2012/3/26
The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationally-sound proofs where the verifier's work is essentially independent of the complexity of the NP nondeter...
In this paper, we analyze collision resistance of the JH hash function in the ideal primitive model. The JH hash function is one of the five SHA-3 candidates accepted for the final round of evaluation...
In this paper, we analyze collision resistance of the JH hash function in the ideal primitive model. The JH hash function is one of the five SHA-3 candidates accepted for the final round of evaluation...
An Investigation of the Enhanced Target Collision Resistance Property for Hash Functions
Hash Functions Security Notions eTCR
2009/12/29
We revisit the enhanced target collision resistance (eTCR) property as a newly emerged notion of security for dedicated-key hash functions, which has been put forth by Halevi and Krawczyk at CRYPTO’06...
An Investigation of Enhanced Target Collision Resistance Property for Hash Functions: Implications, Separations, and Domain Extension
Hash Functions Security Property eTCR
2009/11/18
In this paper we investigate the newly emerged security property called the enhanced target collision
resistance (eTCR) for hash functions. eTCR property was put forth by Halevi and Krawczyk in Crypt...