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 | |
| Source | Science China Information Sciences
 |
| ISSN | 1674733X |
| Volume | 57Issue:1Pages:1-14 |
| English Abstract | 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. |
| Indexed Type | SCI ; EI |
| Keyword | Zero-knowledge Proofs ProOfs Of Knowledge Constant-round Strict Polynomial-time Extractors |
| Department | (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 |
| Language | 英语 |
| WOS ID | WOS:000332596000012 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16879 |
| Collection | 中国科学院软件研究所 |
| Corresponding Author | Li, H. D.(lihongda@iie.ac.cn) |
| Recommended Citation 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. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment