中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP

文献类型:期刊论文

作者Li, HongDa (1) ; Feng, DengGuo (2)
刊名Science China Information Sciences
出版日期2014
卷号57期号:1页码:1-14
关键词zero-knowledge proofs proofs of knowledge constant-round strict polynomial-time extractors
ISSN号1674733X
通讯作者Li, H. D.(lihongda@iie.ac.cn)
中文摘要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. © 2014 Science China Press and Springer-Verlag Berlin Heidelberg.
英文摘要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. © 2014 Science China Press and Springer-Verlag Berlin Heidelberg.
收录类别SCI ; EI
语种英语
WOS记录号WOS:000332596000012
公开日期2014-12-16
源URL[http://ir.iscas.ac.cn/handle/311060/16879]  
专题软件研究所_软件所图书馆_期刊论文
推荐引用方式
GB/T 7714
Li, HongDa ,Feng, DengGuo . Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP[J]. Science China Information Sciences,2014,57(1):1-14.
APA Li, HongDa ,&Feng, DengGuo .(2014).Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP.Science China Information Sciences,57(1),1-14.
MLA Li, HongDa ,et al."Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP".Science China Information Sciences 57.1(2014):1-14.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。