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

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.

• Type: Journal
• Year: 2006
• Where: FUIN
• Authors: Magdalena Kacprzak, Alessio Lomuscio, Artur Niewiadomski, Wojciech Penczek, Franco Raimondi, Maciej Szreter
• Keywords: Checking, Dining Cryptographers Protocol, FUIN 2006, Model