The University of St Andrews

Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >

Please use this identifier to cite or link to this item:
This item has been viewed 7 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
comcom2011.pdf900.38 kBAdobe PDFView/Open
Title: Privacy-enhanced social-network routing
Authors: Parris, Iain Siraj
Henderson, Tristan
Keywords: Social networks
Opportunistic networks
Social-network routing
QA75 Electronic computers. Computer science
Issue Date: 1-Jan-2012
Citation: Parris , I S & Henderson , T 2012 , ' Privacy-enhanced social-network routing ' Computer Communications , vol 35 , no. 1 , pp. 62-74 . , 10.1016/j.comcom.2010.11.003
Abstract: 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 the increase in security provided by this obfuscation, with reference to classes of attack which are mitigated.
Version: Preprint
Description: This work is supported by the UK Engineering and Physical Sciences Research Council and the Technology Strategy Board as part of the Privacy Value Networks project, EP/G002606/1.
Status: Peer reviewed
ISSN: 0140-3664
Type: Journal article
Rights: This is an author version of an article published in Computer Communications, available at
Appears in Collections:University of St Andrews Research
Computer Science Research

This item is protected by original copyright

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


DSpace Software Copyright © 2002-2012  Duraspace - Feedback
For help contact: | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)