2007
DOI: 10.24138/jcomss.v3i3.254
|View full text |Cite
|
Sign up to set email alerts
|

Efficient and Secure Multicast in WirelessMAN: A Cross-layer Design

Abstract: Effectively adding security measures to a multicast service is an intriguing problem, especially when the service isdeployed in a wireless setting. Next generation IEEE 802.16standard WirelessMAN networks are a perfect example of this problem, and the latest draft specification of the standard includes a secure protocol solution called Multicast and Broadcast Rekeying Algorithm (MBRA). In this paper, we expose the security problems of MBRA, including non-scalability and omission of backward and forward secrecy… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 15 publications
(26 reference statements)
0
5
0
Order By: Relevance
“…For instance, the initial works for secure multicast and broadcast communication are [8][9]. Later, logical key hierarchy (LKH) [10,11] and one-way function tree (OFT) [12] were proposed. Several other protocol were proposed based on OFT and LKH [11,[13][14][15].…”
Section: Introductionmentioning
confidence: 99%
“…For instance, the initial works for secure multicast and broadcast communication are [8][9]. Later, logical key hierarchy (LKH) [10,11] and one-way function tree (OFT) [12] were proposed. Several other protocol were proposed based on OFT and LKH [11,[13][14][15].…”
Section: Introductionmentioning
confidence: 99%
“…In the event of member change, a rekey message is generated containing each of the new sets of keys encrypted with its respective node's children keys. In [4] and [8], the authors identify the lack of forward and backward secrecy in MBRA architecture. They also discuss the scalability issues in MBRA.…”
Section: Related Workmentioning
confidence: 99%
“…In [9], Huang et al introduces an approach that handles backward and forward secrecy, Efficient sub-Linear rekeying Algorithm with Perfect Secrecy (ELAPSE), and a cross-layer approach for an improved version of ELAPSE, namely ELAPSE+. Both ELAPSE and ELAPSE+ are based on Logical Key Hierarchy(LKH), as described in [4] and [9], that works in O(log n) message complexity. The ELAPSE and ELAPSE+ can handle forward and backward secrecy with a set of KEKs and Sub Group Key Encryption Keys (SGKEK), and works in O(log n) like LKH.…”
Section: Related Workmentioning
confidence: 99%
“…Authors in [22] suggested an improved version of ELASPE called ELAPSE+ using cross layering concept. They assigned fast moving MSs such as cars to specific subgroups, and made the size of those specific subgroups to be smaller than the other subgroups.…”
Section: Rekeying Algorithmsmentioning
confidence: 99%
“…Here, SG 2 divides into two subgroups i.e. SG 21 and SG 22 . The entire number of MSs in each subgroup is labeled in '#MS' field of Figure 13, when the 12th MS enters into the BS coverage area.…”
Section: Upon Member Join Eventmentioning
confidence: 99%