Filters








79 Hits in 3.6 sec

Abstraction for epistemic model checking of dining cryptographers-based protocols

Omar Al Bataineh, Ron van der Meyden
2011 Proceedings of hte 13th Conference on Theoretical Aspects of Rationality and Knowledge - TARK XIII  
The paper describes an abstraction for protocols that are based on multiple rounds of Chaum's Dining Cryptographers protocol.  ...  This result can be used to optimize model checking of Dining Cryptographers-based protocols, and applied within a methodology for knowledge-based program implementation and verification.  ...  Acknowledgments: Thanks to Xiaowei Huang and Kai Englehardt for comments on an earlier version of the paper.  ... 
doi:10.1145/2000378.2000408 dblp:conf/tark/Al-BatainehM11 fatcat:id2knqxvzjdddl77tzihia6ro4

Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols [article]

Omar I. Al-Bataineh, Ron van der Meyden
2010 arXiv   pre-print
The paper describes an abstraction for protocols that are based on multiple rounds of Chaum's Dining Cryptographers protocol.  ...  This result can be used to optimize model checking of Dining Cryptographers-based protocols, and applied within a methodology for knowledge-based program implementation and verification.  ...  Acknowledgments: Thanks to Xiaowei Huang and Kai Englehardt for comments on an earlier version of the paper.  ... 
arXiv:1010.2287v1 fatcat:ojknvzfzfjdoxmhmseorkwpt6a

A Tool For Specification And Verification Of Epistemic Properties In Interpreted Systems

Franco Raimondi, Alessio Lomuscio
2004 Electronical Notes in Theoretical Computer Science  
We apply this methodology to the verification of a communication protocol -the dining cryptographers. 1  ...  We show how an SMV model checker can be coupled with a Kripke model editor (Akka) to allow for the mechanical verification of epistemic properties of multi-agent systems.  ...  • What particular symbolic representation -OBDD's, SAT-based, etc -is to be used for the model checking task?  ... 
doi:10.1016/s1571-0661(05)82609-x fatcat:xdhxgq3ia5aolely43bmgy77ui

Epistemic Verification of Anonymity

Jan van Eijck, Simona Orzan
2007 Electronical Notes in Theoretical Computer Science  
However, by using epistemic logic (logic of knowledge) to model the protocols, anonymity becomes an easily verifiable epistemic formula.  ...  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.  ...  Acknowledgement We are grateful to Erik de Vink for comments on a previous version of this document.  ... 
doi:10.1016/j.entcs.2006.08.026 fatcat:ifqlfxuohnbrbpmdssluxym574

Optimizing Epistemic Model Checking Using Conditional Independence (Extended Abstract)

Ron van der Meyden
2017 Electronic Proceedings in Theoretical Computer Science  
This paper shows that conditional independence reasoning can be applied to optimize epistemic model checking, in which one verifies that a model for a number of agents operating with imperfect information  ...  The optimization has been implemented in the epistemic model checker MCK. The paper reports experimental results demonstrating that it can yield multiple orders of magnitude performance improvements.  ...  Dining Cryptographers: Our first example is the Dining Cryptographers protocol [7] , discussed above. It was first model checked using epistemic logic in [21] .  ... 
doi:10.4204/eptcs.251.29 fatcat:35uid64y4rhj5j4jqg4oowj64q

Epistemic Model Checking for Knowledge-Based Program Implementation: An Application to Anonymous Broadcast [chapter]

Omar I. Al-Bataineh, Ron van der Meyden
2010 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
The paper describes how epistemic model checking technology may be applied to discover and verify concrete implementations based on this abstract level of description.  ...  The approach is illustrated using extensions of the Dining Cryptographers protocol, a security protocol for anonymous broadcast.  ...  Chaum's dining cryptographers protocol Chaum's dining cryptographers protocol [2, p. 65] is an example of a protocol for secure multiparty computation: it enables the value of a function of a group of  ... 
doi:10.1007/978-3-642-16161-2_25 fatcat:opdbllizpzbqdbiqrpiruz7cmi

Optimizing Epistemic Model Checking using Conditional Independence [article]

Ron van der Meyden
2016 arXiv   pre-print
This paper shows that conditional independence reasoning can also be applied to optimize epistemic model checking, in which one verifies that a model for a number of agents operating with imperfect information  ...  An optimization technique is developed that precedes the use of a model checking algorithm with an analysis that applies conditional independence reasoning to reduce the size of the model.  ...  An example of an application of epistemic model checking, Chaum's Dining Cryptographers protocol [10] is described in Section 3.  ... 
arXiv:1610.03935v1 fatcat:tdrjd6gd5ff6hmtfn7y2zzq6gm

Epistemic Model Checking for Knowledge-Based Program Implementation: an Application to Anonymous Broadcast [article]

Omar I. Al-Bataineh (1,2 University of New South Wales)
2010 arXiv   pre-print
The paper describes how epistemic model checking technology may be applied to discover and verify concrete implementations based on this abstract level of description.  ...  The approach is illustrated using extensions of the Dining Cryptographers protocol, a security protocol for anonymous broadcast.  ...  Chaum's dining cryptographers protocol Chaum's dining cryptographers protocol [2, p. 65] is an example of a protocol for secure multiparty computation: it enables the value of a function of a group of  ... 
arXiv:1004.5130v1 fatcat:qk2ij7oca5ekdk3vjpv3qtkmbq

Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams

Franco Raimondi, Alessio Lomuscio
2007 Journal of Applied Logic  
We present an implementation and report on experimental results for two scenarios: the bit transmission problem with faults and the protocol of the dining cryptographers.  ...  The verification technique relies on model checking via ordered binary decision diagrams.  ...  The protocol of the dining cryptographers The protocol of the dining cryptographers was introduced in [19] , and model checking of its properties was discussed in [20] .  ... 
doi:10.1016/j.jal.2005.12.010 fatcat:lz5ssaqggraapainzft67uhbii

MCMAS: A Model Checker for the Verification of Multi-Agent Systems [chapter]

Alessio Lomuscio, Hongyang Qu, Franco Raimondi
2009 Lecture Notes in Computer Science  
In particular, specification languages based on epistemic logic [7], or logics for knowledge, have proven useful in a variety of areas including robotics, security protocols, web-services, etc.  ...  MCMAS [12] supports specifications based on CTL, epistemic logic (including operators of common and distributed knowledge) [7], Alternating Time Logic [2], and deontic modalities for correctness [16] .  ...  Some of these examples are available from the MCMAS website. To evaluate the tool we discuss the experimental results obtained while verifying the protocol of the dining cryptographers [4] .  ... 
doi:10.1007/978-3-642-02658-4_55 fatcat:stymco64o5ccpntc2gi2hcbmv4

Preservation of epistemic properties in security protocol implementations

Ron van der Meyden, Thomas Wilke
2007 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge - TARK '07  
Our class of protocols contains, for instance, an oblivious transfer protocol by Rivest and Chaum's solution to the dining cryptographers problem.  ...  We introduce (i) a general class of security protocols with private channel as cryptographic primitive and (ii) a probabilistic epistemic logic to express properties of security protocols.  ...  protocol for the dining cryptographers, see [15] .  ... 
doi:10.1145/1324249.1324278 dblp:conf/tark/MeydenW07 fatcat:mi2ucnnqmbbcdlrh7ovfsnzwa4

Knowledge and Security [article]

Riccardo Pucella
2013 arXiv   pre-print
This survey illustrates some of these uses by focusing on confidentiality in the context of cryptographic protocols, and in the context of multi-level security systems.  ...  Epistemic concepts, and in some cases epistemic logic, have been used in security research to formalize security properties of systems.  ...  Thanks to Aslan Askarov, Philippe Balbiani, Stephen Chong, and Vicky Weissman for comments on an early draft of this chapter.  ... 
arXiv:1305.0876v1 fatcat:2ldo7jcaj5ezpfveemzsim7ihq

Symbolic model checking for temporal-epistemic logics

Alessio Lomuscio, Wojciech Penczek
2007 ACM SIGACT News  
We survey some of the recent work in verification via symbolic model checking of temporal-epistemic logic.  ...  Specifically, we discuss OBDD-based and SAT-based approaches for epistemic logic built on discrete and real-time branching time temporal logic.  ...  It offers three complementary methods of model checking: SATbased Bounded Model Checking (BMC), SAT-based Unbounded Model Checking (UMC), and an on-the-fly verification while constructing abstract models  ... 
doi:10.1145/1324215.1324231 fatcat:eyfpocebrnauhi3pv5kzerxm4m

MCMAS: an open-source model checker for the verification of multi-agent systems

Alessio Lomuscio, Hongyang Qu, Franco Raimondi
2015 International Journal on Software Tools for Technology Transfer (STTT)  
We present MCMAS, a model checker for the verification of multi-agent systems.  ...  MCMAS supports efficient symbolic techniques for the verification of multi-agent systems against specifications representing temporal, epistemic and strategic properties.  ...  Acknowledgments The authors would like to thank Jakub Michaliszyn and the anonymous reviewers for valuable feedback on earlier versions of this paper.  ... 
doi:10.1007/s10009-015-0378-x fatcat:4ahtmrxx7ndq5jg2zghtsf3zn4

A Novel Symbolic Approach to Verifying Epistemic Properties of Programs

Nikos Gorogiannis, Franco Raimondi, Ioana Boureanu
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
We prove the correctness of our reduction and we validate our proposal by applying it to two examples: the dining cryptographers problem and the ThreeBallot voting protocol.  ...  We put forward an implementation using existing solvers, and report experimental results showing that the approach can perform better than state-of-the-art symbolic model checkers for temporal-epistemic  ...  We instantiate this framework on two case studies: the dining cryptographers problem [Chaum, 1988] and the ThreeBallot protocol [Rivest and Smith, 2007] .  ... 
doi:10.24963/ijcai.2017/30 dblp:conf/ijcai/GorogiannisRB17 fatcat:ghciudhpznfpbdm7xojcvmjpcm
« Previous Showing results 1 — 15 out of 79 results