Results 1  10
of
140,390
Concurrent ZeroKnowledge
 IN 30TH STOC
, 1999
"... Concurrent executions of a zeroknowledge protocol by a single prover (with one or more verifiers) may leak information and may not be zeroknowledge in toto. In this paper, we study the problem of maintaining zeroknowledge We introduce the notion of an (; ) timing constraint: for any two proces ..."
Abstract

Cited by 177 (18 self)
 Add to MetaCart
Concurrent executions of a zeroknowledge protocol by a single prover (with one or more verifiers) may leak information and may not be zeroknowledge in toto. In this paper, we study the problem of maintaining zeroknowledge We introduce the notion of an (; ) timing constraint: for any two
Precise Concurrent Zero Knowledge
"... Precise zero knowledge introduced by Micali and Pass (STOC’06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed to worstcase) time spent by V in the generated view. We provide the first constructions of precise concurrent zeroknowledge pr ..."
Abstract
 Add to MetaCart
Precise zero knowledge introduced by Micali and Pass (STOC’06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed to worstcase) time spent by V in the generated view. We provide the first constructions of precise concurrent zeroknowledge
Concurrent Zero Knowledge, Revisited
, 2013
"... We provide a more general and, in our eyes, simpler variant of Prabhakaran, Rosen and Sahai’s (FOCS ’02) analysis of the concurrent zeroknowledge simulation technique of Kilian and Petrank (STOC ’01). ..."
Abstract
 Add to MetaCart
We provide a more general and, in our eyes, simpler variant of Prabhakaran, Rosen and Sahai’s (FOCS ’02) analysis of the concurrent zeroknowledge simulation technique of Kilian and Petrank (STOC ’01).
Concurrent ZeroKnowledge Proofs for NP
, 2001
"... A proof is concurrent zeroknowledge if it remains zeroknowledge when many copies of the proof are run in an asynchronous environment, such as the Internet. It is known that zeroknowledge is not necessarily preserved in such an environment [26, 31, 5]. Designing concurrent zeroknowledge proofs ..."
Abstract
 Add to MetaCart
A proof is concurrent zeroknowledge if it remains zeroknowledge when many copies of the proof are run in an asynchronous environment, such as the Internet. It is known that zeroknowledge is not necessarily preserved in such an environment [26, 31, 5]. Designing concurrent zeroknowledge proofs
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
On Concurrent ZeroKnowledge with PreProcessing
 Proceedings of Advances in Cryptology (CRYPT099
, 1999
"... Abstract. Concurrent ZeroKnowledge protocols remain zeroknowledge even when many sessions of them are executed together. These protocols have applications in a distributed setting, where many executions of the same protocol must take place at the same time by many parties, such as the Internet. In ..."
Abstract

Cited by 40 (4 self)
 Add to MetaCart
Abstract. Concurrent ZeroKnowledge protocols remain zeroknowledge even when many sessions of them are executed together. These protocols have applications in a distributed setting, where many executions of the same protocol must take place at the same time by many parties, such as the Internet
On ConstantRound Concurrent ZeroKnowledge
"... Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient ” verifier can be “efficiently” simulated. An outstanding open question regarding zeroknowledge is whether constantround concurrent zeroknowledge proofs exists for nontrivial languages. We ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient ” verifier can be “efficiently” simulated. An outstanding open question regarding zeroknowledge is whether constantround concurrent zeroknowledge proofs exists for nontrivial languages
Concurrent ZeroKnowledge is Easy in Practice
, 1999
"... We show that if any oneway function exists, then 3round concurrent zeroknowledge arguments for all NP problems can be built in a model where a short auxiliary string with a prescribed distribution is available to the players. We also show that all known efficient identification schemes using spec ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We show that if any oneway function exists, then 3round concurrent zeroknowledge arguments for all NP problems can be built in a model where a short auxiliary string with a prescribed distribution is available to the players. We also show that all known efficient identification schemes using
A note on the roundcomplexity of Concurrent ZeroKnowledge
 In Crypto2000, Springer LNCS 1880
, 2000
"... Abstract. We present a lower bound on the number of rounds required by Concurrent ZeroKnowledge proofs for languages in N P. It is shown that in the context of Concurrent ZeroKnowledge, at least eight rounds of interaction are essential for blackbox simulation of nontrivial proof systems (i.e., ..."
Abstract

Cited by 42 (4 self)
 Add to MetaCart
Abstract. We present a lower bound on the number of rounds required by Concurrent ZeroKnowledge proofs for languages in N P. It is shown that in the context of Concurrent ZeroKnowledge, at least eight rounds of interaction are essential for blackbox simulation of nontrivial proof systems (i
Concurrent ZeroKnowledge: Reducing the Need for Timing Constraints
 In Crypto98, Springer LNCS 1462
, 1998
"... Abstract. An interactive proof system (or argument) (P, V)isconcurrent zeroknowledge if whenever the prover engages in polynomially many concurrent executions of (P, V), with (possibly distinct) colluding polynomial time bounded verifiers V1,...,Vpoly(n), the entire undertaking is zeroknowledge. D ..."
Abstract

Cited by 54 (6 self)
 Add to MetaCart
Abstract. An interactive proof system (or argument) (P, V)isconcurrent zeroknowledge if whenever the prover engages in polynomially many concurrent executions of (P, V), with (possibly distinct) colluding polynomial time bounded verifiers V1,...,Vpoly(n), the entire undertaking is zeroknowledge
Results 1  10
of
140,390