On Constant-Round Concurrent Zero-Knowledge

@inproceedings{Pass2008OnCC,
  title={On Constant-Round Concurrent Zero-Knowledge},
  author={Rafael Pass and Muthuramakrishnan Venkitasubramaniam},
  booktitle={TCC},
  year={2008}
}
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). 
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

Similar Papers

Loading similar papers…