摘要
基于图同构零知识证明的标识-鉴别-签名系统,提出了一个解决自授权问题的方法.与以前的方法相比,虽然两者都是基于对主秘密的逐步暴露来实现的,但前者是基于图同构置换来实现的,而后者是基于类似于秘密共享的思想来实现的.在研究给出的自授权系统的安全性时,定义了问题级的知识复杂性、实际知识复杂性和计算知识复杂性.应把它们作为协议知识复杂性的上界.
A solution to the problem of self delegation using the identification authentication signature scheme based on the graph isomorphism problem is proposed in this paper. The major difference from the traditional solutions is that it is based on the graph isomorphism rather than computing numeric theory problem, though they all leak out secret information little by little. The knowledge complexity of problems, the including knowledge complexity, the practical knowledge complexity, and the computing knowledge complexity are also defined. In the authors' opinion, these definitions should be used as the upper bound of knowledge complexity of protocols.
出处
《软件学报》
EI
CSCD
北大核心
1999年第2期170-174,共5页
Journal of Software
基金
国家自然科学基金
国家863高科技项目
关键词
知识复杂性
自授权系统
安全保密
计算机网络
Zero knowledge proof, graph isomorphism, knowledge complexity, self delegation system.