a two-round honest-verifier zero-knowledge protocol | |
Liu HanWu ; Lin DongDai | |
刊名 | SCIENCE CHINA-INFORMATION SCIENCES
![]() |
2010 | |
卷号 | 53期号:5页码:954-963 |
关键词 | proof system argument system zero-knowledge witness indistinguishability black-box one-way permutation commitment scheme zap |
ISSN号 | 1674-733X |
学科主题 | Computer Science ; Information Systems |
收录类别 | SCI |
WOS记录号 | WOS:000277417400007 |
公开日期 | 2011-05-23 |
附注 | Since the concept of zero-knowledge protocols was introduced, it has attracted a lot of attention and in turn showed significant effect on the development of cryptography, complexity theory and other areas. The round complexity of a zero-knowledge protocol is a very important efficiency consideration, and it is required to be as small as possible. Generally, it is desirable to have zero-knowledge protocols with constant numbers of rounds. Goldreich and Oren proved that only languages in BPP have one-round and two-round zero-knowledge protocols. Moreover, they also showed that only languages in BPP have one-round honest-verifier zero-knowledge protocols. The notion of honest-verifier zero-knowledge protocols is highly non-trivial and fascinating itself, and has many other uses. Thus, the problem as to whether there exist two-round honest-verifier zero-knowledge protocols becomes an important open problem. In this paper, we introduce a new simulation technique and present a two-round honest-verifier zero-knowledge protocol for any language in NP under a standard complexity assumption based on this technique. |
内容类型 | 期刊论文 |
源URL | [http://124.16.136.157/handle/311060/9666] ![]() |
专题 | 软件研究所_信息安全国家重点实验室_期刊论文 |
推荐引用方式 GB/T 7714 | Liu HanWu,Lin DongDai. a two-round honest-verifier zero-knowledge protocol[J]. SCIENCE CHINA-INFORMATION SCIENCES,2010,53(5):954-963. |
APA | Liu HanWu,&Lin DongDai.(2010).a two-round honest-verifier zero-knowledge protocol.SCIENCE CHINA-INFORMATION SCIENCES,53(5),954-963. |
MLA | Liu HanWu,et al."a two-round honest-verifier zero-knowledge protocol".SCIENCE CHINA-INFORMATION SCIENCES 53.5(2010):954-963. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论