Results 1  10
of
131,507
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
Practical and ProvablySecure Commitment Schemes from CollisionFree Hashing
 in Advances in Cryptology  CRYPTO96, Lecture Notes in Computer Science 1109
, 1996
"... . We present a very practical stringcommitment scheme which is provably secure based solely on collisionfree hashing. Our scheme enables a computationally bounded party to commit strings to an unbounded one, and is optimal (within a small constant factor) in terms of interaction, communication, a ..."
Abstract

Cited by 77 (5 self)
 Add to MetaCart
, and computation. Our result also proves that constant round statistical zeroknowledge arguments and constantround computational zeroknowledge proofs for NP exist based on the existence of collisionfree hash functions. 1 Introduction String commitment is a fundamental primitive for cryptographic protocols. A
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).
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 44 (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
On ConstantRound Concurrent ZeroKnowledge
"... 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 answer t ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
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 answer
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
, for any constant ε> 0, because the total length of the leakage the simulator needs is (1 + ε) times as large as that of the leakage received by the verifier. In recent, Pandey provides a constantround leakageresilient zeroknowledge argument satisfying the ideal requirement of ε = 0. Whether
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 162 (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 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 208 (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
On the (Im)Plausibility of ConstantRound PublicCoin StraightLineSimulatable ZeroKnowledge Proofs
"... Abstract. In 2001, a breakthrough result by Barak [FOCS 2001] showed how to achieve publiccoin zeroknowledge (ZK) arguments in constant rounds, a feature known to be impossible using blackbox simulation. In this approach, the simulator makes use of the code of the malicious verifier in computing ..."
Abstract
 Add to MetaCart
Abstract. In 2001, a breakthrough result by Barak [FOCS 2001] showed how to achieve publiccoin zeroknowledge (ZK) arguments in constant rounds, a feature known to be impossible using blackbox simulation. In this approach, the simulator makes use of the code of the malicious verifier in computing
The knowledge complexity of interactive proof systems

, 1989
"... Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/nonHamiltonian. In th ..."
Abstract

Cited by 1246 (39 self)
 Add to MetaCart
/nonHamiltonian. In this paper a computational complexity theory of the "knowledge " contained in a proof is developed. Zeroknowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zeroknowledge proof systems are given
Results 1  10
of
131,507