Filtrer par type de contenu

Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.

Supprimer tous les filtres

672 résultats

    • Séminaire

    • Cryptographie

    Cycles of pairing-friendly abelian varieties

    • 28 mars 2025 (13:45 - 14:45)

    • Salle Guernesey, ISTIC

    Orateur : Maria Corte-Real Santos - ENS Lyon

    A promising avenue for realising scalable proof systems relies on the existence of 2-cycles of pairing-friendly elliptic curves. More specifically, such a cycle consists of two elliptic curves E/Fp and E’/Fq that both have a low embedding degree and also satisfy q = #E(Fp) and p = #E’(Fq). These constraints turn out to be rather restrictive; in the decade that has passed since 2-cycles were first[…]
    • Cryptography

    • Séminaire

    • Cryptographie

    Constant-time lattice reduction for SQIsign

    • 14 mars 2025 (13:45 - 14:45)

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

    Orateur : Sina Schaeffler - IBM Research

    SQIsign is an isogeny-based signature scheme which has recently advanced to round 2 of NIST's call for additional post-quantum signatures. A central operation in SQIsign is lattice reduction of special full-rank lattices in dimension 4. As these input lattices are secret, this computation must be protected against side-channel attacks. However, known lattice reduction algorithms like the famous[…]
    • Séminaire

    • Cryptographie

    Pairing-Free Blind Signatures from Standard Assumptions in the ROM

    • 14 février 2025 (13:45 - 14:45)

    • Salle Guernesey, ISTIC

    Orateur : Ky Nguyen - ENS

    Blind Signatures are a useful primitive for privacy preserving applications such as electronic payments, e-voting, anonymous credentials, and more. However, existing practical blind signature schemes based on standard assumptions require either pairings or lattices. We present the first practical construction of a round-optimal blind signature in the random oracle model based on standard[…]
    • Cryptography

    • Séminaire

    • SemSecuElec

    Advanced techniques for fault injection attacks on integrated circuits

    • 25 avril 2025 (10:00 - 11:00)

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

    Orateur : Paul Grandamme - Laboratoire Hubert Curien, Université Jean Monnet

    The security of integrated circuits is evaluated through the implementation of attacks that exploit their inherent hardware vulnerabilities. Fault injection attacks represent a technique that is commonly employed for this purpose. These techniques permit an attacker to alter the nominal operation of the component in order to obtain confidential information. Firstly, we propose the utilisation of[…]
    • SemSecuElec

    • Fault injection

    • Séminaire

    • SemSecuElec

    Anomalies Mitigation for Horizontal Side Channel Attacks with Unsupervised Neural Networks

    • 23 mai 2025 (10:00 - 11:00)

    • Inria Center of the University of Rennes - - IRISA - Salle Aurigny (D165)

    Orateur : Gauthier Cler - SERMA Safety & Security

    The success of horizontal side-channel attacks heavily depends on the quality of the traces as well as the correct extraction of interest areas, which are expected to contain relevant leakages. If former is insufficient, this will consequently degrade the identification capability of potential leakage candidates and often render attacks inapplicable. This work assess the relevance of neural[…]
    • SemSecuElec

    • Side-channel

    • Machine learning

    • Séminaire

    • Cryptographie

    Efficient zero-knowledge proofs and arguments in the CL framework

    • 07 mars 2025 (13:45 - 14:45)

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

    Orateur : Agathe Beaugrand - Institut de Mathématiques de Bordeaux

    The CL encryption scheme, proposed in 2015 by Castagnos and Laguillaumie, is a linearly homomorphic encryption scheme, based on class groups of imaginary quadratic fields. The specificity of these groups is that their order is hard to compute, which means it can be considered unknown. This particularity, while being key in the security of the scheme, brings technical challenges in working with CL,[…]