Filter by content type

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

Remove all filters

677 results

    • Seminar

    • Cryptography

    Lie algebras and the security of cryptosystems based on classical varieties in disguise

    • November 07, 2025 (13:45 - 14:45)

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

    Speaker : Mingjie Chen - KU Leuven

    In 2006, de Graaf et al. proposed a strategy based on Lie algebras for finding a linear transformation in the projective linear group that connects two linearly equivalent projective varieties defined over the rational numbers. Their method succeeds for several families of “classical” varieties, such as Veronese varieties, which are known to have large automorphism groups.   In this talk, we[…]
    • Cryptography

    • Seminar

    • Cryptography

    Dual attacks in code-based (and lattice-based) cryptography

    • September 19, 2025 (13:45 - 14:45)

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

    Speaker : Charles Meyer-Hilfiger - Inria Rennes

    The hardness of the decoding problem and its generalization, the learning with errors problem, are respectively at the heart of the security of the Post-Quantum code-based scheme HQC and the lattice-based scheme Kyber. Both schemes are to be/now NIST standards. These problems have been actively studied for decades, and the complexity of the state-of-the-art algorithms to solve them is crucially[…]
    • Cryptography

    • Thesis defense

    • Fault injection

    • Hardware architecture

    Effects of synchronous clock glitch effect on the security of an integrated circuit

    • June 23, 2025 (14:00 - 17:00)

    • Amphithéâtre PNRB campus de Beaulieu - 263 Av. Général Leclerc - 35700 Rennes

    PhD : Amélie MAROTTA, Centre Inria de l'Université de Rennes, IRISA Context: the various sources of security vulnerability Fault injection is part of a bigger ecosystem of vulnerability exploitation methods, which it can be paired with. To make the study of the security challenges of electronic devices easier, we define three sources of vulnerabilities : software, microarchitectural, and physical[…]
    • Seminar

    • SemSecuElec

    Prise de contrôle d’un infodivertissement automobile à distance

    • November 28, 2025 (11:00 - 12:00)

    • Inria Center of the University of Rennes - Espace de conférences

    Speaker : Philippe Trebuchet, Guillaume Bouffard - ANSSI

    Les véhicules connectés intègrent de nombreuses technologies de communications sans-fil à distance, comme celles exploitant les protocoles Bluetooth ou WiFi. Si le gain en confort d’utilisation et d’interaction est notable, la mise à disposition de ce type d’interfaces augmente les risques en matière de cybersécurité. Dans cet article, nous analysons l’implémentation de la pile Bluetooth embarquée[…]
    • SemSecuElec

    • Network

    • Embedded systems

    • Seminar

    • SoSysec

    Empower New Code Citizens to Reflect and Communicate on Code Security

    • May 20, 2025 (11:00 - 12:00)

    • Inria Center of the University of Rennes - Aurigny room

    Speaker : Manuel Maarek - Heriot-Watt University

    Creating secure software code requires software engineers to elicit and follow the security requirements of the system they are building. Software engineer teams might not have the security expertise to approach this angle of software development confidently. With the democratisation of access to software development and deployment, software are often built by developers with neither software[…]
    • Seminar

    • SoSysec

    A non-comparison oblivious sort and its application to private k-NN

    • June 20, 2025 (11:00 - 12:00)

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

    Speaker : Sofiane Azogagh - UQÀM

    Sorting is a fundamental subroutine of many algorithms and as such has been studied for decades. A well-known result is the Lower Bound Theorem, which states that no comparison-based sorting algorithm can do better than O(nlog(n)) in the worst case. However, in the fifties, new sorting algorithms that do not rely on comparisons were introduced such as counting sort, which can run in linear time[…]
    • Cryptography

    • SoSysec

    • Privacy

    • Databases

    • Secure storage