Privacy-enhanced social-network routing
نویسندگان
چکیده
Opportunistic networking — forwarding messages in a disconnected mobile ad hoc network via any encountered nodes — offers a new mechanism for exploiting the mobile devices that many users now carry. Forwarding messages in such a network often involves the use of social-network routing— sending messages via nodes in the sender or recipient’s friends list. Simple social-network routing, however, may broadcast these friends lists, which introduces privacy concerns. This paper presents a threat analysis of the privacy risks in social-network routing. We introduce two complementary methods for enhancing privacy in social-network routing by obfuscating the friends lists used to inform routing decisions. We evaluate these methods using three real-world datasets, and find that it is possible to obfuscate the friends lists without leading to a significant decrease in routing performance, as measured by delivery cost, delay and ratio. We quantify ∗Corresponding author. Email addresses: [email protected] (Iain Parris), [email protected] (Tristan Henderson) URL: http://www.cs.st-andrews.ac.uk/ ̃ip/ (Iain Parris), http://www.cs.st-andrews.ac.uk/ ̃tristan/ (Tristan Henderson) 1Phone: +44 1334 463253 Fax: +44 1334 463278 Preprint submitted to Computer Communications June 6, 2010 the increase in security provided by this obfuscation, with reference to classes of attack which are mitigated.
منابع مشابه
Practical privacy and security for opportunistic networks
When in physical proximity, data can be directly exchanged between the mobile devices people carry — for example over Bluetooth. If people cooperate to store, carry and forward messages on one another’s behalf, then an opportunistic network may be formed, independent of any fixed infrastructure. To enable performant routing within opportunistic networks, use of social network information has be...
متن کاملPreserving Link Privacy in Social Network Based Systems
A growing body of research leverages social network based trust relationships to improve the functionality of the system. However, these systems expose users’ trust relationships, which is considered sensitive information in today’s society, to an adversary. In this work, we make the following contributions. First, we propose an algorithm that perturbs the structure of a social graph in order t...
متن کاملData routing strategies in opportunistic mobile social networks: Taxonomy and open challenges
Opportunistic Mobile Social Network (MSN) is a kind of Delay Tolerant Network (DTN) in which nodes are mobile with social characteristics. Users in such network carry data, move and forward it to others for information dissemination. To enable efficient data routing in opportunistic MSNs, the social metrics of users, such as mobility pattern, social centrality, community and etc. are leveraged ...
متن کاملPractical privacy-aware opportunistic networking
Opportunistic networks have been the study of much research — in particular on making end-to-end routing efficient. Users’ privacy concerns, however, have not been the subject of much research. What privacy concerns might opportunistic network users have? Is it possible to build opportunistic networks that can mitigate users’ privacy concerns while maintaining routing performance? Our work-to-d...
متن کاملX-Vine: Secure and Pseudonymous Routing in DHTs Using Social Networks
Distributed hash tables suffer from several security and privacy vulnerabilities, including the problem of Sybil attacks. Existing social network-based solutions to mitigate the Sybil attacks in DHT routing have a high state requirement and do not provide an adequate level of privacy. For instance, such techniques require a user to reveal their social network contacts. We design X-Vine, a prote...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Communications
دوره 35 شماره
صفحات -
تاریخ انتشار 2012