
...show that given a prfg (pseudorandom function generator) g that is (1/n
c
) partially secure there exists a polynomial p such that the construction g
1
(x ⊕...and r
i
are strings of random bits, and the key for the new prfg is composed of the r
i
's and keys for the g
i
's. this is...

...show that given a prfg (pseudorandom function gen erator) g which is 1 c partially secure, the construction g1(x ⊕ r1...g and ri are strings of random bits. thus we present the first "natural" construc tion of a (totally secure) prfg from a partially secure...

...of a node compromise to the immediate network neighborhood of the compromised node. the design of the protocol is motivated by the observation that different types of...suitable for meeting these different security requirements. leap supports the establishment of four types of keys for each sensor node  an individual key shared with the base station, a pairwise key...

the exponentiation function in a nite eld of order p (a prime number) is believed to be a oneway function. it is well known that...bits. for all practical purposes, the size of s can be a constant c bits. this leads to a very ecient pseudorandom number generator which produces n c bits...

...is practical and inspired by the pseudorandom functions of naor and reingold and the veriable random functions of lysyanskaya. set in a bilinear group, where the decisional die hellman problem is...small (polynomialsize) input in the view of the reduction algorithm. this view, however, is informationtheoretically hidden from the attacker. since the input space is exponentially large...

...wang et al (2005). provably secure hash functions (in the sense that their security relates to the hardness of some mathematical problems by v...parameters and algorithms to increase the speed of both hash functions. this makes our function one of the most efficient ldquoprovably securerdquo hash functions to this day. finally, we...
Published in 2008.

Published in 2009.

...we give new proofs for the hardness amplification of efficiently samplable
predicates and of weakly verifiable puzzles which generalize to new settings.
more concretely...than previous ones, yet immediately
generalizes to statements similar in spirit such as the extraction lemma used
to obtain pseudorandom generators from oneway functions [hastad, impagliazzo,
levin, luby, siam...

...we give new proofs for the hardness amplification of efficiently samplable predicates and of weakly verifiable puzzles which
generalize to new settings. more concretely...than previous ones, yet immediately generalizes
to statements similar in spirit such as the extraction lemma used to obtain pseudorandom generators from oneway functions
[hastad, impagliazzo, levin, luby, siam...

...problem. despite this evidence for the power of random choices, the computational theory of pseudo randomness shows that, under certain complexity...paper we describe connections between the conditional "derandomization" re sults of the computational theory of pseudorandomness and unconditional explicit constructions of certain combinatorial objects such as...