6 citations · 13 across the 10 of their papers we have counts for
11 papers
SRLR: Symbolic Regression based Logic Recovery to Counter Programmable Logic Controller Attacks
Hao Zhou, Suman Sourav, Binbin Chen +1
Programmable Logic Controllers (PLCs) are critical components in Industrial Control Systems (ICSs). Their potential exposure to external world makes them susceptible to cyber-attac…
The Throughput Gain of Hypercycle-level Resource Reservation for Time-Triggered Ethernet
Peng Wang, Suman Sourav, Binbin Chen +3
Time-Triggered Communication is a key technology for many safety-critical systems, with applications spanning the areas of aerospace and industrial control. Such communication reli…
Exposing Hidden Attackers in Industrial Control Systems using Micro-distortions
Suman Sourav, Binbin Chen
For industrial control systems (ICS), many existing defense solutions focus on detecting attacks only when they make the system behave anomalously. Instead, in this work, we study…
Machine Learning Assisted Bad Data Detection for High-throughput Substation Communication
Suman Sourav, Partha P. Biswas, Vyshnavi Mohanraj +2
Electrical substations are becoming more prone to cyber-attacks due to increasing digitalization. Prevailing defense measures based on cyber rules are often inadequate to detect at…
Detecting Hidden Attackers in Photovoltaic Systems Using Machine Learning
Suman Sourav, Partha P. Biswas, Binbin Chen +1
In modern smart grids, the proliferation of communication-enabled distributed energy resource (DER) systems has increased the surface of possible cyber-physical attacks. Attacks or…
Distort to Detect, not Affect: Detecting Stealthy Sensor Attacks with Micro-distortion
Suman Sourav, Binbin Chen
In this paper, we propose an effective and easily deployable approach to detect the presence of stealthy sensor attacks in industrial control systems, where (legacy) control device…
Guarding a Polygon Without Losing Touch
Barath Ashok, John Augustine, Aditya Mehekare +3
We study the classical Art Gallery Problem first proposed by Klee in 1973 from a mobile multi-agents perspective. Specifically, we require an optimally small number of agents (also…
Distributed Graph Realizations
John Augustine, Keerti Choudhary, Avi Cohen +3
We study graph realization problems from a distributed perspective and we study it in the node capacitated clique (NCC) model of distributed computing, recently introduced for repr…
Latency, Capacity, and Distributed MST
John Augustine, Seth Gilbert, Fabian Kuhn +2
We study the cost of distributed MST construction in the setting where each edge has a latency and a capacity, along with the weight. Edge latencies capture the delay on the links…
Leader Election in Well-Connected Graphs
Seth Gilbert, Peter Robinson, Suman Sourav
In this paper, we look at the problem of randomized leader election in synchronous distributed networks with a special focus on the message complexity. We provide an algorithm that…
Slow links, fast links, and the cost of gossip
Suman Sourav, Peter Robinson, Seth Gilbert
Consider the classical problem of information dissemination: one (or more) nodes in a network have some information that they want to distribute to the remainder of the network. In…