Updatable Blockchains

被引:6
|
作者
Ciampi, Michele [2 ]
Karayannidis, Nikos [1 ]
Kiayias, Aggelos [1 ,2 ]
Zindros, Dionysis [3 ]
机构
[1] Input Output HK Ltd, Hong Kong, Peoples R China
[2] Univ Edinburgh, Edinburgh, Midlothian, Scotland
[3] Natl & Kapodistrian Univ Athens, Athens, Greece
来源
关键词
Blockchain; Update; Ledger;
D O I
10.1007/978-3-030-59013-0_29
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Software updates for blockchain systems become a real challenge when they impact the underlying consensus mechanism. The activation of such changes might jeopardize the integrity of the blockchain by resulting in chain splits. Moreover, the software update process should be handed over to the community and this means that the blockchain should support updates without relying on a trusted party. In this paper, we introduce the notion of updatable blockchains and show how to construct blockchains that satisfy this definition. Informally, an updatable blockchain is a secure blockchain and in addition it allows to update its protocol preserving the history of the chain. In this work, we focus only on the processes that allow securely switching from one blockchain protocol to another assuming that the blockchain protocols are correct. That is, we do not aim at providing a mechanism that allows reaching consensus on what is the code of the new blockchain protocol. We just assume that such a mechanism exists (like the one proposed in NDSS 2019 by Zhang et al.), and show how to securely go from the old protocol to the new one. The contribution of this paper can be summarized as follows. We provide the first formal definition of updatable ledgers and propose the description of two compilers. These compilers take a blockchain and turn it into an updatable blockchain. The first compiler requires the structure of the current and the updated blockchain to be very similar (only the structure of the blocks can be different) but it allows for an update process more simple, efficient. The second compiler that we propose is very generic (i.e., makes few assumptions on the similarities between the structure of the current blockchain and the update blockchain). The drawback of this compiler is that it requires the new blockchain to be resilient against a specific adversarial behaviour and requires all the honest parties to be online during the update process. However, we show how to get rid of the latest requirement (the honest parties being online during the update) in the case of proof-of-work and proof-of-stake ledgers.
引用
收藏
页码:590 / 609
页数:20
相关论文
共 50 条
  • [31] Data Science on Blockchains
    Akcora, Cuneyt Gurcan
    Kantarcioglu, Murat
    Gel, Yulia R.
    KDD '21: PROCEEDINGS OF THE 27TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2021, : 4025 - 4026
  • [32] Take advantage of blockchains
    Guertzgen, Stefan
    Chemical Processing, 2019, 81 (08):
  • [33] Blockchains and constitutional catallaxy
    Alastair Berg
    Chris Berg
    Mikayla Novak
    Constitutional Political Economy, 2020, 31 : 188 - 204
  • [34] Survey: Sharding in Blockchains
    Yu, Guangsheng
    Wang, Xu
    Yu, Kan
    Ni, Wei
    Zhang, J. Andrew
    Liu, Ren Ping
    IEEE ACCESS, 2020, 8 (08): : 14155 - 14181
  • [35] Blockchains and the Logic of Accountability
    Herlihy, Maurice
    Moir, Mark
    PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, : 27 - 30
  • [36] Cryptographic primitives in blockchains
    Wang, Licheng
    Shen, Xiaoying
    Li, Jing
    Shao, Jun
    Yang, Yixian
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2019, 127 : 43 - 58
  • [37] Corporate Governance and Blockchains*
    Yermack, David
    REVIEW OF FINANCE, 2017, 21 (01) : 7 - 31
  • [38] The Hermes BFT for Blockchains
    Jalalzai, Mohammad M.
    Feng, Chen
    Busch, Costas
    Richard, Golden G., III
    Niu, Jianyu
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2022, 19 (06) : 3971 - 3986
  • [39] Forward analysis of updatable timed automata
    Bouyer, P
    FORMAL METHODS IN SYSTEM DESIGN, 2004, 24 (03) : 281 - 320
  • [40] Updatable Encryption from Group Actions
    Leroux, Antonin
    Romeas, Maxime
    POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2024, PT II, 2024, 14772 : 20 - 53