Precise concurrent zero knowledge

Authors:
Omkant Pandey;Rafael Pass;Amit Sahai;Wei-Lung Dustin Tseng;Muthuramakrishnan Venkitasubramaniam
Affiliations:
University of California Los Angeles, California;Cornell University, New York;University of California Los Angeles, California;Cornell University, New York;Cornell University, New York
Venue:
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Year:
2008

Citing 10
Cited 4

The knowledge complexity of interactive proof-systems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Concurrent zero-knowledge

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Concurrent Zero Knowledge with Logarithmic Round-Complexity

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Local zero knowledge

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A precise computational approach to knowledge

A precise computational approach to knowledge
On the concurrent composition of zero-knowledge proofs

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

Password-authenticated session-key generation on the internet in the plain model

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Concurrent non-malleable zero knowledge proofs

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
The knowledge tightness of parallel zero-knowledge

TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Public-Coin concurrent zero-knowledge in the global hash model

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

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.