1446 search results - page 15 / 290 » Local zero knowledge |
173
click to vote
FOCS
2002
IEEE
15 years 10 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,...
160
Voted
EUROCRYPT
2001
Springer
15 years 10 months ago
2001
Springer
In STOC 2000, Canetti, Goldreich, Goldwasser, and Micali put forward the strongest notion of zero-knowledge to date, resettable zero-knowledge (RZK) and implemented it in constant ...
135
click to vote
IH
2001
Springer
15 years 10 months ago
2001
Springer
The goal of zero-knowledge watermark detection is to allow a prover to soundly convince a verifier of the presence of a watermark in certain stego-data without revealing any infor...
147
click to vote
ASIACRYPT
2000
Springer
15 years 10 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 ...
198
Voted
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...