TY - GEN
T1 - Toward Self-stabilizing Blockchain, Reconstructing Totally Erased Blockchain (Preliminary Version)
AU - Dolev, Shlomi
AU - Liber, Matan
N1 - Funding Information:
We thank the Lynne and William Frankel Center for Computer Science, the Rita Altura Trust Chair in Computer Science. This research was also supported by a grant from the Ministry of Science & Technology, Israel & the Japan Science and Technology Agency (JST), Japan, and DFG German-Israeli collaborative projects.
Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - Blockchains, that are essentially distributed public ledgers, are extremely popular nowadays and are being used for many applications. One of the more common uses is for crypto-currencies, where they serve as a structure to store all the transactions publicly, securely, and hopefully irreversibly. Blockchains can be permissionless, where everyone can join and potentially contribute the blockchain, and permissioned, where only a few members (usually, much less than a permissionless blockchain) can push new transactions to the chain. While both approaches have their advantages and disadvantages, we will focus on a weakness of permissioned blockchains. The known boundary on the number of faulty participants − up to f fo3ƒ+1 participants − may be surpassed, causing the BFT algorithm to fail. A situation where a malicious adversary compromises/corrupts enough nodes to harm the blockchain may lead to the complete corruption of the ledger and even to the destruction of ledger copies the nodes hold. We will suggest a solution for the reconstruction of the blockchain in the event of such an attack. Our solution will include a mandatory publication of additional information by the private users when submitting transactions and will require them to store their transaction history. We will present a technique, using verifiable secret sharing (VSS), that will make our solution trust-less, immediate and per-user independent. Our technique will prevent the private user from lying, by making such an act enable the possible exposure of the user’s secret key.
AB - Blockchains, that are essentially distributed public ledgers, are extremely popular nowadays and are being used for many applications. One of the more common uses is for crypto-currencies, where they serve as a structure to store all the transactions publicly, securely, and hopefully irreversibly. Blockchains can be permissionless, where everyone can join and potentially contribute the blockchain, and permissioned, where only a few members (usually, much less than a permissionless blockchain) can push new transactions to the chain. While both approaches have their advantages and disadvantages, we will focus on a weakness of permissioned blockchains. The known boundary on the number of faulty participants − up to f fo3ƒ+1 participants − may be surpassed, causing the BFT algorithm to fail. A situation where a malicious adversary compromises/corrupts enough nodes to harm the blockchain may lead to the complete corruption of the ledger and even to the destruction of ledger copies the nodes hold. We will suggest a solution for the reconstruction of the blockchain in the event of such an attack. Our solution will include a mandatory publication of additional information by the private users when submitting transactions and will require them to store their transaction history. We will present a technique, using verifiable secret sharing (VSS), that will make our solution trust-less, immediate and per-user independent. Our technique will prevent the private user from lying, by making such an act enable the possible exposure of the user’s secret key.
KW - Blockchain
KW - Public threshold commitment
KW - Self-stabilization
UR - http://www.scopus.com/inward/record.url?scp=85087767491&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-49785-9_12
DO - 10.1007/978-3-030-49785-9_12
M3 - Conference contribution
AN - SCOPUS:85087767491
SN - 9783030497842
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 175
EP - 192
BT - Cyber Security Cryptography and Machine Learning - 4th International Symposium, CSCML 2020, Proceedings
A2 - Dolev, Shlomi
A2 - Weiss, Gera
A2 - Kolesnikov, Vladimir
A2 - Lodha, Sachin
PB - Springer
T2 - 4th International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2020
Y2 - 2 July 2020 through 3 July 2020
ER -