No full text
Unpublished conference/Abstract (Scientific congresses, symposiums and conference proceedings)
Re-thinking untraceability in the CryptoNote-style blockchain
Yu, Jiangshan; Au, Man Ho Allen; Verissimo, Paulo
2019IEEE Computer Security Foundations Symposium (CSF) 2019
 

Files


Full Text
No document available.

Send to



Details



Keywords :
blockchain; privacy; formal model
Abstract :
[en] We develop new foundations on transaction untrace- ability 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 bipar- tite 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.
Disciplines :
Computer science
Author, co-author :
Yu, Jiangshan;  Monash University
Au, Man Ho Allen;  Hong Kong Polytechnic University
Verissimo, Paulo ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
External co-authors :
yes
Language :
English
Title :
Re-thinking untraceability in the CryptoNote-style blockchain
Publication date :
June 2019
Event name :
IEEE Computer Security Foundations Symposium (CSF) 2019
Event date :
from 24-27 June 2019
Audience :
International
Focus Area :
Computational Sciences
Funders :
Fonds National de la Recherche Luxembourg (FNR) through PEARL grant FNR/P14/8149128
MonashU-PolyU-Collinstar Capital Joint Lab on Blockchain and Cryptocurrency Technologies
Research Grants Council of Hong Kong (Grant No. 25206317)
Available on ORBilu :
since 27 July 2019

Statistics


Number of views
171 (14 by Unilu)
Number of downloads
0 (0 by Unilu)

Bibliography


Similar publications



Contact ORBilu