摘要
文中对 SET协议中的“k out of n”问题进行了全面的分析 ,并提出了完整的解决方案 .在对 SET付费业务流程中的两个关键性问题用 NDL逻辑进行验证后 ,给出了它们的 Prolog程序流程 .全文着重于在 SET协议中实现“防抵赖”和“可追踪”两种安全机制 ,并在此基础上实现用 Prolog语言程序模拟验证过程 .
This paper analyses the “ k out of n ” problem of SET protocol from all sides,and gives a complete resolution. After the NDL verification of the two key problems in Payment process of SET,this paper gives the Prolog program process of them. It concentrates on how to realize two kinds of secure mechanism “Accountability” and “Traceable”. Based on them, the Prolog program is tried to simulate the verification process. At last,the development of the electronic commerce and the work of the further research are also proposed preliminarily.
出处
《计算机学报》
EI
CSCD
北大核心
2000年第2期202-209,共8页
Chinese Journal of Computers
基金
国家重点基础研究发展规划 (九七三 )!( G19980 3 0 60 0 )
八六三高技术研究发展计划的资助
关键词
电子商务
信息安全
SET协议
计算机网络
electronic commerce,accountability,traceable,information security
