Improving robustness of a popular probabilistic clustering algorithm against insider attacks

Sayed M. Sayed; Tom La Porta; Simone Silvestri; Patrick McDaniel

doi:10.1007/978-3-030-63086-7_21

Improving robustness of a popular probabilistic clustering algorithm against insider attacks

Sayed M. Sayed, Tom La Porta, Simone Silvestri, Patrick McDaniel

Producción científica: Conference contribution › revisión exhaustiva

Resumen

Many clustering algorithms for mesh, ad hoc and Wireless Sensor Networks have been proposed. Probabilistic approaches are a popular class of such algorithms. However, it is essential to analyze their robustness against security compromise. We study the robustness of EEHCA, a popular energy efficient clustering algorithm as an example of probabilistic class in terms of security compromise. In this paper, we investigate attacks on EEHCA through analysis and experimental simulations. We analytically characterize two different attack models. In the first attack model, the attacker aims to gain control over the network by stealing network traffic, or by disrupting the data aggregation process (integrity attack). In the second attack model, the inducement of the attacker is to abridge the network lifetime (denial of service attack). We assume the clustering algorithm is running periodically and propose a detection solution by exploiting Bernoulli CUSUM charts.

Idioma original	English
Título de la publicación alojada	Security and Privacy in Communication Networks - 16th EAI International Conference, SecureComm 2020, Proceedings
Editores	Noseong Park, Kun Sun, Sara Foresti, Kevin Butler, Nitesh Saxena
Páginas	381-401
Número de páginas	21
DOI	https://doi.org/10.1007/978-3-030-63086-7_21
Estado	Published - 2020
Evento	16th International Conference on Security and Privacy in Communication Networks, SecureComm 2020 - Washington, United States Duración: oct 21 2020 → oct 23 2020

Serie de la publicación

Nombre	Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
Volumen	335
ISSN (versión impresa)	1867-8211

Conference

Conference	16th International Conference on Security and Privacy in Communication Networks, SecureComm 2020
País/Territorio	United States
Ciudad	Washington
Período	10/21/20 → 10/23/20

Nota bibliográfica

Publisher Copyright:
© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2020.

Financiación

Acknowledgments. Research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.

Financiadores	Número del financiador
Army Research Laboratory	W911NF-13-2-0045
Army Research Laboratory

ASJC Scopus subject areas

Computer Networks and Communications

Acceder al documento

10.1007/978-3-030-63086-7_21

Otros archivos y enlaces

Citar esto

Sayed, S. M., La Porta, T., Silvestri, S., & McDaniel, P. (2020). Improving robustness of a popular probabilistic clustering algorithm against insider attacks. En N. Park, K. Sun, S. Foresti, K. Butler, & N. Saxena (Eds.), Security and Privacy in Communication Networks - 16th EAI International Conference, SecureComm 2020, Proceedings (pp. 381-401). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol. 335). https://doi.org/10.1007/978-3-030-63086-7_21

Sayed, Sayed M. ; La Porta, Tom ; Silvestri, Simone et al. / Improving robustness of a popular probabilistic clustering algorithm against insider attacks. Security and Privacy in Communication Networks - 16th EAI International Conference, SecureComm 2020, Proceedings. editor / Noseong Park ; Kun Sun ; Sara Foresti ; Kevin Butler ; Nitesh Saxena. 2020. pp. 381-401 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST).

@inproceedings{610bcfce61c242f8846b406b43f5e7d2,

title = "Improving robustness of a popular probabilistic clustering algorithm against insider attacks",

abstract = "Many clustering algorithms for mesh, ad hoc and Wireless Sensor Networks have been proposed. Probabilistic approaches are a popular class of such algorithms. However, it is essential to analyze their robustness against security compromise. We study the robustness of EEHCA, a popular energy efficient clustering algorithm as an example of probabilistic class in terms of security compromise. In this paper, we investigate attacks on EEHCA through analysis and experimental simulations. We analytically characterize two different attack models. In the first attack model, the attacker aims to gain control over the network by stealing network traffic, or by disrupting the data aggregation process (integrity attack). In the second attack model, the inducement of the attacker is to abridge the network lifetime (denial of service attack). We assume the clustering algorithm is running periodically and propose a detection solution by exploiting Bernoulli CUSUM charts.",

keywords = "Anomaly detection, CUSUM test, Probabilistic clustering algorithm",

author = "Sayed, \{Sayed M.\} and \{La Porta\}, Tom and Simone Silvestri and Patrick McDaniel",

note = "Publisher Copyright: {\textcopyright} ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2020.; 16th International Conference on Security and Privacy in Communication Networks, SecureComm 2020 ; Conference date: 21-10-2020 Through 23-10-2020",

year = "2020",

doi = "10.1007/978-3-030-63086-7\_21",

language = "English",

isbn = "9783030630850",

series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST",

pages = "381--401",

editor = "Noseong Park and Kun Sun and Sara Foresti and Kevin Butler and Nitesh Saxena",

booktitle = "Security and Privacy in Communication Networks - 16th EAI International Conference, SecureComm 2020, Proceedings",

}

Sayed, SM, La Porta, T, Silvestri, S & McDaniel, P 2020, Improving robustness of a popular probabilistic clustering algorithm against insider attacks. En N Park, K Sun, S Foresti, K Butler & N Saxena (eds.), Security and Privacy in Communication Networks - 16th EAI International Conference, SecureComm 2020, Proceedings. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, vol. 335, pp. 381-401, 16th International Conference on Security and Privacy in Communication Networks, SecureComm 2020, Washington, United States, 10/21/20. https://doi.org/10.1007/978-3-030-63086-7_21

Improving robustness of a popular probabilistic clustering algorithm against insider attacks. / Sayed, Sayed M.; La Porta, Tom; Silvestri, Simone et al.
Security and Privacy in Communication Networks - 16th EAI International Conference, SecureComm 2020, Proceedings. ed. / Noseong Park; Kun Sun; Sara Foresti; Kevin Butler; Nitesh Saxena. 2020. p. 381-401 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol. 335).

Producción científica: Conference contribution › revisión exhaustiva

TY - GEN

T1 - Improving robustness of a popular probabilistic clustering algorithm against insider attacks

AU - Sayed, Sayed M.

AU - La Porta, Tom

AU - Silvestri, Simone

AU - McDaniel, Patrick

N1 - Publisher Copyright: © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2020.

PY - 2020

Y1 - 2020

N2 - Many clustering algorithms for mesh, ad hoc and Wireless Sensor Networks have been proposed. Probabilistic approaches are a popular class of such algorithms. However, it is essential to analyze their robustness against security compromise. We study the robustness of EEHCA, a popular energy efficient clustering algorithm as an example of probabilistic class in terms of security compromise. In this paper, we investigate attacks on EEHCA through analysis and experimental simulations. We analytically characterize two different attack models. In the first attack model, the attacker aims to gain control over the network by stealing network traffic, or by disrupting the data aggregation process (integrity attack). In the second attack model, the inducement of the attacker is to abridge the network lifetime (denial of service attack). We assume the clustering algorithm is running periodically and propose a detection solution by exploiting Bernoulli CUSUM charts.

AB - Many clustering algorithms for mesh, ad hoc and Wireless Sensor Networks have been proposed. Probabilistic approaches are a popular class of such algorithms. However, it is essential to analyze their robustness against security compromise. We study the robustness of EEHCA, a popular energy efficient clustering algorithm as an example of probabilistic class in terms of security compromise. In this paper, we investigate attacks on EEHCA through analysis and experimental simulations. We analytically characterize two different attack models. In the first attack model, the attacker aims to gain control over the network by stealing network traffic, or by disrupting the data aggregation process (integrity attack). In the second attack model, the inducement of the attacker is to abridge the network lifetime (denial of service attack). We assume the clustering algorithm is running periodically and propose a detection solution by exploiting Bernoulli CUSUM charts.

KW - Anomaly detection

KW - CUSUM test

KW - Probabilistic clustering algorithm

UR - http://www.scopus.com/inward/record.url?scp=85098248099&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85098248099&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-63086-7_21

DO - 10.1007/978-3-030-63086-7_21

M3 - Conference contribution

AN - SCOPUS:85098248099

SN - 9783030630850

T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

SP - 381

EP - 401

BT - Security and Privacy in Communication Networks - 16th EAI International Conference, SecureComm 2020, Proceedings

A2 - Park, Noseong

A2 - Sun, Kun

A2 - Foresti, Sara

A2 - Butler, Kevin

A2 - Saxena, Nitesh

T2 - 16th International Conference on Security and Privacy in Communication Networks, SecureComm 2020

Y2 - 21 October 2020 through 23 October 2020

ER -

Sayed SM, La Porta T, Silvestri S, McDaniel P. Improving robustness of a popular probabilistic clustering algorithm against insider attacks. En Park N, Sun K, Foresti S, Butler K, Saxena N, editores, Security and Privacy in Communication Networks - 16th EAI International Conference, SecureComm 2020, Proceedings. 2020. p. 381-401. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST). doi: 10.1007/978-3-030-63086-7_21

Improving robustness of a popular probabilistic clustering algorithm against insider attacks

Resumen

Serie de la publicación

Conference

Nota bibliográfica

Financiación

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto