54 search results - page 3 / 11 » On the Concurrent Composition of Zero-Knowledge Proofs |
SIAMCOMP
2008
14 years 8 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
2000
Springer
15 years 1 months ago
2000
Springer
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
TCC
2010
Springer
15 years 6 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...
ASIACRYPT
2001
Springer
15 years 2 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
91
Voted
CRYPTO
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we continue the study the round complexity of black-box zero knowledge in the bare public-key (BPK, for short) model previously started by Micali and Reyzin in [11]....