Groupe de Travail (Post-)Doctorants GRACE

GRACE YOUNG SEMINAR

Once a week, this seminar is a place to discuss our research topics, investigate some problems we are currently working on or even share any interesting/illuminating topics in maths or computer science. During this one-hour meeting, the only two rules are : the talk must not exceed 50 minutes to leave some time for questions and it should be graspable by all.

Our meetings take place on Friday from 2:00 pm to 3:00 pm.

Contact: {sarah.bordage, isabella.panaccione} [at] inria.fr
gt-oisillons@inria.fr

Upcoming talks

Past talks

  • October 22, 2021

    Invariants for matrix codes: a tensor algebra approach
    Giuseppe Cotardo (University College Dublin) [slides]

  • March 26, 2021

    An algebraic approach to the Rank Support Learning problem
    Pierre Briaud (COSMIQ Team, Inria Paris) [slides]

  • March 5, 2021

    Finding Waldo in Euclidean Lattices : an Introduction to Search-To-Decision Reduction [slides]
    Maxime Bombar

  • February 19, 2021

    Quantum cryptanalysis of ECC [slides]
    Gustavo Banegas

  • February 05, 2021

    ZK-SNARKs 101
    Youssef El Housni

  • January 22, 2021

    Training a Model on Private Data
    Angelo Saadeh

  • January 15, 2021

    A Composable Look at Provable Security in Cryptography
    Maxime Roméas

  • January 8, 2021

    Rank metric codes, or how to skew polynomials
    Maxime Bombar

  • December 18, 2020

    AG codes: When algebraic geometry meets coding theory [slides]
    Elena Berardini

  • December 11, 2020

    Digital Signatures 101
    Antonin Leroux

  • December 4, 2020

    Décodage des codes Reed-Solomon classiques et entrelacés du point de vue du calcul formel :
    le problème de la reconstruction rationnelle - Partie 2/2
    Ilaria Zappatore

  • November 27, 2020

    Décodage des codes Reed-Solomon classiques et entrelacés du point de vue du calcul formel :
    le problème de la reconstruction rationnelle - Partie 1/2
    Ilaria Zappatore

  • November 20, 2020

    Basics of error-correcting codes
    Isabella Panaccione

  • March 3, 2020

    How to verify a proof without reading it, and applications to verifiable computing
    Sarah Bordage

  • February 25, 2020

    How to algebraically translate geometric properties - Part 2/2
    Jade Nardi

  • February 18, 2020

    How to algebraically translate geometric properties - Part 1/2
    Jade Nardi

  • February 11, 2020

    Rank metric-based cryptography - Part 2/2
    Adrien Hauteville

  • January 30, 2020

    Rank metric-based cryptography - Part 1/2
    Adrien Hauteville

  • December 4, 2019

    A geometric point of view for linear codes
    Alessandro Neri

  • November 29, 2019

    Trying to characterize the failure case of the Power Decoding Algorithm
    Isabella Panaccione

  • November 22, 2019

    The Deuring correspondence and its application to isogeny-based cryptography, a neither light nor friendly (but still very enthusiastic) introduction
    Antonin Leroux

  • November 8, 2019

    Light, friendly and enthusiastic introduction to Isogeny-based crypto
    Mathilde Chenu