139 search results - page 20 / 28 » Zero-Knowledge |
101
click to vote
LATINCRYPT
2010
14 years 11 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...
115
Voted
ASIACRYPT
2010
Springer
14 years 10 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...
112
Voted
ASIACRYPT
2010
Springer
14 years 10 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...
99
Voted
ASIACRYPT
2010
Springer
14 years 10 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 ...
86
Voted
PAIRING
2010
Springer
14 years 10 months ago
2010
Springer