A game-theoretic framework for specification and verification of cryptographic protocols

作者：Saleh Mohamed^*; Debbabi Mourad

来源：Formal Aspects of Computing, 2010, 22(5): 585-609.

DOI：10.1007/s00165-009-0129-4

• Security protocols
• Game semantics
• Formal verification
• Model checking

We model security protocols as games using concepts of game semantics. Using this model we ascribe semantics to protocols written in the standard simple arrow notation. According to the semantics, a protocol is interpreted as a set of strategies over a game tree that represents the type of the protocol. The model uses abstract computation functions and message frames in order to model internal computations and knowledge of agents and the intruder. Moreover, in order to specify properties of the model, a logic that deals with games and strategies is developed. A tableau-based proof system is given for the logic, which can serve as a basis for a model checking algorithm. This approach allows us to model a wide range of security protocol types and verify different properties instead of using a variety of methods as is currently the practice. Furthermore, the analyzed protocols are specified using only the simple arrow notation heavily used by protocol designers and by practitioners.

• 出版日期2010-9