Results 1  10
of
302,404
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 1 (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
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
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.
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
, 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
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 103 (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
EnergyEfficient, CollisionFree Medium Access Control for Wireless Sensor Networks
, 2003
"... The trafficadaptive medium access protocol (TRAMA) is introduced for energyefficient collisionfree channel access in wireless sensor networks. TRAMA reduces energy consumption by ensuring that unicast and broadcast transmissions incur no collisions, and by allowing nodes to assume a lowpower, ..."
Abstract

Cited by 338 (4 self)
 Add to MetaCart
The trafficadaptive medium access protocol (TRAMA) is introduced for energyefficient collisionfree channel access in wireless sensor networks. TRAMA reduces energy consumption by ensuring that unicast and broadcast transmissions incur no collisions, and by allowing nodes to assume a low
A Framework for the Design of OneWay Hash Functions Including Cryptanalysis of Damg˚ard’s OneWay Function Based on a Cellular Automaton
 Advances in cryptology  ASIACRYPT '91, Lecture Notes in Computer Science
, 1993
"... At Crypto ’89 Ivan Damg˚ard [1] presented a method that allows one to construct a computationally collision free hash function that has provably the same level of security as the computationally collision free function with input of constant length that it is based upon. He also gave three examples ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
At Crypto ’89 Ivan Damg˚ard [1] presented a method that allows one to construct a computationally collision free hash function that has provably the same level of security as the computationally collision free function with input of constant length that it is based upon. He also gave three examples
Keying hash functions for message authentication
, 1996
"... The use of cryptographic hash functions like MD5 or SHA for message authentication has become a standard approach inmanyInternet applications and protocols. Though very easy to implement, these mechanisms are usually based on ad hoc techniques that lack a sound security analysis. We present new cons ..."
Abstract

Cited by 617 (42 self)
 Add to MetaCart
The use of cryptographic hash functions like MD5 or SHA for message authentication has become a standard approach inmanyInternet applications and protocols. Though very easy to implement, these mechanisms are usually based on ad hoc techniques that lack a sound security analysis. We present new
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 66 (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
Results 1  10
of
302,404