A novel symbolic model for analyzing Internet of Things protocols based on event logic

IF 5.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Computers & Security Pub Date : 2025-07-01 Epub Date: 2025-03-13 DOI:10.1016/j.cose.2025.104440
Zehuan Li , Meihua Xiao , Yangping Xu , Fangping Chen , Huaibin Shao , Sufen Yan
{"title":"A novel symbolic model for analyzing Internet of Things protocols based on event logic","authors":"Zehuan Li ,&nbsp;Meihua Xiao ,&nbsp;Yangping Xu ,&nbsp;Fangping Chen ,&nbsp;Huaibin Shao ,&nbsp;Sufen Yan","doi":"10.1016/j.cose.2025.104440","DOIUrl":null,"url":null,"abstract":"<div><div>The unique characteristics of the Internet of Things (IoT) make IoT protocols more vulnerable to security risks compared to traditional security protocols. Formal methods are widely used to analyze and verify the security properties of IoT protocols, but existing methods often fail to address the special security mechanisms required in the complex IoT network environment. A novel symbolic model based on event logic is proposed to implement the comprehensive analysis of secure IoT protocols. The model enhances the description of message flow and match, while also extending the inference capabilities of equivalence and injectivity. Aiming at the pre-shared key, cookie, raw public key, and certificate authority in the IoT protocols, a proof system of the model is proposed to prove the security properties of these mechanisms. To improve efficiency, the match buffer reduction method is also presented to eliminate the redundant proof steps. Formal analysis and verification of protocols, including DTLS, SRTP, CoAP, and PUF, uncover several attacks that violate security properties. The results reveal that the proposed symbolic model is an effective method for the formal analysis and proof of IoT protocols.</div></div>","PeriodicalId":51004,"journal":{"name":"Computers & Security","volume":"154 ","pages":"Article 104440"},"PeriodicalIF":5.4000,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Security","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167404825001294","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/13 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The unique characteristics of the Internet of Things (IoT) make IoT protocols more vulnerable to security risks compared to traditional security protocols. Formal methods are widely used to analyze and verify the security properties of IoT protocols, but existing methods often fail to address the special security mechanisms required in the complex IoT network environment. A novel symbolic model based on event logic is proposed to implement the comprehensive analysis of secure IoT protocols. The model enhances the description of message flow and match, while also extending the inference capabilities of equivalence and injectivity. Aiming at the pre-shared key, cookie, raw public key, and certificate authority in the IoT protocols, a proof system of the model is proposed to prove the security properties of these mechanisms. To improve efficiency, the match buffer reduction method is also presented to eliminate the redundant proof steps. Formal analysis and verification of protocols, including DTLS, SRTP, CoAP, and PUF, uncover several attacks that violate security properties. The results reveal that the proposed symbolic model is an effective method for the formal analysis and proof of IoT protocols.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的基于事件逻辑的物联网协议分析符号模型
与传统安全协议相比,物联网(IoT)的独特特性使得物联网协议更容易受到安全风险的影响。形式化方法被广泛用于分析和验证物联网协议的安全特性,但现有方法往往无法解决复杂物联网网络环境中所需的特殊安全机制。为了实现对安全物联网协议的综合分析,提出了一种基于事件逻辑的符号模型。该模型增强了对消息流和匹配的描述,同时扩展了等价性和注入性的推理能力。针对物联网协议中的预共享密钥、cookie、原始公钥和证书颁发机构,提出了该模型的证明体系来证明这些机制的安全性。为了提高效率,还提出了匹配缓冲缩减法,以消除冗余的证明步骤。对协议(包括DTLS、SRTP、CoAP和PUF)的形式化分析和验证揭示了几种违反安全属性的攻击。结果表明,所提出的符号模型是物联网协议形式化分析和证明的有效方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Security
Computers & Security 工程技术-计算机:信息系统
CiteScore
12.40
自引率
7.10%
发文量
365
审稿时长
10.7 months
期刊介绍: Computers & Security is the most respected technical journal in the IT security field. With its high-profile editorial board and informative regular features and columns, the journal is essential reading for IT security professionals around the world. Computers & Security provides you with a unique blend of leading edge research and sound practical management advice. It is aimed at the professional involved with computer security, audit, control and data integrity in all sectors - industry, commerce and academia. Recognized worldwide as THE primary source of reference for applied research and technical expertise it is your first step to fully secure systems.
期刊最新文献
Modeling of physical unclonable functions (PUF): A systematic literature review A hybrid machine learning and cryptography-based predictive probability model for enhancing security and privacy in cloud-IoT environment Empirical assessment of the code comprehension effort needed to attack programs protected with obfuscation Privacy-preserving VPN handshakes with Schnorr-based zero-knowledge proofs Human-factor vulnerabilities of automation in SOCs: A mixed-methods multigroup analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1