Add to ORKGI investigate the extent to which a public source of random bits can be used to obtain some basic cryptographic primitives: hard functions, pseudo-random generators and one-way functions. Strong randomized hard functions and one-way functions are exhibited. The existence of a randomized pseudo-random generators with analogous safety parameters remains open, but a weaker variant is presented. As a side effect, I show a very strong separation between sublinear time and $AC^0$
In the classical approach to pseudo-random number generators, a generator is considered to perform w...
In the classical approach to pseudo-random number generators, a generator is considered to perform w...
In the classical approach to pseudo-random number generators, a generator is considered to perform w...
We consider two of the most fundamental theorems in Cryptography. The first, due to H˚astad et. al. ...
Abstract. We describe efficient constructions for various cryptographic primitives in private-key as...
The paper investigates the extent to which a public source of random bits can be used to obtain priv...
AbstractA pseudo-random function is a fundamental cryptographic primitive that is essential for encr...
The question of how to construct optimally efficient secure protocols is a central question in crypt...
We describe efficient constructions for various cryptographic primitives (both in privatekey and in ...
Constant parallel-time cryptography allows performing complex cryptographic tasks at an ultimate lev...
and Luby show that a pseudorandom generator can be constructed from any one-way function. This plaus...
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of...
The main contribution of this paper is the introduction of a formal notion of public randomness in t...
and Luby show that a pseudorandom generator can be constructed from any one-way function. This plaus...
International audienceYao’s theorem gives an equivalence between the indistinguishability of a pseud...
In the classical approach to pseudo-random number generators, a generator is considered to perform w...
In the classical approach to pseudo-random number generators, a generator is considered to perform w...
In the classical approach to pseudo-random number generators, a generator is considered to perform w...
We consider two of the most fundamental theorems in Cryptography. The first, due to H˚astad et. al. ...
Abstract. We describe efficient constructions for various cryptographic primitives in private-key as...
The paper investigates the extent to which a public source of random bits can be used to obtain priv...
AbstractA pseudo-random function is a fundamental cryptographic primitive that is essential for encr...
The question of how to construct optimally efficient secure protocols is a central question in crypt...
We describe efficient constructions for various cryptographic primitives (both in privatekey and in ...
Constant parallel-time cryptography allows performing complex cryptographic tasks at an ultimate lev...
and Luby show that a pseudorandom generator can be constructed from any one-way function. This plaus...
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of...
The main contribution of this paper is the introduction of a formal notion of public randomness in t...
and Luby show that a pseudorandom generator can be constructed from any one-way function. This plaus...
International audienceYao’s theorem gives an equivalence between the indistinguishability of a pseud...
In the classical approach to pseudo-random number generators, a generator is considered to perform w...
In the classical approach to pseudo-random number generators, a generator is considered to perform w...
In the classical approach to pseudo-random number generators, a generator is considered to perform w...