Brief Announcement Blockguard: Adaptive Blockchain Security

Rai, Shishir; Hood, Kendric; Nesterenko, Mikhail; Sharma, Gokarna

doi:10.1007/978-3-030-34992-9_23

Cited by 3 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We, therefore, built QUANTAS to satisfy the needs of researchers similar to our own. We used QUANTAS prototype in several studies [16,24]. The QUANTAS software is publicly available [1] for other researchers to download and use.…”

Section: Introductionmentioning

confidence: 99%

QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract Simulator

Oglio¹,

Hood²,

Nesterenko³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

We present QUANTAS: a simulator that enables quantitative performance analysis of distributed algorithms. It has a number of attractive features. QUANTAS is an abstract simulator, therefore, the obtained results are not affected by the specifics of a particular network or operating system architecture. QUANTAS allows distributed algorithms researchers to quickly investigate a potential solution and collect data about its performance. QUANTAS programming is relatively straightforward and is accessible to theoretical researchers. To demonstrate QUANTAS capabilities, we implement and compare the behavior of two representative examples from four major classes of distributed algorithms: blockchains, distributed hash tables, consensus, and reliable data link message transmission.

show abstract

Section: Introductionmentioning

confidence: 99%

QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract Simulator

Oglio¹,

Hood²,

Nesterenko³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

Brief Announcement Blockguard: Adaptive Blockchain Security

Rai

Hood

Nesterenko

et al. 2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We consider the problem of varying the security of blockchain transactions according to their importance. This adaptive security is achieved by using variable size consensus committees. To improve performance, such committees function 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, our algorithms may use various available byzantinerobust fault tolerant algorithms (BFT). We implement synchronous BFT, asynchronous BFT and proof-of-work consensus. We thoroughly evaluate the performance of our adaptive security algorithms.

show abstract