Performance evaluation of delay-tolerant wireless friend-to-friend networks for undetectable communication

@article{Barroso2015PerformanceEO,
  title={Performance evaluation of delay-tolerant wireless friend-to-friend networks for undetectable communication},
  author={Ana Barroso and Matthias Hollick},
  journal={2015 IEEE 40th Conference on Local Computer Networks (LCN)},
  year={2015},
  pages={474-477}
}
  • Ana Barroso, M. Hollick
  • Published 26 October 2015
  • Computer Science
  • 2015 IEEE 40th Conference on Local Computer Networks (LCN)
Anonymous communication systems have recently increased in popularity in wired networks, but there are no adequate equivalent systems for wireless networks under strong surveillance. In this work we evaluate the performance of delay-tolerant friend-to-friend networking, which can allow anonymous communication in a wireless medium under strong surveillance by relying on trust relationships between the network's users. Since strong anonymity properties incur in performance penalties, a good… 
View on IEEE
doi.ieeecomputersociety.org
1 Citations

Figures and Tables from this paper

One Citation

Citation Type

Citation Type

Systematic literature review on the state of the art and future research work in anonymous communications systems

References

SHOWING 1-10 OF 16 REFERENCES
Mobile social networking through friend-to-friend opportunistic content dissemination
TLDR
A novel architecture is proposed that addresses the issues of lack of trust, delivery latency, loss of user control, and privacy-aware distributed mobile social networking by combining the advantages of decentralized storage and opportunistic communications.
aDTN - Undetectable Communication in Wireless Delay-tolerant Networks (Working Draft)
TLDR
This document describes a best-effort delay-tolerant communication system that protects the privacy of users in wireless ad-hoc networks by making their communication undetectable and providing undetectability of all users and messages against external adversaries.
Privacy-Aware Message Exchanges for Geographically Routed Human Movement Networks
TLDR
This paper introduces a privacy-aware geographic routing protocol for Human Movement Networks (HumaNets), which leverages self-determined location profiles of smartphone operators’ movements as a predictor of future locations, enabling efficient geographic routing over metropolitan-wide areas.
Tor: The Second-Generation Onion Router
TLDR
This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, and a practical design for location-hidden services via rendezvous points.
How to Disappear Completely: A Survey of Private Peer-to-Peer Networks
This paper offers a survey of the emerging field of private peer-to-peer networks, which can be defined as internet overlays in which the resources and infrastructure are provided by the users, and…
On anonymity in an electronic society: A survey of anonymous communication systems
TLDR
The previous research done to design, develop, and deploy systems for enabling private and anonymous communication on the Internet are surveyed, including mixes and mix networks, onion routing, and Dining Cryptographers networks are surveyed.
Gossip versus Deterministically Constrained Flooding on Small Networks
TLDR
This paper presents a protocol that superficially resembles rumor mongering but is deterministic, and shows that this new protocol has most of the same attractions as rumormongering.
Fast Gossiping by Short Messages
TLDR
The optimal number of communication rounds to perform gossiping for several classes of graphs, including Hamiltonian graphs and complete k-ary trees is determined for complete graphs, hypercubes, rings, and paths.
Safe and Private Data Sharing with Turtle: Friends Team-Up and Beat the System
TLDR
Turtle is a peer-to-peer architecture for safe sharing of sensitive data that builds its overlay on top of pre-existent trust relationships among its users, which allows both data sender and receiver anonymity, while also protecting each and every intermediate relay in the data query path.
Unique in the Crowd: The privacy bounds of human mobility
TLDR
It is found that in a dataset where the location of an individual is specified hourly, and with a spatial resolution equal to that given by the carrier's antennas, four spatio-temporal points are enough to uniquely identify 95% of the individuals.
...
...