Sarah Bordage

Postdoctoral Researcher at École Polytechnique Fédérale de Lausanne

first · last {at} epfl · ch

Research interests: interactive and probabilistic proof systems, cryptography, locality in coding theory

Bonjour!

Since July 2022, I am a postdoctoral researcher at EPFL (Lausanne, Switzerland), in the Laboratory for Computation Security led by Alessandro Chiesa.

I am broadly interested in cryptography, algebraic coding theory and computational complexity. My research mainly focuses on topics at the intersection of these areas, in particular those related to probabilistic proof systems and cryptographic succinct arguments.

I obtained my PhD at École Polytechnique / IP Paris (Paris Area, France) under the supervision of Daniel Augot (more details here).

Research

Publications

Conference Proceedings
- Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes
  with Mathieu Lhotel, Jade Nardi and Hugues Randriam. 37th Computational Complexity Conference (CCC 2022). DOI.
  
  Open Access (DROPS)
Journals
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
  with Daniel Augot and Jade Nardi. Designs, Codes and Cryptography, 2022. DOI.
  
  Open Access (Springer)
- On the Privacy of a Computational Private Information Retrieval Scheme
  with Julien Lavauzelle. Cryptography and Communications, 2021. DOI.
  
  Open Access (Springer)

Other

PhD thesis (Efficient protocols for testing proximity to algebraic codes)

Teaching activities

Teaching at École Polytechnique

Advanced Cryptology

INF568 (Teaching Assistant)

2018-19, 2019-20, 2020-21

Algorithms for Data Analysis in C++

INF442 (Teaching Assistant)

2018-19, 2019-20

Les bases de la programmation et de l'algorithmique

INF411 (Teaching Assistant)
INF411T (Instructor)

2020-21

Supervision of students

Giorgio Seguini - Master student (Master project / Spring 2023)
Clémence Chevignard - Master student (Research Internship / Jul. - Dec. 2021)
Amine Abdeljaoued - Bachelor student (3rd year Bachelor Computer Science Project at l'X / Fall 2020)

Talks

Upcoming talks

May 2023

TBA
at Lattices Meet Hashes: Recent Advances in Post-Quantum Zero-Knowledge Proofs
Bernoulli Center for Fundamental Studies, Lausanne, Switzerland

Past talks

Conferences, workshops, ...

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, online
[extended abstract | slides]
November 6, 2020

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

Seminars, Working groups, ...

May 18, 2022

Interactive oracle proofs of proximity for algebraic codes
at Groupe de travail BAC, LTCI, Télécom Paris
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é
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
March 3, 2020

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

Education

PhD in Computer Science

École Polytechnique, Institut Polytechnique de Paris, France

PhD Thesis

Title: Efficient protocols for testing proximity to algebraic codes
Advisor: Daniel Augot
Reviewers: Pierrick Gaudry, Swastik Kopparty
Examiners: Eli Ben-Sasson, Eleonora Guerrini, Grégoire Lecerf (chair), Adeline Roux-Langlois, Gilles Zémor

Defended on June 16, 2022 | Thesis | Slides

Oct. 2018 - June 2022

Master's degree in Maths & Applications | Specialisation in Cryptology & Computer Security

Université de Bordeaux, France

Modules including modern cryptography, cryptanalysis, elliptic curves, computer algebra, coding theory, computational complexity, operating systems, software security, networks security, chip card security.

2016 - 2018

Bachelor's degree in Mathematics

Université de Nantes, France

2013 - 2016

Additional Experience

Past internships

Multiparty computation protocols secure against covert adversaries at Inria Saclay (Palaiseau, France)

April - August 2018, supervised by Daniel Augot and Matthieu Rambaud
Assessment of password cracking software and hardware at Cyberens Technologies & Services (Bordeaux, France)

June - August 2017, supervised by Bernard Roussely

Dissemination

I contributed to the elaboration of the following documents:

Grace Young Seminar

Co-organizer of a working group for young researchers (MSc students, PhD candidates, post-doc)

Fête de la science at Inria Saclay

October 10-11, 2019
Volunteer in science workshops for middle school students.
"Fête de la Science" (Celebration of Science) is a French national scientific vulgarisation event.