Team SECSI
Members
Overall Objectives
Scientific Foundations
What is computer security? Do we need some?
Logic as a tool for assessing computer security
Enriching the Dolev-Yao model with algebraic theories
Linking cryptographic and formal approaches
Indistinguishability proofs
Application to new security protocols
Models mixing probabilistic and non-deterministic choice
Application Domains
Introduction
Cryptographic Protocols
Static Analysis
Software
Software Packages and Prototypes
The H1 Tool Suite: h1, pl2tptp, auto2pl, pldet, plpurge, pl2gastex, tptpmorph, linauto, h1trace, h1logstrip, h1mc, h1mon, h1getlog
ORCHIDS modules
The mkP11 tool
The KISS tool (previously TERM)
New Results
Indistinguishability proofs
Algebraic properties of cryptographic primitives
Composition
Computational Soundness
First-order logic and bounded verification
Formal Analysis of Security APIs
Cryptographic Security of VHDL Designs
Routing Protocols
Implementatin of efficient ZK-Proofs of Knowledge
Complete WSTS
Geometry of Interaction
A Tale of Two Dualities
Other Grants and Activities
National Actions
International initiatives
Dissemination
Animation of the Scientific Community
Teaching
Supervision, Advisorship
Participation to PhD or habilitation juries
Participation to conference program committees or journal editorial boards
Bibliography
Major publications
Publications of the year
References in notes
Inria
/
Raweb 2009
Presentation of the Project SECSI
Section: Application Domains
Introduction
The application domains of SECSI cover a large part of computer security.
Logo Inria