期刊文献+

安全协议的进程代数规约到逻辑程序的自动转换

Auto-Transformation of the Process Algebra Specification of Security Protocols into Logic Programs
下载PDF
导出
摘要 安全协议用于实现开放互连网络的安全通讯,它本质上是分布式并发程序,使用进程代数可以将其描述为角色进程的并发合成系统。使用抽象方法,安全协议角色进程并发合成模型可以转化为逻辑程序;通过计算逻辑程序的不动点,能够对安全协议无穷会话的并发交叠运行进行验证。本文基于Objective Caml语言,实现了安全协议进程代数描述到安全协议逻辑程序的自动转化。 Security protocols are used to provide secure communications over open network, which are essentially concurrent programs in distributed systems, and can be described as a parallel composition system of multiple role-processes by process algebra By using abstract methods, the security protocols' process model can be transformed into a logic program. By computing the fixedpoint of the logic program, we can verify the parallel interleaved operations of the security protocols' infinite sessions. This paper uses the Objective Carol language, and automatically translates the description of process algebra for Security protocols into relative logic programs.
出处 《计算机工程与科学》 CSCD 2006年第1期22-24,27,共4页 Computer Engineering & Science
基金 国家自然科学基金资助项目(90104026 60073001 60473057) 国家863计划资助项目(2002AA144040)
关键词 安全协议 进程代数 形式化验证 认证性 Objective CANAL security protocol process algebra formal verification authentication Objective Canal
  • 相关文献

参考文献6

  • 1李梦君,李舟军,陈火旺.基于进程代数安全协议验证的研究综述[J].计算机研究与发展,2004,41(7):1097-1103. 被引量:25
  • 2李梦君,李舟军,陈火旺.基于逻辑程序的安全协议验证[J].计算机学报,2004,27(10):1361-1368. 被引量:7
  • 3刘凤岐 陈跃新.逻辑程序设计原理和方法[M].长沙:国防科技大学出版社,1987..
  • 4Emmanuel Chailloux, Pascal Manoury, Bruno Pagano. Developing Applications with Objective Caml[M]. O'REILLY & Associates , 2000.
  • 5Xavier Leroy. The Objective Caml System Release 3.06 Documentation and User' s Manual[Z]. Institute National de Recherche en Informatique et en Automatique, 2002.
  • 6R Milner. Communication and Concurrency[M]. Prentice-Hall, 1989.

二级参考文献31

  • 1M Boreale.Symbolic trace analysis of cryptographic protocols.In:Proc of the 28th Int'l Conf on Automata,Language and Prograing (ICALP'01),LNCS 2076.Geneva,Switzerland:Springer-Verlag,2001.667~681
  • 2G Lowe.Breaking and fixing the Needham-Schroeder public-key protocol using FDR.In:Proc of Tools and Algorithms for the Construction and Analysis of Systems (TACAS),LNCS 1055.Passau,Germany:Springer-Verlag,1996.147~166
  • 3L C Paulson.Proving properties of security protocols by induction.In:Proc of the 10th Computer Security Foundation Workshop (CSFW10).Massachusetts:IEEE Computer Society Press,1997.70~83
  • 4F Javier,T Fabrega,J C Herzog,et al.Strand space:Proving security protocols correct.Journal of Computer Security,1999,7(2/3):191~230
  • 5C Boyd,W Mao.On a limitation of BAN logic.In:Advances in Cryptology-EUROCRYPT'93,LNCS 765.Lofthus,Norway:Springer-Verlag,1993.240~247
  • 6M Burrows,M Abadi,R Needham.A logic of authentication.In:Proc of the Royal Society of London,LNCS 426.London:Springer-Verlag,1989.233~271
  • 7L Gong,R Needham,R Yahalom.Reasoning about belief in cryptographic protocols.In:IEEE Symp on Research in Security and Privacy.Oakland:IEEE Computer Society Press,1990.234~248
  • 8P Syverson,C Meadows,I Cervesato.Dolev-Yao is no better than machiavelli.The 1st Workshop on Issues in the Theory of Security (WITS'00),Geneva,Switzerland,2000
  • 9D Dolev,A C Yao.On the security of public-key protocols.IEEE Trans on Information Theory,1983,2(29):198~208
  • 10D Sangiorgi,D Walker.The π Calculus:A Theory of Mobile Processes.England:Cambridge University Press,2001.20~50

共引文献27

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部