128 search results - page 12 / 26 » Weak Verifiable Random Functions |
WSC
1997
13 years 10 months ago
1997
In this paper we compare the average performance of Monte Carlo methods for global optimization with non-adaptive deterministic alternatives. We analyze the behavior of the algori...
EUROCRYPT
2010
Springer
14 years 1 months ago
2010
Springer
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
ISIPTA
1999
IEEE
14 years 26 days ago
1999
IEEE
The purpose of this note is to describe the underlying insights and results obtained by the authors, and others, in a series of papers aimed at modelling the distribution of `natu...
STOC
2000
ACM
14 years 28 days ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
POPL
2005
ACM
14 years 9 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...