Results 1  10
of
21,584
On the Existance of 3Round ZeroKnowledge Proof Systems
, 2001
"... We provide a proof of knowledge assumption that allows us to construct a three round zeroknowledge proof system for any language in NP. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We provide a proof of knowledge assumption that allows us to construct a three round zeroknowledge proof system for any language in NP.
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
: 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
Definitions And Properties Of ZeroKnowledge Proof Systems
 Journal of Cryptology
, 1994
"... In this paper we investigate some properties of zeroknowledge proofs, a notion introduced by Goldwasser, Micali and Rackoff. We introduce and classify two definitions of zeroknowledge: auxiliary \Gamma input zeroknowledge and blackbox \Gamma simulation zeroknowledge. We explain why auxiliaryinp ..."
Abstract

Cited by 129 (10 self)
 Add to MetaCart
proof systems are shown to be auxiliaryinput zeroknowledge and can be used for cryptographic applications such as those in [GMW2]. We demonstrate the triviality of certain classes of zeroknowledge proof systems, in the sense that only languages in BPP have zeroknowledge proofs of these classes
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
Hybrid Commitments and Their Applications to Zeroknowledge Proof Systems
"... We introduce the notion of hybrid trapdoor commitment schemes. Intuitively an hybrid trapdoor commitment scheme is a primitive which can be either an unconditionally binding commitment scheme or a trapdoor commitment scheme depending on the distribution of commitment parameters. Moreover, such two d ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We introduce the notion of hybrid trapdoor commitment schemes. Intuitively an hybrid trapdoor commitment scheme is a primitive which can be either an unconditionally binding commitment scheme or a trapdoor commitment scheme depending on the distribution of commitment parameters. Moreover, such two distributions are computationally indistinguishable. Hybrid trapdoor commitments are related but different with respect to mixed commitments (introduced by Damg˚ard and Nielsen at Crypto 2002). In particular hybrid trapdoor commitments can either be polynomially trapdoor commitments or unconditionally binding commitments, while mixed commitment can be either trapdoor commitments or extractable commitments. In this paper we show that strong notions (e.g., simulation sound, multi trapdoor) of hybrid trapdoor commitments admit constructions based on the sole assumption that oneway functions exist as well as efficient constructions based on standard numbertheoretic assumptions. To further stress the difference between hybrid and mixed commitments, we remark here that mixed commitments seems to require stronger theoretical assumptions (and the known
Review Article A Survey of Noninteractive Zero Knowledge Proof System and Its Applications
"... Copyright © 2014 H. Wu and F. Wang.This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Zero knowledge proof system which has received ext ..."
Abstract
 Add to MetaCart
Copyright © 2014 H. Wu and F. Wang.This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Zero knowledge proof system which has received
An Efficient NonInteractive ZeroKnowledge Proof System for NP with General Assumptions
 Journal of Cryptology
, 1995
"... We consider noninteractive zeroknowledge proofs in the shared random string model proposed by Blum, Feldman and Micali [BFM88]. Until recently there was a sizable polynomial gap between the most efficient noninteractive proofs for NP based on general complexity assumptions [FLS90] versus those base ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
We consider noninteractive zeroknowledge proofs in the shared random string model proposed by Blum, Feldman and Micali [BFM88]. Until recently there was a sizable polynomial gap between the most efficient noninteractive proofs for NP based on general complexity assumptions [FLS90] versus those
Increasing the Power of the Dealer in Noninteractive ZeroKnowledge Proof Systems
 In ASIACRYPT ’00: Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security
, 2000
"... Abstract. We introduce weaker models for noninteractive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input to the protocol (i.e. the statement to prove). We show in these models a noninteractive statistical zeroknowledge proof ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
proof for every language that has (interactive) statistical zeroknowledge proof, and a computational zeroknowledge proof for every language in NP. We also show how to change the latter proof system to fit the model of noninteractive computational zeroknowledge with preprocessingto improve
Hiding Instances in ZeroKnowledge Proof Systems (Extended Abstract)
 ADVANCES IN CRYPTOLOGY  CRYPTO '90, LECTURE NOTES IN COMPUTER SCIENCE
, 1990
"... Informally speaking, an instancehiding proof system for the function f is a protocol in which a polynomialtime verifier is convinced of the value of f(x) but does not reveal the input x to the provers. We show here that a boolean function f has an instancehiding proof system if and only if it ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
if it is the characteristic function of a language in NEXP " coNEXP. We formalize the notion of zeroknowledge for instancehiding proof systems with several provers and show that all such systems can be made perfect zeroknowledge.
Private Coins versus Public Coins in ZeroKnowledge Proof Systems
"... GoldreichKrawczyk (Siam J of Comp’96) showed that only languages in BPP have constantround publiccoin blackbox zeroknowledge protocols. We extend their lower bound to “fully blackbox” privatecoin protocols based on oneway functions. More precisely, we show that only languages in BPP Sam —wh ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
—where Sam is a “collisionfinding oracle in analogy with Simon (Eurocrypt’98) and Haitner et. al (FOCS’07)—can have constantround fully blackbox zeroknowledge proofs; the same holds for constantround fully blackbox zeroknowledge arguments with sublinear verifier communication complexity. We also
Results 1  10
of
21,584