Pierre Meyer

Pierre Meyer

Cryptographer

CV

Education
  • Ph.D in Computer Science, Reichman University (Herzliya, Israel) & Université Paris Cité (Paris, France), 2023
  • Diploma of the École Normale Supérieure de Lyon (confers a Master’s 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
Work experience

  • 2026-…: Tenure-Track Faculty Member, CISPA, Saarbrücken, Germany

  • 2023-2026: Postdoctoral Researcher
    • Aarhus University, Aarhus, Denmark
    • Host: Claudio Orlandi
  • 2016-2020: Normalien élève
    • École Normale Supérieure de Lyon, Lyon, France
Research internships
  • 2020 (6 months): Research intern, IDC Herzliya, Herzliya, Israel
    • FACT Center. Supervisor: Elette Boyle. Topic: Lower Bounds for Topology-Hiding Computation
  • 2019 (3 months): Research intern, Université Paris Diderot, Paris, France
    • IRIF. Supervisor: Geoffroy Couteau. Topic: Secure Computation with Low Communication
  • 2019 (6 months): Research intern, Aarhus University, Aarhus, Denmark
    • Crypto Group. Supervisors: Ivan Damgård and Daniel Tschudi. Topic: Topology-Hiding Computation
  • 2018 (3 months): Research intern, Thalès Communications & Security, Gennevilliers, France
    • Supervisors: Binh-Minh Bui-Xuan and Antoine Roux. Topic: Performance Analysis of Rectangular Codes with Minimal Feedback Information
  • 2018 (6 weeks): Research intern, Université Pierre & Marie Curie, Paris, France
    • LIP6. Supervisors: Binh-Minh Bui-Xuan and Clémence Magnien. Topic: Dynamic Connexity and Parameterised Complexity
Publications

  • [17] Computationally Succinct Authentication from DCR: Attribute-Based Laconic Function Evaluation and More

    Eurocrypt 2026

  • [16] Maintaining Sublinear Locality Over Time: Adaptively Secure MPC on a Reusable Hidden Graph

    Eurocrypt 2026

  • [15] Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs

    Cryptography and Communications 17(5), 2025

  • [14] Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank

    TCC 2025

  • [13] Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR

    Crypto 2025

  • [12] Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing

    TCC 2024

  • [11] A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction

    TCC 2024

  • [10] Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs

    SCN 2024

  • [9] Fast Public-Key Silent OT and More from Constrained Naor-Reingold

    Eurocrypt 2024

  • [8] Topology-Hiding Communication from Minimal Assumptions

    Journal of Cryptology 36(4), 2023

  • [7] Towards Topology-Hiding Computation from Oblivious Transfer

    TCC 2023

  • [6] Constrained Pseudorandom Functions from Homomorphic Secret-Sharing

    Eurocrypt 2023

  • [5] Sublinear-Communication Secure Multiparty Computation does not require FHE

    Eurocrypt 2023

  • [4] On Low-End Obfuscation and Learning

    ITCS 2023

  • [3] Sublinear Secure Computation from New Assumptions

    TCC 2022

  • [2] Breaking the Circuit Size Barrier for Secure Computation under Quasi-Polynomial LPN

    Eurocrypt 2021

  • [1] Topology-Hiding Communication from Minimal Assumptions

    TCC 2020

Selected Talks
Service and leadership
  • Programme Committee member: TCC 2024, SCN 2024, Crypto 2025, Crypto 2026