Fast randomized consensus using shared memory
Journal of Algorithms
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A methodology for hardware verification using compositional model checking
Science of Computer Programming - Special issue on mathematics of program construction
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Coin Lemmas with Random Variables
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Reasoning about Probabilistic Lossy Channel Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Symbolic Computation of Maximal Probabilistic Reachability
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Compositional Methods for Probabilistic Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Secure and Efficient Asynchronous Broadcast Protocols
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Distributing Trust on the Internet
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Secure Intrusion-tolerant Replication on the Internet
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Induction in Compositional Model Checking
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Probabilistic model checking in practice: case studies with PRISM
ACM SIGMETRICS Performance Evaluation Review
Analyzing the one dimensional Ising model by probabilistic model checking
AsiaMS '07 Proceedings of the IASTED Asian Conference on Modelling and Simulation
Quantitative Analysis With the Probabilistic Model Checker PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying team formation protocols with probabilistic model checking
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
Symmetry reduction for probabilistic model checking
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Randomized wait-free consensus using an atomicity assumption
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
Distributed systems increasingly rely on fault-tolerant and secure authorization services. An essential primitive used to implement such services is the Byzantine agreement protocol for achieving agreement among n parties even if t parties (t n/3) are corrupt and behave maliciously. We describe our experience verifying the randomized protocol ABBA (Asynchronous Binary Byzantine Agreement) of Cachin, Kursawe and Shoup [5], a practical protocol that incorporates modern threshold-cryptographic techniques and forms a core of powerful asynchronous broadcast protocols [4]. The protocol is efficient (runs in constant expected time), optimal (it tolerates the maximum number of corrupted parties) and provably secure (in the random oracle model). We model the protocol in Cadence SMV, replacing the coin tosses with nondeterministic choice, and provide a proof of the protocol correctness for all n under the assumption that the cryptographic primitives are correct. The proof is fully automated except for one high-level inductive argument involving probabilistic reasoning. We validate probabilistic reasoning through deriving abstractions for finite configurations (for n up to 20) and model checking those with the probabilistic model checker PRISM.