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

查看全文 作　　者：LI [1]HongDa;FENG [2]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年第57卷第1期,共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. 关 键 词：零知识证明 多项式时间 NP 提取 公开问题