摘要
自动信任协商通过协商策略协调协商双方间访问控制策略、信任证的交互披露以逐步建立信任.现有的访问控制策略规则的理论表示缺乏直观性,在分析和构造策略算法时带来不便.本文将有穷自动机形式化定义与自动信任协商相结合,提出一套基于有穷自动机的信任协商定义体系,并构造有穷自动机状态转换图对相应的访问控制策略进行图形化表示,便于分析和构造协商策略.针对积极策略缺乏安全性和谨慎策略缺乏高效性的问题,提出了基于有穷自动机的协商策略,该策略在谨慎策略的基础上加入记忆链结构,以减少协商双方交互次数,提高协商效率.经证明,该策略具备完备性和安全性,并通过仿真实验证明相对于谨慎策略,该策略具备高效性.
Automated Trust Negotiation is used to gradually establish the trust between strangers by negotiation strategies that coordi- nate the strangers to iterative disclosure of access control policies and credentials. The theory expression of access control policies＇ rules lack of the property of directviewing, it goes against to analyze and construct the strategy＇s algorithm. Through the combination of formal definition of finite automaton with trust negotiation, a new definition system of negotiation based on finite automaton was proposed, and the finite automaton transition diagrams were constructed to represent corresponding access control policies equivalently by graphs, it was propitious to analyze and construct strategies. For problems which the eager strategy lacked security and the prudent strategy lacked high efficiency, a finite automaton based strategy was proposed, which was added to a structure called memory chain on the basis of prudent strategy so as to reduce the frequency of the communication and improve the negotiating efficiency. The strate- gy was proved to be provided with completeness and safety, and compared with the prudent strategy, it was also proved to be having better practicability and higher efficiency through simulation experiment.
出处
《小型微型计算机系统》
CSCD
北大核心
2013年第6期1375-1381,共7页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(61073042)资助
关键词
协商策略
有穷自动机状态转换图
访问控制策略
安全披露序列
negotiating strategy
finite automaton transition diagram
access control policy
safe disclosure sequence
