Sybil Attacks Against Mobile Users: Friends and Foes to the Rescue
Published 1 March 2010Open access
Daniele Querci, Stephen Hailes
Citations88
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The extent to which MobID reduces the number of interactions with sybil attackers and consequently enables collaborative applications is evaluated and the computational and communication costs of MobID on mobile phones are assessed.
Abstract
Collaborative applications for co-located mobile \nusers can be severely disrupted by a sybil attack to the point of \nbeing unusable. Existing decentralized defences have largely been \ndesigned for peer-to-peer networks but not for mobile networks. \nThat is why we propose a new decentralized defence for portable \ndevices and call it MobID. The idea is that a device manages two \nsmall networks in which it stores information about the devices \nit meets: its network of friends contains honest devices, and its \nnetwork of foes contains suspicious devices. By reasoning on these \ntwo networks, the device is then able to determine whether \nan unknown individual is carrying out a sybil attack or not. \nWe evaluate the extent to which MobID reduces the number \nof interactions with sybil attackers and consequently enables \ncollaborative applications.We do so using real mobility and social \nnetwork data. We also assess computational and communication \ncosts of MobID on mobile phones.
Keywords
Computer Science
NatureError and attack tolerance of complex networks
7,218 Citations2000Réka Albert, Hawoong Jeong +1 more
It is found that scale-free networks, which include the World-Wide Web, the Internet, social networks and cells, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates.
NatureUnderstanding individual human mobility patterns
6,079 Citations2008Marta C. González, César A. Hidalgo +1 more
The trajectory of 100,000 anonymized mobile phone users whose position is tracked for a six-month period is studied, finding that, in contrast with the random trajectories predicted by the prevailing Lévy flight and random walk models, human trajectories show a high degree of temporal and spatial regularity.
Journal of Mathematical SociologyA faster algorithm for betweenness centrality*
4,926 Citations2001Ulrik Brandes
New algorithms for betweenness are introduced in this paper and require O(n + m) space and run in O(nm) and O( nm + n2 log n) time on unweighted and weighted networks, respectively, where m is the number of links.
Lecture notes in computer scienceThe Sybil Attack
4,328 Citations2002John R. Douceur
It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
Personal and Ubiquitous ComputingReality mining: sensing complex social systems
2,765 Citations2005Nathan Eagle, Alex Pentland
The ability to use standard Bluetooth-enabled mobile telephones to measure information access and use in different contexts, recognize social patterns in daily user activity, infer relationships, identify socially significant locations, and model organizational rhythms is demonstrated.
Social NetworksA measure of betweenness centrality based on random walks
2,435 Citations2005M. E. J. Newman
A betweenness measure is proposed that relaxes this assumption that information spreads only along those shortest paths, including contributions from essentially all paths between nodes, not just the shortest, although it still gives more weight to short paths.
I tube, you tube, everybody tubes
1,583 Citations2007Meeyoung Cha, Haewoon Kwak +3 more
This paper analyzed YouTube, the world's largest UGC VoD system, and provided an in-depth study of the popularity life-cycle of videos, the intrinsic statistical properties of requests and their relationship with video age, and the level of content aliasing or of illegal content in the system.
IEEE Transactions on Mobile ComputingBUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
1,515 Citations2011Pan Hui, Jon Crowcroft +1 more
IEEE Transactions on Mobile ComputingImpact of Human Mobility on Opportunistic Forwarding Algorithms
1,032 Citations2007Augustin Chaintreau, Pan Hui +4 more
A simplified model based on the renewal theory is used to study how the parameters of the distribution impact the performance in terms of the delivery delay of well-founded opportunistic forwarding algorithms in the context of human-carried devices.
Information Processing & ManagementCo-authorship networks in the digital library research community
822 Citations2005Xiaoming Liu, Johan Bollen +2 more
The state of the DL domain after a decade of activity is examined by applying social network analysis to the co-authorship network of the past ACM, IEEE, and joint ACM/IEEE digital library conferences, and clear advantages of PageRank and AuthorRank are shown over degree, closeness and betweenness centrality metrics.
Bubble rap
816 Citations2008Pan Hui, Jon Crowcroft +1 more
BUBBLE is designed and evaluated, a novel social-based forwarding algorithm that utilizes the aforementioned metrics to enhance delivery performance and empirically shows that BUBBLE can substantially improve forwarding performance compared to a number of previously proposed algorithms including the benchmarking history-based PROPHET algorithm, and social- based forwarding SimBet algorithm.
ACM SIGCOMM Computer Communication ReviewSybilGuard
749 Citations2006Haifeng Yu, Michael Kaminsky +2 more
Gossip algorithms: design, analysis and applications
571 Citations2005Stephen Boyd, Aritra Ghosh +2 more
This work analyzes the averaging problem under the gossip constraint for arbitrary network, and finds that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly stochastic matrix characterizing the algorithm.
SybilInfer: Detecting Sybil Nodes using Social Networks.
409 Citations2009George Danezis, Prateek Mittal
This work proves that, given standard constraints on the adversary, SybilInfer is secure, in that it successfully distinguishes between honest and dishonest nodes and is not susceptible to manipulation by the adversary.
American Journal of EpidemiologyInfection in Social Networks: Using Network Analysis to Identify High-Risk Individuals
396 Citations2005Robert Christley, Gina Pinchbeck +5 more
Simulation studies using susceptible-infectious-recovered models were conducted to estimate individuals' risk of infection and time to infection in small-world and randomly mixing networks and the ability of measures of network centrality to identify high-risk individuals was assessed.
Mobility helps security in ad hoc networks
258 Citations2003Srđjan Čapkun, Jean‐Pierre Hubaux +1 more
It is shown that node mobility can be useful to provide security in ad hoc networks and that the time necessary to set up the security associations is strongly influenced by several factors, including the size of the deployment area, the mobility patterns, and the number of friends.
SybilGuard
250 Citations2006Haifeng Yu, Michael Kaminsky +2 more
This paper presents SybilGuard, a novel protocol for limiting the corruptive influences of sybil attacks, based on the ldquosocial networkrdquo among user identities, where an edge between two identities indicates a human-established trust relationship.
Detecting the Sybil Attack in Mobile Ad hoc Networks
185 Citations2006Chris Piro, Clay Shields +1 more
This paper shows that nodes that passively monitor traffic in the network can detect a Sybil attacker that uses a number of network identities simultaneously, and extends the protocol to monitor collisions at the MAC level to differentiate between a single attacker spoofing many addresses and a group of nodes traveling in close proximity.
Media sharing based on colocation prediction in urban transport
166 Citations2008Liam McNamara, Cecilia Mascolo +1 more
This paper proposes a user-centric prediction scheme that collects historical colocation information to determine the best content sources, and validates this assumption on a real dataset, that consists of traces of people moving in a large city's mass transit system.
Lecture notes in computer scienceSybil-Resistant DHT Routing
165 Citations2005George Danezis, Chris Lesniewski-Laas +2 more
This work introduces a routing strategy that alleviates some of the effects of such an attack by making sure that lookups are performed using a diverse set of nodes, and makes use of latent social information present in the introduction graph of the network.
Sybil Attacks Against Mobile Users: Friends and Foes to the Rescue
88 Citations2010Daniele Querci, Stephen Hailes
The extent to which MobID reduces the number of interactions with sybil attackers and consequently enables collaborative applications is evaluated and the computational and communication costs of MobID on mobile phones are assessed.
MoB
65 Citations2005Rajiv Chakravorty, Sulabh Agarwal +2 more
The overall architecture of MoB is described including various enablers like user reputation management, incentive management, and accounting services and the prototype implementation in enhancing application performance in multiple different scenarios—file transfers, web browsing, media streaming, and location-enhanced services.
Lightweight Distributed Trust Propagation
56 Citations2007Daniele Quercia, Stephen Hailes +1 more
This work designs a mechanism for mobile devices that effectively propagates trust and that is lightweight and distributed (as opposed to previous work that focuses on centralized propagation).
Trust Negotiation with Hidden Credentials, Hidden Policies, and Policy Cycles
51 Citations2006Keith B. Frikken, Jiangtao Li +1 more
This paper uses novel techniques to implement a non-standard trust negotiation strategy specifically suited to this framework, which is a substantial extension of the state-of-the-art in privacypreserving trust negotiations.
Efficient Private Techniques for Verifying Social Proximity.
30 Citations2007Michael J. Freedman, Antonio Nicolosi
This paper proposes new privacy-preserving cryptographic protocols that enable participants to verify social proximity while exposing minimal information about the parties’ social contacts.
Lecture notes in computer scienceLoKey: Leveraging the SMS Network in Decentralized, End-to-End Trust Establishment
28 Citations2006Anthony J. Nicholson, Ian E. Smith +2 more
LoKey is described, a system that leverages the Short Message Service (SMS) to verify keys on users' behalf and can establish and verify a shared key in approximately 30 seconds, provided only that one correspondent knows the other's phone number.
Pervasive and Mobile ComputingPromoting cooperation among strangers to access Internet services from an ad hoc network
20 Citations2005Danyu Zhu, Matt W. Mutka
A new distributed trust framework and a credit system are presented to solve the problem of people lack the incentive to cooperate with a group of strangers without a centralized trust authority.
USENIX Security SymposiumElliptic curve DSA (ECSDA): an enhanced DSA
17 Citations1998Don B. Johnson, Alfred Menezes
This paper compares the draft ANSI X9.62 ECDSA to the ANSIX9.30 DSA, the latter of which is identical to FIPS 186 DSS, and finds the strength-perkey-bit is substantially greater in an algorithm that uses elliptic curves.
MobiRate
14 Citations2008Daniele Quercia, Stephen Hailes +1 more
The extent to which MobiRate reduces the impact of tampered ratings and consequently locates reputable service providers is evaluated using real mobility and social network data and computational and communication costs of Mobi rate on mobile phones are assessed.