Efficiency improvements in constructing pseudorandom generators from one-way functions

Iftach Haitner; Omer Reingold; Salil Vadhan

doi:10.1145/1806689.1806750

Efficiency improvements in constructing pseudorandom generators from one-way functions

Iftach Haitner^*, Omer Reingold, Salil Vadhan

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of Hastad, Impagliazzo, Levin, and Luby [SICOMP '99]. The key to our construction is a new notion of next-block pseudoentropy, which is inspired by the notion of "inaccessible entropy" recently introduced in [Haitner, Reingold, Vadhan, Wee, STOC '09]. An additional advantage over previous constructions is that our pseudorandom generators are parallelizable and invoke the one-way function in a non-adaptive manner. Using [Applebaum, Ishai, Kushilevitz, SICOMP '06], this implies the existence of pseudorandom generators in NC⁰ based on the existence of one-way functions in NC¹.

Original language	English
Title of host publication	STOC'10 - Proceedings of the 2010 ACM International Symposium on Theory of Computing
Pages	437-446
Number of pages	10
DOIs	https://doi.org/10.1145/1806689.1806750
State	Published - 2010
Externally published	Yes
Event	42nd ACM Symposium on Theory of Computing, STOC 2010 - Cambridge, MA, United States Duration: 5 Jun 2010 → 8 Jun 2010

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)	0737-8017

Conference

Conference	42nd ACM Symposium on Theory of Computing, STOC 2010
Country/Territory	United States
City	Cambridge, MA
Period	5/06/10 → 8/06/10

Keywords

one-way function
pseudorandom generator
security preserving

Access to Document

10.1145/1806689.1806750

Cite this

@inproceedings{ac2b5482365d485f9a10c27ed5cd4b13,

title = "Efficiency improvements in constructing pseudorandom generators from one-way functions",

abstract = "We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of Hastad, Impagliazzo, Levin, and Luby [SICOMP '99]. The key to our construction is a new notion of next-block pseudoentropy, which is inspired by the notion of {"}inaccessible entropy{"} recently introduced in [Haitner, Reingold, Vadhan, Wee, STOC '09]. An additional advantage over previous constructions is that our pseudorandom generators are parallelizable and invoke the one-way function in a non-adaptive manner. Using [Applebaum, Ishai, Kushilevitz, SICOMP '06], this implies the existence of pseudorandom generators in NC0 based on the existence of one-way functions in NC1.",

keywords = "one-way function, pseudorandom generator, security preserving",

author = "Iftach Haitner and Omer Reingold and Salil Vadhan",

year = "2010",

doi = "10.1145/1806689.1806750",

language = "אנגלית",

isbn = "9781605588179",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

pages = "437--446",

booktitle = "STOC'10 - Proceedings of the 2010 ACM International Symposium on Theory of Computing",

note = "42nd ACM Symposium on Theory of Computing, STOC 2010 ; Conference date: 05-06-2010 Through 08-06-2010",

}

Haitner, I, Reingold, O & Vadhan, S 2010, Efficiency improvements in constructing pseudorandom generators from one-way functions. in STOC'10 - Proceedings of the 2010 ACM International Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 437-446, 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, MA, United States, 5/06/10. https://doi.org/10.1145/1806689.1806750

Efficiency improvements in constructing pseudorandom generators from one-way functions. / Haitner, Iftach; Reingold, Omer; Vadhan, Salil.
STOC'10 - Proceedings of the 2010 ACM International Symposium on Theory of Computing. 2010. p. 437-446 (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficiency improvements in constructing pseudorandom generators from one-way functions

AU - Haitner, Iftach

AU - Reingold, Omer

AU - Vadhan, Salil

PY - 2010

Y1 - 2010

N2 - We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of Hastad, Impagliazzo, Levin, and Luby [SICOMP '99]. The key to our construction is a new notion of next-block pseudoentropy, which is inspired by the notion of "inaccessible entropy" recently introduced in [Haitner, Reingold, Vadhan, Wee, STOC '09]. An additional advantage over previous constructions is that our pseudorandom generators are parallelizable and invoke the one-way function in a non-adaptive manner. Using [Applebaum, Ishai, Kushilevitz, SICOMP '06], this implies the existence of pseudorandom generators in NC0 based on the existence of one-way functions in NC1.

AB - We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of Hastad, Impagliazzo, Levin, and Luby [SICOMP '99]. The key to our construction is a new notion of next-block pseudoentropy, which is inspired by the notion of "inaccessible entropy" recently introduced in [Haitner, Reingold, Vadhan, Wee, STOC '09]. An additional advantage over previous constructions is that our pseudorandom generators are parallelizable and invoke the one-way function in a non-adaptive manner. Using [Applebaum, Ishai, Kushilevitz, SICOMP '06], this implies the existence of pseudorandom generators in NC0 based on the existence of one-way functions in NC1.

KW - one-way function

KW - pseudorandom generator

KW - security preserving

UR - http://www.scopus.com/inward/record.url?scp=77954721007&partnerID=8YFLogxK

U2 - 10.1145/1806689.1806750

DO - 10.1145/1806689.1806750

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77954721007

SN - 9781605588179

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 437

EP - 446

BT - STOC'10 - Proceedings of the 2010 ACM International Symposium on Theory of Computing

T2 - 42nd ACM Symposium on Theory of Computing, STOC 2010

Y2 - 5 June 2010 through 8 June 2010

ER -

Efficiency improvements in constructing pseudorandom generators from one-way functions

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this