中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
Author: Li, HongDa (1) ; Feng, DengGuo (2)
Corresponding Author: Li, H. D.(lihongda@iie.ac.cn)
Keyword: zero-knowledge proofs ; proofs of knowledge ; constant-round ; strict polynomial-time extractors
Source: Science China Information Sciences
Issued Date: 2014
Volume: 57, Issue:1, Pages:1-14
Indexed Type: SCI ; EI
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
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.
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.
Language: 英语
WOS ID: WOS:000332596000012
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16879
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Li, HongDa ,Feng, DengGuo . Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP[J]. Science China Information Sciences,2014-01-01,57(1):1-14.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Li, HongDa (1)]'s Articles
[Feng, DengGuo (2)]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Li, HongDa (1)]‘s Articles
[Feng, DengGuo (2)]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace