International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Wei-Lung Dustin Tseng

Publications

Year
Venue
Title
2014
JOFC
2012
TCC
2011
TCC
2010
TCC
2010
CRYPTO
2009
CRYPTO
2008
EUROCRYPT
2007
EPRINT
Precise Concurrent Zero Knowledge
\emph{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 \emph{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.