Abstract: 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.

Key words: zero knowledge proofs, protocol, tuple, interactive proof, CFL (Chen, Fan, and Lü)

摘要： 自计算复杂性理论中“零知识证明思想”提出以来，认证双方真实身份领域的研究日益成为大家关注的热点.如果观察发现认证协议是零知识证明的，就解释为基于相应证明的系统方案是安全的.在多元组方式的基础上，梳理了交互零知识证明、知识零知识证明、非交互零知识证明.在此基础上，证明了基于标识的证书认证体制CFL是交互证明系统，并为统计零知识的.

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