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.
Eurocrypt'21"Breaking the Circuit Size Barrier for Secure Computation under Quasi-Polynomial LPN", Geoffroy Couteau and P. M., 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques (Eurocrypt'21), Zagreb, Croatia, 17-21 October 2021. (accepted)
TCC'20"Topology-Hiding Communication from Minimal Assumptions", Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, P. M., and Tal Moran, in Proceedings of the 18th Theory of Cryptography Conference (TCC'20), Online, 15-19 November 2020.
GROW'17"Kernelization Algorithms for some Link Stream Editing Problems", Binh-Minh Bui-Xuan, Clémence Magnien, and P.M., 8th Workshop on Graph Classes, Optimization, and Width Parameters (GROW'17) Toronto, Canada, 10-13 October 2017.
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)