Results 1  10
of
401,170
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
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).
How to Construct ConstantRound ZeroKnowledge Proof Systems for NP
 Journal of Cryptology
, 1995
"... Constantround zeroknowledge proof systems for every language in NP are presented, assuming the existence of a collection of clawfree functions. In particular, it follows that such proof systems exist assuming the intractability of either the Discrete Logarithm Problem or the Factoring Problem for ..."
Abstract

Cited by 169 (8 self)
 Add to MetaCart
Constantround zeroknowledge proof systems for every language in NP are presented, assuming the existence of a collection of clawfree functions. In particular, it follows that such proof systems exist assuming the intractability of either the Discrete Logarithm Problem or the Factoring Problem
On ConstantRound Concurrent ZeroKnowledge from a Knowledge Assumption
, 2012
"... In this work, we consider the longstanding open question of constructing constantround concurrent zeroknowledge protocols in the plain model. Resolving this question is known to require nonblackbox techniques. We consider nonblackbox techniques for zeroknowledge based on knowledge assumption ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this work, we consider the longstanding open question of constructing constantround concurrent zeroknowledge protocols in the plain model. Resolving this question is known to require nonblackbox techniques. We consider nonblackbox techniques for zeroknowledge based on knowledge
A Note on ConstantRound ZeroKnowledge Proofs for NP
 In Proceedings of the 1st Theory of Cryptography Conference
, 2004
"... We consider the problem of constructing a constantround zeroknowledge proof system for all languages in NP. This problem has been previously addressed by Goldreich and Kahan (Jour. of Cryptology, 1996). Following recent works on concurrent zeroknowledge, we propose an alternative solution tha ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We consider the problem of constructing a constantround zeroknowledge proof system for all languages in NP. This problem has been previously addressed by Goldreich and Kahan (Jour. of Cryptology, 1996). Following recent works on concurrent zeroknowledge, we propose an alternative solution
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
ConstantRound LeakageResilient ZeroKnowledge Arguments of Knowledge for NP
"... Abstract. Garg, Jain, and Sahai first consider zero knowledge proofs in the presence of leakage on the local state of the prover, and present a leakageresilientzeroknowledge proof system for HC (Hamiltonian Cycle) problem. Their construction is called (1 + ε)leakageresilient zeroknowledge, for ..."
Abstract
 Add to MetaCart
there exist constant round leakageresilient zeroknowledge arguments of knowledge for all NP languages is an interesting problem. This paper focuses on this problem and presents a constantround construction of leakageresilient zeroknowledge arguments of knowledge for the HC problem. Key word: zeroknowledge
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
is a fundamental issue in the study of zeroknowledge since known zeroknowledge protocols cannot be run in a realistic modern computing environment. In this paper we rst show that there exists a concurrent zeroknowledge proof system for all languages in NP. Our proof system is the rst zeroknowledge
A Note on ConstantRound ZeroKnowledge Proofs of Knowledge ∗
, 2011
"... In this note, we show the existence of constantround computational zeroknowledge proofs of knowledge for all N P. The existence of constantround zeroknowledge proofs was proven by Goldreich and Kahan (Journal of Cryptology, 1996), and the existence of constantround zeroknowledge arguments of kn ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this note, we show the existence of constantround computational zeroknowledge proofs of knowledge for all N P. The existence of constantround zeroknowledge proofs was proven by Goldreich and Kahan (Journal of Cryptology, 1996), and the existence of constantround zeroknowledge arguments
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
interactive proofs and perfect concurrent zeroknowledge arguments for every language in NP . We also address the more specific problem of Deniable Authentication, for which we propose several particularly efficient solutions. Deniable Authentication is of independent interest, even in the sequential case
Results 1  10
of
401,170