WIKINDX Resources

Fanti, G., Venkatakrishnan, S. B., Bakshi, S., Denby, B., Bhargava, S., & Miller, A., et al. (2018). Dandelion++ lightweight cryptocurrency networking with formal anonymity guarantees. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 2(2), 1–35. 
Added by: Jack (2022-04-01 18:41)   Last edited by: Jack (2023-01-20 17:44)
Resource type: Journal Article
BibTeX citation key: Fanti2018
View all bibliographic details
Categories: Monero-focused
Creators: Bakshi, Bhargava, Denby, Fanti, Miller, Venkatakrishnan, Viswanath
Collection: Proceedings of the ACM on Measurement and Analysis of Computing Systems
Views: 15/1781
Attachments   D++.pdf [10/394] URLs ... bs/10.1145/3224424
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 Dandelion++, 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.
WIKINDX 6.5.0 | Total resources: 187 | Username: -- | Bibliography: WIKINDX Master Bibliography | Style: American Psychological Association (APA)