Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP  

作　　者：LI HongDa FENG DengGuo 

机构地区：[1]State Key Lab of Information Security, Institute of Information Engineering of Chinese Academy of Sciences [2]Institute of software of Chinese Academy of Sciences

出　　处：《Science China(Information Sciences)》2014年第1期146-159,共14页中国科学（信息科学）（英文版）

基　　金：partially supported by National Basic Research Program of China(973 program)(Grant No.2007CB311202);National Natural Science Foundation of China(Grant No.60970139);Strategic Priority Program of Chinese Academy of Sciences(Grant No.XDA06010702);IIEs Cryptography Research Project

摘　　要：Barak and Lindell showed that there exist constant-round zero-knowledge arguments of knowledge with strict polynomial-time extractors. This leaves the open problem of whether it is possible to obtain an analogous result regarding constant-round zero-knowledge proofs of knowledge for NP. This paper focuses on this problem and gives a positive answer by presenting a construction of constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP.Barak and Lindell showed that there exist constant-round zero-knowledge arguments of knowledge with strict polynomial-time extractors. This leaves the open problem of whether it is possible to obtain an analogous result regarding constant-round zero-knowledge proofs of knowledge for NP. This paper focuses on this problem and gives a positive answer by presenting a construction of constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP.

关 键 词：zero-knowledge proofs proofs of knowledge constant-round strict polynomial-time extractors 

分 类 号：TN918.1[电子电信—通信与信息系统]