29 search results - page 2 / 6 » Concurrent Zero-Knowledge |
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
IACR
2011
12 years 4 months ago
2011
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
ASIACRYPT
2010
Springer
13 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...