首页 | 官方网站   微博 | 高级检索  
     

Kailar逻辑的缺陷
引用本文:周典萃,卿斯汉,周展飞.Kailar逻辑的缺陷[J].软件学报,1999,10(12):1238-1245.
作者姓名:周典萃  卿斯汉  周展飞
作者单位:1. 中国科学院软件研究所,北京,100080
2. 中国科学院信息安全技术工程研究中心,北京,100080
基金项目:本文研究得到国家自然科学基金资助.
摘    要:近年来,电子商务协议的设计逐渐成为热点.可追究性是指电子商务协议迫使个人或组织对自己在电子交易中的行为负责的能力.缺乏可追究性,电子交易容易引起争议.因此,Rajashekar Kailar提出了一种用于分析电子商务协议中可追究性的形式化分析方法,简称Kailar逻辑.该文指出这一逻辑的缺陷:(1) 不能分析协议的公平性;(2) 对协议语句的解释及初始化假设是非形式化的,存在局限性;(3) 无法处理密文.

关 键 词:可追究性  电子商务  协议  协议分析
收稿时间:2/8/1999 12:00:00 AM
修稿时间:1999/5/25 0:00:00

Limitations of Kailar Logic
ZHOU Dian-cui,QING Si-han and ZHOU Zhan-fei.Limitations of Kailar Logic[J].Journal of Software,1999,10(12):1238-1245.
Authors:ZHOU Dian-cui  QING Si-han and ZHOU Zhan-fei
Affiliation:ZHOU Dian cui\ QING Si han\ ZHOU Zhan fei(Institute of Software\ The Chinese Academy of Sciences\ Beijing\ 100080) (Engineering Research Center for Information Security Technology\ The Chinese Academy of Sciences\ Beijing\ 100080)
Abstract:There is a growing interest in the design and development of electronic commerce protocols. Accountability is the ability to hold individuals or organizations accountable for transactions. Without such assurances, electronic transactions can be susceptible to disputes. Rajashekar Kailar has proposed a framework for the analysis of communication protocols which require accountability. The authors call this framework Kailar logic. In this paper, the authors find this framework has three limitations. Firstly, the framework cannot analyze fairness of protocols. Secondly, articulating initial state assumptions is an informal and error-prone step. At last, the messages with encrypted contents in the protocol cannot be interpreted.
Keywords:Accountability  electronic commerce  protocol  protocol analysis  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号