SlimBox:对加密流量进行轻量级数据包检测

IF 7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Qin Liu, Yu Peng, Hongbo Jiang, Jie Wu, Tian Wang, Tao Peng, Guojun Wang
{"title":"SlimBox:对加密流量进行轻量级数据包检测","authors":"Qin Liu, Yu Peng, Hongbo Jiang, Jie Wu, Tian Wang, Tao Peng, Guojun Wang","doi":"10.1109/TDSC.2022.3222533","DOIUrl":null,"url":null,"abstract":"Due to the explosive increase of enterprise network traffic, middleboxes that inspect packets through customized rules have been widely outsourced for cost-saving. Despite promising, redirecting enterprise traffic to remote middleboxes raises privacy concerns about the exposure of corporate secrets. To address this, existing solutions mainly apply searchable encryption (SE) to encrypt traffic and rules, enabling middlebox to perform pattern matching over ciphertexts without learning any sensitive information. However, SE is designed for searching pre-chosen keywords, and may cause extensive costs when applied directly to inspecting traffic in which the keywords cannot be determined in advance. The inefficiency of existing SE-based approaches motivates us to investigate a privacy-preserving and lightweight middlebox. To this end, this paper designs <inline-formula><tex-math notation=\"LaTeX\">$\\mathsf{SlimBox}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"sans-serif\">SlimBox</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq1-3222533.gif\"/></alternatives></inline-formula>, which rapidly screens out potentially malicious packets in constant time while incurring only moderate communication overhead. Our main idea is to fragment a traffic/rule string into sub-patterns to achieve conjunctive sub-pattern matching over ciphertexts, while incorporating the position information into the secure matching process to avoid false positives. Experiment results on real datasets show that <inline-formula><tex-math notation=\"LaTeX\">$\\mathsf{SlimBox}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"sans-serif\">SlimBox</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq2-3222533.gif\"/></alternatives></inline-formula> can achieve a good tradeoff between matching latency and communication cost compared to prior work.","PeriodicalId":13047,"journal":{"name":"IEEE Transactions on Dependable and Secure Computing","volume":"20 1","pages":"4359-4371"},"PeriodicalIF":7.0000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"SlimBox: Lightweight Packet Inspection over Encrypted Traffic\",\"authors\":\"Qin Liu, Yu Peng, Hongbo Jiang, Jie Wu, Tian Wang, Tao Peng, Guojun Wang\",\"doi\":\"10.1109/TDSC.2022.3222533\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the explosive increase of enterprise network traffic, middleboxes that inspect packets through customized rules have been widely outsourced for cost-saving. Despite promising, redirecting enterprise traffic to remote middleboxes raises privacy concerns about the exposure of corporate secrets. To address this, existing solutions mainly apply searchable encryption (SE) to encrypt traffic and rules, enabling middlebox to perform pattern matching over ciphertexts without learning any sensitive information. However, SE is designed for searching pre-chosen keywords, and may cause extensive costs when applied directly to inspecting traffic in which the keywords cannot be determined in advance. The inefficiency of existing SE-based approaches motivates us to investigate a privacy-preserving and lightweight middlebox. To this end, this paper designs <inline-formula><tex-math notation=\\\"LaTeX\\\">$\\\\mathsf{SlimBox}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\\\"sans-serif\\\">SlimBox</mml:mi></mml:math><inline-graphic xlink:href=\\\"wang-ieq1-3222533.gif\\\"/></alternatives></inline-formula>, which rapidly screens out potentially malicious packets in constant time while incurring only moderate communication overhead. Our main idea is to fragment a traffic/rule string into sub-patterns to achieve conjunctive sub-pattern matching over ciphertexts, while incorporating the position information into the secure matching process to avoid false positives. Experiment results on real datasets show that <inline-formula><tex-math notation=\\\"LaTeX\\\">$\\\\mathsf{SlimBox}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\\\"sans-serif\\\">SlimBox</mml:mi></mml:math><inline-graphic xlink:href=\\\"wang-ieq2-3222533.gif\\\"/></alternatives></inline-formula> can achieve a good tradeoff between matching latency and communication cost compared to prior work.\",\"PeriodicalId\":13047,\"journal\":{\"name\":\"IEEE Transactions on Dependable and Secure Computing\",\"volume\":\"20 1\",\"pages\":\"4359-4371\"},\"PeriodicalIF\":7.0000,\"publicationDate\":\"2023-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Dependable and Secure Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1109/TDSC.2022.3222533\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Dependable and Secure Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/TDSC.2022.3222533","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 3

摘要

随着企业网络流量的爆炸式增长,通过自定义规则检测报文的中间件被广泛外包,以节省成本。尽管前景看好,但将企业流量重定向到远程中间件会引发对企业机密暴露的隐私担忧。为了解决这个问题,现有的解决方案主要应用可搜索加密(SE)来加密流量和规则,使middlebox能够在不学习任何敏感信息的情况下对密文执行模式匹配。但是,SE是为搜索预先选择的关键字而设计的,如果直接应用到无法提前确定关键字的流量检测中,可能会造成很大的成本。现有的基于se的方法效率低下,这促使我们研究一种保护隐私和轻量级的中间盒。为此,本文设计了$\mathsf{SlimBox}$SlimBox,它在恒定时间内快速筛选出潜在的恶意数据包,同时只产生适度的通信开销。我们的主要思想是将流量/规则字符串分割成子模式,以实现密文上的联合子模式匹配,同时将位置信息纳入安全匹配过程,以避免误报。在真实数据集上的实验结果表明,与之前的工作相比,$\mathsf{SlimBox}$SlimBox可以很好地平衡匹配延迟和通信成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SlimBox: Lightweight Packet Inspection over Encrypted Traffic
Due to the explosive increase of enterprise network traffic, middleboxes that inspect packets through customized rules have been widely outsourced for cost-saving. Despite promising, redirecting enterprise traffic to remote middleboxes raises privacy concerns about the exposure of corporate secrets. To address this, existing solutions mainly apply searchable encryption (SE) to encrypt traffic and rules, enabling middlebox to perform pattern matching over ciphertexts without learning any sensitive information. However, SE is designed for searching pre-chosen keywords, and may cause extensive costs when applied directly to inspecting traffic in which the keywords cannot be determined in advance. The inefficiency of existing SE-based approaches motivates us to investigate a privacy-preserving and lightweight middlebox. To this end, this paper designs $\mathsf{SlimBox}$SlimBox, which rapidly screens out potentially malicious packets in constant time while incurring only moderate communication overhead. Our main idea is to fragment a traffic/rule string into sub-patterns to achieve conjunctive sub-pattern matching over ciphertexts, while incorporating the position information into the secure matching process to avoid false positives. Experiment results on real datasets show that $\mathsf{SlimBox}$SlimBox can achieve a good tradeoff between matching latency and communication cost compared to prior work.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Dependable and Secure Computing
IEEE Transactions on Dependable and Secure Computing 工程技术-计算机:软件工程
CiteScore
11.20
自引率
5.50%
发文量
354
审稿时长
9 months
期刊介绍: The "IEEE Transactions on Dependable and Secure Computing (TDSC)" is a prestigious journal that publishes high-quality, peer-reviewed research in the field of computer science, specifically targeting the development of dependable and secure computing systems and networks. This journal is dedicated to exploring the fundamental principles, methodologies, and mechanisms that enable the design, modeling, and evaluation of systems that meet the required levels of reliability, security, and performance. The scope of TDSC includes research on measurement, modeling, and simulation techniques that contribute to the understanding and improvement of system performance under various constraints. It also covers the foundations necessary for the joint evaluation, verification, and design of systems that balance performance, security, and dependability. By publishing archival research results, TDSC aims to provide a valuable resource for researchers, engineers, and practitioners working in the areas of cybersecurity, fault tolerance, and system reliability. The journal's focus on cutting-edge research ensures that it remains at the forefront of advancements in the field, promoting the development of technologies that are critical for the functioning of modern, complex systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信