An anonymous messaging system for Delay Tolerant Networks

Spiridon Bakiras, Erald Troja, Xiaohua Xu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Security and anonymity are vital components in today's networked world, and play critical roles in several reallife situations, such as whistleblowing, intelligence operations, oppressive governments, etc. In this paper, we study anonymous communications in the context of Delay Tolerant Networks (DTNs). Existing work in this area relies on the standard onion routing paradigm to provide anonymity and is, therefore, vulnerable to malicious nodes. To this end, we introduce a novel message forwarding algorithm that utilizes random walks to deliver messages to their destinations. By removing the requirement to list all the intermediate nodes on the end-to-end path, our method enhances considerably the anonymity of the underlying communications. Our simulation results show that the proposed forwarding algorithm achieves high message delivery rates, at the expense of a moderate computational overhead at the mobile devices.

Original languageEnglish
Title of host publication2017 IEEE International Conference on Communications, ICC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781467389990
DOIs
Publication statusPublished - 28 Jul 2017
Event2017 IEEE International Conference on Communications, ICC 2017 - Paris, France
Duration: 21 May 201725 May 2017

Other

Other2017 IEEE International Conference on Communications, ICC 2017
CountryFrance
CityParis
Period21/5/1725/5/17

Fingerprint

Delay tolerant networks
Communication
Mobile devices

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Bakiras, S., Troja, E., & Xu, X. (2017). An anonymous messaging system for Delay Tolerant Networks. In 2017 IEEE International Conference on Communications, ICC 2017 [7996867] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2017.7996867

An anonymous messaging system for Delay Tolerant Networks. / Bakiras, Spiridon; Troja, Erald; Xu, Xiaohua.

2017 IEEE International Conference on Communications, ICC 2017. Institute of Electrical and Electronics Engineers Inc., 2017. 7996867.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bakiras, S, Troja, E & Xu, X 2017, An anonymous messaging system for Delay Tolerant Networks. in 2017 IEEE International Conference on Communications, ICC 2017., 7996867, Institute of Electrical and Electronics Engineers Inc., 2017 IEEE International Conference on Communications, ICC 2017, Paris, France, 21/5/17. https://doi.org/10.1109/ICC.2017.7996867
Bakiras S, Troja E, Xu X. An anonymous messaging system for Delay Tolerant Networks. In 2017 IEEE International Conference on Communications, ICC 2017. Institute of Electrical and Electronics Engineers Inc. 2017. 7996867 https://doi.org/10.1109/ICC.2017.7996867
Bakiras, Spiridon ; Troja, Erald ; Xu, Xiaohua. / An anonymous messaging system for Delay Tolerant Networks. 2017 IEEE International Conference on Communications, ICC 2017. Institute of Electrical and Electronics Engineers Inc., 2017.
@inproceedings{eb5ac2e192f64b1eae1758f66bb7ac28,
title = "An anonymous messaging system for Delay Tolerant Networks",
abstract = "Security and anonymity are vital components in today's networked world, and play critical roles in several reallife situations, such as whistleblowing, intelligence operations, oppressive governments, etc. In this paper, we study anonymous communications in the context of Delay Tolerant Networks (DTNs). Existing work in this area relies on the standard onion routing paradigm to provide anonymity and is, therefore, vulnerable to malicious nodes. To this end, we introduce a novel message forwarding algorithm that utilizes random walks to deliver messages to their destinations. By removing the requirement to list all the intermediate nodes on the end-to-end path, our method enhances considerably the anonymity of the underlying communications. Our simulation results show that the proposed forwarding algorithm achieves high message delivery rates, at the expense of a moderate computational overhead at the mobile devices.",
author = "Spiridon Bakiras and Erald Troja and Xiaohua Xu",
year = "2017",
month = "7",
day = "28",
doi = "10.1109/ICC.2017.7996867",
language = "English",
booktitle = "2017 IEEE International Conference on Communications, ICC 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - An anonymous messaging system for Delay Tolerant Networks

AU - Bakiras, Spiridon

AU - Troja, Erald

AU - Xu, Xiaohua

PY - 2017/7/28

Y1 - 2017/7/28

N2 - Security and anonymity are vital components in today's networked world, and play critical roles in several reallife situations, such as whistleblowing, intelligence operations, oppressive governments, etc. In this paper, we study anonymous communications in the context of Delay Tolerant Networks (DTNs). Existing work in this area relies on the standard onion routing paradigm to provide anonymity and is, therefore, vulnerable to malicious nodes. To this end, we introduce a novel message forwarding algorithm that utilizes random walks to deliver messages to their destinations. By removing the requirement to list all the intermediate nodes on the end-to-end path, our method enhances considerably the anonymity of the underlying communications. Our simulation results show that the proposed forwarding algorithm achieves high message delivery rates, at the expense of a moderate computational overhead at the mobile devices.

AB - Security and anonymity are vital components in today's networked world, and play critical roles in several reallife situations, such as whistleblowing, intelligence operations, oppressive governments, etc. In this paper, we study anonymous communications in the context of Delay Tolerant Networks (DTNs). Existing work in this area relies on the standard onion routing paradigm to provide anonymity and is, therefore, vulnerable to malicious nodes. To this end, we introduce a novel message forwarding algorithm that utilizes random walks to deliver messages to their destinations. By removing the requirement to list all the intermediate nodes on the end-to-end path, our method enhances considerably the anonymity of the underlying communications. Our simulation results show that the proposed forwarding algorithm achieves high message delivery rates, at the expense of a moderate computational overhead at the mobile devices.

UR - http://www.scopus.com/inward/record.url?scp=85028360883&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85028360883&partnerID=8YFLogxK

U2 - 10.1109/ICC.2017.7996867

DO - 10.1109/ICC.2017.7996867

M3 - Conference contribution

BT - 2017 IEEE International Conference on Communications, ICC 2017

PB - Institute of Electrical and Electronics Engineers Inc.

ER -