The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Identifying Encrypted Malware Traffic with Contextual Flow Data
Abstract
Identifying threats contained within encrypted network traffic poses a unique set of challenges. It is important to monitor this traffic for threats and malware, but do so in a way that maintains the integrity of the encryption. Because pattern matching cannot operate on encrypted data, previous approaches have leveraged observable metadata gathered from the flow, e.g., the flow's packet lengths and inter-arrival times. In this work, we extend the current state-of-the-art by considering a data omnia approach. To this end, we develop supervised machine learning models that take advantage of a unique and diverse set of network flow data features. These data features include TLS handshake metadata, DNS contextual flows linked to the encrypted flow, and the HTTP headers of HTTP contextual flows from the same source IP address within a 5 minute window.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Scikit-learn: Machine Learning in Python
(2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2078195 · Cited by 8,539
Approximate Statistical Tests for Comparing Supervised Classification Learning Algorithms
Dietterich, T. G. (1998) · Neural Computation · doi:10.1162/089976698300017197 · Cited by 3,840
Hypertext Transfer Protocol (HTTP)
(2003) · The Hacker's Handbook · doi:10.1201/9780203490044-20 · Cited by 2,824
The Transport Layer Security (TLS) Protocol Version 1.1
Dierks, T., & Rescorla, E. (2006) · doi:10.17487/rfc4346 · Cited by 2,278
Outside the Closed World: On Using Machine Learning for Network Intrusion Detection
Sommer, R., & Paxson, V. (2010) · 2010 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2010.25 · Cited by 2,085
(2011) · IEEE Software · doi:10.1109/ms.2011.67 · Cited by 1,989
The Transport Layer Security (TLS) Protocol Version 1.2
Dierks, T., & Rescorla, E. (2008) · doi:10.17487/rfc5246 · Cited by 1,576
(2004) · IEEE Security & Privacy Magazine · doi:10.1109/msp.2004.9 · Cited by 1,518
Domain names - concepts and facilities
Mockapetris, P. V. (1987) · doi:10.17487/rfc1034 · Cited by 1,467
Cited by
FS-Net: A Flow Sequence Network For Encrypted Traffic Classification
Liu, C., He, L., Xiong, G., Cao, Z., & Li, Z. (2019) · IEEE INFOCOM 2019 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2019.8737507 · Cited by 630
A Distributed Deep Learning System for Web Attack Detection on Edge Devices
Tian, Z., Luo, C., Qiu, J., Du, X., & Guizani, M. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2938778 · Cited by 367
FlowPrint: Semi-Supervised Mobile-App Fingerprinting on Encrypted Network Traffic
van Ede, T., Bortolameotti, R., Continella, A., Ren, J., Dubois, D. J., Lindorfer, M., Choffnes, D., van Steen, M., & Peter, A. (2020) · Proceedings 2020 Network and Distributed System Security Symposium · doi:10.14722/ndss.2020.24412 · Cited by 339
Anderson, B., & McGrew, D. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098163 · Cited by 295
Self-citationLightweight Convolutional Neural Network Based Intrusion Detection System
Sungkyunkwan University, S. A. 1., Pham, V., Seo, E., & Chung, T.-M. (2020) · Journal of Communications · doi:10.12720/jcm.15.11.808-817 · Cited by 27
Metadata
- Authors
- Anderson, B., & McGrew, D.
- Venue
- Proceedings of the 2016 ACM Workshop on Artificial Intelligence and Security
- Publisher
- ACM
- Published
- 2016-10-28
- Pages
- 35-46
- OpenAlex
- W2537766808
- Cited by
- 261
- References
- 38
- FWCI
- 9.49
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Identifying Encrypted Malware Traffic with Contextual Flow Data. https://app.cochat.ai/papers/10.1145/2996758.2996768
- The paper
- Anderson, B., & McGrew, D. (2016). Identifying Encrypted Malware Traffic with Contextual Flow Data. Proceedings of the 2016 ACM Workshop on Artificial Intelligence and Security. https://doi.org/10.1145/2996758.2996768
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.