|
MoneroResearch.info |
 |
 |
 |
|
Fanti, G., Venkatakrishnan, S. B., Bakshi, S., Denby, B., Bhargava, S., & Miller, A., et al. (2018). Dandelion++: Lightweight Cryptocurrency Networking with Formal Anonymity Guarantees, Proc. ACM Meas. Anal. Comput. Syst. 2(2). Added by: Rucknium (22/10/2022, 20:53) |
 |
| Resource type: Journal Article DOI: 10.1145/3224424 BibTeX citation key: Fanti2018a View all bibliographic details  |
Categories: Not Monero-focused Keywords: anonymity, cryptocurrencies, p2p networks Creators: Bakshi, Bhargava, Denby, Fanti, Miller, Venkatakrishnan, Viswanath Collection: Proc. ACM Meas. Anal. Comput. Syst. |
Views: 83/2357
|
Attachments
fanti2018.pdf  [19/984]
|
URLs https://doi.org/10.1145/3224424 |
| Abstract |
|
Recent work has demonstrated significant anonymity vulnerabilities in Bitcoin's networking stack. In particular, the current mechanism for broadcasting Bitcoin transactions allows third-party observers to link transactions to the IP addresses that originated them. This lays the groundwork for low-cost, large-scale deanonymization attacks. In this work, we present Algopp, a first-principles defense against large-scale deanonymization attacks with near-optimal information-theoretic guarantees. Dandelion++ builds upon a recent proposal called Dandelion that exhibited similar goals. However, in this paper, we highlight some simplifying assumptions made in Dandelion, and show how they can lead to serious deanonymization attacks when violated. In contrast, Dandelion++ defends against stronger adversaries that are allowed to disobey protocol. Dandelion++ is lightweight, scalable, and completely interoperable with the existing Bitcoin network. We evaluate it through experiments on Bitcoin's mainnet (i.e., the live Bitcoin network) to demonstrate its interoperability and low broadcast latency overhead.
Added by: Rucknium |