摘要
一、引言 随着计算机网络的不断扩展和信息高速公路的建设,信息的安全问题也变得十突出了。
Using the one-way homomorphic function, we proposed a method to design the identifi-cation schemes which have the property of zero knowledge proof, the schemes based on the knap-sack problems are presented in the paper. The scheme on the Constrained Linear Equations(CLE in short) is unsolved. It is easy to change the schemes to the signature schemes.
出处
《计算机科学》
CSCD
北大核心
1995年第6期19-21,11,共4页
Computer Science
基金
中国博士后基金
清华大学青年科技基金
关键词
背包问题
身份认证
信息安全
计算机网络
Cryptography, Complexity theory, Zero knowledge proof, Signature, Identification.
