Journal of Software:1999.10(12):1238-1245

Limitations of Kailar Logic
ZHOU Dian-cui,QING Si-han,ZHOU Zhan-fei
Chart / table
Similar Articles
Article :Browse 2629   Download 2422
Received:February 08, 1999    Revised:May 25, 1999
> 中文摘要: 近年来,电子商务协议的设计逐渐成为热点.可追究性是指电子商务协议迫使个人或组织对自己在电子交易中的行为负责的能力.缺乏可追究性,电子交易容易引起争议.因此,Rajashekar Kailar提出了一种用于分析电子商务协议中可追究性的形式化分析方法,简称Kailar逻辑.该文指出这一逻辑的缺陷:(1) 不能分析协议的公平性;(2) 对协议语句的解释及初始化假设是非形式化的,存在局限性;(3) 无法处理密文.
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.
文章编号:     中图分类号:    文献标志码:
基金项目:本文研究得到国家自然科学基金资助. 本文研究得到国家自然科学基金资助.
Foundation items:
Reference text:


ZHOU Dian-cui,QING Si-han,ZHOU Zhan-fei.Limitations of Kailar Logic.Journal of Software,1999,10(12):1238-1245