The Experts below are selected from a list of 23481 Experts worldwide ranked by ideXlab platform

Catherine Meadows - One of the best experts on this subject based on the ideXlab platform.

  • emerging issues and trends in formal methods in Cryptographic Protocol analysis twelve years later
    Logic Rewriting and Concurrency, 2015
    Co-Authors: Catherine Meadows
    Abstract:

    In 2003 I published a paper “Formal Methods in Cryptographic Protocol Analysis: Emerging Issues and Trends”, in which I identified the various open problems related to applying formal methods to the analysis of Cryptographic Protocols as we saw them then, and discussed the state of the art and the problems that still needed to be solved. Twelve years later, it is time for a an update and a reassessment. In this paper I revisit the open problems that I addressed in the original paper, discussing the progress that has been made in the intervening years, and the problems that still remain to be solved. I also discuss some new open problems that have arisen since then.

  • asymmetric unification a new unification paradigm for Cryptographic Protocol analysis
    Conference on Automated Deduction, 2013
    Co-Authors: Serdar Erbatur, Catherine Meadows, Paliath Narendran, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher S Lynch, Jose Meseguer, Sonia Santiago, Ralf Sasse
    Abstract:

    We present a new paradigm for unification arising out of a technique commonly used in Cryptographic Protocol analysis tools that employ unification modulo equational theories. This paradigm relies on: (i) a decomposition of an equational theory into (R,E) where R is confluent, terminating, and coherent modulo E, and (ii) on reducing unification problems to a set of problems $s =_{}^{?} t$ under the constraint that t remains R/E-irreducible. We call this method asymmetric unification. We first present a general-purpose generic asymmetric unification algorithm. and then outline an approach for converting special-purpose conventional unification algorithms to asymmetric ones, demonstrating it for exclusive-or with uninterpreted function symbols. We demonstrate how asymmetric unification can improve performanceby running the algorithm on a set of benchmark problems. We also give results on the complexity and decidability of asymmetric unification.

  • maude npa Cryptographic Protocol analysis modulo equational properties
    Foundations of Security Analysis and Design V, 2009
    Co-Authors: Santiago Escobar, Catherine Meadows, Jose Meseguer
    Abstract:

    In this tutorial, we give an overview of the Maude-NRL Protocol Analyzer (Maude-NPA), a tool for the analysis of Cryptographic Protocols using functions that obey different equational theories. We show the reader how to use Maude-NPA, and how it works, and also give some of the theoretical background behind the tool.

  • Towards a Hierarchy of Cryptographic Protocol Models
    2003
    Co-Authors: Catherine Meadows
    Abstract:

    Recently there has been an increasing amount of research in the introduction of Cryptographic ideas into discrete methods for Cryptographic Protocol analysis. This is often done by developing a discrete model and a Cryptographic model such that the discrete model can be shown sound with respect to the Cryptographic model. In this position paper we talk about some of the other issues in Cryptographic Protocol analysis that could be addressed with this approach, and propose a hierarchy of models.

  • what makes a Cryptographic Protocol secure the evolution of requirements specification in formal Cryptographic Protocol analysis
    European Symposium on Programming, 2003
    Co-Authors: Catherine Meadows
    Abstract:

    Much attention has been paid to the design of languages for the specification of Cryptographic Protocols. However, the ability to specify their desired behavior correctly is also important; indeed many perceived Protocol flaws arise out of a misunderstanding of the Protocol's requirements. In this talk we give a brief survey of the history of requirements specification in formal analysis of Cryptographic Protocols. We outline the main approaches and describe some of the open issues.

Bruno Blanchet - One of the best experts on this subject based on the ideXlab platform.

  • SAS - Abstracting Cryptographic Protocols by Prolog Rules
    Static Analysis, 2001
    Co-Authors: Bruno Blanchet
    Abstract:

    Most current Cryptographic Protocol verifiers meet the state space explosion problem, and have to limit the number of executions of the considered Protocol during the verification. To solve these problems, we introduce an abstract representation of Cryptographic Protocols, based on Prolog rules, and use it to verify secrecy properties of Protocols.

  • an efficient Cryptographic Protocol verifier based on prolog rules
    IEEE Computer Security Foundations Symposium, 2001
    Co-Authors: Bruno Blanchet
    Abstract:

    Abstract: We present a new automatic Cryptographic Protocol verifier based on a simple representation of the Protocol by Prolog rules, and on a new efficient algorithm that determines whether a fact can be proved from these rules or not. This verifier proves secrecy properties of the Protocols. Thanks to its use of unification, it avoids the problem of the state space explosion. Another advantage is that we do not need to limit the number of runs of the Protocol to analyze it. We have proved the correctness of our algorithm, and have implemented it. The experimental results show that many examples of Protocols of the literature, including Skeme [24], can be analyzed by our tool with very small resources: the analysis takes from less than 0.1 s for simple Protocols to 23 s for the main mode of Skeme. It uses less than 2 Mb of memory in our tests.

Walter O. Krawec - One of the best experts on this subject based on the ideXlab platform.

  • ISIT - Asymptotic analysis of a three state quantum Cryptographic Protocol
    2016 IEEE International Symposium on Information Theory (ISIT), 2016
    Co-Authors: Walter O. Krawec
    Abstract:

    In this paper we consider a three-state variant of the BB84 quantum key distribution (QKD) Protocol. We derive a new lower-bound on the key rate of this Protocol in the asymptotic scenario and use mismatched measurement outcomes to improve the channel estimation. Our new key rate bound remains positive up to an error rate of 11%, exactly that achieved by the four-state BB84 Protocol.

  • Asymptotic Analysis of a Three State Quantum Cryptographic Protocol
    arXiv: Quantum Physics, 2016
    Co-Authors: Walter O. Krawec
    Abstract:

    In this paper we consider a three-state variant of the BB84 quantum key distribution (QKD) Protocol. We derive a new lower-bound on the key rate of this Protocol in the asymptotic scenario and use mismatched measurement outcomes to improve the channel estimation. Our new key rate bound remains positive up to an error rate of $11\%$, exactly that achieved by the four-state BB84 Protocol.

Ralf Sasse - One of the best experts on this subject based on the ideXlab platform.

  • asymmetric unification a new unification paradigm for Cryptographic Protocol analysis
    Conference on Automated Deduction, 2013
    Co-Authors: Serdar Erbatur, Catherine Meadows, Paliath Narendran, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher S Lynch, Jose Meseguer, Sonia Santiago, Ralf Sasse
    Abstract:

    We present a new paradigm for unification arising out of a technique commonly used in Cryptographic Protocol analysis tools that employ unification modulo equational theories. This paradigm relies on: (i) a decomposition of an equational theory into (R,E) where R is confluent, terminating, and coherent modulo E, and (ii) on reducing unification problems to a set of problems $s =_{}^{?} t$ under the constraint that t remains R/E-irreducible. We call this method asymmetric unification. We first present a general-purpose generic asymmetric unification algorithm. and then outline an approach for converting special-purpose conventional unification algorithms to asymmetric ones, demonstrating it for exclusive-or with uninterpreted function symbols. We demonstrate how asymmetric unification can improve performanceby running the algorithm on a set of benchmark problems. We also give results on the complexity and decidability of asymmetric unification.

Serdar Erbatur - One of the best experts on this subject based on the ideXlab platform.

  • asymmetric unification a new unification paradigm for Cryptographic Protocol analysis
    Conference on Automated Deduction, 2013
    Co-Authors: Serdar Erbatur, Catherine Meadows, Paliath Narendran, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher S Lynch, Jose Meseguer, Sonia Santiago, Ralf Sasse
    Abstract:

    We present a new paradigm for unification arising out of a technique commonly used in Cryptographic Protocol analysis tools that employ unification modulo equational theories. This paradigm relies on: (i) a decomposition of an equational theory into (R,E) where R is confluent, terminating, and coherent modulo E, and (ii) on reducing unification problems to a set of problems $s =_{}^{?} t$ under the constraint that t remains R/E-irreducible. We call this method asymmetric unification. We first present a general-purpose generic asymmetric unification algorithm. and then outline an approach for converting special-purpose conventional unification algorithms to asymmetric ones, demonstrating it for exclusive-or with uninterpreted function symbols. We demonstrate how asymmetric unification can improve performanceby running the algorithm on a set of benchmark problems. We also give results on the complexity and decidability of asymmetric unification.