Results 1  10
of
4,614
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
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
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
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
. 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 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
Does Secure TimeStamping Imply CollisionFree Hash Functions?
"... Abstract. We prove that there are no blackbox reductions from CollisionFree Hash Functions to secure timestamping schemes, which means that in principle secure timestamping schemes may exist even if there exist no collisionresistant hash functions. We show that there is an oracle relative to wh ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We prove that there are no blackbox reductions from CollisionFree Hash Functions to secure timestamping schemes, which means that in principle secure timestamping schemes may exist even if there exist no collisionresistant hash functions. We show that there is an oracle relative
Chisel: A storageefficient, collisionfree hashbased network processing architecture
 In Proceedings of The 33rd Annual International Symposium on Computer Architecture (ISCA 33
, 2006
"... Longest Prefix Matching (LPM) is a fundamental part of various network processing tasks. Previously proposed approaches for LPM result in prohibitive cost and power dissipation (TCAMs) or in large memory requirements and long lookup latencies (tries), when considering future linerates, table sizes ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
propose a novel architecture which successfully addresses for the first time, both key problems in hash based LPM — making the following contributions: (1) We architect an LPM solution based upon a recentlyproposed, collisionfree hashing scheme called Bloomier filter, by eliminating its false positives
COLLISION FREE HASH FUNCTIONS AND PUBLIC KEY SIGNATURE SCHEMES
, 1988
"... In this paper, we present a construction of hash functions. These functions are collision free in the sense that under some cryptographic assumption, it is provably hard for an enemy to find collisions. Assumptions that would be sufficient are the hardness of factoring, of discrete log, or the (poss ..."
Abstract

Cited by 108 (1 self)
 Add to MetaCart
In this paper, we present a construction of hash functions. These functions are collision free in the sense that under some cryptographic assumption, it is provably hard for an enemy to find collisions. Assumptions that would be sufficient are the hardness of factoring, of discrete log
Improved Form of CollisionFree Hashing From Lattice Problems
"... In 1995, Ajtai described a construction of oneway functions whose security is equivalent to the difficulty of some wellknown approximation problems in lattice. We improve the hash function which meets all the three security properties. ..."
Abstract
 Add to MetaCart
In 1995, Ajtai described a construction of oneway functions whose security is equivalent to the difficulty of some wellknown approximation problems in lattice. We improve the hash function which meets all the three security properties.
Two Infinite Classes of Cryptographic Hash Functions
, 2003
"... We o#er two new definitions of two infinite classes of strongly collision free hash functions that we gave a name "Edon"C and "Edon" R. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We o#er two new definitions of two infinite classes of strongly collision free hash functions that we gave a name "Edon"C and "Edon" R.
Results 1  10
of
4,614