IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
On the establishment of distinct identities in overlay networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Computational Puzzles as Sybil Defenses
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
DSybil: Optimal Sybil-Resistance for Recommendation Systems
SP '09 Proceedings of the 2009 30th IEEE Symposium on Security and Privacy
A sybil-proof referral system based on multiplicative reputation chains
IEEE Communications Letters
A survey of peer-to-peer security issues
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Sybil defenses via social networks: a tutorial and survey
ACM SIGACT News
| Hi-index | 0.00 |
Sybil attack is one of the most challenging problems related to identity management in Peer-to-Peer networks. The huge number of fake identities created by malicious users may attempt to gain a large influence on the network and may collude or subvert the system. This paper proposes a Sybil defense for super peer based P2P networks where identities are distributed in a hierarchical way from super nodes to peers. The identification scheme is based on invitations and assigning a set of identities to each node is based on how they utilized the earlier ones and referral values.