Section: Overall Objectives

Overall Objectives

SECSI is a common project between INRIA Saclay and the LSV (Laboratoire Spécification et Vérification), itself a common research unit of CNRS (UMR 8643) and the ENS (École Normale Supérieure) de Cachan.

The SECSI project is a research project on the security of information systems. Originally, SECSI was organized around three main themes, and their mutual relationships:

  • Automated verification of cryptographic protocols;

  • Intrusion detection;

  • Static analysis of programs, in order to detect security holes and vulnerabilities at the protocol level.

This has changed. Starting from 2006, SECSI concentrates on the first theme, while keeping an eye on the other two.

In a nutshell, the aim of the SECSI project is to develop logic-based verification techniques for security properties of computer systems and networks.

The thrust is towards more automation (new automata-based, or theorem-proving based verification techniques), more properties (not just secrecy or authentication, but e.g., coercion-resistance in electronic voting schemes), more realism (e.g., cryptographic soundness theorems for formal models).

The new objectives of the SECSI project are:

  1. Tree-automata based methods, automated deduction, and approximate/exact cryptographic protocol verification in the Dolev-Yao model.

  2. Enriching the Dolev-Yao model with algebraic theories, and associated decision problems.

  3. Computational soundness of formal models (Dolev-Yao, applied pi-calculus).

  4. Indistinguishability proofs allowing us to handle more properties, e.g. anonymity.

  5. Application to new security protocols, e.g. electonic voting protocols.

  6. Security in the presence of probabilistic and demonic non-deterministic choices.