8 search results - page 1 / 2 » On the Composition of Public-Coin Zero-Knowledge Protocols |
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
TCC
2010
Springer
14 years 1 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
IACR
2011
12 years 4 months ago
2011
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
SIAMCOMP
2008
13 years 3 months ago
2008
We investigate structural properties of interactive perfect zero-knowledge (PZK) proofs. Specifically, we look into the closure properties of PZK languages under monotone boolean ...
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
We examine the concurrent composition of zero-knowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zero-knowledge pro...