Simplified Design for Concurrent Statistical Zero-Knowledge Arguments  

作　　者：魏普文 张国艳 张立江 王小云 

机构地区：[1]Key Laboratory of Cryptologic Technology and Information Security of Ministry of Education,Shandong University [2]Center for Advanced Study,Tsinghua University

出　　处：《Tsinghua Science and Technology》2009年第2期255-263,共9页清华大学学报（自然科学版（英文版）

基　　金：Supported by the National Key Basic Research and Development(973) Program of China(No.2007CB807902);the National Natural Science Foundation of China(Nos.90604036 and 60525201)

摘　　要：This paper shows that the protocol presented by Goyal et al. can be further simplified for a one-way function, with the simplified protocol being more practical for the decisional Diffie-Hellman assumption. Goyal et al. provided a general transformation from any honest verifier statistical zero-knowledge argument to a concurrent statistical zero-knowledge argument. Their transformation relies only on the existence of one-way functions. For the simplified transformation, the witness indistinguishable proof of knowledge protocols in ＂parallel＂ not only plays the role of preamble but also removes some computational zero-knowledge proofs, which Goyal et al. used to prove the existence of the valid openings to the commitments. Therefore, although some computational zero-knowledge proofs are replaced with a weaker notion, the witness indistinguishable protocol, the proof of soundness can still go through.This paper shows that the protocol presented by Goyal et al. can be further simplified for a one-way function, with the simplified protocol being more practical for the decisional Diffie-Hellman assumption. Goyal et al. provided a general transformation from any honest verifier statistical zero-knowledge argument to a concurrent statistical zero-knowledge argument. Their transformation relies only on the existence of one-way functions. For the simplified transformation, the witness indistinguishable proof of knowledge protocols in ＂parallel＂ not only plays the role of preamble but also removes some computational zero-knowledge proofs, which Goyal et al. used to prove the existence of the valid openings to the commitments. Therefore, although some computational zero-knowledge proofs are replaced with a weaker notion, the witness indistinguishable protocol, the proof of soundness can still go through.

关 键 词：CONCURRENT statistical zero-knowledge witness indistinguishable honest verifier decisional Diffie-Hellman assumption 

分 类 号：TB47[一般工业技术—工业设计]