PrivBox: Privacy-Preserving Deep Packet Inspection With Dual Double-Masking Obfuscated Rule Generation
Many network middleboxes have been deployed to perform <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">deep packet inspection</i> (DPI) over packet payloads. However, such middleboxes cannot accomplish their tasks when the traffic is encrypted. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">BlindBox</i> (SIGCOMM 2015) provided the first solution for performing DPI over encrypted traffic. To improve its efficiency, a later proposal <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">PrivDPI</i> (CCS 2019) introduced a practical technique to generate encrypted rules. However, a recent proposal <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">P2DPI</i> (ASIACCS 2021) showed that the rule generator in PrivDPI can comprise the user's privacy. In this paper, we present a new attack on P2DPI and show that the privacy of its endpoints can still be compromised by the rule generator. We comprehensively analyze the vulnerability of prior studies and present <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">PrivBox</i>, a new DPI system that achieves the same privacy guarantee as BlindBox while maintaining practical efficiency. This is based on a new technique called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">dual double-masking obfuscated rule generation</i>. For a ruleset of 3,000, PrivBox achieves connection establishment time on the endpoint side comparable to PrivDPI and supports up to 4,672 token encryptions per second, which is sufficient for a number of real-world applications. Overall, our experiment demonstrates that PrivBox is practical and well-suited for short, frequently established sessions, especially when token repeating is common.
Authors
- Kaitai Liang (ORCID: https://orcid.org/0000-0003-0262-7678)
- Pengfei Wu (ORCID: https://orcid.org/0000-0003-0896-9476)
- Xinyi Huang (ORCID: https://orcid.org/0000-0003-0070-1707)
- Rongmao Chen (ORCID: https://orcid.org/0000-0002-5113-387X)
- Kai Zhang (ORCID: https://orcid.org/0000-0001-9728-4051)
- Jianting Ning (ORCID: https://orcid.org/0000-0001-7165-398X)
Institutions
- Jinan University (CN)
- National University of Defense Technology (CN)
- Shanghai University of Electric Power (CN)
- Wuhan University (CN)
- Delft University of Technology (NL)
Publication Details
- Journal
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2025-04-03
- DOI
- https://doi.org/10.1109/tdsc.2025.3557423
- Citations
- 1
- Primary Topic
- Internet Traffic Analysis and Secure E-voting
- Type
- article
- Field-Weighted Citation Impact
- 2.48