on constant-round zero-knowledge proofs of knowledge for np-relations

	on constant-round zero-knowledge proofs of knowledge for np-relations
	Li HongDa ; Xu HaiXia ; Li Bao ; Feng DengGuo
刊名	SCIENCE CHINA-INFORMATION SCIENCES
	2010
卷号	53 期号:4 页码:788-799
关键词	zero-knowledge proof proof of knowledge constant-round NP-relation
ISSN号	1674-733X
学科主题	Computer Science ; Information Systems
收录类别	SCI
WOS记录号	WOS:000276775200011
公开日期	2011-05-23
附注	This paper considers the existence of constant-round zero-knowledge proofs of knowledge for NP under standard assumptions. By introducing a new interactive proof model, we construct a 3-round zero-knowledge proof of knowledge system for the NP-relation under the assumption that factoring is intractable. Our construction not only shows the existence of constant-round zero-knowledge proofs of knowledge, but also gives a positive answer to the open problem of the existence of 3-round zero-knowledge proofs for NP.
内容类型	期刊论文
源URL	[http://124.16.136.157/handle/311060/9752]
专题	软件研究所_信息安全国家重点实验室_期刊论文
推荐引用方式 GB/T 7714	Li HongDa,Xu HaiXia,Li Bao,et al. on constant-round zero-knowledge proofs of knowledge for np-relations[J]. SCIENCE CHINA-INFORMATION SCIENCES,2010,53(4):788-799.
APA	Li HongDa,Xu HaiXia,Li Bao,&Feng DengGuo.(2010).on constant-round zero-knowledge proofs of knowledge for np-relations.SCIENCE CHINA-INFORMATION SCIENCES,53(4),788-799.
MLA	Li HongDa,et al."on constant-round zero-knowledge proofs of knowledge for np-relations".SCIENCE CHINA-INFORMATION SCIENCES 53.4(2010):788-799.