Results 1  10
of
114,449
Indifferentiable Hashing to . . .
"... A number of recent works have considered the problem of constructing constanttime hash functions to various families of elliptic curves over finite fields. In the relevant literature, it has been occasionally asserted that constanttime hashing to certain special elliptic curves, in particular so ..."
Abstract
 Add to MetaCart
function that can be implemented rather efficiently and securely, that reaches about 9/16ths of all points on the curve, and that is welldistributed in the sense of Farashahi et al., so that one can easily build from it a hash function that is indifferentiable from a random oracle.
On the indifferentiability of the Grøstl hash function
 In SCN ’10, LNCS
, 2010
"... Abstract. The notion of indifferentiability, introduced by Maurer et al., is an important criterion for the security of hash functions. Concretely, it ensures that a hash function has no structural design flaws and thus guarantees security against generic attacks up to the proven bounds. In this wor ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
. In this work we prove the indifferentiability of Grøstl, a second round SHA3 hash function candidate. Grøstl combines characteristics of the widepipe and chopMerkleDamg˚ard iterations and uses two distinct permutations P and Q internally. Under the assumption that P and Q are random lbit permutations
Revisiting the Indifferentiability of PGV Hash Functions
, 2009
"... In this paper, first we point out some flaws in the existing indifferentiability simulations of the pfMD and the NMAC constructions, and provide new differentiable attacks on the hash functions based these schemes. Afterthat, the indifferentiability of the 20 collision resistant PGV hash functions, ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In this paper, first we point out some flaws in the existing indifferentiability simulations of the pfMD and the NMAC constructions, and provide new differentiable attacks on the hash functions based these schemes. Afterthat, the indifferentiability of the 20 collision resistant PGV hash functions
An Indifferentiable Hash Function into Elliptic Curves
"... Abstract. We provide the first construction of a hash function into an elliptic curve that is indifferentiable from a random oracle. Our construction can be based on any efficient encoding into an ellipticcurve, for example Icart’s function or the ShallueWoestijneUlas (SWU) algorithm. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We provide the first construction of a hash function into an elliptic curve that is indifferentiable from a random oracle. Our construction can be based on any efficient encoding into an ellipticcurve, for example Icart’s function or the ShallueWoestijneUlas (SWU) algorithm.
On the Indifferentiability of the IntegratedKey Hash Functions
"... Most of today’s popular hash functions are keyless such that they accept variablelength messages and return fixedlength fingerprints. However, recent separation results reported on several serious inherent weaknesses in these functions, motivating the design of hash functions in the keyed setting. ..."
Abstract
 Add to MetaCart
is to adopt the ”integratedkey” approach that creates keyed hash functions out of ”unmodified ” keyless primitives. In this paper, we adopt several integratedkey constructions and prove that they are indifferentiable from random oracle, showing in details how to develop indifferentiability proofs
Verified Indifferentiable Hashing into Elliptic Curves
"... Abstract. Many cryptographic systems based on elliptic curves are proven secure in the Random Oracle Model, assuming there exist probabilistic functions that map elements in some domain (e.g. bitstrings) onto uniformly and independently distributed points in a curve. When implementing such systems, ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
known for some time, the first generic construction for hashing into ordinary elliptic curves indifferentiable from a random oracle was put forward only recently by Brier et al. We present a machinechecked proof of this construction. The proof is based on an extension of the CertiCrypt framework
Generic Indifferentiability Proofs of Hash Designs
"... Abstract—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and provide a unified proof of their security in the form of a generic reduction theorem. Our general model for domain exen ..."
Abstract
 Add to MetaCart
of hash functions justifying the security of their constructions: they only need to bound the probability of welldefined events. Our model allows to consider many SHA3 finalists and is instantiated on two wellknown constructions, namely ChopMD and Sponge. Finally, the indifferentiability bounds which
PseudoRandom Generation from OneWay Functions
 PROC. 20TH STOC
, 1988
"... Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom gene ..."
Abstract

Cited by 887 (22 self)
 Add to MetaCart
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3499 (47 self)
 Add to MetaCart
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions
Efficient implementation of a BDD package
 In Proceedings of the 27th ACM/IEEE conference on Design autamation
, 1991
"... Efficient manipulation of Boolean functions is an important component of many computeraided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient implementat ..."
Abstract

Cited by 500 (9 self)
 Add to MetaCart
Efficient manipulation of Boolean functions is an important component of many computeraided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient
Results 1  10
of
114,449