SlimBox: Lightweight Packet Inspection over Encrypted Traffic

被引:6
作者
Liu, Qin [1 ]
Peng, Yu [1 ]
Jiang, Hongbo [1 ]
Wu, Jie [2 ]
Wang, Tian [3 ,4 ]
Peng, Tao [5 ]
Wang, Guojun [5 ]
机构
[1] Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Hunan, Peoples R China
[2] Temple Univ, Dept Comp & Informat Sci, Philadelphia, PA 19122 USA
[3] Beijing Normal Univ, Inst Artificial Intelligence & Future Networks, Zhuhai 519000, Guangdong, Peoples R China
[4] UIC, Zhuhai 519000, Guangdong, Peoples R China
[5] Guangzhou Univ, Sch Comp Sci & Cyber Engn, Guangzhou 510006, Guangdong, Peoples R China
关键词
Cryptography; Middleboxes; Pattern matching; Payloads; Privacy; Encryption; Servers; Outsourced middlebox; privacy preserving; lightweight; pattern matching; searchable encryption;
D O I
10.1109/TDSC.2022.3222533
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 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 subpatterns 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 SlimBox can achieve a good tradeoff between matching latency and communication cost compared to prior work.
引用
收藏
页码:4359 / 4371
页数:13
相关论文
共 32 条
  • [1] [Anonymous], 2015, An open source intrusion prevention system
  • [2] Bkakria Anis, 2020, Advances in Cryptology - ASIACRYPT 2020. 26th International Conference on the Theory and Application of Cryptology and Information Security. Proceedings. Lecture Notes in Computer Science (LNCS 12492), P191, DOI 10.1007/978-3-030-64834-3_7
  • [3] A Survey of Provably Secure Searchable Encryption
    Bosch, Christoph
    Hartel, Pieter
    Jonker, Willem
    Peter, Andreas
    [J]. ACM COMPUTING SURVEYS, 2015, 47 (02)
  • [4] BlindIDS: Market-Compliant and Privacy-Friendly Intrusion Detection System over Encrypted Traffic
    Canard, Sebastien
    Diop, Aida
    Kheir, Nizar
    Paindavoine, Marie
    Sabt, Mohamed
    [J]. PROCEEDINGS OF THE 2017 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (ASIA CCS'17), 2017, : 561 - 574
  • [5] Leakage-Abuse Attacks Against Searchable Encryption
    Cash, David
    Grubbs, Paul
    Perry, Jason
    Ristenpart, Thomas
    [J]. CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, : 668 - 679
  • [6] Cash D, 2013, LECT NOTES COMPUT SC, V8042, P353, DOI 10.1007/978-3-642-40041-4_20
  • [7] SgxPectre: Stealing Intel Secrets From SGX Enclaves via Speculative Execution
    Chen, Guoxing
    Chen, Sanchuan
    Xiao, Yuan
    Zhang, Yinqian
    Lin, Zhiqiang
    Lai, Ten-Hwang
    [J]. IEEE SECURITY & PRIVACY, 2020, 18 (03) : 28 - 37
  • [8] Choi B, 2016, 13TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION (NSDI '16), P551
  • [9] De Caro A, 2011, IEEE SYMP COMP COMMU
  • [10] Desmoulins Nicolas, 2018, Advances in Cryptology - ASIACRYPT 2018. 24th International Conference on the Theory and Application of Cryptology and Information Security. Proceedings: Lecture Notes in Computer Science (LNCS 11272), P121, DOI 10.1007/978-3-030-03326-2_5