Institutional Repository
| 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
![]() |
| ISSN | 1674733X |
| 卷号 | 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. |
| 条目包含的文件 | 条目无相关文件。 | |||||
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论