|
MoneroResearch.info |
 |
 |
 |
Successfully added resource(s) to basket
|
Egger, C., Lai, R. W. F., Ronge, V., Woo, I. K. Y., & Yin, H. H. F. (2022). On defeating graph analysis of anonymous transactions. Proceedings on Privacy Enhancing Technologies, 2022(3). Added by: Rucknium (2/24/22, 3:28 PM) Last edited by: Rucknium (7/5/22, 5:03 PM) |
| Resource type: Journal Article BibTeX citation key: Egger2022 View all bibliographic details  |
Categories: Monero-focused Creators: Egger, Lai, Ronge, Woo, Yin Collection: Proceedings on Privacy Enhancing Technologies |
Views: 26/3245
|
Attachments
popets-2022-0085.pdf  [15/811]
|
URLs https://petsymposi ... pets-2022-0085.pdf, https://eprint.iacr.org/2022/132 |
| Abstract |
|
In a ring-signature-based anonymous cryptocurrency, signers of a transaction are hidden among a set of potential signers, called a ring, whose size is much smaller than the number of all users. The ring-membership relations specified by the sets of transactions thus induce bipartite transaction graphs, whose distribution is in turn induced by the ring sampler underlying the cryptocurrency. Since efficient graph analysis could be performed on transaction graphs to potentially deanonymise signers, it is crucial to understand the resistance of (the transaction graphs induced by) a ring sampler against graph analysis. Of particular interest is the class of partitioning ring samplers. Although previous works showed that they provide almost optimal local anonymity, their resistance against global, e.g. graph-based, attacks were unclear. In this work, we analyse transaction graphs induced by partitioning ring samplers. Specifically, we show (partly analytically and partly empirically) that, somewhat surprisingly, by setting the ring size to be at least logarithmic in the number of users, a graph-analysing adversary is no better than the one that performs random guessing in deanonymisation up to constant factor of 2. |