mlsanityData to 14 Oct 2026

Automated Attack Synthesis by Extracting Finite State Machines from Protocol Specification Documents

arXiv 2202.09470 ↗First posted 18 Feb 2022cs.CR cs.CL cs.FLcited by 8

Not on the map. Why?

Abstract (arXiv)

Automated attack discovery techniques, such as attacker synthesis or model-based fuzzing, provide powerful ways to ensure network protocols operate correctly and securely. Such techniques, in general, require a formal representation of the protocol, often in the form of a finite state machine (FSM). Unfortunately, many protocols are only described in English prose, and implementing even a simple network protocol as an FSM is time-consuming and prone to subtle logical errors. Automatically extracting protocol FSMs from documentation can significantly contribute to increased use of these techniques and result in more robust and secure protocol implementations. In this work we focus on attacker synthesis as a representative technique for protocol security, and on RFCs as a representative format for protocol prose description. Unlike other works that rely on rule-based approaches or use off-the-shelf NLP tools directly, we suggest a data-driven approach for extracting FSMs from RFC documents. Specifically, we use a hybrid approach consisting of three key steps: (1) large-scale word-representation learning for technical language, (2) focused zero-shot learning for mapping protocol text to a protocol-independent information language, and (3) rule-based mapping from protocol-independent information to a specific protocol FSM. We show the generalizability of our FSM extraction by using the RFCs for six different protocols: BGPv4, DCCP, LTP, PPTP, SCTP and TCP. We demonstrate how automated extraction of an FSM from an RFC can be applied to the synthesis of attacks, with TCP and DCCP as case-studies. Our approach shows that it is possible to automate attacker synthesis against protocols by using textual specifications such as RFCs.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 17 of its 72 references that are in the map. First posted on arXiv 18 Feb 2022.

Builds on

17 of 72 references.

References · 17

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  4. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  5. 2018Deep contextualized word representationscited by 2,290
  6. 2020Don't Stop Pretraining: Adapt Language Models to Domains and Taskscited by 1,565
  7. 2016Neural Architectures for Named Entity Recognitioncited by 550
  8. 2018AllenNLP: A Deep Semantic Natural Language Processing Platformcited by 347
  9. 2016End-to-end Sequence Labeling via Bi-directional LSTM-CNNs-CRFcited by 341
  10. 2019Entity, Relation, and Event Extraction with Contextualized Span Representationscited by 262
  11. 2015Named Entity Recognition with Bidirectional LSTM-CNNscited by 201
  12. 2017Learning Structured Natural Language Representations for Semantic Parsingcited by 15
5 more
  1. 2020Semi-Automated Protocol Disambiguation and Code Generationcited by 9
  2. 2018Leveraging Textual Specifications for Grammar-based Fuzzing of Network Protocolscited by 3
  3. 2014Synthesizing Finite-state Protocols from Scenarios and Requirementscited by 2
  4. 2020Automated Attacker Synthesis for Distributed Protocolscited by 1
  5. 2021Counterexample Classificationcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 3; 2026: 3.

8 papers.