Sarah Bordage

I am a member of the project-team GRACE, working under the supervision of Daniel Augot.

Main interests: interactive and probabilistic proof systems, cryptographic protocols, zero-knowledge proofs, locality in coding theory.

I defended my PhD thesis entitled "Efficient Protocols for Testing Proximity to Algebraic Codes" on June 16, 2022.
A first version of the manuscript can be found here.

Contact: First.Last [at] {inria.fr, lix.polytechnique.fr}

Office 2039, Bâtiment Alan Turing
Campus de l'École Polytechnique
91120 Palaiseau Cedex - France


* This action benefits from the support of the Chair "Blockchain & B2B Platforms", led by l’X – École Polytechnique and the Fondation de l’École Polytechnique, sponsored by Capgemini, NomadicLabs and Caisse des Dépôts.

I am not a pirat.

Research

Publications

Conference Proceedings
Journals

Talks

Upcoming talks
  • May 18, 2022

    Interactive oracle proofs of proximity for algebraic codes
    at Séminaire C², LTCI, Télécom Paris

Past talks
  • May 11, 2022

    Interactive oracle proofs of proximity for algebraic codes
    at Séminaire ECO, LIRMM, Université de Montpellier

  • May 5, 2022

    Interactive oracle proofs of proximity for algebraic codes
    at Discrete Mathematics, Codes and Cryptography Seminar, LAGA, Université Paris 8

  • April 21, 2022

    Fast proximity tests for algebraic codes
    at Séminaire ALMASTY, LIP6, Sorbonne Université

  • April 11, 2022

    Interactive oracle proofs of proximity for Algebraic Geometry codes
    at Journées Codage et Cryptographie 2022, Hendaye, France

  • March 8, 2022

    Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
    at WCC 2022: The Twelfth International Workshop on Coding and Cryptography, virtual conference [slides]

  • November 18, 2021

    Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
    at COMPSEC Seminar, Ecole polytechnique fédérale de Lausanne

  • June 17, 2021

    Efficient proofs of computational integrity from code-based IOPs
    at Groupe de travail Codes et Cryptographie, Inria de Paris

  • May 20, 2021

    Introduction to Zero-Knowledge Proofs
    at Blockchain & B2B Platforms Working Group, Ecole Polytechnique

  • December 8 & 15, 2020

    Efficient proofs of computational integrity from code-based IOPs
    at Groupe de travail GRACE, Inria Saclay & LIX

  • November 19, 2020

    IOP of Proximity to Algebraic Geometry Codes (Joint talk with Jade Nardi)
    at StarkWare Industries

  • November 6, 2020

    Proofs of Proximity for Tensored Reed-Solomon codes and Reed-Muller codes
    at Journées Codage et Cryptographie 2020, virtual conference

  • March 3, 2020

    How to verify a proof without reading it, and applications to verifiable computing
    at Grace young seminar


Teaching at Ecole Polytechnique

Advanced Cryptology

INF568 - Tutorials
2018-19, 2019-20, 2020-21

Algorithms for Data Analysis in C++

INF442 - Tutorials
2018-19, 2019-20

Les bases de la programmation et de l'algorithmique

INF411 - Tutorials & INF411T - Tutoring
2020-21

Supervision

CSE303: 3rd year Bachelor Computer Science Project
2020-21

Miscealleneous

Past student

Clémence Chevignard, Master student (Internship, Jul. - Dec. 2021)

Grace Young Seminar

Co-organizer

Fete de la science at Inria Saclay

October 10-11, 2019
Volunteer

Past internships

  • Multiparty computation protocols secure against covert adversaries at Inria Saclay, France

    April - August 2018, supervised by Daniel Augot and Matthieu Rambaud

  • Assessment of password cracking software and hardware at Cyberens Technologies & Services

    June - August 2017


Education

Master degree in Cryptology and Cybersecurity

University of Bordeaux, France
2016 - 2018

Bachelor degree in Pure Mathematics

University of Nantes, France
2013 - 2016