Sciweavers

397 search results - page 21 / 80
» Pseudorandom Functions and Lattices
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 1 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
NA
2007
100views more  NA 2007»
15 years 23 days ago
Periodization strategy may fail in high dimensions
Abstract. We discuss periodization of smooth functions f of d variables for approximation of multivariate integrals. The benefit of periodization is that we may use lattice rules,...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
ISCIS
2005
Springer
15 years 6 months ago
Recovering the Lattice of Repetitive Sub-functions
Abstract. Given a set of observations of an existing concurrent system with repetitive sub-functions, we consider the construction of an MSC graph representing the functionality of...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
FOCS
2003
IEEE
15 years 6 months ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim