The official PGP user's guide
Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The sybil attack in sensor networks: analysis & defenses
Proceedings of the 3rd international symposium on Information processing in sensor networks
Congestion control and fairness for many-to-one routing in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
A jamming-resistant MAC protocol for single-hop wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A survey of attack and defense techniques for reputation systems
ACM Computing Surveys (CSUR)
Competitive and Fair Medium Access Despite Reactive Jamming
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Competitive and fair throughput for co-existing networks under adversarial interference
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
Consider a scenario where many wireless users are attempting to download data from a single base station. While most of the users are honest, some users may be malicious and attempt to obtain more than their fair share of the bandwidth. One possible strategy for attacking the system is to simulate multiple fake identities, each of which is given its own equal share of the bandwidth. Such an attack is often referred to as a sybil attack. To counter such behavior, we propose SybilCast, a protocol for multichannel wireless networks that limits the number of fake identities, and in doing so, ensures that each honest user gets at least a constant fraction of their fair share of the bandwidth. As a result, each honest user can complete his or her data download in asymptotically optimal time. A key aspect of this protocol is balancing the rate at which new identities are admitted and the maximum number of fake identities that can co-exist, while keeping the overhead low. Besides sybil attacks, our protocol can also tolerate spoofing and jamming.