34 search results - page 2 / 7 » A Complete Problem for Statistical Zero Knowledge |
LATINCRYPT
2010
13 years 4 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...
EUROCRYPT
2006
Springer
13 years 10 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
EUROCRYPT
2007
Springer
14 years 11 days 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...
TCC
2010
Springer
14 years 1 months ago
2010
Springer
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
SDM
2008
SIAM
13 years 7 months ago
2008
SIAM
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...