2576 search results - page 4 / 516 » The Complexity of Zero Knowledge |
100
click to vote
TCC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We introduce Fair Zero-Knowledge, a multi-verifier ZK system where every proof is guaranteed to be “zero-knowledge for all verifiers.” That is, if an honest verifi...
226
click to vote
CRYPTO
2004
Springer
15 years 7 months ago
2004
Springer
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...
127
click to vote
EUROCRYPT
2007
Springer
15 years 7 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...
115
click to vote
CRYPTO
2008
Springer
15 years 3 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
143
click to vote
IACR
2011
14 years 1 months ago
2011
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...