Filter by content type

Select one or more filters. This choice will reload the page to display the filtered results.

Remove all filters

723 results

    • Seminar

    • SemSecuElec

    Acquisition and Exploitation of Traces from Connected Devices

    • September 27, 2024 (10:00 - 11:00)

    • Inria Center of the University of Rennes - - Petri/Turing room

    Speaker : Francesco Servida - École des Sciences Criminelles, Université de Lausanne

    This presentation aims to give an overview of the traces that can be obtained from connected objects as witnesses or actors at a crime scene. Using several scenarios we cover the challenges of detecting connected devices, the relevant locations for data retrieval and the techniques for acquiring said data. We then present how such data can be useful in helping to understand the dynamics of events[…]
    • SemSecuElec

    • Embedded systems

    • Seminar

    • SemSecuElec

    Understanding and fighting fault injections with programming languages

    • September 27, 2024 (11:00 - 12:00)

    • Inria Center of the University of Rennes - - Petri/Turing room

    Speaker : Sébastien Michelland - Université Grenoble Alpes, Grenoble INP, LCIS

    Would your latest program produce correct results if I skipped a statement in it? Two? Corrupted a variable at random? Then it might not be robust against _fault injection attacks_, which target hardware directly and have such effects. To be fair, nothing really resists them; still, efforts in designing protections have come a long way, relying (perhaps surprisingly) in large part on hardening[…]
    • SemSecuElec

    • Fault injection

    • Seminar

    • Cryptography

    Ind-cpa-d insecurity of approximate and exact homomorphic encryption schemes

    • March 29, 2024

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Elias Suvanto - Cryptolab

    Fully Homomorphic Encryption enables the evaluation of arbitrary circuits over encrypted data while maintaining the confidentiality of the underlying messages. It greatly enhances functionality but also comes with security challenges for some applications like Threshold FHE. While the standard IND-CPA security is sufficient against honest but curious adversaries, a stronger security notion called[…]
    • Seminar

    • Cryptography

    An extension of Overbeck’s attack with an application to cryptanalysis of Twisted Gabidulin-based schemes.

    • October 06, 2023

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Ilaria Zappatore - XLIM

    In this talk, I will discuss the decoding of Gabidulin and related codes from a cryptographic point of view, pointing out that these codes can be decoded solely from the knowledge of a generator matrix. I will also present an extension of Gibson and Overbeck attacks on the generalized GPT encryption scheme (instantiated with the Gabidulin code) for different ranks of the distortion matrix. Finally[…]
    • Seminar

    • Cryptography

    Side channel analysis against AEAD lightweight cryptography

    • May 24, 2024

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Modou SARRY - IMT Atlantique

    Les dispositifs interconnectés tels que les réseaux de capteurs, la santé, les systèmes de contrôle distribués, l’internet des objets et les systèmes cyber-physiques sont de plus en plus répandus. Cette transition vers de petits appareils engendre de nouvelles préoccupations en matière de sécurité et de vie privée, car de nombreux algorithmes cryptographiques classiques ne répondent pas toujours[…]
    • Seminar

    • Cryptography

    Pseudorandom Correlation Generators from the Quasi-Abelian Decoding Problem

    • January 19, 2024

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Clément Ducros - IRIF

    Secure multi-party computing often enhances efficiency by leveraging correlated randomness. Recently, Boyle et al. showcased the effectiveness of pseudorandom correlation generators (PCGs) in producing substantial correlated (pseudo)randomness, specifically for two-party random oblivious linear evaluations (OLEs). This process involves minimal interactions and subsequent local computations,[…]