60 search results - page 10 / 12 » focs 2010 |
COCO
2010
Springer
14 years 10 months ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
ECCC
2011
14 years 4 months ago
2011
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
ECCC
2007
14 years 9 months ago
2007
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
102
click to vote
ECCC
2010
14 years 8 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...