How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
How to construct random functions
Journal of the ACM (JACM)
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Journal of the ACM (JACM)
Elements of information theory
Elements of information theory
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
Randomized algorithms
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
P, NP, and NP-Completeness: The Basics of Computational Complexity
P, NP, and NP-Completeness: The Basics of Computational Complexity
A brief introduction to property testing
Studies in complexity and cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
Hi-index | 0.00 |
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.