Our work focuses on the design of a scalable permissionless blockchain in the proof-of-stake setting. In particular, we use a distributed hash table as a building block to set up randomized shards, and then leverage the sharded architecture to validate blocks in an efficient manner. We combine verifiable Byzantine agreements run by shards of stakeholders and a block validation protocol to guarantee that forks occur with negligible probability. We impose induced churn to make shards robust to eclipse attacks, and we rely on the UTXO coin model to guarantee that any stakeholder action is securely verifiable by anyone. Our protocol works against adaptive adversary, and makes no synchrony assumption beyond what is required for the byzantine agreement.
CITATION STYLE
Durand, A., Anceaume, E., & Ludinard, R. (2019). StakeCube: Combining sharding and proof-of-stake to build fork-free secure permissionless distributed ledgers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11704 LNCS, pp. 148–165). Springer. https://doi.org/10.1007/978-3-030-31277-0_10
Mendeley helps you to discover research relevant for your work.