16 search results - page 1 / 4 » Perfect Zero-Knowledge in Constant Rounds |
STOC
1990
ACM
13 years 8 months ago
1990
ACM
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
CRYPTO
2004
Springer
13 years 9 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
2011
Springer
12 years 4 months ago
2011
Springer
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
ASIACRYPT
2001
Springer
13 years 8 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...
ASIACRYPT
2000
Springer
13 years 8 months ago
2000
Springer
In this paper, we investigate the gap between auxiliary-input zero-knowledge (AIZK) and blackbox-simulation zero-knowledge (BSZK). It is an interesting open problem whether or not ...