Sciweavers

Share
STOC
1998
ACM

Concurrent Zero-Knowledge

9 years 6 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 question regarding zero-knowledge is whether constant-round concurrent zero-knowledge proofs exists for nontrivial languages. We answer this question to the affirmative when modeling “efficient adversaries” as probabilistic quasi-polynomial time machines (instead of the traditional notion of probabilistic polynomial-time machines).
Cynthia Dwork, Moni Naor, Amit Sahai
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where STOC
Authors Cynthia Dwork, Moni Naor, Amit Sahai
Comments (0)
books