基于大数分解的一次性身份识别协议

One-time Identification Protocol Based on Large Numbers Factorization

针对现有的身份识别协议效率不高的问题,利用大数分解的困难性和多元一次同余不定方程解的结构形式,构造了随机"询问与应答"的一个四步交互式身份识别协议.该协议符合身份证明系统的完备性、正确性、安全性和零知识性的要求,既没有被附加任何复杂性假设和用户的计算能力假设,又能做到对用户身份的一次性识别.

In order to deal with the inefficient problem of the existing identification protocol,a four-step interactive identification protocol was constructed by using the difficulty of large numbers factorization and the solution constitutional formula of multivariate linear coresidual indeterminate equation. Any complexity assumption and power of prover was not relied on and any random challenge-response could be accomplished in the protocol. Some conditions of the interactive identification proof systems such as completeness and correctness as well as security and zero-knowledge were possessed by the protocol. Moreover,identification of user could be finished at one time.