Towards a Verified Model of the Algorand Consensus Protocol in Coq

Alturki, Musab A.; Chen, Jing; Luchangco, Victor; Moore, B.; Palmskog, Karl; Peña, Lucas; Roşu, Grigore

doi:10.1007/978-3-030-54994-7_27

Cited by 13 publications

(13 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Alturki et al [29] developed a state-transition formal model of the Algorand consensus protocol and verified its asynchronous safety using Coq proof assistant. e authors claim that their model is general and can be adopted to prove other properties (e.g., liveness) of the protocol.…”

Section: Formal Software Verificationmentioning

confidence: 99%

“…Images. To state and prove interesting properties of binary and grayscale images, different operations over pixels and images are first defined in Listing 10. ese operations include equality of colors eqbcol (lines 1-6), negation of a color negcolor (lines 8-12), negation of a pixel color negpix (lines 14-17), negation of a binary image negimage (lines[19][20][21][22][23], equality of pixels eqpixel (lines[25][26][27][28][29], and negation of a specific pixel in an image negpiximg (lines 31-37), respectively. e first function eqbcol defines when two colors are equal.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Proving Reliability of Image Processing Techniques in Digital Forensics Applications

Iqbal

Khan

Alothaim

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

Binary images have found its place in many applications, such as digital forensics involving legal documents, authentication of images, digital books, contracts, and text recognition. Modern digital forensics applications involve binary image processing as part of data hiding techniques for ownership protection, copyright control, and authentication of digital media. Whether in image forensics, health, or other fields, such transformations are often implemented in high-level languages without formal foundations. The lack of formal foundation questions the reliability of the image processing techniques and hence the forensic results loose their legal significance. Furthermore, counter-forensics can impede or mislead the forensic analysis of the digital images. To ensure that any image transformation meet high standards of safety and reliability, more rigorous methods should be applied to image processing applications. To verify the reliability of these transformations, we propose to use formal methods based on theorem proving that can fulfil high standards of safety. To formally investigate binary image processing, in this paper, a reversible formal model of the binary images is defined in the Proof Assistant Coq. Multiple image transformation methods are formalized and their reliability properties are proved. To analyse real-life RGB images, a prototype translator is developed that reads RGB images and translate them to Coq definitions. As the formal definitions and proof scripts can be validated automatically by the computer, this raises the reliability and legal significance of the image forensic applications.

show abstract

Section: Formal Software Verificationmentioning

confidence: 99%

mentioning

confidence: 99%

Proving Reliability of Image Processing Techniques in Digital Forensics Applications

Iqbal

Khan

Alothaim

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Alturki et al [2] use Coq to formally verify correctness of Algorand's [20] consensus protocol. Their correctness condition is slightly different as Algorand's protocol seeks to ensure that exactly one block is certified per round, implying a total order on all certified blocks.…”

Section: Other Bft Consensus Protocolsmentioning

confidence: 99%

Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version

Carr¹,

Moir²,

Miraldo³

et al. 2022

Preprint

View full text Add to dashboard Cite

LibraBFT is a Byzantine Fault Tolerant (BFT) consensus protocol based on HotStuff. We present an abstract model of the protocol underlying HotStuff / LibraBFT, and formal, machine-checked proofs of their core correctness (safety) property and an extended condition that enables non-participating parties to verify committed results. (Liveness properties would be proved for specific implementations, not for the abstract model presented in this paper.) A key contribution is precisely defining assumptions about the behavior of honest peers, in an abstract way, independent of any particular implementation. Therefore, our work is an important step towards proving correctness of an entire class of concrete implementations, without repeating the hard work of proving correctness of the underlying protocol. The abstract proofs are for a single configuration (epoch); extending these proofs across configuration changes is future work. Our models and proofs are expressed in Agda, and are available in open source.⋆ This is an extended version of a conference paper with the same title in the proceedings of the 14th NASA Formal Methods Symposium (NFM 2022). It contains additional details and proof overviews.

show abstract

“…We write Γ t − → 1 Γ ′ to mean: if the transaction t is performed in blockchain state Γ, then the blockchain evolves to state Γ ′ . 9 We specify the transition relation − → 1 through a set of inference rules (see Fig. 4 in the Appendix for the full definition): each rule describes the effect of a transaction t in the state Γ of eq.…”

Section: Executing Single Transactionsmentioning

confidence: 99%

“…Algorand [21] is a late-generation blockchain that features a set of interesting features, including high-scalability and a no-forking consensus protocol based on Proof-of-Stake [9]. Its smart contract layer (ASC1) aims to mitigate smart contract risks, and adopts a non-Turing-complete programming model, natively supporting atomic sets of transactions and user-defined assets.…”

Section: Introductionmentioning

confidence: 99%

A formal model of Algorand smart contracts

Bartoletti¹,

Bracciali²,

Lepore³

et al. 2020

Preprint

View full text Add to dashboard Cite

We develop a formal model of Algorand stateless smart contracts (stateless ASC1.) We exploit our model to prove fundamental properties of the Algorand blockchain, and to establish the security of some archetypal smart contracts. While doing this, we highlight various design patterns supported by Algorand. We perform experiments to validate the coherence of our formal model w.r.t. the actual implementation.

show abstract

Towards a Verified Model of the Algorand Consensus Protocol in Coq

Cited by 13 publications

References 5 publications

Proving Reliability of Image Processing Techniques in Digital Forensics Applications

Proving Reliability of Image Processing Techniques in Digital Forensics Applications

Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version

A formal model of Algorand smart contracts

Contact Info

Product

Resources

About