Synthesis of Winning Attacks on Communication Protocols using Supervisory Control Theory

02/09/2021
by   Shoma Matsui, et al.
0

There is an increasing need to study the vulnerability of communication protocols in distributed systems to malicious attacks that attempt to violate safety or liveness properties. In this paper, we propose a general methodology for formal synthesis of successful attacks against protocols where the attacker always eventually wins, called For-all attacks. This generalizes previous work on the synthesis of There-exists attacks, where the attacker can sometimes win. As we model protocols and system architectures by finite-state automata, our methodology employs the supervisory control theory of discrete event systems, which is well suited to pose and the synthesis of For-all attacks where the attacker has partial observability and controllability of the system events. We demonstrate our methodology using examples of man-in-the-middle attacks against the Alternating Bit Protocol and the Transmission Control Protocol.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/02/2020

Automated Attacker Synthesis for Distributed Protocols

Distributed protocols should be robust to both benign malfunction (e.g. ...
research
02/18/2022

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

Automated attack discovery techniques, such as attacker synthesis or mod...
research
06/05/2023

Synthesis of Distributed Protocols by Enumeration Modulo Isomorphisms

Synthesis of distributed protocols is a hard, often undecidable, problem...
research
01/22/2022

Long-term Data Sharing under Exclusivity Attacks

The quality of learning generally improves with the scale and diversity ...
research
01/31/2019

Replay Attacks and Defenses against Cross-shard Consensus in Sharded Distributed Ledgers

We present the first replay attacks against sharded distributed ledgers....
research
11/02/2020

Error- and Tamper-Tolerant State Estimation for Discrete Event Systems under Cost Constraints

This paper deals with the state estimation problem in discrete-event sys...
research
06/21/2022

FlashSyn: Flash Loan Attack Synthesis via Counter Example Driven Approximation

In decentralized finance (DeFi) ecosystem, lenders can offer flash loans...

Please sign up or login with your details

Forgot password? Click here to reset