论文部分内容阅读
类ＢＡＮ逻辑通常都分析了ＢＡＮ逻辑的缺陷并相应地发展了自己的推理法则，在 ＢＡＮ逻辑的缺陷中最受关注的是消息可识别性问题和密钥保密性问题。该文重新对这两个问题进行分析并指出以前类ＢＡＮ逻辑中对这两个缺陷的理解是错误的，并把这两个缺陷归结为消息不可伪造问题和信任模型问题。同时指出进一步法则类ＢＡＮ逻辑应解决的问题。
BAN-like logic usually analyzes the defects of BAN logic and develops its own inference rules accordingly. Among the defects of BAN logic, the issues of message identifiability and key confidentiality are the most concerned. The article re-analyzes these two issues and points out that it is wrong to understand these two defects in the former BAN logic, and these two defects are attributed to the problem of message unforgeability and trust model. At the same time pointed out that the law of the class BAN logic should solve the problem.