Precise bounded-concurrent zero-knowledge proofs for NP  

作　　者：DING Ning GU DaWu 

机构地区：[1]Department of Computer Science and Engineering,Shanghai Jiao Tong University,Shanghai 200240,China

出　　处：《Science China(Information Sciences)》2010年第9期1738-1752,共15页中国科学(信息科学)(英文版)

基　　金：supported by the Specialized Research Fund for the Doctoral Program of Higher Education(GrantNo.200802480019)

摘　　要：Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt'08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers.Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt'08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers.

关 键 词：interactive proofs and arguments ZERO-KNOWLEDGE precise zero-knowledge proofs of knowledge bounded concurrency 

分 类 号：TP309[自动化与计算机技术—计算机系统结构] TP393.08[自动化与计算机技术—计算机科学与技术]