On the public citation graph

SybilCast

0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-45748-8_24openalex-snapshot
The Sybil Attack
inferredcites →https://doi.org/10.1007/978-3-642-02085-8_1openalex-snapshot
Speed Dating Despite Jammers
inferredcites →https://doi.org/10.1007/bf01940883openalex-snapshot
Proportionate Progress: A Notion of Fairness in Resource Allocation
inferredcites →https://doi.org/10.1109/dsn.2010.5545006openalex-snapshot
Observable non-Sybil quorums construction in one-hop wireless ad hoc networks
inferredcites →https://doi.org/10.1109/icdcs.2011.8openalex-snapshot
Competitive and Fair Medium Access Despite Reactive Jamming
inferredcites →https://doi.org/10.1109/infcom.2003.1208924openalex-snapshot
Understanding TCP fairness over wireless LAN
inferredcites →https://doi.org/10.1109/sp.2008.13openalex-snapshot
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
inferredcites →https://doi.org/10.1109/sp.2008.9openalex-snapshot
Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping
inferredcites →https://doi.org/10.1145/1031495.1031513openalex-snapshot
Congestion control and fairness for many-to-one routing in sensor networks
inferredcites →https://doi.org/10.1145/1400751.1400759openalex-snapshot
A jamming-resistant MAC protocol for single-hop wireless networks
inferredcites →https://doi.org/10.1145/1582716.1582749openalex-snapshot
The wireless synchronization problem
inferredcites →https://doi.org/10.1145/1592451.1592452openalex-snapshot
A survey of attack and defense techniques for reputation systems
inferredcites →https://doi.org/10.1145/2332432.2332488openalex-snapshot
Competitive and fair throughput for co-existing networks under adversarial interference
inferredcites →https://doi.org/10.1145/345910.345925openalex-snapshot
Achieving MAC layer fairness in wireless packet networks
inferredcites →https://doi.org/10.1145/501445.501447openalex-snapshot
On max-min fairness and scheduling in wireless ad-hoc networks
inferredcites →https://doi.org/10.1145/984622.984660openalex-snapshot
The sybil attack in sensor networks
inferredcites →https://doi.org/10.1515/9780691206844openalex-snapshot
Pseudorandomness and Cryptographic Applications
inferredcites →https://doi.org/10.48550/arxiv.cs/9809099openalex-snapshot
A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-54921-3_2openalex-snapshot
Resource Burning for Permissionless Systems (Invited Paper)
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_16openalex-snapshot
Who Are You? Secure Identities in Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/s00446-016-0280-0openalex-snapshot
Who are you? Secure identities in single hop ad hoc networks
inferred← citeshttps://doi.org/10.1007/s00446-017-0307-1openalex-snapshot
Sade: competitive MAC under adversarial SINR
inferred← citeshttps://doi.org/10.1007/s00446-017-0313-3openalex-snapshot
A resource-competitive jamming defense
inferred← citeshttps://doi.org/10.1007/s00446-021-00403-9openalex-snapshot
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.07.001openalex-snapshot
Packet latency of deterministic broadcasting in adversarial multiple access channels
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.02.004openalex-snapshot
Bankrupting Sybil despite churn
inferred← citeshttps://doi.org/10.1109/icdcs51616.2021.00048openalex-snapshot
Bankrupting Sybil Despite Churn
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00115openalex-snapshot
Peace Through Superior Puzzling: An Asymmetric Sybil Defense
inferred← citeshttps://doi.org/10.48550/arxiv.1708.01285openalex-snapshot
Proof of Work Without All the Work: Computationally Efficient Attack-Resistant Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1911.06462openalex-snapshot
Resource-Competitive Sybil Defenses
inferred← citeshttps://doi.org/10.48550/arxiv.2006.04865openalex-snapshot
Resource Burning for Permissionless Systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.