54 search results - page 1 / 11 » On the Concurrent Composition of Zero-Knowledge Proofs |
EUROCRYPT
1999
Springer
13 years 11 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...
CRYPTO
2009
Springer
14 years 2 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...
CRYPTO
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
TARK
2009
Springer
14 years 2 months ago
2009
Springer
Halpern, Moses and Tuttle presented a definition of interactive proofs using a notion they called practical knowledge, but left open the question of finding an epistemic formula...
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
