Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > PSEUDO-RANDOM FUNCTIONS:
Reports tagged with Pseudo-Random Functions:
TR97-028 | 12th July 1997
Scott E. Decatur, Oded Goldreich, Dana Ron

#### Computational Sample Complexity

In a variety of PAC learning models, a tradeoff between time and
information seems to exist: with unlimited time, a small amount of
sometimes seems to be required.
In addition, it has long been known that there are
concept classes ... more >>>

TR99-021 | 8th April 1999
Igor E. Shparlinski

#### ON THE UNIFORMITY OF DISTRIBUTION OF A CERTAIN PSEUDO-RANDOM FUNCTION

We show that a pseudo-random number generator,
introduced recently by M. Naor and O. Reingold,
possess one more attractive and useful property.
Namely, it is proved that for almost all values of parameters it
produces a uniformly distributed sequence.
The proof is based on some recent bounds of exponential
more >>>

TR17-005 | 10th January 2017
Nir Bitansky

#### Verifiable Random Functions from Non-Interactive Witness-Indistinguishable Proofs

Revisions: 3

Verifiable random functions (VRFs) are pseudorandom functions where the owner of the seed, in addition to computing the function's value $y$ at any point $x$, can also generate a non-interactive proof $\pi$ that $y$ is correct (relative to so), without compromising pseudorandomness at other points. Being a natural primitive with ... more >>>

ISSN 1433-8092 | Imprint