Furthermore, we propose a $\omega (\log ^2 n)$-round concurrent zero-knowledge argument for ${\rm{NP}}$ with linear precision, which shows that the view of any verifier in concurrent interaction can be reconstructed by the simulator with linear-time overhead. Our argument is Feige-Lapidot-Shamir type which consists of a proof-preamble and a proof-body for a modified NP statement. Our result assumes the restriction of adversarial scheduling the communication that the concurrent interaction of preambles of all sessions will be scheduled before any proof-body by the adversarial verifier.
Category / Keywords: foundations / Date: received 7 Dec 2007, withdrawn 16 Mar 2008 Contact author: dingning at sjtu edu cn Available format(s): (-- withdrawn --) Version: 20080316:110625 (All versions of this report) Short URL: ia.cr/2007/456