Regular Paper

Journal of Computer Science and Technology

, Volume 21, Issue 6, pp 932-943

Verification of Authentication Protocols for Epistemic Goals via SAT Compilation

  • Kai-Le SuAffiliated withDepartment of Computer Science, Sun Yat-Sen UniversityInstitute for Integrated and Intelligent Systems, Griffith University, Brisbane
  • , Qing-Liang ChenAffiliated withDepartment of Computer Science, Sun Yat-Sen UniversityDepartment of Computer Science, Brandenburg University of Technology Email author 
  • , Abdul SattarAffiliated withInstitute for Integrated and Intelligent Systems, Griffith University, Brisbane
  • , Wei-Ya YueAffiliated withDepartment of Computer Science, Sun Yat-Sen University
  • , Guan-Feng LvAffiliated withCollege of Computer Science and Technology, Beijing University of Technology
  • , Xi-Zhong ZhengAffiliated withDepartment of Computer Science, Brandenburg University of Technology

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper introduces a new methodology that uses knowledge structures, a specific form of Kripke semantics for epistemic logic, to analyze communication protocols over hostile networks. The paper particularly focuses on automatic verification of authentication protocols. Our approach is based on the actual definitions of a protocol, not on some difficult-to-establish justifications. The proposed methodology is different from many previous approaches to automatic verification of security protocols in that it is justification-oriented instead of falsification-oriented, i.e., finding bugs in a protocol. The main idea is based on observations: separating a principal executing a run of protocol from the role in the protocol, and inferring a principal’s knowledge from the local observations of the principal. And we show analytically and empirically that this model can be easily reduced to Satisfiability (SAT) problem and efficiently implemented by a modern SAT solver.

Keywords

authentication protocol formal verification knowledge structure SAT