152 search results - page 6 / 31 » Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use |
85
Voted
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...
106
Voted
ECCC
2006
14 years 9 months ago
2006
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
111
click to vote
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
EUROCRYPT
2007
Springer
15 years 3 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
81
Voted
ECCC
2000
14 years 9 months ago
2000
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...