1446 search results - page 10 / 290 » Local zero knowledge |
EUROCRYPT
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
TCC
2009
Springer
15 years 10 months ago
2009
Springer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
TCC
2010
Springer
15 years 4 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...
75
Voted
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
We suggest practical sub-linear size zero-knowledge arguments for statements involving linear algebra. Given commitments to matrices over a finite field, we give a sub-linear siz...