Recent advances in emerging technologies gave birth to new parading of networks calledInternet of Things (IoT). The emergence of such communicating objects has led practitioners to envision networking a large number of sensors for event monitoring, data collection and filtering. Due to the use of wireless technologies, a secure communication is strongly needed to protect valuable information. Secure group communication is one of the most significant requirements for IoT applications. This employs a group rekeying mechanism for a secure and efficient delivery of data. In this paper, we present a new efficient and scalable rekeying protocol for wireless communicating things. This protocol uses $O(log_2\sqrt[3]n)$ memory complexity, improving significantly the literature works, where n is the network size. Simulation results show that our protocol has better performances than existing works in several criteria.
A Memory-efficient Group Key Managment for Communicating Things / Lakhlef, H.; Bouabdallah, A.; D'Andreagiovanni, F.. - (2020), pp. 29-35. (Intervento presentato al convegno 19th ACM symposium on QoS and Security for Wireless and Mobile Networks, Q2SWinet 2020 tenutosi a esp nel 2020) [10.1145/3416013.3426447].
A Memory-efficient Group Key Managment for Communicating Things
D'Andreagiovanni F.
2020
Abstract
Recent advances in emerging technologies gave birth to new parading of networks calledInternet of Things (IoT). The emergence of such communicating objects has led practitioners to envision networking a large number of sensors for event monitoring, data collection and filtering. Due to the use of wireless technologies, a secure communication is strongly needed to protect valuable information. Secure group communication is one of the most significant requirements for IoT applications. This employs a group rekeying mechanism for a secure and efficient delivery of data. In this paper, we present a new efficient and scalable rekeying protocol for wireless communicating things. This protocol uses $O(log_2\sqrt[3]n)$ memory complexity, improving significantly the literature works, where n is the network size. Simulation results show that our protocol has better performances than existing works in several criteria.| File | Dimensione | Formato | |
|---|---|---|---|
|
2020_QS2Winet_MemoryEfficientKey.pdf
Accesso riservato
Tipologia:
VOR - Versione pubblicata dall'editore
Dimensione
1 MB
Formato
Adobe PDF
|
1 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate

I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris




