2576 search results - page 21 / 516 » The Complexity of Zero Knowledge |
152
click to vote
ASIACRYPT
2010
Springer
15 years 2 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...
147
click to vote
ASIACRYPT
2010
Springer
15 years 2 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...
136
click to vote
ASIACRYPT
2010
Springer
15 years 2 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 ...
129
click to vote
PROVSEC
2010
Springer
15 years 2 months ago
2010
Springer
Zero-knowledge identification schemes solve the problem of authenticating one party to another via an insecure channel without disclosing any additional information that might be u...