18:39:46 <m-relay> <a​ck-j:matrix.org> De-anonymizing Monero: A Maximum Weighted Matching-Based Approach.
18:39:46 <m-relay> <a​ck-j:matrix.org> https://moneroresearch.info/index.php?action=resource_RESOURCEVIEW_CORE&id=260
18:42:07 <m-relay> <a​ck-j:matrix.org> This paper has a flashy title but they use the ML dataset I published and achieved roughly the same accuracy with a ring size of 11 (slightly above random guessing). Nice to see that my approach was validated by a different group and no significant privacy leak was discovered in the metadata.
18:43:55 <m-relay> <r​ucknium:monero.social> xmrack: On a very quick skim, it looked like they tried to use a graph attack, too. Is that correct? Like the DM decomposition paper.
18:45:07 <m-relay> <r​ucknium:monero.social> AFAIK, your paper only used, at most, one hop backward in the tx graph.
18:45:56 <m-relay> <a​ck-j:matrix.org> I used two hops IIRC but its been a while
18:47:32 <m-relay> <r​ucknium:monero.social> I'll try to read their paper in full before next meeting.
18:47:35 <m-relay> <a​ck-j:matrix.org> https://matrix.monero.social/_matrix/media/v1/download/matrix.org/dUGnAyljDSxMpmeBjCiNAYco
18:48:02 <m-relay> <a​ck-j:matrix.org> I used two hops but labeled them as hop 0 and hop 1
18:48:18 <m-relay> <r​ucknium:monero.social> This is the second paper that has used your dataset, right? Beside your own paper, of course.
18:50:42 <m-relay> <a​ck-j:matrix.org> Correct, i’m pretty happy about that :)