FINDING · DEFENSE
Kaleidoscope bounds censor knowledge by routing proxy advertisements over symmetric random routes of length r=5 on a social trust graph: if the censor controls f subverted trust links, they can learn of at most r×f = 5f users or proxies regardless of how many Sybil identities they generate. Symmetric routing ensures the set a node learns of and the set that learns of a node are identical, closing the asymmetric information-leakage channel.
From 2008-sovran-pass — Pass it on: Social Networks Stymie Censors · §3, §3.2 · 2008 · International Workshop on Peer-to-Peer Systems
Implications
- Bound proxy advertisement fan-out (e.g., r=5 hops) over a trust-anchored graph so a censor's Sybil attacks yield only O(r×f) proxy discoveries rather than full enumeration.
- Enforce symmetric routing so a compromised node's inbound and outbound knowledge sets are equal, preventing extra vantage points from asymmetric probing.
Tags
Extracted by claude-sonnet-4-6 — review before relying.