efficient concurrent npoly(log n)-simulatable argument of knowledge
文献类型:会议论文
作者 | Huang Guifang ; Lin Dongdai ; Zhang Yanshuo |
出版日期 | 2009 |
会议名称 | 5th International Conference on Information Security Practice and Experience |
会议日期 | APR 13-15, |
会议地点 | Xi an, PEOPLES R CHINA |
关键词 | straight-line n(poly(log n))-simulatable argument of knowledge Sigma-protocol |
英文摘要 | 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. |
会议主办者 | Xidian Univ, Xidian Univ, Sch Telecommun Engn, Key Lab Comp Networks & Informat Security, Minist Educ |
会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
![]() |
会议录出版者 | 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 |
源URL | [http://124.16.136.157/handle/311060/8384] ![]() |
专题 | 软件研究所_信息安全国家重点实验室_会议论文 |
推荐引用方式 GB/T 7714 | 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,. |
入库方式: OAI收割
来源:软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。