10 search results - page 1 / 2 » Pseudorandom Generators in Propositional Proof Complexity |
59
Voted
FOCS
2000
IEEE
15 years 3 months ago
2000
IEEE
STOC
1994
ACM
15 years 3 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
ASIACRYPT
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
105
click to vote
CRYPTO
2005
Springer
15 years 4 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
COCO
2005
Springer
15 years 1 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...