DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/8261
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHaribabu, K-
dc.date.accessioned2023-01-03T09:56:59Z-
dc.date.available2023-01-03T09:56:59Z-
dc.date.issued2009-
dc.identifier.urihttps://link.springer.com/chapter/10.1007/978-3-642-11530-1_14-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8261-
dc.description.abstractThe 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.isoenen_US
dc.publisherSpringeren_US
dc.subjectComputer Scienceen_US
dc.subjectPeer-to-peeren_US
dc.subjectOverlay Networksen_US
dc.subjectSybil Detectionen_US
dc.subjectReplicationen_US
dc.titleDetecting Sybils in Peer-to-Peer File Replication Systemsen_US
dc.typeArticleen_US
Appears in Collections:Department of Computer Science and Information Systems

Files in This Item:
There are no files associated with this item.


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