CV

Positions

• 2023-…: Postdoctoral researcher
  • Aarhus University
  • Aarhus, Denmark
• 2016-2020: “Normalien élève”
  • Ecole Normale Supérieure de Lyon
  • Lyon, France

Internships

• 2020: Research intern at IDC Herzliya
  • Herzliya, Israel
  • Duration: Six months
  • Lab: FACT Center
  • Supervisor: Elette Boyle
  • Topic: Lower Bounds for Topology-Hiding Computation
• 2019: Research intern at University Paris Diderot
  • Paris, France
  • Duration: Three months
  • Lab: IRIF
  • Supervisor: Geoffroy Couteau
  • Topic: Secure Computation with Low Communication
• 2019: Research intern at Aarhus University
  • Aarhus, Denmark
  • Duration: Six months
  • Lab: Crypto Group
  • Supervisors: Ivan Damgård and Daniel Tschudi
  • Topic: Toplogy-Hiding Computation.
• 2018: Research intern at Thalès Communications & Security
  • Genevilliers, France
  • Duration: three months
  • Supervisors: Binh-Minh Bui-Xuan and Antoine Roux
  • Topic: Performance Analysis of Rectangular Codes with Minimal Feedback Information
• 2018: Research intern at University Pierre & Marie Curie
  • Paris, France
  • Duration: six weeks
  • Lab: LIP6
  • Supervisors: Binh-Minh Bui-Xuan and Clémence Magnien
  • Topic: Dynamic Connexity and Parameterised Complexity

Professional Service

• Programme Committees: TCC (‘24), SCN (‘24), Crypto (‘25,‘26)

Education

• Ph.D in Computer Science, Reichman University (Herzliya, Israel) and Université Paris Cité (Paris, France), 2023 (joint PhD. under the French ``cotutelle’’ system)
• Diploma of the Ecole Normale Supérieure de Lyon (confers a Masters degree), 2020
• M.Sc. in Computer Science, Université Claude Bernard Lyon 1 (Lyon, France), 2019
• B.Sc. in Computer Science, Université Claude Bernard Lyon 1, (Lyon, France), 2017

Publications

Computationally Succinct Authentication from DCR: Attribute-Based Laconic Function Evaluation and More

Maintaining Sublinear Locality Over Time: Adaptively Secure MPC on a Reusable Hidden Graph

Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs

Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank

<a href="https://pierremeyercs.github.io/2025/245" rel="permalink">Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR </a>

Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs

Fast Public-Key Silent OT and More from Constrained Naor-Reingold

Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing

A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction

Topology-Hiding Communication from Minimal Assumptions

Towards Topology-Hiding Computation from Oblivious Transfer

Constrained Pseudorandom Functions from Homomorphic Secret-Sharing

Sublinear-Communication Secure Multiparty Computation does not require FHE

On Low-End Obfuscation and Learning

Sublinear Secure Computation from New Assumptions

Breaking the Circuit Size Barrier for Secure Computation under Quasi-Polynomial LPN

Topology-Hiding Communication from Minimal Assumptions

Talks

Distributed Discrete Logarithms and Applications – Part I

June 03, 2024

Invited talk at TPMPC 2024, Darmstadt, Germany

The Foundations of Topology-Hiding Computation

June 10, 2022

Contributed talk at TPMPC 2022, Aarhus, Denmark

Kernelization algorithms for some link stream editing problems

October 10, 2017

Invited talk at GROW 2017, Toronto, Canada