|
|
|
|
|
by trevelyan
988 days ago
|
|
Author of the original paper this write-up was based on here. The sybil attack as a theoretical problem is defined in the "Red Balloons" paper ("information propagation without self-cloning") so that might be a good starting point. The solution formally and mathematically achieves these properties: - not profitable to add routing hops
- profitable to share with others
- not profitable to share with yourself (!!!) If you have a single central entity somewhere that isn't a sybil attack. Nothing wrong with being concerned about network centralization, but you're much less likely to have it in sybil-proof systems as above given that nodes suddenly have commercial incentives to share data as opposed to hoarding it. |
|
Unless I’m categorically missing something, Claims like network centralization is much less likely in a Sybil-proof system, is just plain wrong and confusing, to say the least, if discussed “formally” and “mathematically”.
[1] https://www.microsoft.com/en-us/research/publication/the-syb...
[2] https://arxiv.org/pdf/1111.2626.pdf
[3] https://en.wikipedia.org/wiki/DARPA_Network_Challenge?wprov=...
[4] https://link.springer.com/chapter/10.1007/978-3-540-85230-8_...