从∑-协议到公共参考串模型下可否认零知识的高效编译器.pdfVIP

中国科学院研究生院学报 Vo l. 27 No.6 第 27 卷第 6 期 2010 年 11 月 loumaI of the Graduate SchooI of the Chinese Academy of Sciences November 2010 x.编号:1 ∞2-1175(2010)06-0831- 07 An efficient compiler from ~←protocol to deniable zero knowledge in CRS model * HUANG Gui-Fang lt , HU Lei 1 , LIN Dong-Dai 2 (1 Sta阳 Key Labotatory o/Inform晴twn S时U哟• Graduak UniveT8ity. Chinese Academy 0/ Sciences , Beijing 1 ∞ω9 ， China õ 2 /lI$ titute 0/ Sψ阳阳， Chin制e Academy of Scie时时， Beijing 100190. China) (Receîved 23 February 2010; Revî肺d7 May2010) Huang G F , Hu L , Lin D D. An emcient compiler Irom l:-protocol to deniable zero knowledge in CRS model [ J] • Joumal or the Graduate School 01 the Chinese Academy 01 Sclences , 2010 ,27(6) :831-837. Abstract In this paper. we present a positive result on deniable zero knowledge in the common reference string (CRS) model: an efficient transformation from I-protocol ωdeniable zero knowledge in CRS mode l. According to the lower bound given by Pass , for deniable zero knowledge in CRS model , our compiler achieves optimal round efficíency. In addition. the transformation induces only a small addítive overhead in communication complexity. Key words deniable zero knowledge ín the CRS model , I-protocol , I-compiler CLC TP309 1 Introduction Zero knowledge (ZK) proof. defined by Goldwasser , et αl is an interactive proof that yield日 no other knowledge than the validity of the assertion proved( 1). The