Private Transaction Retrieval for Lightweight Bitcoin Clients

被引:0
|
作者
Xie, Yankai [1 ]
Wang, Qingtao [1 ]
Li, Ruoyue [1 ]
Zhang, Chi [1 ]
Wei, Lingbo [1 ,2 ]
机构
[1] Univ Sci & Technol China, Sch Cyberspace Sci & Technol, Hefei 230027, Anhui, Peoples R China
[2] Hefei Comprehens Natl Sci Ctr, Inst Dataspace, Hefei 230094, Peoples R China
关键词
Bitcoin; Blockchains; Privacy; Servers; Synchronization; Data privacy; Protocols; blockchain; lightweight client; privacy-preserving;
D O I
10.1109/TSC.2023.3290605
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Running a typical Bitcoin client (also called full node) needs more than 444 GB of disk space, considerable time, and computational resources to synchronize the entire blockchain, which is infeasible for resource-constrained devices. To address such concerns, the lightweight Bitcoin client proposed by Satoshi outsources most of computational and storage burdens to full nodes. Unfortunately, interacting with full nodes to query transactions leaks considerable information like addresses and transactions of lightweight client users. Thus, Bitcoin users that rely on lightweight clients are subject to de-anonymization, which defeats users privacy. Traditional schemes cannot support lightweight clients to query transactions from full nodes in an efficient yet privacy-preserving way. In this article, we propose a new efficient yet privacy-preserving transaction query scheme that specially targets the missing support for lightweight clients. We identify unique characteristics of the Bitcoin blockchain and craft a highly customized private information retrieval scheme called BIT-PIR to match the Bitcoin transaction query scenario and boost performances. Moreover, we customize a storage structure of the Bitcoin blockchain so that it further improves the query efficiency of our scheme. Finally, we develop a prototype implementation to demonstrate the feasibility of our proposed scheme.
引用
收藏
页码:3590 / 3603
页数:14
相关论文
共 50 条
  • [21] Abnormal Transaction Node Detection on Bitcoin
    Zhang, Yuhang
    Lu, Yanjing
    Li, Mian
    PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND NETWORKS, VOL III, CENET 2023, 2024, 1127 : 53 - 60
  • [22] Bitcoin as a Transaction Ledger: A Composable Treatment
    Christian Badertscher
    Ueli Maurer
    Daniel Tschudi
    Vassilis Zikas
    Journal of Cryptology, 2024, 37
  • [23] Bitcoin as a Transaction Ledger: A Composable Treatment
    Badertscher, Christian
    Maurer, Ueli
    Tschudi, Daniel
    Zikas, Vassilis
    ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PT I, 2017, 10401 : 324 - 356
  • [24] Bitcoin research with a transaction graph dataset
    Schnoering, Hugo
    Vazirgiannis, Michalis
    SCIENTIFIC DATA, 2025, 12 (01)
  • [25] Visualizing Dynamic Bitcoin Transaction Patterns
    McGinn, Dan
    Birch, David
    Akroyd, David
    Molina-Solana, Miguel
    Guo, Yike
    Knottenbelt, William J.
    BIG DATA, 2016, 4 (02) : 109 - 119
  • [26] Erlay: Efficient Transaction Relay for Bitcoin
    Naumenko, Gleb
    Maxwell, Gregory
    Wuille, Pieter
    Fedorova, Alexandra
    Beschastnikh, Ivan
    PROCEEDINGS OF THE 2019 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'19), 2019, : 817 - 831
  • [27] Transaction activity and bitcoin realized volatility
    Gkillas, Konstantinos
    Tantoula, Maria
    Tzagarakis, Manolis
    OPERATIONS RESEARCH LETTERS, 2021, 49 (05) : 715 - 719
  • [28] Reducing the number of transaction messages in bitcoin
    Misic, Vojislav B.
    Misic, Jelena
    Chang, Xiaolin
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2022, 15 (01) : 768 - 782
  • [29] Long Transaction Chains and the Bitcoin Heartbeat
    Di Battista, Giuseppe
    Di Donato, Valentino
    Pizzonia, Maurizio
    EURO-PAR 2017: PARALLEL PROCESSING WORKSHOPS, 2018, 10659 : 507 - 516
  • [30] Structure and anonymity of the bitcoin transaction graph
    Department of Computer Science, TU Darmstadt, Hochschulstr. 10, Darmstadt
    D-64289, Germany
    不详
    64289, Germany
    不详
    64287, Germany
    Future Internet, 2013, 2 (237-250):