Results 1  10
of
242,154
The RoundComplexity of BlackBox Concurrent ZeroKnowledge
, 2003
"... Zeroknowledge proof systems are interactive protocols that enable one party, called the prover, to convince another party, called the verifier, in the truth of a statement without revealing anything beyond the validity of the assertion being proved. Besides being fascinating on their own right, zer ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
in the era of the Internet, is one that allows the concurrent execution of zeroknowledge protocols. The most common technique for proving the zeroknowledge property of a protocol is called blackbox simulation. As it turns out, the usage of blackbox simulation in the concurrent setting introduces many
BlackBox Concurrent ZeroKnowledge Requires ~\Omega (log n) Rounds
, 2001
"... Abstract We show that any concurrent zeroknowledge protocol for a nontrivial language (i.e., for a language outside BPP), whose security is proven via blackbox simulation, must use at least ~ \Omega (log n) rounds of interaction. This result achieves a substantial improvement over previous lower ..."
Abstract
 Add to MetaCart
Abstract We show that any concurrent zeroknowledge protocol for a nontrivial language (i.e., for a language outside BPP), whose security is proven via blackbox simulation, must use at least ~ \Omega (log n) rounds of interaction. This result achieves a substantial improvement over previous lower
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
processors P1 and P2 , if P1 measures elapsed time on its local clock and P2 measures elapsed time on its local clock, and P2 starts after P1 does, then P2 will finish after P1 does. We show that if the adversary is constrained by an (; ) assumption then there exist fourround almost concurrent zeroknowledge
BlackBox Concurrent ZeroKnowledge Requires (almost) Logarithmically Many Rounds
 SIAM Journal on Computing
, 2002
"... We show that any concurrent zeroknowledge protocol for a nontrivial language (i.e., for a language outside BPP), whose security is proven via blackbox simulation, must use at least ~ \Omega\Gamma/10 n) rounds of interaction. This result achieves a substantial improvement over previous lower bound ..."
Abstract

Cited by 105 (9 self)
 Add to MetaCart
We show that any concurrent zeroknowledge protocol for a nontrivial language (i.e., for a language outside BPP), whose security is proven via blackbox simulation, must use at least ~ \Omega\Gamma/10 n) rounds of interaction. This result achieves a substantial improvement over previous lower
Resettable zeroknowledge
, 2000
"... We introduce the notion of Resettable ZeroKnowledge (rZK), a new security measure for cryptographic protocols which strengthens the classical notion of zeroknowledge. In essence, an rZK protocol is one that remains zero knowledge even if an adversary can interact with the prover many times, each ..."
Abstract

Cited by 80 (6 self)
 Add to MetaCart
complexity assumptions, which hold for example if the Discrete Logarithm Problem is hard, we construct: ffl Resettable ZeroKnowledge proofsystems for NP with nonconstant number of rounds. ffl Fiveround Resettable WitnessIndistinguishable proofsystems for NP. ffl Fourround Resettable ZeroKnowledge
On the Composition of ZeroKnowledge Proof Systems
 SIAM Journal on Computing
, 1990
"... : The wide applicability of zeroknowledge interactive proofs comes from the possibility of using these proofs as subroutines in cryptographic protocols. A basic question concerning this use is whether the (sequential and/or parallel) composition of zeroknowledge protocols is zeroknowledge too. We ..."
Abstract

Cited by 214 (15 self)
 Add to MetaCart
execution. We present lower bounds on the round complexity of zeroknowledge proofs, with significant implications to the parallelization of zeroknowledge protocols. We prove that 3round interactive proofs and constantround ArthurMerlin proofs that are blackbox simulation zeroknowledge exist only
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
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
Interleaved ZeroKnowledge
, 1999
"... We introduce the notion of Interleaved ZeroKnowledge (iZK), a new security measure for cryptographic protocols which strengthens the classical notion of zeroknowledge, in a way suitable for multiple concurrent executions in an asynchronous environment like the internet. We prove that iZK protoc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. The protocols are in the public key model: the verifier is assumed to have a public key associated with it. This implies, concurrent constantround zeroknowledge computationallysound proofs for NP in the public key model, without resorting to any timing assumptions. Analogously, we define Interleaved
Requirements for Internet Hosts  Communication Layers
 RFC1812] [RFC2277] Baker, F., "Requirements for IP Version 4 Routers", RFC 1812
, 1989
"... This RFC is an official specification for the Internet community. It incorporates by reference, amends, corrects, and supplements the primary protocol standards documents relating to hosts. Distribution of this document is unlimited. Summary This is one RFC of a pair that defines and discusses the r ..."
Abstract

Cited by 521 (6 self)
 Add to MetaCart
the requirements for Internet host software. This RFC covers the communications protocol layers: link layer, IP layer, and transport layer; its companion RFC1123 covers the application and support protocols.
Results 1  10
of
242,154