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

• 作 者: LI HongDa FENG DengGuo
• 机 构: State Key Lab of Information Security, Institute of Information Engineering of Chinese Academy of Sc
• 出 处: Science China(Information Sciences)
• 发表日期: 2014年01期
• 关键词: strict polynomial receiver commit proof sender argument interactive committed ac

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 exists 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 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.