SODA

GREP: a Group REkeying Protocol Based on Member Join History

Tiloca, Marco and Dini, Gianluca (2016) GREP: a Group REkeying Protocol Based on Member Join History. In: The twenty-first IEEE Symposium on Computers and Communications (ISCC 2016), 27-30 June 2016, Messina (Italy).

[img]
Preview
PDF (Preprint) - Accepted Version
438Kb

Official URL: http://ieeexplore.ieee.org/document/7543761/

Abstract

This paper presents GREP, a highly scalable and efficient group rekeying protocol with the following merits. First, it rekeys the group with only two messages, introducing an overhead which is small, constant, and independent of the group size. Second, GREP considers collusion as a first-class attack. Third, GREP efficiently recovers the group from a collusion attack without recourse to a total member reinitialization. The recovery cost smoothly grows with the group size, and gradually increases with the attack severity. GREP achieves these results by organizing nodes into logical subgroups and exploiting the history of node joining events. This allows GREP to establish a total ordering among subgroups and among nodes in each subgroup, so making collusion recovery highly scalable and efficient. We evaluate performance from several standpoints, and show that GREP is deployable in large-scale networks of customary, even resource constrained, platforms.

Item Type:Conference or Workshop Item (Paper)
ID Code:6045
Deposited By:Marco Tiloca
Deposited On:29 Aug 2016 15:25
Last Modified:29 Aug 2016 15:25

Repository Staff Only: item control page