In the domain of security, verification is generally declined as robustness criteria and must be led against attacker models. We propose tools and technics dedicated to the evaluation of secure devices (smartcard or secured dongle) against fault attacks (such as laser or electromagnetic attacks). We are also interested for modeling and verifying other security requirements (confidentiality, integrity, isolation...) in particular in the context of Common Criteria certification.
Browsing
News
- Conferences
- 28 - 30 mai 2018 GT Verif 2018
- 13 July 2018 ADSL 2018
- 26-28 september 2018 VECoS 2018
- 10-13 November 2018 RV 2018
Seminars
New publications
- Recent Publications
- Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Vincent Villain: Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge
- Arvind S. Adimoolam, Thao Dang: Template complex zonotopes for stability and invariant verification
- Stéphane Devismes, Anissa Lamani, Franck Petit, Sébastien Tixeuil: Optimal Torus Exploration by Oblivious Robots
- Stéphane Devismes, David Ilcinkas, Colette Johnen: Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps
- Karine Altisen, Pierre Corbineau: Composition certifié d'algorithmes autostabilisants silencieux
- Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore: Self-stabilizing silent disjunction in an anonymous network
Jobs and internships
- Jobs and internships
- Phd Proposal : Inférence de modèles de faute pour simulation d’attaques sur composants sécurisés
- Phd proposal : Optimisation de l’évaluation et des tests de sécurité des systèmes cyber-physiques par analyse des canaux auxiliaires
- [M1 internship] Modeling of Graph Topologies Using Coq
- [M2 internship] Certification of Distributed Self-Stabilizing Algorithms Using Coq
- [M2 internship] Models of Distributed Algorithms
