Precise Concurrent Zero Knowledge

  • Omkant Pandey
  • Rafael Pass
  • Amit Sahai
  • Wei-Lung Dustin Tseng
  • Muthuramakrishnan Venkitasubramaniam
Conference paper

DOI: 10.1007/978-3-540-78967-3_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4965)
Cite this paper as:
Pandey O., Pass R., Sahai A., Tseng WL.D., Venkitasubramaniam M. (2008) Precise Concurrent Zero Knowledge. In: Smart N. (eds) Advances in Cryptology – EUROCRYPT 2008. EUROCRYPT 2008. Lecture Notes in Computer Science, vol 4965. Springer, Berlin, Heidelberg

Abstract

Precise zero knowledge introduced by Micali and Pass (STOC’06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed to worst-case) time spent by V in the generated view. We provide the first constructions of precise concurrent zero-knowledge protocols. Our constructions have essentially optimal precision; consequently this improves also upon the previously tightest non-precise concurrent zero-knowledge protocols by Kilian and Petrank (STOC’01) and Prabhakaran, Rosen and Sahai (FOCS’02) whose simulators have a quadratic worst-case overhead. Additionally, we achieve a statistically-precise concurrent zero-knowledge property—which requires simulation of unbounded verifiers participating in an unbounded number of concurrent executions; as such we obtain the first (even non-precise) concurrent zero-knowledge protocols which handle verifiers participating in a super-polynomial number of concurrent executions.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Omkant Pandey
    • 1
  • Rafael Pass
    • 2
  • Amit Sahai
    • 1
  • Wei-Lung Dustin Tseng
    • 2
  • Muthuramakrishnan Venkitasubramaniam
    • 2
  1. 1.University of California Los AngelesCalifornia
  2. 2.Cornell UniversityNew York

Personalised recommendations