102 research outputs found

    Towards Model Checking Cryptographic Protocols with Dynamic Epistemic Logic

    Get PDF
    We present a variant of Kripke models to model knowledge of large numbers, applicable to cryptographic protocols. Our Epistemic Crypto Logic is a variant of Dynamic Epistemic Logic to describe com- munication and computation in a multi-agent setting. It is interpreted on register models which eciently encode larger Kripke models. As an example we formalize the well-known Die-Hellman key exchange. The presented register models also motivate a Monte Carlo method for model checking which we compare against a standard algorithm, using the key exchange as a benchmark

    Dynamic epistemic verification of security protocols: framework and case study

    Get PDF
    We propose a dynamic epistemic framework for the verification of security protocols. First, we introduce a dynamic epistemic logic equipped with iteration and cryptographic supplements in which we can formalize and check (epistemic) requirements of security protocols. On top of this, we give a general guide how to go from a protocol specification to its representation in our framework. We demonstrate this by checking requirements of a simplified version of a protocol for confidential message comparison

    Semantic results for ontic and epistemic change

    Get PDF

    Crossing Hands in the Russian Cards Problem

    Get PDF
    When communicating using an unconditionally secure protocol, a sender and receiver is able to transmit secret information over a public, insecure channel without fear of the secret being intercepted by a third party. The Russian cards problem is an example of an unconditionally secure protocol where the communication is fully understandable for everyone listening in. Even though everyone can understand what is being said, only the sender and receiver are able to uncover the secrets being transmitted. In this thesis we investigate the interaction among the communicating parties. By extending existing problem-specific software we are able to more efficiently analyze protocols, and we are therefore able to provide an answer to an open problem in the literature. We provide a completely new solution to the Russian cards protocol and show that it fulfills all requirements by the problem. Discovering this new solution provides the person initiating the protocol two new strategies to choose from when constructing the initial announcement of the protocol.Masteroppgave i informasjonsvitenskapINFO39

    Discourses on social software

    Full text link
    Can computer scientists contribute to the solution of societal problems? Can logic help to model social interactions? Are there recipes for making groups with diverging preferences arrive at reasonable decisions? Why is common knowledge important for social interaction? Does the rational pursuit of individual interests put the public interest in danger, and if so, why? Discourses on Social Software sheds light on these and similar questions. This book offers the reader an ideal introduction to the exciting new field of social software. It shows in detail the many ways in which the seemingly abstract sciences of logic and computer science can be put to use to analyse and solve contemporary social problems. The unusual format of a series of discussions among a logician, a computer scientist, a philosopher and some researchers from other disciplines encourages the reader to develop his own point of view. The only requirements for reading this book are a nodding familiarity with logic, a curious mind, and a taste for spicy debate.Kunnen de computerwetenschappers bijdragen aan een oplossing van sociale problemen? Kan logica gebruikt worden om sociale interactie te modelleren? Zijn er regels op te stellen om groepen met afwijkende voorkeuren tot redelijke besluiten te laten komen? Discourses on Social Software biedt de lezer een ideale inleiding op (nog nieuwe) gebied van sociale software. Het toont in detail de vele manieren waarin de schijnbaar abstracte wetenschappen van logica en computerwetenschap aan het werk kunnen worden gezet om eigentijdse sociale problemen te analyseren en op te lossen. Door de ongebruikelijke aanpak in dit boek, namelijk door discussies tussen een logicus, een computerwetenschapper, een filosoof en onderzoekers uit andere disciplines, wordt de lezer aangemoedigd zijn eigen standpunt te ontwikkelen. De enige vereisten om dit boek te lezen zijn enige vertrouwdheid met de logica, een nieuwsgierige geest, en liefde voor een pittig debat

    New Directions in Model Checking Dynamic Epistemic Logic

    Get PDF
    Dynamic Epistemic Logic (DEL) can model complex information scenarios in a way that appeals to logicians. However, its existing implementations are based on explicit model checking which can only deal with small models, so we do not know how DEL performs for larger and real-world problems. For temporal logics, in contrast, symbolic model checking has been developed and successfully applied, for example in protocol and hardware verification. Symbolic model checkers for temporal logics are very efficient and can deal with very large models. In this thesis we build a bridge: new faithful representations of DEL models as so-called knowledge and belief structures that allow for symbolic model checking. For complex epistemic and factual change we introduce transformers, a symbolic replacement for action models. Besides a detailed explanation of the theory, we present SMCDEL: a Haskell implementation of symbolic model checking for DEL using Binary Decision Diagrams. Our new methods can solve well-known benchmark problems in epistemic scenarios much faster than existing methods for DEL. We also compare its performance to to existing model checkers for temporal logics and show that DEL can compete with established frameworks. We zoom in on two specific variants of DEL for concrete applications. First, we introduce Public Inspection Logic, a new framework for the knowledge of variables and its dynamics. Second, we study the dynamic gossip problem and how it can be analyzed with epistemic logic. We show that existing gossip protocols can be improved, but that no perfect strengthening of "Learn New Secrets" exists

    Arrows for knowledge-based circuits

    No full text
    Knowledge-based programs (KBPs) are a formalism for directly relating agents' knowledge and behaviour in a way that has proven useful for specifying distributed systems. Here we present a scheme for compiling KBPs to executable automata in finite environments with a proof of correctness in Isabelle/HOL. We use Arrows, a functional programming abstraction, to structure a prototype domain-specific synchronous language embedded in Haskell. By adapting our compilation scheme to use symbolic representations we can apply it to several examples of reasonable size
    • …
    corecore