基于Z_(pq)中离散对数问题的零知识证明方案  

An Interactive Zero-Knowledge Proof Scheme Based on The Discrete Logarithm Problem for Z_(pq)

作　　者：王小云[1] 

机构地区：[1]山东大学效学系

出　　处：《信息安全与通信保密》1994年第1期64-68,共5页Information Security and Communications Privacy

摘　　要：本文提出了一个零知识证明方案。该方案证明了对某一x∈Z_(n,a)(n=p·q,p·q未知),证明者知道其指数index_(n,a),而没有泄露指数本身。方案的安全性完全建立在Z(n,a)中离散对数问题基础之上。In this paper, we discusses an interactive zero-knowledgeproofscheme. As the result of a conversation between the prover and theverifier the verifier believes that the prover knows the secret indexn,a(x) for certain x Zn, a, and the prover does not leak any informationabout indexn, a(x). The security of the scheme is compeletly based onthe discrete logarithmproblem foy z_n (n=pq, p and q are unkownprimes).

关 键 词：离散对数 零知识证明 安全 

分 类 号：TN918.1[电子电信—通信与信息系统]