9 search results - page 2 / 2 » Responsive Round Complexity and Concurrent Zero-Knowledge |
146
click to vote
EUROCRYPT
1999
Springer
15 years 7 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...
122
click to vote
ASIACRYPT
2004
Springer
15 years 8 months ago
2004
Springer
In the bare public-key model, introduced by Canetti et al. [STOC 2000], it is only assumed that each verifier deposits during a setup phase a public key in a file accessible by a...
113
click to vote
TCC
2010
Springer
15 years 12 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...
125
click to vote
EUROCRYPT
2003
Springer
15 years 8 months ago
2003
Springer
A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and ...