Large Language Model guided Protocol Fuzzing
Open accessAbstract
How to find security flaws in a protocol implementation without a machine-readable specification of the protocol?Facing the internet, protocol implementations are particularly security-critical software systems where inputs must adhere to a specific structure and order that is often informally specified in hundreds of pages in natural language (RFC).Without some machine-readable version of that protocol, it is difficult to automatically generate valid test inputs for its implementation that follow the required structure and order.It is possible to partially alleviate this challenge using mutational fuzzing on a set of recorded message sequences as seed inputs.However, the set of available seeds is often quite limited and will hardly cover the great diversity of protocol states and input structures.In this paper, we explore the opportunities of systematic interaction with pre-trained large language models (LLMs), which have ingested millions of pages of human-readable protocol specifications, to draw out machine-readable information about the protocol that can be used during protocol fuzzing.We use the knowledge of the LLMs about protocol message types for well-known protocols.We also checked the LLM's capability in detecting "states" for stateful protocol implementations by generating sequences of messages and predicting response codes.Based on these observations, we have developed an LLM-guided protocol implementation fuzzing engine.Our protocol fuzzer CHATAFL constructs grammars for each message type in a protocol, and then mutates messages or predicts the next messages in a message sequence via interactions with LLMs.Experiments on a wide range of real-world protocols from PROFUZZBENCH show significant efficacy in state and code coverage.Our LLMguided stateful fuzzer was compared with state-of-the-art fuzzers AFLNET and NSFUZZ.CHATAFL covers 47.60% and 42.69% more state transitions, 29.55% and 25.75% more states, and 5.81% and 6.74% more code, respectively.Apart from enhanced coverage, CHATAFL discovered nine distinct and previously unknown vulnerabilities in widely-used and extensively-tested protocol implementations while AFLNET and NSFUZZ only discovered three and four of them, respectively.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Meng et al. (2024) discusses how to find security vulnerabilities in protocol implementations in the absence of a machine-readable protocol specification, training LLMs with massive human-readable protocol documents and asking LLMs to mutate interactive messages for protocol fuzz.
“Meng et al. (2024) discusses how to find security vulnerabilities in protocol implementations in the absence of a machine-readable protocol specification. They train LLMs with massive human-readable protocol documents and ask LLMs to mutate interactive messages for protocol fuzz (e.g., HTTP).”
From When LLMs meet cybersecurity: a systematic literature review (2025) · cites this paper as Meng et al. (2024)
Cites
PaLM: Scaling Language Modeling with Pathways
Chowdhery, A., Narang, S., Devlin, J., Bosma, M., Mishra, G., Roberts, A., Barham, P., Chung, H. W., Sutton, C., Gehrmann, S., et al. (2022) · arXiv · doi:10.48550/arxiv.2204.02311 · Cited by 2,590 · see citing works
Evaluating Large Language Models Trained on Code
Chen, M., Tworek, J., Jun, H., Yuan, Q., Pinto, H. P. D. O., Kaplan, J., Edwards, H., Burda, Y., Joseph, N., Brockman, G., et al. (2021) · arXiv · doi:10.48550/arxiv.2107.03374 · Cited by 1,436 · see citing works
Deng, Y., Xia, C. S., Peng, H., Yang, C., & Zhang, L. (2023) · Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis · doi:10.1145/3597926.3598067 · Cited by 326 · see citing works
CodaMosa: Escaping Coverage Plateaus in Test Generation with Pre-trained Large Language Models
Lemieux, C., Inala, J. P., Lahiri, S. K., & Sen, S. (2023) · 2023 IEEE/ACM 45th International Conference on Software Engineering (ICSE) · doi:10.1109/icse48619.2023.00085 · Cited by 306 · cited 1× · see citing works
“For instance, C ODA M OSA [28] was the first to apply LLMs to fuzzing ( i.e., the automatic generation of test cases for Python modules).”
Automated Repair of Programs from Large Language Models
Fan, Z., Gao, X., Mirchev, M., Roychoudhury, A., & Tan, S. H. (2023) · 2023 IEEE/ACM 45th International Conference on Software Engineering (ICSE) · doi:10.1109/icse48619.2023.00128 · Cited by 256 · cited 1× · see citing works
“LLMs have also been proven effective in translating natural language specifications and instructions into executable code [20], [24], [14].”
Self-citationOn the reliability of coverage-based fuzzer benchmarking
Böhme, M., Szekeres, L., & Metzman, J. (2022) · Proceedings of the 44th International Conference on Software Engineering · doi:10.1145/3510003.3510230 · Cited by 104 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
A survey on large language model (LLM) security and privacy: The Good, The Bad, and The Ugly
Yao, Y., Duan, J., Xu, K., Cai, Y., Sun, Z., & Zhang, Y. (2024) · High-Confidence Computing · doi:10.1016/j.hcc.2024.100211 · Cited by 1,083 · see citing works
When LLMs meet cybersecurity: a systematic literature review
Zhang, J., Bu, H., Wen, H., Liu, Y., Fei, H., Xi, R., Li, L., Yang, Y., Zhu, H., & Meng, D. (2025) · Cybersecurity · doi:10.1186/s42400-025-00361-w · Cited by 220 · see citing works
“It aligns token predictions with Abstract Syn-tax Tree (AST) nodes, enabling detailed evaluation and visualization of model predictions.”
Generative AI in cybersecurity: A comprehensive review of LLM applications and vulnerabilities
Ferrag, M. A., Alwahedi, F., Battah, A., Cherif, B., Mechri, A., Tihanyi, N., Bisztray, T., & Debbah, M. (2025) · Internet of Things and Cyber-Physical Systems · doi:10.1016/j.iotcps.2025.01.001 · Cited by 148 · see citing works
Demystifying LLM-Based Software Engineering Agents
Xia, C. S., Deng, Y., Dunn, S., & Zhang, L. (2025) · Proceedings of the ACM on Software Engineering · doi:10.1145/3715754 · Cited by 87 · see citing works
Agentless: Demystifying LLM-based Software Engineering Agents
Xia, C. S., Deng, Y., Dunn, S., & Zhang, L. (2024) · arXiv · doi:10.48550/arxiv.2407.01489 · Cited by 24 · see citing works
“Researchers have applied LLMs to perform fuzzing in domains such as DL libraries [35, 36], OS Kernel [100, 70], compilers [93, 99, 75], network protocols [66], and mobile applications [59].”
MethodNageshwaran, V., & Ezekiel, S. (2026) · Electronics · doi:10.3390/electronics15122740 · Cited by 4 · see citing works
“On vulnerability discovery, KARONTE (Redini et al., IEEE S&P 2020 [107]) and ChatAFL (Meng et al., NDSS 2024 [108]) represent the systems-security firmware-and protocol-fuzzing tradition we flagged as under-represented: KARONTE is a non-LLM multi-binary taint-tracking baseline, whereas ChatAFL uses…”
- Authors
- Meng, R., Mirchev, M., Böhme, M., & Roychoudhury, A.
- Affiliations
- National University of Singapore (SG)
- Max Planck Institute for Security and Privacy (DE)
- Venue
- Proceedings 2024 Network and Distributed System Security Symposium
- Publisher
- Internet Society
- Published
- 2024
- OpenAlex
- W4391724785
- Cited by
- 246
- References
- 6
- Citations by year
- 2026: 83 · 2025: 117 · 2024: 45 · 2023: 1
- FWCI
- 66.66
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Network and Distributed System Security Symposium (publishedVersion)
- Funders
- National Research Foundation
- National Research Foundation Singapore (NRF-NCR25-Fuzz-0001)
- Topics
- Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
- Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
- Keywords
- protocol fuzzing, large language models, protocol vulnerabilities, code coverage, state transitions
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