Federated Byzantine Agreement Protocol Robustness to Targeted Network Attacks

Tumas, Vytautas; Rivera, Sean; Magoni, Damien; State, Radu

doi:10.1109/iscc58397.2023.10217935

Cited by 4 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…the deeper the forest, the fewer the topmost CHs that verify transactions and blocks, the shorter the consensus delays using a consensus-agnostic consensus-accelerating protocol that we propose, and the more scalable the model becomes. This is the primary motivation for our multi-tiered clustered design concept versus other horizontally clustered flat and two-tiered designs where clustering serves as an essential element of the consensus algorithm akin to Federated Byzantine Agreement (FBA) [16], Quorum [17] and context-based consensus [18]. Since IoT nature dictates a need to dynamically add or remove IoTDs to/from the system, cluster size can become too large to be managed or too small to perform consensus.…”

Section: Architecturementioning

confidence: 99%

A Blockchain Auto-Scaling Node Organizing Design Model for the Internet of Things

ELSAADANY,

Bégin

2024

Preprint

View full text Add to dashboard Cite

Many node-organizing blockchain models for IoT lack the scalability needed for high transaction volumes and mechanisms to manage decentralization and node overhead. This study proposes a multi-tiered Self-Scalable Dynamic architecture based on a forest of trees to improve scalability and efficiency by clustering all nodes to limit those involved in consensus. In addition to the architecture, our contributions include: i) A protocol to speed up consensus. ii) A mechanism for efficient node-lookup and message-routing. iii) A dynamic algorithm to balance overhead and decentralization. iv) A colocality mechanism to enhance consensus time. This architecture reduces consensus time with an upper bound of O(1) plus a propagation delay factor. As more IoT devices join, resulting in a deeper forest, the model becomes more scalable with shorter consensus delays. The proposed mechanisms may serve as general-purpose solutions for scalability, load balancing, node-lookup and message-routing, and are application-, clustering-, and consensus-algorithm-agnostic.

show abstract

Section: Architecturementioning

confidence: 99%