Sciweavers

STOC
1998
ACM
105views Algorithms» more  STOC 1998»
13 years 7 months ago
Concurrent Zero-Knowledge
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
Cynthia Dwork, Moni Naor, Amit Sahai