---

Hello there. Since October 2023, I am a Postdoctoral Researcher at Aarhus University, hosted by Claudio Orlandi. I previously completed my PhD. studies jointly at Reichman University (formerly IDC Herzliya) and Université Paris Cité, advised by Elette Boyle and Geoffroy Couteau.

My research focusses on Cryptography, and more specifically on Secure Multiparty Computation. I am however interested in most problems at the frontier between discrete mathematics and theoretical computer science. In particular the following: Cryptography, Graph Theory, Combinatorics, Complexity Theory.

You may find a copy of my PhD thesis, here.

The complete list of my publications is available on my dblp page.

---

Conferences

1. TCC'24 Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing
   Pierre Meyer, Claudio Orlandi, Lawrence Roy, and Peter Scholl. [eprint]
2. TCC'24 Depth-Reduction Algorithms for Directed Acyclic Graphs and Applications to Secure Multiparty Computation
   Pierre Meyer, Geoffroy Couteau, Pierre Charbit, and Reza Naserasr. [eprint]
3. SCN'24 Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs
   Chris Brzuska, Geoffroy Couteau, Christoph Egger, Pihla Karanko, and Pierre Meyer. [eprint]
4. Eurocrypt'24 Fast Public-Key Silent OT and More from Constrained Naor-Reingold
   Dung Bui, Geoffroy Couteau, Pierre Meyer, Alain Passelègue, and Mahshid Riahinia. [eprint]
5. TCC'23 Towards Topology-Hiding Computation from Oblivious Transfer, Marshall Ball, Alexander Bienstock, Lisa Kohl, and Pierre Meyer. [eprint]
6. Eurocrypt'23 Constrained Pseudorandom Functions from Homomorphic Secret-Sharing
   Geoffroy Couteau, Pierre Meyer, Alain Passelègue, and Mahshid Riahinia. [eprint]
7. Eurocrypt'23 Sublinear-Communication Secure Multiparty Computation does not require FHE
   Elette Boyle, Geoffroy Couteau, and Pierre Meyer. [eprint]
8. ITCS'23 On Low-End Obfuscation and Learning
   Elette Boyle, Yuval Ishai, Pierre Meyer, Robert Robere, and Gal Yehuda. [Camera-Ready]
9. TCC'22 Sublinear Secure Computation from New Assumptions
   Elette Boyle, Geoffroy Couteau, and Pierre Meyer. [eprint]
10. Eurocrypt'21 Breaking the Circuit Size Barrier for Secure Computation under Quasi-Polynomial LPN
    Geoffroy Couteau and Pierre Meyer. [eprint]
11. TCC'20 Topology-Hiding Communication from Minimal Assumptions
    Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, and Tal Moran. [eprint]

---

Journals

1. JoC'23 "Topology-Hiding Communication from Minimal Assumptions"
   Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, and Tal Moran. [eprint]

---

Workshops

1. TPMPC'22 "The Foundations of Topology-Hiding Computation" (contributed talk), Marshall Ball, Alexander Bienstock, Lisa Kohl, and Pierre Meyer.
2. GROW'17 "Kernelization Algorithms for some Link Stream Editing Problems", Binh-Minh Bui-Xuan, Clémence Magnien, and Pierre Meyer.

---

Professional Service

• Programme Committee TCC ('24), SCN ('24).

---

Pre-Prints

• Lightweight FEC: Rectangular Codes with Minimum Feedback Information, Binh-Minh Bui-Xuan, P.M., and Antoine Roux. [ArXiv.org]
• Link Stream Edition: Sparse Split and Bi-Sparse Split., Binh-Minh Bui-Xuan, Clémence Magnien, P.M., and Phan Thi Ha Duong. [math.ac.vn] (pdf)

---

Positions, Internships, and Visits

• FACT Center: PhD. Student (Sep. 2020 - present), Intern (Winter-Spring-Summer 2020)
• IRIF: PhD. Student (Sep. 2020 - present), Intern (Automn 2019)
• Aarhus Crypto Group: Intern (Winter-Spring 2019)
• LIP6: Visitor (Winter-Spring 2019), Intern (Summer 2018)
• ENS de Lyon: Normalien Élève (Sep. 2016 - Aug. 2020)