DSpace Repository

Detecting Sybils in Peer-to-Peer File Replication Systems

Show simple item record

dc.contributor.author Haribabu, K
dc.date.accessioned 2023-01-03T09:56:59Z
dc.date.available 2023-01-03T09:56:59Z
dc.date.issued 2009
dc.identifier.uri https://link.springer.com/chapter/10.1007/978-3-642-11530-1_14
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8261
dc.description.abstract The test of a peer-to-peer file sharing network is how efficiently the objects are discovered and retrieved. One of the most important factors that contribute towards this is optimal replication of the objects across the network. One of the security threats to replication model is Sybil attack. In this paper we propose an approach that aims at detecting sybil identities in peer-to-peer file sharing networks. The sybils can corrupt, hide or destroy the replicas in file sharing network. This approach makes use of the fact that sybil doesn’t scale its storage to the factor of its identities. The approach safeguards the availability and accessibility of objects in a peer-to-peer network from sybil attack. Experimental evaluations have shown that our approach works very efficiently in detecting sybils. More than 50% of the sybils were detected in first few seconds of the simulation and loss or damage of objects is reduced to less than .0001%. en_US
dc.language.iso en en_US
dc.publisher Springer en_US
dc.subject Computer Science en_US
dc.subject Peer-to-peer en_US
dc.subject Overlay Networks en_US
dc.subject Sybil Detection en_US
dc.subject Replication en_US
dc.title Detecting Sybils in Peer-to-Peer File Replication Systems en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account