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

Joe-kai Tsay - One of the best experts on this subject based on the ideXlab platform.

  • Cryptographically sound security proofs for basic and public-key Kerberos
    International Journal of Information Security, 2011
    Co-Authors: Michael Backes, Aaron D. Jaggard, Andre Scedrov, Iliano Cervesato, Joe-kai Tsay
    Abstract:

    We present a computational analysis of basic Kerberos with and without its public-key extension PKINIT in which we consider authentication and key secrecy properties. Our proofs rely on the Dolev–Yao style model of Backes, Pfitzmann, and Waidner, which allows for mapping results obtained symbolically within this model to cryptographically sound proofs if certain assumptions are met. This work was the first verification at the computational level of such a complex fragment of an Industrial Protocol. By considering a recently fixed version of PKINIT, we extend symbolic correctness results we previously attained in the Dolev–Yao model to cryptographically sound results in the computational model.

  • AsiaCCS - Computationally sound mechanized proofs for basic and public-key Kerberos
    Proceedings of the 2008 ACM symposium on Information computer and communications security - ASIACCS '08, 2008
    Co-Authors: Bruno Blanchet, Aaron D. Jaggard, Andre Scedrov, Joe-kai Tsay
    Abstract:

    We present a computationally sound mechanized analysis of Kerberos 5, both with and without its public-key extension PKINIT. We prove authentication and key secrecy properties using the prover CryptoVerif, which works directly in the computational model; these are the first mechanical proofs of a full Industrial Protocol at the computational level. We also generalize the notion of key usability and use CryptoVerif to prove that this definition is satisfied by keys in Kerberos.

  • ESORICS - Cryptographically sound security proofs for basic and public-key kerberos
    Computer Security – ESORICS 2006, 2006
    Co-Authors: Michael Backes, Aaron D. Jaggard, Andre Scedrov, Iliano Cervesato, Joe-kai Tsay
    Abstract:

    We present a computational analysis of basic Kerberos and Kerberos with public-key authentication (PKINIT) in which we consider authentication and key secrecy properties. Our proofs rely on the Dolev-Yao style model of Backes, Pfitzmann and Waidner, which allows for mapping results obtained symbolically within this model to cryptographically sound proofs if certain assumptions are met. This is the most complex fragment of an Industrial Protocol that has yet been verified at the computational level. Considering a recently fixed version of PKINIT, we extend symbolic correctness results we previously attained in the Dolev-Yao model to cryptographically sound results in the computational model.

  • Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos
    Lecture Notes in Computer Science, 2006
    Co-Authors: Michael Backes, Aaron D. Jaggard, Andre Scedrov, Iliano Cervesato, Joe-kai Tsay
    Abstract:

    We present a computational analysis of basic Kerberos and Kerberos with public-key authentication (PKINIT) in which we consider authentication and key secrecy properties. Our proofs rely on the Dolev-Yao style model of Backes, Pfitzmann and Waidner, which allows for mapping results obtained symbolically within this model to cryptographically sound proofs if certain assumptions are met. This is the most complex fragment of an Industrial Protocol that has yet been verified at the computational level. Considering a recently fixed version of PKINIT, we extend symbolic correctness results we previously attained in the Dolev-Yao model to cryptographically sound results in the computational model.

César Viho - One of the best experts on this subject based on the ideXlab platform.

  • An Experiment in Automatic Generation of Test Suites for Protocols with Verification Technology
    1996
    Co-Authors: Jean-claude Fernandez, Claude Jard, Thierry Jéron, Laurence Nedelka, César Viho
    Abstract:

    In this report we describe an experiment in automatic generation of test suites for Protocol testing. We report the results gained with generation of test suites based on advanced verification techniques applied to a real Industrial Protocol. In this experiment, several tools have been used~: the commercial tool GEODE (VERILOG) was used for the generation of finite state graph models from SDL specifications, the tool Aldebaran of the CADP toolbox for the minimization of transition systems, and a prototype named TGV (for Test Generation using Verification techniques) for the generation of test suites which has been developed in the CADP toolbox. TGV is based on verification techniques such as synchronous product and on-the-fly verification. These tools have been applied to an Industrial Protocol, the DREX Protocol. The comparison of produced test suites with hand written test suites proves the relevance of the used techniques.

  • CAV - Using On-The-Fly Verification Techniques for the Generation of test Suites
    Computer Aided Verification, 1996
    Co-Authors: Jean-claude Fernandez, Claude Jard, Thierry Jéron, César Viho
    Abstract:

    In this paper we attempt to demonstrate that on-the-fly techniques, developed in the context of verification, can help in deriving test suites. Test purposes are used in practice to select test cases according to some properties of the specification. We define a consistency pre-order linking test purposes and specifications. We give a set of rules to check this consistency and to derive a complete test case with preamble, postamble, verdicts and timers. The algorithm, which implements the construction rules, is based on a depth first traversal of a synchronous product between the test purpose and the specification. We shortly relate our experience on an Industrial Protocol with TGV, a first prototype of the algorithm implemented as a component of the C ADP toolbox.

  • Using on-the-fly Verification Techniques for the Generation of Test Suites
    1996
    Co-Authors: Jean-claude Fernandez, Claude Jard, Thierry Jéron, Laurence Nedelka, César Viho
    Abstract:

    In this paper we attempt to demonstrate that on-the-fly techniques, developed in the context of verification, can help in deriving test suites. Test purposes are used in practice to select test cases according to some properties of the specification. We define a consistency preorder linking test purposes and specifications. We give a set of rules to check this consistency and to derive a complete test case with preamble, postamble, verdicts and timers. The algorithm, which implements the construction rules, is based on a depth first traversal of a synchronous product between the test purpose and the specification. We shortly relate our experience on an Industrial Protocol with TGV, a first prototype of the algorithm implemented as a component of the CADP toolbox.

Jean-claude Fernandez - One of the best experts on this subject based on the ideXlab platform.

  • Verification and test generation for the SSCOP Protocol
    Science of Computer Programming, 2000
    Co-Authors: Marius Bozga, Jean-claude Fernandez, Claude Jard, Thierry Jéron, Lucian Ghirvu, Alain Kerbrat, Pierre Morel, Laurent Mounier
    Abstract:

    Abstract Many formal tools are now efficient enough to deal with small-to-medium size systems. Working with larger systems requires not so much to improve these tools, but to use them in combination, applying one tool for what it is most efficient for, and using its results to improve the applicability of the other tools. This paper presents such a combination, illustrated on an Industrial Protocol, large enough to break any brute force approach. Two research teams allied their forces with a software engineering tools maker in order to analyse, verify and generate automatically tests for this Protocol, by the extension and the interconnection of their various tools. The results obtained give some hints on a methodology for the formal validation of large systems.

  • An Experiment in Automatic Generation of Test Suites for Protocols with Verification Technology
    1996
    Co-Authors: Jean-claude Fernandez, Claude Jard, Thierry Jéron, Laurence Nedelka, César Viho
    Abstract:

    In this report we describe an experiment in automatic generation of test suites for Protocol testing. We report the results gained with generation of test suites based on advanced verification techniques applied to a real Industrial Protocol. In this experiment, several tools have been used~: the commercial tool GEODE (VERILOG) was used for the generation of finite state graph models from SDL specifications, the tool Aldebaran of the CADP toolbox for the minimization of transition systems, and a prototype named TGV (for Test Generation using Verification techniques) for the generation of test suites which has been developed in the CADP toolbox. TGV is based on verification techniques such as synchronous product and on-the-fly verification. These tools have been applied to an Industrial Protocol, the DREX Protocol. The comparison of produced test suites with hand written test suites proves the relevance of the used techniques.

  • Assessment of automatic generation methods of conformance test suites in an Industrial context
    Testing of Communicating Systems, 1996
    Co-Authors: Laurent Doldi, Jean-claude Fernandez, Thierry Jéron, Vincent Encontre, Sylvie Le Bricquir, Nathalie Texier, Marc Phalippou
    Abstract:

    In this paper we describe three experiments in the automatic generation of conformance abstract test suites for Protocol testing. The methods and tools have been applied to a same Industrial Protocol, the DREX Protocol. This Protocol has been specified in SDL language. Abstract conformance test suites have been generated in TTCN language. The study proved that the technology transfer to obtain a commercial tool is now possible.

  • CAV - Using On-The-Fly Verification Techniques for the Generation of test Suites
    Computer Aided Verification, 1996
    Co-Authors: Jean-claude Fernandez, Claude Jard, Thierry Jéron, César Viho
    Abstract:

    In this paper we attempt to demonstrate that on-the-fly techniques, developed in the context of verification, can help in deriving test suites. Test purposes are used in practice to select test cases according to some properties of the specification. We define a consistency pre-order linking test purposes and specifications. We give a set of rules to check this consistency and to derive a complete test case with preamble, postamble, verdicts and timers. The algorithm, which implements the construction rules, is based on a depth first traversal of a synchronous product between the test purpose and the specification. We shortly relate our experience on an Industrial Protocol with TGV, a first prototype of the algorithm implemented as a component of the C ADP toolbox.

  • Using on-the-fly Verification Techniques for the Generation of Test Suites
    1996
    Co-Authors: Jean-claude Fernandez, Claude Jard, Thierry Jéron, Laurence Nedelka, César Viho
    Abstract:

    In this paper we attempt to demonstrate that on-the-fly techniques, developed in the context of verification, can help in deriving test suites. Test purposes are used in practice to select test cases according to some properties of the specification. We define a consistency preorder linking test purposes and specifications. We give a set of rules to check this consistency and to derive a complete test case with preamble, postamble, verdicts and timers. The algorithm, which implements the construction rules, is based on a depth first traversal of a synchronous product between the test purpose and the specification. We shortly relate our experience on an Industrial Protocol with TGV, a first prototype of the algorithm implemented as a component of the CADP toolbox.

Thierry Jéron - One of the best experts on this subject based on the ideXlab platform.

  • Verification and test generation for the SSCOP Protocol
    Science of Computer Programming, 2000
    Co-Authors: Marius Bozga, Jean-claude Fernandez, Claude Jard, Thierry Jéron, Lucian Ghirvu, Alain Kerbrat, Pierre Morel, Laurent Mounier
    Abstract:

    Abstract Many formal tools are now efficient enough to deal with small-to-medium size systems. Working with larger systems requires not so much to improve these tools, but to use them in combination, applying one tool for what it is most efficient for, and using its results to improve the applicability of the other tools. This paper presents such a combination, illustrated on an Industrial Protocol, large enough to break any brute force approach. Two research teams allied their forces with a software engineering tools maker in order to analyse, verify and generate automatically tests for this Protocol, by the extension and the interconnection of their various tools. The results obtained give some hints on a methodology for the formal validation of large systems.

  • An Experiment in Automatic Generation of Test Suites for Protocols with Verification Technology
    1996
    Co-Authors: Jean-claude Fernandez, Claude Jard, Thierry Jéron, Laurence Nedelka, César Viho
    Abstract:

    In this report we describe an experiment in automatic generation of test suites for Protocol testing. We report the results gained with generation of test suites based on advanced verification techniques applied to a real Industrial Protocol. In this experiment, several tools have been used~: the commercial tool GEODE (VERILOG) was used for the generation of finite state graph models from SDL specifications, the tool Aldebaran of the CADP toolbox for the minimization of transition systems, and a prototype named TGV (for Test Generation using Verification techniques) for the generation of test suites which has been developed in the CADP toolbox. TGV is based on verification techniques such as synchronous product and on-the-fly verification. These tools have been applied to an Industrial Protocol, the DREX Protocol. The comparison of produced test suites with hand written test suites proves the relevance of the used techniques.

  • Assessment of automatic generation methods of conformance test suites in an Industrial context
    Testing of Communicating Systems, 1996
    Co-Authors: Laurent Doldi, Jean-claude Fernandez, Thierry Jéron, Vincent Encontre, Sylvie Le Bricquir, Nathalie Texier, Marc Phalippou
    Abstract:

    In this paper we describe three experiments in the automatic generation of conformance abstract test suites for Protocol testing. The methods and tools have been applied to a same Industrial Protocol, the DREX Protocol. This Protocol has been specified in SDL language. Abstract conformance test suites have been generated in TTCN language. The study proved that the technology transfer to obtain a commercial tool is now possible.

  • CAV - Using On-The-Fly Verification Techniques for the Generation of test Suites
    Computer Aided Verification, 1996
    Co-Authors: Jean-claude Fernandez, Claude Jard, Thierry Jéron, César Viho
    Abstract:

    In this paper we attempt to demonstrate that on-the-fly techniques, developed in the context of verification, can help in deriving test suites. Test purposes are used in practice to select test cases according to some properties of the specification. We define a consistency pre-order linking test purposes and specifications. We give a set of rules to check this consistency and to derive a complete test case with preamble, postamble, verdicts and timers. The algorithm, which implements the construction rules, is based on a depth first traversal of a synchronous product between the test purpose and the specification. We shortly relate our experience on an Industrial Protocol with TGV, a first prototype of the algorithm implemented as a component of the C ADP toolbox.

  • Using on-the-fly Verification Techniques for the Generation of Test Suites
    1996
    Co-Authors: Jean-claude Fernandez, Claude Jard, Thierry Jéron, Laurence Nedelka, César Viho
    Abstract:

    In this paper we attempt to demonstrate that on-the-fly techniques, developed in the context of verification, can help in deriving test suites. Test purposes are used in practice to select test cases according to some properties of the specification. We define a consistency preorder linking test purposes and specifications. We give a set of rules to check this consistency and to derive a complete test case with preamble, postamble, verdicts and timers. The algorithm, which implements the construction rules, is based on a depth first traversal of a synchronous product between the test purpose and the specification. We shortly relate our experience on an Industrial Protocol with TGV, a first prototype of the algorithm implemented as a component of the CADP toolbox.

Michael Backes - One of the best experts on this subject based on the ideXlab platform.

  • Cryptographically sound security proofs for basic and public-key Kerberos
    International Journal of Information Security, 2011
    Co-Authors: Michael Backes, Aaron D. Jaggard, Andre Scedrov, Iliano Cervesato, Joe-kai Tsay
    Abstract:

    We present a computational analysis of basic Kerberos with and without its public-key extension PKINIT in which we consider authentication and key secrecy properties. Our proofs rely on the Dolev–Yao style model of Backes, Pfitzmann, and Waidner, which allows for mapping results obtained symbolically within this model to cryptographically sound proofs if certain assumptions are met. This work was the first verification at the computational level of such a complex fragment of an Industrial Protocol. By considering a recently fixed version of PKINIT, we extend symbolic correctness results we previously attained in the Dolev–Yao model to cryptographically sound results in the computational model.

  • ESORICS - Cryptographically sound security proofs for basic and public-key kerberos
    Computer Security – ESORICS 2006, 2006
    Co-Authors: Michael Backes, Aaron D. Jaggard, Andre Scedrov, Iliano Cervesato, Joe-kai Tsay
    Abstract:

    We present a computational analysis of basic Kerberos and Kerberos with public-key authentication (PKINIT) in which we consider authentication and key secrecy properties. Our proofs rely on the Dolev-Yao style model of Backes, Pfitzmann and Waidner, which allows for mapping results obtained symbolically within this model to cryptographically sound proofs if certain assumptions are met. This is the most complex fragment of an Industrial Protocol that has yet been verified at the computational level. Considering a recently fixed version of PKINIT, we extend symbolic correctness results we previously attained in the Dolev-Yao model to cryptographically sound results in the computational model.

  • Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos
    Lecture Notes in Computer Science, 2006
    Co-Authors: Michael Backes, Aaron D. Jaggard, Andre Scedrov, Iliano Cervesato, Joe-kai Tsay
    Abstract:

    We present a computational analysis of basic Kerberos and Kerberos with public-key authentication (PKINIT) in which we consider authentication and key secrecy properties. Our proofs rely on the Dolev-Yao style model of Backes, Pfitzmann and Waidner, which allows for mapping results obtained symbolically within this model to cryptographically sound proofs if certain assumptions are met. This is the most complex fragment of an Industrial Protocol that has yet been verified at the computational level. Considering a recently fixed version of PKINIT, we extend symbolic correctness results we previously attained in the Dolev-Yao model to cryptographically sound results in the computational model.