The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Reasoning about knowledge
Common knowledge and update in finite environments
Information and Computation
Dynamic Logic
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
A Practical Secret Voting Scheme for Large Scale Elections
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
CONCUR 2005 - Concurrency Theory
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Logics of communication and change
Information and Computation
Information hiding, anonymity and privacy: a modular approach
Journal of Computer Security - Special issue on WITS'02
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysis of an electronic voting protocol in the applied pi calculus
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Refinement of Kripke Models for Dynamics
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
A survey of state-of-the-art in anonymity metrics
Proceedings of the 1st ACM workshop on Network data anonymization
Specification of Electronic Voting Protocol Properties Using ADM Logic: FOO Case Study
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
Epistemic Logic for the Applied Pi Calculus
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Operational and epistemic approaches to protocol analysis: bridging the gap
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Anonymity, Privacy, Onymity, and Identity: A Modal Logic Approach
Transactions on Data Privacy
| Hi-index | 0.00 |
Anonymity is not a trace-based property, therefore traditional model checkers are not directly able to express it and verify it. However, by using epistemic logic (logic of knowledge) to model the protocols, anonymity becomes an easily verifiable epistemic formula. We propose using Dynamic Epistemic Logic to model security protocols and properties, in particular anonymity properties. We have built tool support for DEL verification which reuses state-of-the-art tool support for automata-based verification. We illustrate this approach by analyzing an anonymous broadcast protocol and an electronic voting protocol. By comparison with a process-based analysis of the same protocols, we also discuss the relative (dis)advantages of the process-based and epistemic-based verification methods in general.