CFL满足统计零知识  

CFL is Statistical Zero-Knowledge Proof System

作　　者：杜春玲[1] 刘纪敏[1] 范修斌 赵慧奇[1] 

机构地区：[1]山东科技大学信息工程系,山东泰安271019 [2]中科国民科学技术研究院,北京100086 [3]北京博文广成信息安全技术有限公司,北京102206

出　　处：《信息安全研究》2016年第7期621-627,共7页Journal of Information Security Research

摘　　要：自计算复杂性理论中"零知识证明思想"提出以来,认证双方真实身份领域的研究日益成为大家关注的热点.如果观察发现认证协议是零知识证明的,就解释为基于相应证明的系统方案是安全的。在多元组方式的基础上,梳理了交互零知识证明、知识零知识证明、非交互零知识证明.在此基础上,证明了基于标识的证书认证体制CFL是交互证明系统,并为统计零知识的.In the computational complexity theory, since the idea of zero knowledge proof was put forward, the research of both parties certification real identity has increasingly become a hot field among many people. If found that by observing the authentication protocol is to satisfy a zero knowledge proof system, the system scheme based on a corresponding certificate would be interpreted as safe. On the basis of multi-tuple, some basic concepts such as interaction zero knowledge proof, knowledge zero knowledge proof, non-interactive zero-knowledge proof are combeded. CFL is an interactive proof system of membership and statistical zero-knowledge proof system.

关 键 词：零知识证明 协议 元组 交互证明 CFL(Chen Fan and Lü) 

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