IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Implementing a Reputation-Aware Gnutella Servent
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
BISS: building secure routing out of an incomplete set of security associations
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Preserving peer replicas by rate-limited sampled voting
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Exchange-Based Incentive Mechanisms for Peer-to-Peer File Sharing
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
The sybil attack in sensor networks: analysis & defenses
Proceedings of the 3rd international symposium on Information processing in sensor networks
Limited reputation sharing in P2P systems
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Security in wireless sensor networks
Communications of the ACM - Wireless sensor networks
SeAl: Managing Accesses and Data in Peer-to-Peer Sharing Networks
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Analysis of an incentives-based secrets protection system
Proceedings of the 4th ACM workshop on Digital rights management
Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis
ACSAC '04 Proceedings of the 20th Annual Computer Security Applications Conference
Pastiche: making backup cheap and easy
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
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
Remote Physical Device Fingerprinting
IEEE Transactions on Dependable and Secure Computing
Sybilproof reputation mechanisms
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
An auctioning reputation system based on anomaly
Proceedings of the 12th ACM conference on Computer and communications security
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
CAPTCHA: using hard AI problems for security
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
A taxonomy of rational attacks
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Passive-Logging Attacks Against Anonymous Communications Systems
ACM Transactions on Information and System Security (TISSEC)
Quantifying Resistance to the Sybil Attack
Financial Cryptography and Data Security
A Distributed and Oblivious Heap
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A survey of DHT security techniques
ACM Computing Surveys (CSUR)
SybilLimit: a near-optimal social network defense against sybil attacks
IEEE/ACM Transactions on Networking (TON)
GAUR: a method to detect Sybil groups in peer-to-peer overlays
International Journal of Grid and Utility Computing
| Hi-index | 0.00 |
We propose an economic approach to Sybil attack detection. In our Informant protocol, a detective offers a reward for Sybils to reveal themselves. The detective accepts from one identity a security deposit and the name of target peer; the deposit and a reward are given to the target. We prove the optimal strategy for the informant is to play the game if and only if she is Sybil with a low opportunity cost, and the target will cooperate if and only if she is identical to the informant. Informant uses a Dutch auction to find the minimum possible reward that will reveal a Sybil attacker. Because our approach is economic, it is not limited to a specific application and does not rely on a physical device or token.