Results 1  10
of
1,031
ZeroKnowledge Proofs
, 2014
"... Zeroknowledge proofs are proofs that yield nothing beyond the validity of the assertion ..."
Abstract
 Add to MetaCart
Zeroknowledge proofs are proofs that yield nothing beyond the validity of the assertion
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
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
Handout ZeroKnowledge proofs
"... Zeroknowledge proofs are proofs that yield nothing beyond the validity of the assertion. ..."
Abstract
 Add to MetaCart
Zeroknowledge proofs are proofs that yield nothing beyond the validity of the assertion.
On the Concurrent Composition of ZeroKnowledge Proofs
 In EuroCrypt99, Springer LNCS 1592
, 1999
"... Abstract. We examine the concurrent composition of zeroknowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zeroknowledge proofs with one or multiple verifiers. Under this type of composition it is believed that standard zeroknowledge ..."
Abstract

Cited by 110 (3 self)
 Add to MetaCart
Abstract. We examine the concurrent composition of zeroknowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zeroknowledge proofs with one or multiple verifiers. Under this type of composition it is believed that standard 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
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
SuperPerfect ZeroKnowledge Proofs
, 2014
"... We initiate a study of superperfect zeroknowledge proof systems. Loosely speaking, these are proof systems for which the interaction can be perfectly simulated in strict probabilistic polynomialtime. In contrast, the standard definition of perfect zeroknowledge only requires that the interaction ..."
Abstract
 Add to MetaCart
We initiate a study of superperfect zeroknowledge proof systems. Loosely speaking, these are proof systems for which the interaction can be perfectly simulated in strict probabilistic polynomialtime. In contrast, the standard definition of perfect zeroknowledge only requires
Research on ZeroKnowledge Proof Protocol
"... Zeroknowledge proof protocol is a critical component of cryptography, which in recent years has raised increasing concern of many scholars.Its application field is very extensive,and it has made breakthrough progress in many aspects,including mathematics and network safety and so on. This article l ..."
Abstract
 Add to MetaCart
Zeroknowledge proof protocol is a critical component of cryptography, which in recent years has raised increasing concern of many scholars.Its application field is very extensive,and it has made breakthrough progress in many aspects,including mathematics and network safety and so on. This article
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
On the Concrete Complexity of ZeroKnowledge Proofs
 Journal of Cryptology
, 1990
"... The fact that there are zeroknowledge proofs for all languages in NP has, potentially, enormous implications to cryptography. For cryptographers, the issue is no longer "which languages in NP have zeroknowledge proofs" but rather "which languages in NP have practical zeroknowledge ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
The fact that there are zeroknowledge proofs for all languages in NP has, potentially, enormous implications to cryptography. For cryptographers, the issue is no longer "which languages in NP have zeroknowledge proofs" but rather "which languages in NP have practical zeroknowledge
Zeroknowledge proofs of retrievability
, 2010
"... Abstract Proof of retrievability (POR) is a technique for ensuring the integrity of data in outsourced storage services. In this paper, we address the construction of POR protocol on the standard model of interactive proof systems. We propose the first interactive POR scheme to prevent the fraudulen ..."
Abstract
 Add to MetaCart
the fraudulence of prover and the leakage of verified data. We also give full proofs of soundness and zeroknowledge properties by constructing a polynomialtime rewindable knowledge extractor under the computational DiffieHellman assumption. In particular, the verification process of this scheme requires a low
Results 1  10
of
1,031