Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2347
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPurushothama, B.R.-
dc.contributor.authorShirisha, K.-
dc.contributor.authorAmberker, B.B.-
dc.date.accessioned2025-01-02T09:23:05Z-
dc.date.available2025-01-02T09:23:05Z-
dc.date.issued2012-
dc.identifier.citation10.1007/978-3-642-34135-9_14en_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/2347-
dc.descriptionNITWen_US
dc.description.abstractThe rich literature available for key management schemes for Secure Group Communication focuses on operating only a single group. We consider the operation of simultaneous/concurrent multiple groups in the Secure Group Communication model with overlapping memberships. Designing a secure key management scheme with efficient rekeying process in this scenario is a challenging task. We design an efficient secure group key management scheme for simultaneous multiple groups with overlapping memberships. We propose a new key structure called Binomial Key Tree Queue to manage the keys. Our scheme scales well as the overlapping memberships across the multiple groups increases. We compare the schemes with two schemes which have recently focused on key management protocol design for simultaneous multiple groups. The proposed scheme achieves significant reduction in rekeying cost, storage compared to these schemes. Interestingly, we achieve this efficiency in the rekeying cost without much increase in storage at useren_US
dc.language.isoenen_US
dc.publisherCommunications in Computer and Information Scienceen_US
dc.subjectSimultaneous multiple groupsen_US
dc.subjectBinomial Key Tree Queuen_US
dc.titleSecure Group Key Management Scheme for Simultaneous Multiple Groups with Overlapped Memberships Using Binomial Key Treeen_US
dc.typeOtheren_US
Appears in Collections:Computer Science & Engineering

Files in This Item:
File Description SizeFormat 
978-3-642-34135-9_14.pdf326.51 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.