2576 search results - page 2 / 516 » The Complexity of Zero Knowledge |
ASIACRYPT
2003
Springer
13 years 10 months ago
2003
Springer
FSTTCS
2007
Springer
13 years 9 months ago
2007
Springer
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
CRYPTO
2005
Springer
13 years 11 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]....
EUROCRYPT
2008
Springer
13 years 7 months ago
2008
Springer
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...