TY - GEN
T1 - Untraceability of mobile devices in wireless mesh networks using linear network coding
AU - Wang, Jin
AU - Lu, Kejie
AU - Wang, Jianping
AU - Qiao, Chunming
PY - 2013
Y1 - 2013
N2 - To protect user privacy in wireless mesh networks (WMNs), it is important to address two major challenges, namely: flow untraceability and movement untraceability, which prevent malicious attackers from deducing the flow paths and the movement tracks of mobile devices. For these two privacy requirements, most existing approaches rely on encrypting the whole packet, appending random padding, and applying random delay for each message at every intermediate node, resulting in significant computational and communication overheads. Recently, linear network coding (LNC) has been introduced as an alternative but the global encoding vectors (GEVs) of coded messages have to be encrypted so as to conceal the relationships between the incoming and outgoing messages. In this paper, we aim to explore the potential of LNC to ensure the flow untraceability and movement untraceability. Specifically, we first determine the necessary and sufficient condition, with which the two privacy requirements can be achieved without encrypting either GEVs or message contents. We then design a deterministic untraceable LNC (ULNC) scheme to provide flow untraceability and movement untraceability when the sufficient and necessary condition is satisfied. Finally, we discuss the effectiveness of the proposed ULNC scheme against traffic analysis attacks in WMNs. © 2013 IEEE.
AB - To protect user privacy in wireless mesh networks (WMNs), it is important to address two major challenges, namely: flow untraceability and movement untraceability, which prevent malicious attackers from deducing the flow paths and the movement tracks of mobile devices. For these two privacy requirements, most existing approaches rely on encrypting the whole packet, appending random padding, and applying random delay for each message at every intermediate node, resulting in significant computational and communication overheads. Recently, linear network coding (LNC) has been introduced as an alternative but the global encoding vectors (GEVs) of coded messages have to be encrypted so as to conceal the relationships between the incoming and outgoing messages. In this paper, we aim to explore the potential of LNC to ensure the flow untraceability and movement untraceability. Specifically, we first determine the necessary and sufficient condition, with which the two privacy requirements can be achieved without encrypting either GEVs or message contents. We then design a deterministic untraceable LNC (ULNC) scheme to provide flow untraceability and movement untraceability when the sufficient and necessary condition is satisfied. Finally, we discuss the effectiveness of the proposed ULNC scheme against traffic analysis attacks in WMNs. © 2013 IEEE.
UR - http://www.scopus.com/inward/record.url?scp=84883063317&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84883063317&origin=recordpage
U2 - 10.1109/INFCOM.2013.6566777
DO - 10.1109/INFCOM.2013.6566777
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 978-1-4673-5944-3
T3 - Proceedings - IEEE INFOCOM
SP - 270
EP - 274
BT - 2013 Proceedings IEEE INFOCOM
PB - IEEE
T2 - 32nd IEEE Conference on Computer Communications (IEEE INFOCOM 2013)
Y2 - 14 April 2013 through 19 April 2013
ER -