TY - GEN
T1 - Anonymous communications in mobile ad hoc networks
AU - Zhang, Yanchao
AU - Liu, Wei
AU - Lou, Wenjing
PY - 2005
Y1 - 2005
N2 - Due to the broadcast nature of radio transmissions, communications in mobile ad hoc networks (MANETs) are more susceptible to malicious traffic analysis. In this paper we propose a novel anonymous on-demand routing protocol, termed MASK, to enable anonymous communications thereby thwarting possible traffic analysis attacks. Based on a new cryptographic concept called pairing, we first propose an anonymous neighborhood authentication protocol which allows neighboring nodes to authenticate each other without revealing their identities. Then utilizing the secret pairwise link identifiers and keys established between neighbors during the neighborhood authentication process, MASK fulfills the routing and packet forwarding tasks nicely without disclosing the identities of participating nodes under a rather strong adversarial model. MASK provides the desirable sender and receiver anonymity, as well as the relationship anonymity of the sender and receiver. It is also resistant to a wide range of adversarial attacks. Moreover, MASK preserves the routing efficiency in contrast to previous proposals. Detailed anonymity analysis and simulation studies are carried out to validate and justify the effectiveness of MASK
AB - Due to the broadcast nature of radio transmissions, communications in mobile ad hoc networks (MANETs) are more susceptible to malicious traffic analysis. In this paper we propose a novel anonymous on-demand routing protocol, termed MASK, to enable anonymous communications thereby thwarting possible traffic analysis attacks. Based on a new cryptographic concept called pairing, we first propose an anonymous neighborhood authentication protocol which allows neighboring nodes to authenticate each other without revealing their identities. Then utilizing the secret pairwise link identifiers and keys established between neighbors during the neighborhood authentication process, MASK fulfills the routing and packet forwarding tasks nicely without disclosing the identities of participating nodes under a rather strong adversarial model. MASK provides the desirable sender and receiver anonymity, as well as the relationship anonymity of the sender and receiver. It is also resistant to a wide range of adversarial attacks. Moreover, MASK preserves the routing efficiency in contrast to previous proposals. Detailed anonymity analysis and simulation studies are carried out to validate and justify the effectiveness of MASK
UR - http://www.scopus.com/inward/record.url?scp=25844443821&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=25844443821&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2005.1498472
DO - 10.1109/INFCOM.2005.1498472
M3 - Conference contribution
AN - SCOPUS:25844443821
SN - 0780389689
T3 - Proceedings - IEEE INFOCOM
SP - 1940
EP - 1951
BT - Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
A2 - Makki, K.
A2 - Knightly, E.
T2 - IEEE INFOCOM 2005
Y2 - 13 March 2005 through 17 March 2005
ER -