research-article

SybilCast: broadcast on the open airwaves (extended abstract)

Authors:

Seth Lewis Gilbert,

Chaodong ZhengAuthors Info & Claims

SPAA '13: Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

Pages 130 - 139

https://doi.org/10.1145/2486159.2486172

Published: 23 July 2013 Publication History

Abstract

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.

References

[1]

B. Awerbuch, A. Richa, and C. Scheideler. A jamming-resistant mac protocol for single-hop wireless networks. In Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, pages 45--54, 2008.

Digital Library

[2]

S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15:600--625, 1996.

Digital Library

[3]

Bluetooth Consortium. Bluetooth Specification Version 2.1, July 2007.

[4]

J. Douceur. The sybil attack. In Peer-to-Peer Systems, volume 2429 of Lecture Notes in Computer Science, pages 251--260. Springer, 2002.

Digital Library

[5]

C. T. Ee and R. Bajcsy. Congestion control and fairness for many-to-one routing in sensor networks. In Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems, pages 148--161, 2004.

Digital Library

[6]

K. Hoffman, D. Zage, and C. Nita-Rotaru. A survey of attack and defense techniques for reputation systems. ACM Computing Surveys, 42:1--31, December 2009.

Digital Library

[7]

X. L. Huang and B. Bensaou. On max-min fairness and scheduling in wireless ad-hoc networks: Analytical framework and implementation. In Proceedings of the 2nd ACM International Symposium on Mobile Ad-Hoc Networking & Computing, pages 221--231, 2001.

Digital Library

[8]

R. Jain, D. Chiu, and W. Hawe. A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. 1984.

[9]

N. James, E. Shi, D. Song, and A. Perrig. The sybil attack in sensor networks: Analysis & defenses. In Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, pages 259--268, 2004.

Digital Library

[10]

M. G. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.

Digital Library

[11]

D. Mónica. Thwarting the sybil attack in wireless ad-hoc networks. Master';s thesis, Instituto Superior Técnico, Universidade Técnica de Lisboa, July 2009.

[12]

D. Mónica, J. Leitão, L. Rodrigues, and C. Ribeiro. On the use of radio resource tests in wireless ad-hoc networks. In Proceedings of the 3rd Workshop on Recent Advances on Intrusion-Tolerant Systems, pages F21--F26, June 2009.

[13]

D. Mónica, J. Leitão, L. Rodrigues, and C. Ribeiro. Observable non-sybil quorums construction in one-hop wireless ad hoc networks. In Proceedings of the 40th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, June 2010.

[14]

T. Nandagopal, T. E. Kim, X. Gao, and V. Bharghavan. Achieving mac layer fairness in wireless packet networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pages 87--98. ACM, 2000.

Digital Library

[15]

S. Pilosof, R. Ramjee, D. Raz, Y. Shavitt, and P. Sinha. Understanding tcp fairness over wireless lan. In 22nd Annual Joint Conference of the IEEE Computer and Communications, volume 2, pages 863--872, 2003.

[16]

A. Richa, C. Scheideler, S. Schmid, and J. Zhang. Competitive and fair medium access despite reactive jamming. In Proceedings of the 31st International Conference on Distributed Computing Systems, pages 507--516, 2011.

Digital Library

[17]

A. Richa, C. Scheideler, S. Schmid, and J. Zhang. Competitive and fair throughput for co-existing networks under adversarial interference. In Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, pages 291--300, 2012.

Digital Library

[18]

M. Strasser, S. Capkun, C. Popper, and M. Cagalj. Jamming-resistant key establishment using uncoordinated frequency hopping. In Proceedings of the IEEE Symposium on Security and Privacy, pages 64--78, May 2008.

Digital Library

[19]

H. Yu, P. Gibbons, M. Kaminsky, and F. Xiao. Sybillimit: A near-optimal social network defense against sybil attacks. In Proceedings of the IEEE Symposium on Security and Privacy, pages 3--17, May 2008.

Digital Library

[20]

P. R. Zimmermann. The Official PGP User's Guide. MIT Press, 1995.

Digital Library

Cited By

Chakraborty TSaia JYoung M(2024)Defending Hash Tables from Algorithmic Complexity Attacks with Resource BurningTheoretical Computer Science10.1016/j.tcs.2024.114762(114762)Online publication date: Aug-2024
https://doi.org/10.1016/j.tcs.2024.114762
Gupta DSaia JYoung M(2023)Bankrupting Sybil despite churnJournal of Computer and System Sciences10.1016/j.jcss.2023.02.004135(89-124)Online publication date: Aug-2023
https://doi.org/10.1016/j.jcss.2023.02.004
Anderton WChakraborty TYoung M(2021)Windowed backoff algorithms for WiFi: theory and performance under batched arrivalsDistributed Computing10.1007/s00446-021-00403-9Online publication date: 13-Sep-2021
https://doi.org/10.1007/s00446-021-00403-9
Show More Cited By

Index Terms

SybilCast: broadcast on the open airwaves (extended abstract)
1. Networks
  1. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

SybilCast: Broadcast on the Open Airwaves
Special Issue for SPAA 2013

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 ...
SybilGuard: defending against sybil attacks via social networks
SIGCOMM '06: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications

Peer-to-peer and other decentralized,distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack,a malicious user obtains multiple fake identities and pretends to be multiple, distinct nodes in the system. By ...
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications

Peer-to-peer and other decentralized,distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack,a malicious user obtains multiple fake identities and pretends to be multiple, distinct nodes in the system. By ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '13: Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

July 2013

348 pages

ISBN:9781450315722

DOI:10.1145/2486159

General Chair:
Guy Blelloch
Carnegie Mellon University, USA
,
Program Chair:
Berthold Vöcking
RWTH Aachen University, Germany

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 July 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SPAA '13

Sponsor:

SPAA '13: 25th ACM Symposium on Parallelism in Algorithms and Architectures

July 23 - 25, 2013

Québec, Montréal, Canada

Acceptance Rates

SPAA '13 Paper Acceptance Rate 31 of 130 submissions, 24%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
138
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chakraborty TSaia JYoung M(2024)Defending Hash Tables from Algorithmic Complexity Attacks with Resource BurningTheoretical Computer Science10.1016/j.tcs.2024.114762(114762)Online publication date: Aug-2024
https://doi.org/10.1016/j.tcs.2024.114762
Gupta DSaia JYoung M(2023)Bankrupting Sybil despite churnJournal of Computer and System Sciences10.1016/j.jcss.2023.02.004135(89-124)Online publication date: Aug-2023
https://doi.org/10.1016/j.jcss.2023.02.004
Anderton WChakraborty TYoung M(2021)Windowed backoff algorithms for WiFi: theory and performance under batched arrivalsDistributed Computing10.1007/s00446-021-00403-9Online publication date: 13-Sep-2021
https://doi.org/10.1007/s00446-021-00403-9
Gupta DSaia JYoung M(2020)Resource Burning for Permissionless Systems (Invited Paper)Structural Information and Communication Complexity10.1007/978-3-030-54921-3_2(19-44)Online publication date: 28-Jul-2020
https://doi.org/10.1007/978-3-030-54921-3_2
Gupta DSaia JYoung M(2018)Proof of Work Without All the WorkProceedings of the 19th International Conference on Distributed Computing and Networking10.1145/3154273.3154333(1-10)Online publication date: 4-Jan-2018
https://dl.acm.org/doi/10.1145/3154273.3154333
King VPettie SSaia JYoung M(2018)A resource-competitive jamming defenseDistributed Computing10.1007/s00446-017-0313-331:6(419-439)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s00446-017-0313-3
Ogierman ARicha AScheideler CSchmid SZhang J(2018)SadeDistributed Computing10.1007/s00446-017-0307-131:3(241-254)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s00446-017-0307-1
Gilbert SNewport CZheng C(2017)Who are you? Secure identities in single hop ad hoc networksDistributed Computing10.1007/s00446-016-0280-030:2(103-125)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s00446-016-0280-0

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten