中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 信息安全国家重点实验室  > 会议论文
题名:
concurrently non-malleable black-box zero knowledge in the bare public-key model
作者: Deng Yi ; Di Crescenzo Giovanni ; Lin Dongdai ; Feng Dengguo
会议文集: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议名称: 4th International Computer Science Symposium
会议日期: AUG 18-23,
出版日期: 2009
会议地点: Novosibirsk, RUSSIA
关键词: Linguistics ; Query languages
出版者: COMPUTER SCIENCE - THEORY AND APPLICATIONS
出版地: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-642-03350-6
部门归属: Deng, Yi; Lin, Dongdai; Feng, Dengguo Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100190, Peoples R China.
主办者: Russian Fdn Bas Res, Yandex
英文摘要: In this paper we study the possibility of reducing the setup assumptions under which concurrent non-malleable zero knowledge protocol can be realized. A natural model choice is the bare public-key (BPK) model of 6, a model with very minimal setup assumptions. Our main contribution is to show in this model the following about constant-round concurrent non-malleable black-box zero-knowledge arguments. - They can be constructed from any one-way function for any language in NP. Here, our construction takes 5 rounds, and we can reduce it to a round (round-optimal) argument under existence of one-way permutations. - Under number-theoretic assumptions, they admit a time-efficient instantiation for some specific NP languages (e.g., all languages having efficient Sigma protocols, for which we can implement our construction using only O(1) modular exponentiations). Compared to the non-black-box construct ion in a concurrent work of OPV, ICALP 2008 in this model, our protocol (even the construction from one-way function) is significantly more time- and round-efficient and can be based on more general assumptions.
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8334
Appears in Collections:信息安全国家重点实验室_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Deng Yi,Di Crescenzo Giovanni,Lin Dongdai,et al. concurrently non-malleable black-box zero knowledge in the bare public-key model[C]. 见:4th International Computer Science Symposium. Novosibirsk, RUSSIA. AUG 18-23,.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Deng Yi]'s Articles
[Di Crescenzo Giovanni]'s Articles
[Lin Dongdai]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Deng Yi]‘s Articles
[Di Crescenzo Giovanni]‘s Articles
[Lin Dongdai]‘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-2017  中国科学院软件研究所 - Feedback
Powered by CSpace