Practical Large-Scale Proof-Of-Stake Asynchronous Total-Order Broadcast

Alpos, Orestis; Cachin, Christian; Kamp, Simon Holmgaard; Nielsen, Jesper Buus; Bonneau, Joseph; Weinberg, S. Matthew (2023). Practical Large-Scale Proof-Of-Stake Asynchronous Total-Order Broadcast. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik 10.4230/lipics.aft.2023.31

[img]
Preview
Text
LIPIcs.AFT.2023.31.pdf - Published Version
Available under License Creative Commons: Attribution (CC-BY).

Download (1MB) | Preview

We present simple and practical protocols for generating randomness as used by asynchronous total-order broadcast. The protocols are secure in a proof-of-stake setting with dynamically changing stake. They can be plugged into existing protocols for asynchronous total-order broadcast and will turn these into asynchronous total-order broadcast with dynamic stake. Our contribution relies on two important techniques. The paper "Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography" [Cachin, Kursawe, and Shoup, PODC 2000] has influenced the design of practical total-order broadcast through its use of threshold cryptography. However, it needs a setup protocol to be efficient. In a proof-of-stake setting with dynamic stake this setup would have to be continually recomputed, making the protocol impractical. The work "Asynchronous Byzantine Agreement with Subquadratic Communication" [Blum, Katz, Liu-Zhang, and Loss, TCC 2020] showed how to use an initial setup for broadcast to asymptotically efficiently generate sub-sequent setups. The protocol, however, resorted to fully homomorphic encryption and was therefore not practically efficient. We adopt their approach to the proof-of-stake setting with dynamic stake, apply it to the Constantinople paper, and remove the need for fully homomorphic encryption. This results in simple and practical proof-of-stake protocols.

Item Type:

Conference or Workshop Item (Paper)

Division/Institute:

08 Faculty of Science > Institute of Computer Science (INF) > Cryptology and Data Security Group
08 Faculty of Science > Institute of Computer Science (INF)

UniBE Contributor:

Alpos, Orestis Charilaos, Cachin, Christian

Subjects:

000 Computer science, knowledge & systems
500 Science > 510 Mathematics

ISSN:

1868-8969

ISBN:

978-3-95977-303-4

Publisher:

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Language:

English

Submitter:

Christian Cachin

Date Deposited:

28 Mar 2024 08:38

Last Modified:

28 Mar 2024 08:48

Publisher DOI:

10.4230/lipics.aft.2023.31

BORIS DOI:

10.48350/194692

URI:

https://boris.unibe.ch/id/eprint/194692

Actions (login required)

Edit item Edit item
Provide Feedback