摘要
本文针对公平非否认协议给出了一种基于有限状态自动机的分析模型,并使用SPIN模型检测工具,对Zhou-Gollmann非否认协议进行了分析,结果发现该协议不满足公平性和机密性,为此对该协议进行了改进。
A model based on finite state automaton is proposed for a fair non-repudiation protocol. The Zhou-Gollmann fair non-repudiation protocol is analyzed with using model checker SPIN. The results show that the protocol isn't satisfied with fairness and confidentiality. Finally, some improvements are given for this protocol.
出处
《计算机科学》
CSCD
北大核心
2005年第8期83-86,共4页
Computer Science
基金
广西自然科学基金(编号:桂科自0229051)