Results 1  10
of
959
An unconditional study of computational zero knowledge
 SIAM Journal on Computing
, 2004
"... We prove a number of general theorems about ZK, the class of problems possessing (computational) zeroknowledge proofs. Our results are unconditional, in contrast to most previous works on ZK, which rely on the assumption that oneway functions exist. We establish several new characterizations of ZK ..."
Abstract

Cited by 31 (8 self)
 Add to MetaCart
We prove a number of general theorems about ZK, the class of problems possessing (computational) zeroknowledge proofs. Our results are unconditional, in contrast to most previous works on ZK, which rely on the assumption that oneway functions exist. We establish several new characterizations
An Unconditional Study of Computational Zero Knowledge
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 56
, 2006
"... We prove a number of general theorems about ZK, the class of problems possessing (computational) zeroknowledge proofs. Our results are unconditional, in contrast to most previous works on ZK, which rely on the assumption that oneway functions exist. We establish several new characterizations of ZK ..."
Abstract
 Add to MetaCart
We prove a number of general theorems about ZK, the class of problems possessing (computational) zeroknowledge proofs. Our results are unconditional, in contrast to most previous works on ZK, which rely on the assumption that oneway functions exist. We establish several new characterizations
BlackBox Computational ZeroKnowledge Proofs, Revisited: The SimulationExtraction Paradigm
"... The concept of zeroknowledge proofs has been around for about 25 years. It has been redefined over and over to suit the special security requirements of protocols and systems. Common among all definitions is the requirement of the existence of some efficient “device ” simulating the view of the v ..."
Abstract
 Add to MetaCart
the definition of “blackbox computational ” zeroknowledge, in which there exists one simulator for all verifiers, the simulator has blackbox access to the verifier, and the quality of simulation is such that the real and simulated views cannot be distinguished by polynomial tests (computational
2010 International Conference on Advances in Communication, Network, and Computing Zeroknowledge Software Watermarking for C Programs
"... Abstract—This paper proposes a novel method for watermarking C source code by exploiting the programming language features.The key idea of our watermarking scheme is a semanticspreserving program transformation, based on a hidden permutation of local identifiers, followed by another hidden permutat ..."
Abstract
 Add to MetaCart
permutation of the functions defined in the source code. This last permutation allows to encrypt the prove of ownership, in the framework of interactive zeroknowledge proof system. The proposed watermarking scheme is invisible to compilers and does not reveal any information about the watermark, its nature
HonestVerifier Statistical ZeroKnowledge Equals General Statistical ZeroKnowledge
 In Proceedings of the 30th Annual ACM Symposium on Theory of Computing
, 1998
"... We show how to transform any interactive proof system which is statistical zeroknowledge with respect to the honestverifier, into a proof system which is statistical zeroknowledge with respect to any verifier. This is done by limiting the behavior of potentially cheating verifiers, without using ..."
Abstract

Cited by 49 (15 self)
 Add to MetaCart
Merlin) computational zeroknowledge proofs: We transform any ArthurMerlin proof system which is computational zeroknowledge with respect to the honestverifier, into an ArthurMerlin proof systemwhich is computational zeroknowledgewith respect to any probabilistic polynomialtime verifier. A crucial ingredient
General properties of quantum zeroknowledge proofs
 In Proceedings of the Fifth IACR Theory of Cryptography Conference
, 2008
"... This paper studies the complexity classes QZK and HVQZK, the classes of problems having a quantum computational zeroknowledge proof system and an honestverifier quantum computational zeroknowledge proof system, respectively. The results proved in this paper include: • HVQZK = QZK. • Any problem i ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper studies the complexity classes QZK and HVQZK, the classes of problems having a quantum computational zeroknowledge proof system and an honestverifier quantum computational zeroknowledge proof system, respectively. The results proved in this paper include: • HVQZK = QZK. • Any problem
Noninteractive ZeroKnowledge
 SIAM J. COMPUTING
, 1991
"... This paper investigates the possibility of disposing of interaction between prover and verifier in a zeroknowledge proof if they share beforehand a short random string. Without any assumption, it is proven that noninteractive zeroknowledge proofs exist for some numbertheoretic languages for which ..."
Abstract

Cited by 214 (18 self)
 Add to MetaCart
for which no efficient algorithm is known. If deciding quadratic residuosity (modulo composite integers whose factorization is not known) is computationally hard, it is shown that the NPcomplete language of satisfiability also possesses noninteractive zeroknowledge proofs.
Noninteractive statistical zeroknowledge proofs for . . .
, 2008
"... We construct noninteractive statistical zeroknowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors problem and the complement of the shortest vector problem. Prior proof systems for lattice problems were either interact ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
We construct noninteractive statistical zeroknowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors problem and the complement of the shortest vector problem. Prior proof systems for lattice problems were either
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
A Complete Promise Problem for Statistical ZeroKnowledge
 In Proceedings of the 38th Annual Symposium on the Foundations of Computer Science
, 1997
"... We present a complete promise problem for SZK, the class of languages possessing statistical zeroknowledge proofs (against an honest verifier). The problem is to decide whether two efficiently samplable distributions are either statistically close or far apart. This characterizes SZK with no refer ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
with no reference to interaction or zeroknowledge. From this theorem and its proof, we are able to establish several other results about SZK, knowledge complexity, and efficiently samplable distributions. 1 Introduction A revolution in theoretical computer science occurred when it was discovered that NP has
Results 1  10
of
959