论文部分内容阅读
允许A使B相信她知道一个离散对数问題的解——即她知道一个满足α~X≡β(modN)的X,而不泄露任何有关X的信息给B的技术被介绍。对N是素数和N是合数都给出了协议。我们证明在一个自身有趣的形式模型下这些协议是安全的。我们还指出A怎样能使B信服元素α和β产生Z_N~*中同样的子群而不泄露如何能将其中一个表为另二个的幂。
Allow A to convince B that she knows the solution to a discrete logarithm problem-that is, she knows that a technique that satisfies X for α ~ X≡β (modN) without revealing any information about X to B is introduced. The agreement is given for N being a prime number and N being a composite number. We show that these protocols are safe under a model of their own interest. We also show how A can cause B to convince elements α and β to produce the same subgroups in Z_N ~ * without revealing how one of the tables can be a power of the other two.