139 search results - page 20 / 28 » Zero-Knowledge |
115
click to vote
LATINCRYPT
2010
15 years 24 days 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...
134
click to vote
ASIACRYPT
2010
Springer
15 years 12 days 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...
126
click to vote
ASIACRYPT
2010
Springer
15 years 12 days 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...
113
click to vote
ASIACRYPT
2010
Springer
15 years 12 days 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 ...