Symbolic Model Checking the Knowledge of the Dining Cryptographers

Authors:
Ron van der Meyden;Kaile Su
Affiliations:
University of New South Wales, Australia;Zhongshan University, China
Venue:
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Year:
2004

Citing 0
Cited 46

Complexity results for logics of local reasoning and inconsistent belief

TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Synthesis of distributed systems from knowledge-based specifications

CONCUR 2005 - Concurrency Theory
Anonymity and information hiding in multiagent systems

Journal of Computer Security
The interpreted system model of knowledge, belief, desire and intention

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Epistemic Verification of Anonymity

Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Bounded model checking for knowledge and real time

Artificial Intelligence
Symbolic model checking for temporal-epistemic logics

ACM SIGACT News
Preservation of epistemic properties in security protocol implementations

TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Bounded Model Checking Real-Time Multi-agent Systems with Clock Differences: Theory and Implementation

Model Checking and Artificial Intelligence
Model Checking Knowledge and Linear Time: PSPACE Cases

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Refinement of Kripke Models for Dynamics

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
LDYIS: a Framework for Model Checking Security Protocols

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Model checking temporal logics of knowledge in distributed systems

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall

Computational Logic in Multi-Agent Systems
Observation-based model for BDI-agents

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Automatic verification of knowledge and time with NuSMV

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A symmetry reduction technique for model checking temporal-epistemic logic

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A Data Symmetry Reduction Technique for Temporal-epistemic Logic

ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Model Checking Games for a Fair Branching-Time Temporal Epistemic Logic

AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
A framework for automatically checking anonymity with µCRL

TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Measuring anonymity with relative entropy

FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Symbolic model checking temporal logics of knowledge in multi-agent system via extended Mu-calculus

LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
Partial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Symbolic model checking of probabilistic knowledge

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Abstraction for epistemic model checking of dining cryptographers-based protocols

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Anonymity, Privacy, Onymity, and Identity: A Modal Logic Approach

Transactions on Data Privacy
The BMC method for the existential part of RTCTLK and interleaved interpreted systems

EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
A combination of explicit and deductive knowledge with branching time: completeness and decidability results

DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
A complete first-order temporal BDI logic for forest multi-agent systems

Knowledge-Based Systems
Observation-Based logic of knowledge, belief, desire and intention

KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
The shadow knows: refinement of ignorance in sequential programs

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Verification of multi-agent systems via bounded model checking

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Calculus of cooperation and game-based reasoning about protocol privacy

ACM Transactions on Computational Logic (TOCL)
Analyzing multi-agent systems with probabilistic model checking approach

Proceedings of the 34th International Conference on Software Engineering
Symbolic model checking for temporal-epistemic logic

Logic Programs, Norms and Action
Bounded model checking for the existential part of real-time CTL and knowledge

CEE-SET'09 Proceedings of the 4th IFIP TC 2 Central and East European conference on Advances in Software Engineering Techniques
Group synthesis for parametric temporal-epistemic logic

Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
LDYIS: a Framework for Model Checking Security Protocols

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Interpreted systems semantics for process algebra with identity annotations

TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Bounded planning for strategic goals with incomplete information and perfect recall

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
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

This paper describes the application of symbolic techniques(in particular, OBDD's) to model checking specificationsin the logic of knowledge for an agent operating withsynchronous perfect recall in an environment of which it hasincomplete knowledge. It discusses the application of thesetechiques to the verification of a security protocol: Chaum'sDining Cryptographers protocol, which provides a mechanismfor anonymous broadcast.