Pseudorandomness for network algorithms

Russell Impagliazzo; Noam Nisan; Avi Wigderson

doi:10.1145/195058.195190

Pseudorandomness for network algorithms

Russell Impagliazzo, Noam Nisan, Avi Wigderson

The Rachel and Selim Benin School of Engineering and Computer Science

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

169 Scopus citations

Abstract

We define pseudorandom generators for Yao's two party communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive composition of such generators to obtain pseudorandom generators that fool distributed network algorithms. While the construction and the proofs are simple, we demonstrate the generality of such generators by giving several applications.

Original language	English
Title of host publication	Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994
Publisher	Association for Computing Machinery
Pages	356-364
Number of pages	9
ISBN (Electronic)	0897916638
DOIs	https://doi.org/10.1145/195058.195190
State	Published - 23 May 1994
Event	26th Annual ACM Symposium on Theory of Computing, STOC 1994 - Montreal, Canada Duration: 23 May 1994 → 25 May 1994

Publication series

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

Conference

Conference	26th Annual ACM Symposium on Theory of Computing, STOC 1994
Country/Territory	Canada
City	Montreal
Period	23/05/94 → 25/05/94

Bibliographical note

Publisher Copyright:
© 1994 ACM.

Access to Document

10.1145/195058.195190

Cite this

@inproceedings{1d22e2ed152643f099cb824a4f029e5f,

title = "Pseudorandomness for network algorithms",

abstract = "We define pseudorandom generators for Yao's two party communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive composition of such generators to obtain pseudorandom generators that fool distributed network algorithms. While the construction and the proofs are simple, we demonstrate the generality of such generators by giving several applications.",

author = "Russell Impagliazzo and Noam Nisan and Avi Wigderson",

note = "Publisher Copyright: {\textcopyright} 1994 ACM.; 26th Annual ACM Symposium on Theory of Computing, STOC 1994 ; Conference date: 23-05-1994 Through 25-05-1994",

year = "1994",

month = may,

day = "23",

doi = "10.1145/195058.195190",

language = "אנגלית",

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

publisher = "Association for Computing Machinery",

pages = "356--364",

booktitle = "Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994",

}

Impagliazzo, R, Nisan, N & Wigderson, A 1994, Pseudorandomness for network algorithms. in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F129502, Association for Computing Machinery, pp. 356-364, 26th Annual ACM Symposium on Theory of Computing, STOC 1994, Montreal, Canada, 23/05/94. https://doi.org/10.1145/195058.195190

Pseudorandomness for network algorithms. / Impagliazzo, Russell; Nisan, Noam; Wigderson, Avi.
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994. Association for Computing Machinery, 1994. p. 356-364 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129502).

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

TY - GEN

T1 - Pseudorandomness for network algorithms

AU - Impagliazzo, Russell

AU - Nisan, Noam

AU - Wigderson, Avi

PY - 1994/5/23

Y1 - 1994/5/23

N2 - We define pseudorandom generators for Yao's two party communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive composition of such generators to obtain pseudorandom generators that fool distributed network algorithms. While the construction and the proofs are simple, we demonstrate the generality of such generators by giving several applications.

AB - We define pseudorandom generators for Yao's two party communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive composition of such generators to obtain pseudorandom generators that fool distributed network algorithms. While the construction and the proofs are simple, we demonstrate the generality of such generators by giving several applications.

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

U2 - 10.1145/195058.195190

DO - 10.1145/195058.195190

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

AN - SCOPUS:0028022375

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

SP - 356

EP - 364

BT - Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994

PB - Association for Computing Machinery

T2 - 26th Annual ACM Symposium on Theory of Computing, STOC 1994

Y2 - 23 May 1994 through 25 May 1994

ER -

Pseudorandomness for network algorithms

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this