TY - GEN
T1 - An Analysis of Onion-Based Anonymous Routing for Delay Tolerant Networks
AU - Sakai, Kazuya
AU - Sun, Min Te
AU - Ku, Wei Shinn
AU - Wu, Jie
AU - Alanazi, Faisal S.
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/8/8
Y1 - 2016/8/8
N2 - Delay tolerant network (DTN) routing provides a communication primitive in intermittently disconnected networks, such as battlefield communications and human-contact networks. In these applications, the anonymity preserving mechanism, which hides the identities of communicating parties, plays an important role as a defense against cyber and physical attacks. While anonymous routing protocols for DTNs have been proposed in the past, to the best of our knowledge, there is no work that emphasizes the theoretical aspects. In this paper, we first design an abstract of anonymous routing protocols for DTNs and augment the existing solution with multi-copy message forwarding. Then, we construct simplified mathematical models, which can be used to understand the fundamental performance and security guarantees of onion-based anonymous routing in DTNs. The numerical and simulation results using randomly generated contact graphs and the real traces demonstrate that our models provide very close approximations to the performance of the anonymous DTN routing protocol.
AB - Delay tolerant network (DTN) routing provides a communication primitive in intermittently disconnected networks, such as battlefield communications and human-contact networks. In these applications, the anonymity preserving mechanism, which hides the identities of communicating parties, plays an important role as a defense against cyber and physical attacks. While anonymous routing protocols for DTNs have been proposed in the past, to the best of our knowledge, there is no work that emphasizes the theoretical aspects. In this paper, we first design an abstract of anonymous routing protocols for DTNs and augment the existing solution with multi-copy message forwarding. Then, we construct simplified mathematical models, which can be used to understand the fundamental performance and security guarantees of onion-based anonymous routing in DTNs. The numerical and simulation results using randomly generated contact graphs and the real traces demonstrate that our models provide very close approximations to the performance of the anonymous DTN routing protocol.
KW - Anonymous communications
KW - delay tolerant networks
KW - DTNs
KW - onion routing
UR - http://www.scopus.com/inward/record.url?scp=84985962867&partnerID=8YFLogxK
U2 - 10.1109/ICDCS.2016.9
DO - 10.1109/ICDCS.2016.9
M3 - Conference contribution
AN - SCOPUS:84985962867
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 609
EP - 618
BT - Proceedings - 2016 IEEE 36th International Conference on Distributed Computing Systems, ICDCS 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 36th IEEE International Conference on Distributed Computing Systems, ICDCS 2016
Y2 - 27 June 2016 through 30 June 2016
ER -