Constructions of Low-Degree and Error-Correcting \in-Biased Generators

Authors:
Amir Shpilka
Affiliations:
Technion, Israel
Venue:
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Year:
2006

Citing 0
Cited 3

On Pseudorandom Generators with Linear Stretch in NC0

Computational Complexity
Small Sample Spaces Cannot Fool Low Degree Polynomials

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Cryptography in constant parallel time

Cryptography in constant parallel time

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we give two new constructions of \in-biased generators. Our first construction answers an open question of Dodis and Smith [DS05], and our second construction significantly extends a result of Mossel et al. [MST03].