Research output per year
Research output per year
Jiangshan Yu, Man Ho Allen Au, Paulo Esteves-Verissimo
Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review
We develop new foundations on transaction untraceability for CryptoNote-style blockchain systems. In particular, we observe new attacks; develop theoretical foundations to model transaction untraceability; provide the least upper bound of transaction untraceability guarantee; provide ways to efficiently and automatically verify whether a given ledger achieves optimal transaction untraceability; and provide a general solution that achieves provably optimal transaction untraceability. Unlike previous cascade effect attacks (ESORICS' 17 and PETS' 18) on CryptoNote-style transaction untraceability, we consider not only a passive attacker but also an active adaptive attacker. Our observed attacks allow both types of attacker to trace blockchain transactions that cannot be traced by using the existing attacks. We develop a series of new games, which we call 'The Sun-Tzu Survival Problem', to model CryptoNote-style blockchain transaction untraceability and our identified attacks. In addition, we obtain seven novel results, where three of them are negative and the rest are positive. In particular, thanks to our abstract game, we are able to build bipartite graphs to model transaction untraceability, and provide reductions to formally relate the hardness of calculating untraceability to the hardness of calculating the number of perfect matchings in all possible bipartite graphs. We prove that calculating transaction untraceability is a #P-complete problem, which is believed to be even more difficult to solve than NP problems. In addition, we provide the first result on the least upper bound of transaction untraceability. Moreover, through our theoretical results, we are able to provide ways to efficiently and automatically verify whether a given ledger achieves optimal transaction untraceability. Furthermore, we propose a simple strategy for CryptoNote-style blockchain systems to achieve optimal untraceability. We take Monero as a concrete example to demonstrate how to apply this strategy to optimise the untraceability guarantee provided by Monero.
Original language | English |
---|---|
Title of host publication | Proceedings - 2019 IEEE 32nd Computer Security Foundations Symposium, CSF 2019 |
Editors | Stephanie Delaune, Limin Jia |
Place of Publication | Piscataway NJ USA |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 94-107 |
Number of pages | 14 |
ISBN (Electronic) | 9781728114064 |
ISBN (Print) | 9781728114088 |
DOIs | |
Publication status | Published - 2019 |
Event | IEEE Computer Security Foundations Symposium 2019 - Hoboken, United States of America Duration: 25 Jun 2019 → 28 Jun 2019 Conference number: 32nd https://web.stevens.edu/csf2019/ https://ieeexplore.ieee.org/xpl/conhome/8804915/proceeding (Proceedings) |
Conference | IEEE Computer Security Foundations Symposium 2019 |
---|---|
Abbreviated title | CSF 2019 |
Country/Territory | United States of America |
City | Hoboken |
Period | 25/06/19 → 28/06/19 |
Internet address |
Research output: Book/Report › Commissioned Report › Other
Jiangshan Yu
18/06/19
1 item of Media coverage
Press/Media: Profile/Interview
Jiangshan Yu
24/04/19
1 item of Media coverage
Press/Media: Article/Feature