Randomness in interactive proofs

Authors:
M. Bellare;O. Goldreich;S. Goldwasser
Affiliations:
Lab. for Comput. Sci., MIT, Cambridge, MA, USA;-;-
Venue:
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Year:
1990

Citing 0
Cited 4

Efficient probabilistically checkable proofs and applications to approximations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A Randomnesss-Rounds Tradeoff in Private Computation

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Recycling random bits in composed perfect zero-knowledge

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
A sample of samplers: a computational perspective on sampling

Studies in complexity and cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

The quantitative aspects of randomness in interactive proof systems are studied. The result is a randomness-efficient error-reduction technique: given an Arthur-Merlin proof system (error probability