论文部分内容阅读
基于图同构零知识证明的标识－鉴别－签名系统，提出了一个解决自授权问题的方法．与以前的方法相比，虽然两者都是基于对主秘密的逐步暴露来实现的，但前者是基于图同构置换来实现的，而后者是基于类似于秘密共享的思想来实现的．在研究给出的自授权系统的安全性时，定义了问题级的知识复杂性、实际知识复杂性和计算知识复杂性．应把它们作为协议知识复杂性的上界．
Based on the identification-authentication-signature system of graph isomorphism zero knowledge proof, a method to solve the problem of self-authorization is proposed. Compared with the previous method, although both of them are based on the gradual exposure of the master secret, the former is based on the graph isomorphism replacement, while the latter is based on the idea of secret sharing. In studying the security of self-authorizing system, the problem-level knowledge complexity, actual knowledge complexity and computational complexity are defined. They should be used as the upper bound on the complexity of the protocol knowledge.