Observational equivalence and security games: Enhancing the formal analysis of security protocols

被引:0
作者
Cai, Liujia [1 ]
Cai, Guangying [1 ]
Lu, Siqi [1 ]
Li, Guangsong [1 ]
Wang, Yongjuan [1 ]
机构
[1] Henan Key Lab Network Cryptog Technol, Zhengzhou, Peoples R China
基金
中国国家自然科学基金;
关键词
Security protocols; Formal verification; TAMARIN-PROVER; Security game of encryption; Symbolic model; KEY; TOOL;
D O I
10.1016/j.cose.2024.103785
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The formal analysis of security protocols uses abstract language to describe the security protocols, and current protocol descriptions sometimes overlook the security aspects related to cryptographic primitives. In this study, we integrate the security notions of cryptographic primitives with formal methods. Particularly, we use observational equivalence to create security games within the symbolic model. This innovative approach allows for the automation of security detection for cryptographic primitives within the symbolic model. In addition, we have designed and implemented various cryptographic primitives that satisfy different security properties and detect them with our developed security games. The results confirm the effectiveness of our security games. It is worth mentioning that the cryptographic primitives and the characterization of adversary capabilities discussed in this paper can be extended to the formal analysis of other protocols. The ultimate goal is to relax the assumption of perfect encryption and narrow the gap between the formal analysis of security protocols and the real world.
引用
收藏
页数:19
相关论文
共 41 条
  • [1] [Anonymous], 2003, RSA Laboratories Cryptobytes
  • [2] Armando A, 2005, LECT NOTES COMPUT SC, V3576, P281
  • [3] Symbolic verification of privacy-type properties for security protocols with XOR
    Baelde, David
    Delaune, Stephanie
    Gazeau, Ivan
    Kremer, Steve
    [J]. 2017 IEEE 30TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF), 2017, : 234 - 248
  • [4] Basin D, 2021, PROCEEDINGS OF THE 30TH USENIX SECURITY SYMPOSIUM, P179
  • [5] Basin D, 2021, P IEEE S SECUR PRIV, P1766, DOI 10.1109/SP40001.2021.00037
  • [6] A Formal Analysis of 5G Authentication
    Basin, David
    Dreier, Jannik
    Hirschi, Lucca
    Radomirovic, Sasa
    Sasse, Ralf
    Stettler, Vincent
    [J]. PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18), 2018, : 1383 - 1396
  • [7] Automated Symbolic Proofs of Observational Equivalence
    Basin, David
    Dreier, Jannik
    Sasse, Ralf
    [J]. CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, : 1144 - 1155
  • [8] Bellare M., 2001, US Patent, Patent No. 6266771
  • [9] Bellare M., 1995, LNCS, P92, DOI DOI 10.1007/BFB0053428
  • [10] Verified Models and Reference Implementations for the TLS 1.3 Standard Candidate
    Bhargavan, Karthikeyan
    Blanchet, Bruno
    Kobeissi, Nadim
    [J]. 2017 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2017, : 483 - 502