Results 11  20
of
1,127,211
Quantum statistical zeroknowledge
 LANL quantph/0202111
, 2002
"... In this paper we propose a definition for (honest verifier) quantum statistical zeroknowledge interactive proof systems and study the resulting complexity class, which we denote QSZK. We prove several facts regarding this class: • The following natural problem is a complete promise problem for QSZK ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
proof systems can be simulated in PSPACE, even for oneround proof systems.) • Any honest verifier quantum statistical zeroknowledge proof system can be parallelized to
Achieving Constant Round LeakageResilient ZeroKnowledge
"... Recently there has been a huge emphasis on constructing cryptographic protocols that maintain their security guarantees even in the presence of side channel attacks. Such attacks exploit the physical characteristics of a cryptographic device to learn useful information about the internal state of th ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
is ⌈ n ϵ ⌉. In this work, we present the first construction of leakageresilient zeroknowledge satisfying the ideal requirement of ϵ = 0. While our focus is on a feasibility result for ϵ = 0, our construction also enjoys a constant number of rounds. At the heart of our construction is a new “public
ConstantRound Concurrent Zeroknowledge from
, 2014
"... We present a constantround concurrent zeroknowledge protocol for NP. Our protocol relies on the existence of families of collisionresistant hash functions, oneway permutations, and indistinguishability obfuscators for P/poly (with slightly superpolynomial security). ..."
Abstract
 Add to MetaCart
We present a constantround concurrent zeroknowledge protocol for NP. Our protocol relies on the existence of families of collisionresistant hash functions, oneway permutations, and indistinguishability obfuscators for P/poly (with slightly superpolynomial security).
HonestVerifier Statistical ZeroKnowledge Equals General Statistical ZeroKnowledge
 In Proceedings of the 30th Annual ACM Symposium on Theory of Computing
, 1998
"... We show how to transform any interactive proof system which is statistical zeroknowledge with respect to the honestverifier, into a proof system which is statistical zeroknowledge with respect to any verifier. This is done by limiting the behavior of potentially cheating verifiers, without using ..."
Abstract

Cited by 48 (16 self)
 Add to MetaCart
We show how to transform any interactive proof system which is statistical zeroknowledge with respect to the honestverifier, into a proof system which is statistical zeroknowledge with respect to any verifier. This is done by limiting the behavior of potentially cheating verifiers, without using
On the Existence of 3Round ZeroKnowledge Protocols
 In Crypto98, Springer LNCS 1462
, 1999
"... In this paper, we construct a 3round zeroknowledge protocol for any NP language. Our protocol achieves weaker notions of zeroknowledge than blackbox simulation zeroknowledge. Therefore, our result does not contradict the triviality result of Goldreich and Krawczyk [GoKr96] which shows that 3ro ..."
Abstract

Cited by 66 (2 self)
 Add to MetaCart
In this paper, we construct a 3round zeroknowledge protocol for any NP language. Our protocol achieves weaker notions of zeroknowledge than blackbox simulation zeroknowledge. Therefore, our result does not contradict the triviality result of Goldreich and Krawczyk [GoKr96] which shows that 3
STATISTICAL ZEROKNOWLEDGE ARGUMENTS: THEORY AND PRACTICE
, 2004
"... Abstract. During a statistical zeroknowledge argument, the arguer convinces the verifier on the truth of an assertment, without revealing next to nothing—but the truth of the assertment—even to an omnipotent verifier. The crucial part here is “next to nothing”: compared to perfect zeroknowledge ar ..."
Abstract
 Add to MetaCart
Abstract. During a statistical zeroknowledge argument, the arguer convinces the verifier on the truth of an assertment, without revealing next to nothing—but the truth of the assertment—even to an omnipotent verifier. The crucial part here is “next to nothing”: compared to perfect zeroknowledge
On the statistical analysis of dirty pictures
 JOURNAL OF THE ROYAL STATISTICAL SOCIETY B
, 1986
"... ..."
ConstantRound Perfect ZeroKnowledge Computationally Convincing Protocols
, 1991
"... A perfect zeroknowledge interactive protocol allows a prover to convince a verifier of the validity of a statement in a way that does not give the verifier any additional information [GMR,GMW]. Such protocols take place by the exchange of messages back and forth between the prover and the verifier. ..."
Abstract

Cited by 47 (5 self)
 Add to MetaCart
cheating greater than 2 \Gammak . In this paper, we give the first perfect zeroknowledge protocol that offers arbitrarily high security for any statement in NP with a constant number of rounds. The protocol is computationally convincing (rather than statistically convincing as would have been
Concurrent ZeroKnowledge in
, 2000
"... k) number of rounds. Thus, we narrow the huge gap between the known upper and lower bounds on the number of rounds required for a zeroknowledge proof that is robust for asynchronous composition. 1 Introduction Zeroknowledge proofs, presented in [19], are proofs that yield no knowledge but the vali ..."
Abstract
 Add to MetaCart
k) number of rounds. Thus, we narrow the huge gap between the known upper and lower bounds on the number of rounds required for a zeroknowledge proof that is robust for asynchronous composition. 1 Introduction Zeroknowledge proofs, presented in [19], are proofs that yield no knowledge
RoundOptimal ZeroKnowledge Arguments Based on any OneWay Function
, 1997
"... We fill a gap in the theory of zeroknowledge protocols by presenting NParguments that achieve negligible error probability and computational zeroknowledge in four rounds of interaction, assuming only the existence of a oneway function. This result is optimal in the sense that four rounds and a o ..."
Abstract

Cited by 35 (3 self)
 Add to MetaCart
We fill a gap in the theory of zeroknowledge protocols by presenting NParguments that achieve negligible error probability and computational zeroknowledge in four rounds of interaction, assuming only the existence of a oneway function. This result is optimal in the sense that four rounds and a
Results 11  20
of
1,127,211