ISCAS OpenIR
Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
Li, HongDa (1); Feng, DengGuo (2); Li, H. D.(lihongda@iie.ac.cn)
2014
发表期刊Science China Information Sciences
ISSN1674733X
卷号57期号:1页码:1-14
摘要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
关键词Zero-knowledge Proofs ProOfs Of Knowledge Constant-round Strict Polynomial-time Extractors
部门归属(1) State Key Lab of Information Security, Institute of Information Engineering of Chinese Academy of Sciences, Beijing, 100093, China; (2) Institute of software of Chinese Academy of Sciences, Beijing, 100080, China
语种英语
WOS记录号WOS:000332596000012
引用统计
内容类型期刊论文
URI标识http://ir.iscas.ac.cn/handle/311060/16879
专题中国科学院软件研究所
通讯作者Li, H. D.(lihongda@iie.ac.cn)
推荐引用方式
GB/T 7714
Li, HongDa ,Feng, DengGuo ,Li, H. D.. 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 ,&Li, H. D..(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.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Li, HongDa (1)]的文章
[Feng, DengGuo (2)]的文章
[Li, H. D.(lihongda@iie.ac.cn)]的文章
百度学术
百度学术中相似的文章
[Li, HongDa (1)]的文章
[Feng, DengGuo (2)]的文章
[Li, H. D.(lihongda@iie.ac.cn)]的文章
必应学术
必应学术中相似的文章
[Li, HongDa (1)]的文章
[Feng, DengGuo (2)]的文章
[Li, H. D.(lihongda@iie.ac.cn)]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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