22 search results - page 2 / 5 » Zero Knowledge and Soundness Are Symmetric |
EUROCRYPT
2003
Springer
13 years 10 months ago
2003
Springer
A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and ...
ASIACRYPT
2010
Springer
13 years 3 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 ...
LATINCRYPT
2010
13 years 3 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...
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
We show that probabilistically checkable proofs can be used to shorten non-interactive zero-knowledge proofs. We obtain publicly verifiable non-interactive zero-knowledge proofs fo...
TCC
2009
Springer
14 years 5 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...