On Relationships between Statistical Zero-Knowledge Proofs
114
TL;DR: This paper solves several fundamental open problems about statistical zero-knowledge interactive proofs (SZKIPs) and proves that the complement of L has a statisticalzero-knowledge constant (one) round interactive proof against an honest verifier.
read more
About: This article is published in Journal of Computer and System Sciences. The article was published on 01 Feb 2000. and is currently open access. The article focuses on the topics: Interactive proof system & Proof of knowledge.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On best-possible obfuscation
Shafi Goldwasser,Guy N. Rothblum +1 more
- 21 Feb 2007
TL;DR: This work shows a natural obfuscation task that can be achieved under the best-possible definition, but cannot be achieve under the black-box definition, and shows that strong (information-theoretic) best-Possible obfuscation implies a collapse in the polynomial hierarchy.
277
On the Limits of Nonapproximability of Lattice Problems
Oded Goldreich,Shafi Goldwasser +1 more
- 01 Jun 2000
TL;DR: Simple constant-round interactive proof systems for problems capturing the approximability, to within a factor of n, of optimization problems in integer lattices, specifically, the closest vectors problem (CVP) and the shortest vector problem (SVP) are shown.
204
New Limits to Classical and Quantum Instance Compression
TL;DR: Given an instance of a hard decision problem, a limited goal is to compress that instance into a smaller, equivalent instances of a second problem.
181
Limits on the power of quantum statistical zero-knowledge
John Watrous
- 16 Nov 2002
TL;DR: A definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems is proposed and the resulting complexity class is studied, which is denote QSZK/sub HV/.
On promise problems: a survey
TL;DR: This article surveys some of the applications that this notion of promise problems has found in the twenty years that elapsed, including the notion of “unique solutions”, the formulation of "gap problems" as capturing various approximation tasks, the identification of complete problems, and the enabling of presentations that better distill the essence of various proofs.
154
References
Probability Inequalities for sums of Bounded Random Variables
TL;DR: In this article, upper bounds for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt are derived for certain sums of dependent random variables such as U statistics.
The knowledge complexity of interactive proof systems
TL;DR: A computational complexity theory of the “knowledge” contained in a proof is developed and examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity.
A hard-core predicate for all one-way functions
Oded Goldreich,Leonid A. Levin +1 more
- 01 Feb 1989
TL;DR: This paper proves a conjecture of [Levin 87, sec. 5.6.2] that the scalar product of Boolean vectors p, g, x is a hard-core of every one-way function ƒ, and extends to multiple (up to the logarithm of security) such bits and to any distribution on the x .
1.5K
Minimum disclosure proofs of knowledge
Gilles Brassard,David Chaum,Claude Crépeau +2 more
- 01 Oct 1988
TL;DR: In this article, the authors present protocols for allowing a "prover" to convince a "verifier" that the prover knows some verifiable secret information, without allowing the verifier to learn anything about the secret.
1.1K
Trading group theory for randomness
László Babai
- 01 Dec 1985
TL;DR: The aim of this paper is to replace most of the (proven and unproven) group theory of [BS] by elementary combinatorial arguments and defines a new hierarchy of complexity classes “just above NP
1K