139 search results - page 20 / 28 » Zero-Knowledge |
LATINCRYPT
2010
13 years 5 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 5 months ago
2010
Springer
We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is exp...
ASIACRYPT
2010
Springer
13 years 5 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...
ASIACRYPT
2010
Springer
13 years 5 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 ...
PAIRING
2010
Springer
13 years 5 months ago
2010
Springer