Work

Comparing BDD and SAT based techniques for model checking Chaum's Dining Cryptographers Protocol

Year: 2006
Type: article
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.
Language: English
Open Access status: green
OpenAlex ID: W1781752104
FWCI: 6.124
Cites: 28
Cited by: 47
Related to: 10