We change the security of blockchain transactions by varying the size of consensus committees. To improve performance, such committees operate concurrently. We present two algorithms that allow adaptive security by forming concurrent variable size consensus committees on demand. One is based on a single joint blockchain, the other is based on separate sharded blockchains. For in-committee consensus, we implement synchronous Byzantine fault tolerance algorithm (BFT), asynchronous BFT and proof-of-work consensus. We evaluate the performance of our adaptive security algorithms.
@InProceedings{rai_et_al:OASIcs.Tokenomics.2020.12, author = {Rai, Shishir and Hood, Kendric and Nesterenko, Mikhail and Sharma, Gokarna}, title = {{Blockguard: Adaptive Blockchain Security}}, booktitle = {2nd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2020)}, pages = {12:1--12:5}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-157-3}, ISSN = {2190-6807}, year = {2021}, volume = {82}, editor = {Anceaume, Emmanuelle and Bisi\`{e}re, Christophe and Bouvard, Matthieu and Bramas, Quentin and Casamatta, Catherine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2020.12}, URN = {urn:nbn:de:0030-drops-135347}, doi = {10.4230/OASIcs.Tokenomics.2020.12}, annote = {Keywords: Blockchain, Consensus, Security, Distributed algorithms} }
Feedback for Dagstuhl Publishing