2576 search results - page 1 / 516 » The Complexity of Zero Knowledge |
112
click to vote
CRYPTO
2000
Springer
15 years 4 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...
PROVSEC
2007
Springer
15 years 5 months ago
2007
Springer
ASIACRYPT
2001
Springer
15 years 4 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...
107
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
LATINCRYPT
2010
14 years 10 months ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...