Show simple item record

dc.contributor.authorUrueña, Manuel
dc.contributor.authorCuevas, Rubén
dc.contributor.authorCuevas, Ángel
dc.contributor.authorBanchs, Albert 
dc.date.accessioned2021-07-13T10:05:56Z
dc.date.available2021-07-13T10:05:56Z
dc.date.issued2013-02
dc.identifier.issn1089-7798
dc.identifier.urihttp://hdl.handle.net/20.500.12761/1241
dc.description.abstractThe Sybil attack is one of the most harmful security threats for distributed hash tables (DHTs). This attack is not only a theoretical one, but it has been spotted "in the wild", and even performed by researchers themselves to demonstrate its feasibility. In this letter we analyse the Sybil attack whose objective is that the targeted resource cannot be accessed by any user of a Chord DHT, by replacing all the replica nodes that store it with sybils. In particular, we propose a simple, yet complete model that provides the number of random node-IDs that an attacker would need to generate in order to succeed with certain probability. Therefore, our model enables to quantify the cost of performing a Sybil resource attack on RELOAD/Chord DHTs more accurately than previous works, and thus establishes the basis to measure the effectiveness of different solutions proposed in the literature to prevent or mitigate Sybil attacks.
dc.language.isoeng
dc.publisherIEEE Communications Society
dc.titleA Model to Quantify the Success of a Sybil Attack Targeting RELOAD/Chord Resourcesen
dc.typejournal article
dc.journal.titleIEEE Communications Letters
dc.type.hasVersionVoR
dc.rights.accessRightsopen access
dc.volume.number17
dc.issue.number2
dc.identifier.doihttp://dx.doi.org/10.1109/LCOMM.2013.011113.122220
dc.page.final431
dc.page.initial428
dc.subject.keywordChord
dc.subject.keywordDistributed Hash Table(DHT)
dc.subject.keywordKademlia
dc.subject.keywordP2PSIP
dc.subject.keywordREsource LOcation And Discovery(RELOAD)
dc.subject.keywordSybil resource attack
dc.description.statuspub
dc.eprint.idhttp://eprints.networks.imdea.org/id/eprint/646


Files in this item

This item appears in the following Collection(s)

Show simple item record