Je recherche

723 résultats

• • Séminaire

  • SoSysec

  A Compositional and Complete approach to Verifying Privacy Properties using the Applied Pi-calculus

  • 08 février 2019

  • Inria Center of the University of Rennes - - Room TBD

  Orateur : Ross Horne (University of Luxembourg)

  The pi-calculus was introduced for verifying cryptographic protocols by Abadi and Fournet in 2001. They proposed an equivalence technique, called bisimilarity, useful for verify privacy properties. It is widely acknowledged (cf. Paige and Tarjan 1987), that bisimilarity is more efficient to check than trace equivalence; however, surprisingly, tools based on the applied pi-calculus typically still[…]

• • Séminaire

  • SoSysec

  How to decrypt without keys with GlobalPlatform SCP02 protocol

  • 06 juillet 2018

  • Inria Center of the University of Rennes - - Room TBD

  Orateur : par Loic Ferreira (Orange Labs, IRISA)

  The GlobalPlatform SCP02 protocol is a security protocol implemented in smart cards, and used by transport companies, in the banking world and by mobile network operators (UICC/SIM cards). We describe how to perform a padding oracle attack against SCP02. The attack allows an adversary to efficiently retrieve plaintext bytes from an encrypted data field. We provide results of our experiments done[…]

• • Séminaire

  • SoSysec

  Breaking and fixing HB+DB: A Short Tale of Provable vs Experimental Security and Lightweight Designs

  • 02 février 2018

  • Inria Center of the University of Rennes - - Room TBD

  Orateur : Ioana Boureanu (University of Surrey)

  HB+ is a well-know authentication scheme purposely designed to be lightweight. However, HB+ is vulnerable to a key-recovery, man-in-the-middle (MiM) attack dubbed GRS. To this end, at WiSec2015, the HB+DB protocol added a distance-bounding dimension to HB+, which was experimentally shown to counteract the GRS attack.In this talk, we will exhibit however a number of security flaws in the HB+DB[…]

• • Séminaire

  • SoSysec

  Voting : You Can’t Have Privacy without Individual Verifiability

  • 01 mars 2019

  • Inria Center of the University of Rennes - - Room TBD

  Orateur : Joseph Lallemand (Loria)

  Electronic voting typically aims at two main security goals: vote privacy and verifiability. These two goals are often seen as antagonistic and some national agencies even impose a hierarchy between them: first privacy, and then verifiability as an additional feature. Verifiability typically includes individual verifiability (a voter can check that her ballot is counted); universal verifiability […]

• • Séminaire

  • SoSysec

  On MILP modelisations

  • 29 avril 2022

  • Inria Center of the University of Rennes - - Room TBD

  Orateur : Christina Boura (UVSQ, CNRS, LMV)

  Modelizing a problem using linear constraints and solving it by some Mixed Integer Linear Programming (MILP) solver is a popular approach in many domains of computer science. In this talk we present and compare different new techniques to modelize any subset of {0,1}^n for MILP. We then discuss the efficiency of our models by applying them to the search of differential paths, a classical problem[…]

• • Séminaire

  • SoSysec

  An evaluation of Symbolic Execution Systems and the benefits of compilation with SymCC

  • 25 septembre 2020

  • Inria Center of the University of Rennes - - Room TBD

  Orateur : Aurélien Francillon (Eurecom)

  In this talk I will discuss our recent work, together with Sebastian Poeplau, on Symbolic execution. Symbolic execution has become a popular technique for software testing and vulnerability detection, in particular, because it allows to generate test cases for difficult to reach program paths. However, a major impediment to practical symbolic execution is speed, especially when compared to near[…]