44 citations · 91 across the 11 of their papers we have counts for
4 papers · 1 filter
Defense Against Shortest Path Attacks
Benjamin A. Miller, Zohair Shafi, Wheeler Ruml +3
Identifying shortest paths between nodes in a network is an important task in many applications. Recent work has shown that a malicious actor can manipulate a graph to make traffic…
Attacking Shortest Paths by Cutting Edges
Benjamin A. Miller, Zohair Shafi, Wheeler Ruml +3
Identifying shortest paths between nodes in a network is a common graph analysis problem that is important for many applications involving routing of resources. An adversary that c…
Optimal Edge Weight Perturbations to Attack Shortest Paths
Benjamin A. Miller, Zohair Shafi, Wheeler Ruml +3
Finding shortest paths in a given network (e.g., a computer network or a road network) is a well-studied task with many applications. We consider this task under the presence of an…
PATHATTACK: Attacking Shortest Paths in Complex Networks
Benjamin A. Miller, Zohair Shafi, Wheeler Ruml +3
Shortest paths in complex networks play key roles in many applications. Examples include routing packets in a computer network, routing traffic on a transportation network, and inf…