Efficient Concurrent n ^{poly (log n )}-Simulatable Argument of Knowledge

详细信息    查看全文

• 作者：Guifang Huang ; Dongdai Lin ; Yanshuo Zhang
• 关键词：straight ; line n poly(logn) ; simulatable ; argument of knowledge ; Σ ; protocol
• 刊名：Lecture Notes in Computer Science
• 出版年：2009
• 出版时间：2009
• 年：2009
• 卷：5451
• 期：1
• 页码：93-101
• 全文大小：187.0 KB

文摘

In [16], Pass generalized the definition of zero knowledge proof and defined n O(σ(n))-simulatable proof which can be simulated by a simulator in n O(σ(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 n poly(logn)-simulatable argument of knowledge was presented there. In this paper, we construct an efficient concurrent n poly(logn)-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 Σ-protocol for the corresponding statement as sub-protocol, instead of Σ-protocol with honest verifier perfect zero knowledge, the resulting protocol is not necessarily closed under concurrent composition.