2576 search results - page 2 / 516 » The Complexity of Zero Knowledge |
ASIACRYPT
2003
Springer
15 years 2 months ago
2003
Springer
69
Voted
FSTTCS
2007
Springer
15 years 1 months ago
2007
Springer
FOCS
2002
IEEE
15 years 2 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...
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]....
110
click to vote
EUROCRYPT
2008
Springer
14 years 11 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...