Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol

Authors:
Magdalena Kacprzak;Alessio Lomuscio;Artur Niewiadomski;Wojciech Penczek;Franco Raimondi;Maciej Szreter
Affiliations:
Białystok University of Technology, PL. E-mail: mdkacprzak@wp.pl;University College London, UK. E-mail: a.lomuscio@cs.ucl.ac.uk;Podlasie Academy, PL. E-mail: artur@iis.ap.siedlce.pl;Institute of Computer Science, PAS, and Podlasie Academy, PL. E-mail: penczek@ipipan.waw.pl;University College London, UK. E-mail: a.lomuscio@cs.ucl.ac.uk;Institute of Computer Science, PAS, PL. E-mail: mszreter@ipipan.waw.pl
Venue:
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Year:
2006

Citing 15
Cited 8

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Reasoning about knowledge

Reasoning about knowledge
Using CSP to Detect Errors in the TMN Protocol

IEEE Transactions on Software Engineering
Logic in computer science: modelling and reasoning about systems

Logic in computer science: modelling and reasoning about systems
Model checking

Model checking
Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Model Checking Programs

ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Verifying epistemic properties of multi-agent systems via bounded model checking

AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Symbolic Model Checking the Knowledge of the Dining Cryptographers

CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Verification of Multiagent Systems via Ordered Binary Decision Diagrams: An Algorithm and Its Implementation

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
√erics: a tool for verifying timed automata and estelle specifications

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
MCMAS: a model checker for multi-agent systems

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Bounded Model Checking for the Universal Fragment of CTL

Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)

Symbolic model checking for temporal-epistemic logics

ACM SIGACT News
Symbolic model checking for temporal-epistemic logic

Logic Programs, Norms and Action
LDYIS: a Framework for Model Checking Security Protocols

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
SAT-based Unbounded Model Checking of Timed Automata

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
VerICS 2007 - a Model Checker for Knowledge and Real-Time

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Verification of the TESLA protocol in MCMAS-X

Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance

Autonomous Agents and Multi-Agent Systems
Algorithmic probabilistic game semantics

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of a network of communicating automata and verify that the protocol meets the anonymity requirements specified. Two different model checking techniques (ordered binary decision diagrams and SAT-based bounded model checking) are evaluated and compared to verify the protocols.