Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Reasoning about knowledge
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Common knowledge and update in finite environments
Information and Computation
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Knowledge and the logic of local propositions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Another Look at LTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Model Checking Temporal Logics of Knowledge Via OBDDs1
The Computer Journal
Model checking temporal logics of knowledge in distributed systems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
Abstraction for epistemic model checking of dining cryptographers-based protocols
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Hi-index | 0.00 |
The importance of anonymity has increased over the past few years in many applications. Herbivore is a distributed anonymous communication system, providing private file sharing and messaging over the Internet. In this paper, we utilize MCTK to model the round protocol of the Herbivore system and verify the anonymity and other knowledge properties that the protocol should provide, where MCTK is an OBDD-based symbolic model checker for temporal logic of knowledge developed by us, under the semantics of interpreted systems with local propositions. We model the round protocol of the Herbivore system in MCTK under the assumption that all agents have perfect recall of all observations. We implement the round protocol of the Herbivore system in MCTK and another epistemic model checker MCK. The encouraging experimental results show the validity of our MCTK.