Reconstructive dispersers and hitting set generators

Reconstructive dispersers and hitting set generators (2005)

by Christopher Umans

Venue:	In APPROXRANDOM
Citations:	6 - 3 self

Datum	Value	Source
TITLE	Reconstructive dispersers and hitting set generators	INFERENCE
AUTHOR NAME	Christopher Umans	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Science Department; California Institute of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Pasadena CA 91125	SVM HeaderParse 0.2
ABSTRACT	Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive ” disperser. Past constructions of optimal HSGs have been based on such disperser constructions, but have had to modify the construction in a complicated way to meet the stringent efficiency requirements of HSGs. The construction in this paper uses existing disperser constructions with the “easiest ” parameter setting in a black-box fashion to give new constructions of optimal HSGs without any additional complications. Our results show that a straightforward composition of the Nisan-Wigderson pseudorandom generator that is similar to the composition in works by Impagliazzo, Shaltiel and Wigderson in fact yields optimal HSGs (in contrast to the “near-optimal ” HSGs constructed in those works). Our results also give optimal HSGs that do not use any form of hardness amplification or implicit list-decoding – like Trevisan’s extractor, the only ingredients are combinatorial designs and any good list-decodable error-correcting code. 1	SVM HeaderParse 0.2
YEAR	2005	INFERENCE
VENUE	In APPROXRANDOM	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	460--471	INFERENCE
CITATIONS	16 found	ParsCit 1.0