Add to ORKGWe present several new constructions of collision-resistant hash-functions (CRHFs) from general assumptions. We start with a simple construction of CRHF from any homomorphic encryption. Then, we strengthen this result by presenting constructions of CRHF from two other primitives that are implied by homomorphic-encryption: one-round private information retrieval (PIR) protocols and homomorphic one-way commitments
Doctor en Ciencias, Mención ComputaciónSe estudian funciones de hash resistentes a colisiones (FHRC)...
International audienceA cryptographic hash function is a deterministic procedure that compresses an ...
We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant a...
Abstract. There is a foundational problem involving collision-resistant hash-functions: common const...
This paper determines an exact relationship between collision-free hash functions and other cryptogr...
Abstract. We initiate a complexity-theoretic treatment of hardness amplification for collision-resis...
In this paper, we present a construction of hash functions. These functions are collision free in th...
Abstract. The collision-resistance of hash functions is an impor-tant foundation of many cryptograph...
htmlabstractA black-box combiner for collision resistant hash functions (CRHF) is a construction w...
The MD transform that underlies the MD and SHA families iterates a compression function $\mathsf{h}$...
Item removed from eCommons on 2010-02-21 at the request of the author.A long-standing open problem o...
We prove that there is no fully black-box construction of collision-resistant hash functions (CRH) f...
© Springer-Verlag Berlin Heidelberg 1993. Collision resistant hash functions are an important basic ...
Chameleon hash functions are collision resistant when only the hashing keys of the functions are kno...
Doctor en Ciencias, Mención ComputaciónSe estudian funciones de hash resistentes a colisiones (FHRC)...
Doctor en Ciencias, Mención ComputaciónSe estudian funciones de hash resistentes a colisiones (FHRC)...
International audienceA cryptographic hash function is a deterministic procedure that compresses an ...
We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant a...
Abstract. There is a foundational problem involving collision-resistant hash-functions: common const...
This paper determines an exact relationship between collision-free hash functions and other cryptogr...
Abstract. We initiate a complexity-theoretic treatment of hardness amplification for collision-resis...
In this paper, we present a construction of hash functions. These functions are collision free in th...
Abstract. The collision-resistance of hash functions is an impor-tant foundation of many cryptograph...
htmlabstractA black-box combiner for collision resistant hash functions (CRHF) is a construction w...
The MD transform that underlies the MD and SHA families iterates a compression function $\mathsf{h}$...
Item removed from eCommons on 2010-02-21 at the request of the author.A long-standing open problem o...
We prove that there is no fully black-box construction of collision-resistant hash functions (CRH) f...
© Springer-Verlag Berlin Heidelberg 1993. Collision resistant hash functions are an important basic ...
Chameleon hash functions are collision resistant when only the hashing keys of the functions are kno...
Doctor en Ciencias, Mención ComputaciónSe estudian funciones de hash resistentes a colisiones (FHRC)...
Doctor en Ciencias, Mención ComputaciónSe estudian funciones de hash resistentes a colisiones (FHRC)...
International audienceA cryptographic hash function is a deterministic procedure that compresses an ...
We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant a...