Randomness and computation

Oded Goldreich

doi:10.1007/978-3-642-22670-0_33

Randomness and computation

Oded Goldreich

Department of Computer Science and Applied Mathematics

Weizmann Institute of Science

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

Abstract

The interplay of randomness and computation is at the heart of modern Cryptography and plays a fundamental role in the design of algorithms and in the study of computation at large. Specifically, this interplay is pivotal to several intriguing notions of probabilistic proof systems (e.g., interactive proofs, zero-knowledge proofs, and probabilistically checkable proofs), is the focal of the computational approach to randomness, and is essential for some types of sub-linear time algorithms (e.g., property testers). This essay provides a brief outline of these connections.

Original language	English
Title of host publication	Studies in Complexity and Cryptography
Subtitle of host publication	Miscellanea on the Interplay between Randomness and Computation
Editors	Oded Goldreich
Chapter	33
Pages	507-539
Number of pages	33
DOIs	https://doi.org/10.1007/978-3-642-22670-0_33
State	Published - 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6650 LNCS

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-22670-0_33

Cite this

Goldreich, O. (2011). Randomness and computation. In O. Goldreich (Ed.), Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation (pp. 507-539). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6650 LNCS). https://doi.org/10.1007/978-3-642-22670-0_33

@inbook{bf4d0d2434654e649e2d72bb1ebc8233,

title = "Randomness and computation",

abstract = "The interplay of randomness and computation is at the heart of modern Cryptography and plays a fundamental role in the design of algorithms and in the study of computation at large. Specifically, this interplay is pivotal to several intriguing notions of probabilistic proof systems (e.g., interactive proofs, zero-knowledge proofs, and probabilistically checkable proofs), is the focal of the computational approach to randomness, and is essential for some types of sub-linear time algorithms (e.g., property testers). This essay provides a brief outline of these connections.",

author = "Oded Goldreich",

note = "I am grateful to Tamas Rudas for his comments on early versions of this essay",

year = "2011",

doi = "10.1007/978-3-642-22670-0_33",

language = "الإنجليزيّة",

isbn = "9783642226694",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "507--539",

editor = "Oded Goldreich",

booktitle = "Studies in Complexity and Cryptography",

}

Goldreich, O 2011, Randomness and computation. in O Goldreich (ed.), Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6650 LNCS, pp. 507-539. https://doi.org/10.1007/978-3-642-22670-0_33

Randomness and computation. / Goldreich, Oded.
Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. ed. / Oded Goldreich. 2011. p. 507-539 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6650 LNCS).

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

TY - CHAP

T1 - Randomness and computation

AU - Goldreich, Oded

N1 - I am grateful to Tamas Rudas for his comments on early versions of this essay

PY - 2011

Y1 - 2011

N2 - The interplay of randomness and computation is at the heart of modern Cryptography and plays a fundamental role in the design of algorithms and in the study of computation at large. Specifically, this interplay is pivotal to several intriguing notions of probabilistic proof systems (e.g., interactive proofs, zero-knowledge proofs, and probabilistically checkable proofs), is the focal of the computational approach to randomness, and is essential for some types of sub-linear time algorithms (e.g., property testers). This essay provides a brief outline of these connections.

AB - The interplay of randomness and computation is at the heart of modern Cryptography and plays a fundamental role in the design of algorithms and in the study of computation at large. Specifically, this interplay is pivotal to several intriguing notions of probabilistic proof systems (e.g., interactive proofs, zero-knowledge proofs, and probabilistically checkable proofs), is the focal of the computational approach to randomness, and is essential for some types of sub-linear time algorithms (e.g., property testers). This essay provides a brief outline of these connections.

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

U2 - 10.1007/978-3-642-22670-0_33

DO - 10.1007/978-3-642-22670-0_33

M3 - فصل

SN - 9783642226694

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 507

EP - 539

BT - Studies in Complexity and Cryptography

A2 - Goldreich, Oded

ER -

Randomness and computation

Abstract

Publication series

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this