2576 search results - page 21 / 516 » The Complexity of Zero Knowledge |
106
click to vote
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...
102
click to vote
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...
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 ...
PAIRING
2010
Springer
14 years 9 months ago
2010
Springer
PROVSEC
2010
Springer
14 years 9 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...