Institutional Repository
| efficient concurrent npoly(log n)-simulatable argument of knowledge | |
| Huang Guifang; Lin Dongdai; Zhang Yanshuo | |
| 2009 | |
| Conference Name | 5th International Conference on Information Security Practice and Experience |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Conference Date | APR 13-15, |
| Conference Place | Xi an, PEOPLES R CHINA |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | INFORMATION SECURITY PRACTICE AND EXPERIENCE, PROCEEDINGS - 5TH INTERNATIONAL CONFERENCE, ISPEC 2009 |
| ISSN | 0302-9743 |
| ISBN | 978-3-642-00842-9 |
| Department | Huang, Guifang; Lin, Dongdai Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100190, Peoples R China. |
| English Abstract | 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. |
| Keyword | Straight-line n(Poly(Log n))-simulatable Argument Of Knowledge Sigma-protocol |
| Sponsorship | Xidian Univ, Xidian Univ, Sch Telecommun Engn, Key Lab Comp Networks & Informat Security, Minist Educ |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8384 |
| Collection | 信息安全国家重点实验室 |
| Recommended Citation GB/T 7714 | Huang Guifang,Lin Dongdai,Zhang Yanshuo. efficient concurrent npoly(log n)-simulatable argument of knowledge[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:INFORMATION SECURITY PRACTICE AND EXPERIENCE, PROCEEDINGS - 5TH INTERNATIONAL CONFERENCE, ISPEC 2009,2009. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment