TY - JOUR
T1 - A Mechanism for Communication-Efficient Broadcast Encryption over Wireless Ad Hoc Networks
AU - Curtmola, Reza
AU - Kamara, Seny
N1 - Funding Information:
The authors would like to thank the anonymous reviewers for helpful comments. The second author was supported by a Bell Labs Graduate Research Fellowship.
PY - 2007/4/14
Y1 - 2007/4/14
N2 - Due to its low communication cost, stateful broadcast encryption is an appealing solution for secure content distribution in mobile ad hoc wireless networks (MANETs). Unfortunately, the inherent limitations of MANETs prevent a standard application of such schemes since they require receivers to be online. In this paper, we present a reliable message delivery mechanism for MANETs that is based on erasure codes and that leverages node mobility in order to achieve non-interactive recovery of missed messages. We then show how our mechanism can be used to reliably deliver the key updates of a stateful broadcast encryption scheme. Our solution has several useful properties: it allows trade-offs between the amount of storage required at each node and the speed of message recovery; and it has the ability to leverage the resources of unauthorized nodes. We evaluate the performance of our approach through simulation, and show that it achieves good performance for networks with high node density.
AB - Due to its low communication cost, stateful broadcast encryption is an appealing solution for secure content distribution in mobile ad hoc wireless networks (MANETs). Unfortunately, the inherent limitations of MANETs prevent a standard application of such schemes since they require receivers to be online. In this paper, we present a reliable message delivery mechanism for MANETs that is based on erasure codes and that leverages node mobility in order to achieve non-interactive recovery of missed messages. We then show how our mechanism can be used to reliably deliver the key updates of a stateful broadcast encryption scheme. Our solution has several useful properties: it allows trade-offs between the amount of storage required at each node and the speed of message recovery; and it has the ability to leverage the resources of unauthorized nodes. We evaluate the performance of our approach through simulation, and show that it achieves good performance for networks with high node density.
KW - broadcast encryption
KW - key updates
KW - mobility
KW - reliable message delivery
KW - storage
KW - wireless ad hoc wireless networks
UR - http://www.scopus.com/inward/record.url?scp=34047106767&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34047106767&partnerID=8YFLogxK
U2 - 10.1016/j.entcs.2006.11.009
DO - 10.1016/j.entcs.2006.11.009
M3 - Article
AN - SCOPUS:34047106767
SN - 1571-0661
VL - 171
SP - 57
EP - 69
JO - Electronic Notes in Theoretical Computer Science
JF - Electronic Notes in Theoretical Computer Science
IS - 1 SPEC. ISS.
ER -