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).

• Type: Conference
• Year: 1998
• Where: STOC
• Authors: Cynthia Dwork, Moni Naor, Amit Sahai
• Keywords: Algorithms, Concurrent Zero-Knowledge Proofs, Probabilistic Polynomial-time Machines, Question Regarding Zero-knowledge, STOC 1998