中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 信息安全国家重点实验室  > 会议论文
题名:
efficient concurrent npoly(log n)-simulatable argument of knowledge
作者: Huang Guifang ; Lin Dongdai ; Zhang Yanshuo
会议文集: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议名称: 5th International Conference on Information Security Practice and Experience
会议日期: APR 13-15,
出版日期: 2009
会议地点: Xi an, PEOPLES R CHINA
关键词: straight-line n(poly(log n))-simulatable ; argument of knowledge ; Sigma-protocol
出版者: INFORMATION SECURITY PRACTICE AND EXPERIENCE, PROCEEDINGS - 5TH INTERNATIONAL CONFERENCE, ISPEC 2009
出版地: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-642-00842-9
部门归属: Huang, Guifang; Lin, Dongdai Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100190, Peoples R China.
主办者: Xidian Univ, Xidian Univ, Sch Telecommun Engn, Key Lab Comp Networks & Informat Security, Minist Educ
英文摘要: In 16, Pass generalized the definition of zero knowledge proof and defined n(O(sigma(n)))-simulatable proof which can be simulated by a simulator in n(O(sigma(n))) time. Assuming the existence of one-way permutation secure against sub-exponential circuits and 2-round perfect hiding commitment scheme, an efficient 4-round perfect argument of knowledge was presented there. In this paper, we construct an efficient concurrent simulatable argument of knowledge under more general assumption. The new scheme is 5-round and is based on the existence of one-way permutation secure against sub-exponential circuits. However, for the scheme in 16, if using ordinary Sigma-protocol for the corresponding statement as sub-protocol, instead of Sigma-protocol with honest verifier perfect zero knowledge, the resulting protocol is not necessarily closed under concurrent composition.
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8384
Appears in Collections:信息安全国家重点实验室_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Huang Guifang,Lin Dongdai,Zhang Yanshuo. efficient concurrent npoly(log n)-simulatable argument of knowledge[C]. 见:5th International Conference on Information Security Practice and Experience. Xi an, PEOPLES R CHINA. APR 13-15,.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Huang Guifang]'s Articles
[Lin Dongdai]'s Articles
[Zhang Yanshuo]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Huang Guifang]‘s Articles
[Lin Dongdai]‘s Articles
[Zhang Yanshuo]‘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