Abstract
We investigate an understudied threat: networks of stealthy routers (S-Routers), communicating across a restricted area. S-Routers use short-range, low-energy communication, detectable only by nearby devices. We examine algorithms to intercept S-Routers, using one or more mobile devices, called Interceptors. We focus on Destination-Search scenarios, in which the goal of the Interceptors is to find a (single) destination S-Router, by detecting transmissions along one or more paths from a given (single) source S-Router. We evaluate the algorithms analytically and experimentally (simulations), including against a parametric, optimized S-Routers algorithm. Our main result is an Interceptors algorithm which bounds the expected time until the destination is found to O(NB^log2(N)), where N is the number of S-Routers and B^ is the average rate of transmission.
Original language | English |
---|---|
Title of host publication | Cyber Security Cryptography and Machine Learning - Second International Symposium, CSCML 2018, Proceedings |
Editors | Itai Dinur, Shlomi Dolev, Sachin Lodha |
Publisher | Springer Verlag |
Pages | 188-205 |
Number of pages | 18 |
ISBN (Print) | 9783319941462 |
DOIs | |
State | Published - 2018 |
Event | 2nd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2018 - Beer-Sheva, Israel Duration: 21 Jun 2018 → 22 Jun 2018 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 10879 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 2nd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2018 |
---|---|
Country/Territory | Israel |
City | Beer-Sheva |
Period | 21/06/18 → 22/06/18 |
Bibliographical note
Publisher Copyright:© 2018, Springer International Publishing AG, part of Springer Nature.