60 search results - page 7 / 12 » Zero knowledge with efficient provers |
TCC
2010
Springer
14 years 7 months ago
2010
Springer
TCC
2010
Springer
14 years 7 months ago
2010
Springer
CRYPTO
1994
Springer
15 years 1 months ago
1994
Springer
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
81
Voted
ASIACRYPT
2010
Springer
14 years 7 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
SDM
2008
SIAM
14 years 11 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...