On Sequential Composition of Precise Zero-Knowledge  

作　　者：丁宁 谷大武 

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

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

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

摘　　要：Precise zero-knowledge was introduced by Micali and Pass in STOC'06.This notion captures the idea that the view of any verifier in interaction can be reconstructed in almost time.Pass also obtained a sequential composition lemma for precise zero-knowledge protocols.However,this lemma doesn't provide tight precisions for composed protocols.In this paper we further obtain a sequential composition lemma for a subclass of precise zero-knowledge protocols,which all satisfy a property:their simulators use the code of verifier in almost the black-box way.We call such subclass emulated black-box zero-knowledge protocols.Our lemma provides better precisions for sequential composition of such protocols.Precise zero-knowledge was introduced by Micali and Pass in STOC＇06. This notion captures the idea that the view of any verifier in interaction can be reconstructed in almost time. Pass also obtained a sequential composition lemma for precise zero-knowledge protocols. However, this lemma doesn＇t provide tight precisions for composed protocols. In this paper we further obtain a sequential composition lemma for a subclass of precise zero-knowledge protocols, which all satisfy a property： their simulators use the code of verifier in almost the black-box way. We call such subclass emulated black-box zero-knowledge protocols. Our lemma provides better precisions for sequential composition of such protocols.

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

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