Results 1  10
of
804,174
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
: 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
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 216 (19 self)
 Add to MetaCart
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
Improved Zeroknowledge Proofs of Knowledge for the ISIS Problem, and Applications
"... Abstract. In all existing efficient proofs of knowledge of a solution to the infinity norm Inhomogeneous Small Integer Solution (ISIS ∞ ) problem, the knowledge extractor outputs a solution vector that is only guaranteed to be Õ(n) times longer than the witness possessed by the prover. As a conseque ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
consequence, in many cryptographic schemes that use these proof systems as building blocks, there exists a gap between the hardness of solving the underlying ISIS ∞ problem and the hardness underlying the security reductions. In this paper, we generalize Stern’s protocol to obtain two statistical zeroknowledge
ZeroKnowledge Proofs and Applications
"... The material below covers two lectures on the beautiful and influential concept of zeroknowledge proofs. This notion, introduced by Goldwasser, Micali and Rackoff [GMR85] formalizes the idea of a proof that “yields nothing but its validity”.1 We will start by describing a simple running example, w ..."
Abstract
 Add to MetaCart
, which will allow us to abstract away some basic properties. This will lead to the concept of Σprotocols, and their application to construct secure identification schemes. Next, we will move to cryptographic applications. In particular we will show how to use zeroknowledge proofs to construct efficient
ZeroKnowledge Proofs and Arguments
, 1996
"... Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS ..."
Abstract
 Add to MetaCart
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS
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
Minimum Resource ZeroKnowledge Proofs
 In 30th Annual Symposium on Foundations of Computer Science
, 1989
"... ) Joe Kilian Silvio Micali y Rafail Ostrovsky z Abstract We consider several resources relating to zeroknowledge protocols: The number of envelopes used in the protocol, the number of oblivious transfers protocols executed during the protocol, and the total amount of communication required by ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
theorem is less then 1 2 k . 1 Minimizing Envelopes 1.1 Envelopes as a resource. [GMR] puts forward the somewhat paradoxical notion of a zeroknowledge proof, and exemplifies it for a few special classes of assertions. The introduction of ideal commitment mechanisms, known as envelopes, allows us
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
The Knowledge Level
 In International Conference on Software Engineering
, 1982
"... The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying of this document without permission of its author may be prohibited by law. ..."
Abstract

Cited by 871 (1 self)
 Add to MetaCart
The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying of this document without permission of its author may be prohibited by law.
Alternative Variants of ZeroKnowledge Proofs
, 2004
"... Zeroknowledge proofs are one of the most important cryptographic notions. Since their introduction in the early 80's by Goldwasser, Micali and Racko, they have proven very useful in the design of cryptographic protocols. Nevertheless, many limitations (in terms of e ciency and robustness under ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Zeroknowledge proofs are one of the most important cryptographic notions. Since their introduction in the early 80's by Goldwasser, Micali and Racko, they have proven very useful in the design of cryptographic protocols. Nevertheless, many limitations (in terms of e ciency and robustness
Results 1  10
of
804,174