Precise Zero-Knowledge Arguments with Poly-logarithmic Efficiency  

作　　者：丁宁 谷大武 

机构地区：[1]Department of Computer Science and Engineering,Shanghai Jiaotong University

出　　处：《Journal of Shanghai Jiaotong university(Science)》2009年第5期584-589,共6页上海交通大学学报（英文版）

基　　金：the National Natural Science Foundation of China (No.60573031);New Century Excellent Talent Program of Education Ministry of China (No.NCET-05-0398)

摘　　要：Precise zero-knowledge was introduced by Micali and Pass in STOC06. This notion captures the idea that the view of a verifier can be reconstructed in almost same time. Following the notion, they constructed some precise zero-knowledge proofs and arguments, in which the communicated messages are polynomial bits. In this paper, we employ the new simulation technique introduced by them to provide a precise simulator for a modified Kilian＇s zero-knowledge arguments with poly-logarithmic efficiency （this modification addressed by Rosen）, and as a result we show this protocol is a precise zero-knowledge argument with poly-logaxithmic efficiency. We also present an alternative construction of the desired protocols.Precise zero-knowledge was introduced by Micali and Pass in STOC'06.This notion captures the idea that the view of a verifier can be reconstructed in almost same time.Following the notion,they constructed some precise zero-knowledge proofs and arguments,in which the communicated messages are polynomial bits.In this paper,we employ the new simulation technique introduced by them to provide a precise simulator for a modified Kilian's zero-knowledge arguments with poly-logarithmic efficiency(this modification addressed by Rosen) ,and as a result we show this protocol is a precise zero-knowledge argument with poly-logarithmic efficiency.We also present an alternative construction of the desired protocols.

关 键 词：CRYPTOGRAPHY ZERO-KNOWLEDGE precise zero-knowledge 

分 类 号：TP309[自动化与计算机技术—计算机系统结构] U483[自动化与计算机技术—计算机科学与技术]