Paola de Perthuis

Completing my PhD in cryptography at the école normale supérieure (ENS) of Paris and Cosmian, advised by Pr. David Pointcheval. I was previously a Research Engineer in the Polynomial Systems (PolSys) team of the LIP6 Computer Science Department of Sorbonne université (Paris). I studied General Engineering and Data Science at the école Centrale of Lyon, after two years of classes préparatoires in Maths, Physics and Engineering. I have worked on Generative Adversarial Networks (GANs) to produce cloud databases with Sidonie Lefebvre at the French National Aerospace Lab (ONERA) in Palaiseau, and on Data Mining an Processing with Didier Orel at Tamedia in Lausanne, namely working on the Paradise Papers in partnership with the ICIJ.

My research interests are focused on Asymmetric Cryptography, with works on Verifiable Computations on Homomorphic Ciphertexts, Functional Encryption, Registration-Based Encryption and Key-Encapsulation Mechanisms. I am also working on Standardization at the European Telecommunications Standards Institute (ETSI) on behalf of Cosmian.

Recent Publications

AC:FKP23

Cuckoo Commitments: Registration-Based Encryption and Key-Value Map Commitments for Large Spaces

Dario Fiore, Dimitris Kolonelos, and Paola Perthuis

In asiacrypt23name1, Asiacrypt23month 2023

Bib

@inproceedings{AC:FioKolPer23,
  author = {Fiore, Dario and Kolonelos, Dimitris and de Perthuis, Paola},
  title = {Cuckoo Commitments: Registration-Based Encryption and Key-Value Map Commitments for Large Spaces},
  editor = {asiacrypt23ed},
  booktitle = asiacrypt23name1,
  volume = asiacrypt23vol1,
  address = asiacrypt23addr,
  month = asiacrypt23month,
  publisher = asiacryptpub,
  series = mylncs,
  year = {2023},
  doi = {10.1007/978-981-99-8733-7_6},
  pages = {166--200},
}

ESOR:BPP23

Covercrypt: an Efficient Early-Abort KEM for Hidden Access Policies with Traceability from the DDH and LWE

Théophile Brézot, Paola Perthuis, and David Pointcheval

In esorics23name1, Esorics23month 2023

Bib

@inproceedings{ESORICS:BrePerPoi23,
  author = {Brézot, Théophile and de Perthuis, Paola and Pointcheval, David},
  title = {Covercrypt: an Efficient Early-Abort KEM for Hidden Access Policies with Traceability from the DDH and LWE},
  editor = {esorics23ed},
  booktitle = esorics23name1,
  volume = esorics23vol1,
  address = esorics23addr,
  month = esorics23month,
  publisher = esoricspub,
  series = mylncs,
  year = {2023},
  doi = {10.1007/978-3-031-50594-2_19},
  pages = {372--392},
}

CCS:PP22

Two-Client Inner-Product Functional Encryption with an Application to Money-Laundering Detection

Paola Perthuis, and David Pointcheval

In ccs22name, Ccs22month 2022

Bib

@inproceedings{CCS:PerPoi22,
  author = {de Perthuis, Paola and Pointcheval, David},
  title = {Two-Client Inner-Product Functional Encryption with an Application to Money-Laundering Detection},
  pages = {725--737},
  editor = {ccs22ed},
  booktitle = ccs22name,
  address = ccs22addr,
  month = ccs22month,
  publisher = ccspub,
  year = {2022},
  doi = {10.1145/3548606.3559374},
}

SCN:INPP22
MyOPE: Malicious SecuritY for Oblivious Polynomial Evaluation

Malika Izabachène, Anca Nitulescu, Paola Perthuis, and David Pointcheval

In Security and Cryptography for Networks, Sep 2022

Abs Bib

Oblivious Polynomial Evaluation (OPE) schemes are interactive protocols between a sender with a private polynomial and a receiver with a private evaluation point where the receiver learns the evaluation of the polynomial in their point and no additional information. In this work, we introduce MyOPE, a “short-sighted” non-interactive polynomial evaluation scheme with a poly-logarithmic communication complexity in the presence of malicious senders. In addition to strong privacy guarantees, MyOPE enforces honest sender behavior and consistency by adding verifiability to the calculations.
@inproceedings{SCN:INPP22, author = {Izabach{\`e}ne, Malika and Nitulescu, Anca and de Perthuis, Paola and Pointcheval, David}, editor = {Galdi, Clemente and Jarecki, Stanislaw}, title = {MyOPE: Malicious SecuritY for Oblivious Polynomial Evaluation}, booktitle = {Security and Cryptography for Networks}, year = {2022}, month = sep, publisher = {Springer International Publishing}, address = {Cham}, pages = {663--686}, isbn = {978-3-031-14791-3}, }

Talks

Jan 30, 2024	Cuckoo Commitments [AC:FioKolPer23] at the Cybersecurity PEPR winter school.
Oct 17, 2023	Cuckoo Commitments [AC:FioKolPer23] at the Journées C2 in Najac.
Oct 2, 2023	Presenting Covercrypt [ESORICS:BrePerPoi23] at the French National Security Agency, ANSSI, ‘s team of cryptologists in Paris.
Sep 27, 2023	Presenting Covercrypt [ESORICS:BrePerPoi23] at ESORICS 2023 in the Hague.
Jul 25, 2023	Presenting Cryptographic access control by attributes — ongoing standards development at ETSI with Giovanni Bartolomeo at the NIST Special Topics on Privacy and Public Auditability 6th session.
Jun 21, 2023	Presenting MyOPE [SCN:INPP22] at the Jean Kuntzmann Laboratory Seminar in Grenoble.
May 23, 2023	Presenting Covercrypt [ESORICS:BrePerPoi23] at the ETSI CYBER group in Sophia-Antipolis.
Apr 23, 2023	Presenting Two-Client Inner-Product Functional Encryption with an Application to Money-Laundering Detection [CCS:PerPoi22] at Crossfyre 2023 in Lyon.
Dec 13, 2022	Presenting MyOPE [SCN:INPP22] at the PICOCRYPT Seminar of the IMDEA Software Institute in Madrid.
Nov 9, 2022	Presenting [CCS:PerPoi22] at ACM CCS 2022 in Los Angeles.
Sep 12, 2022	Presenting MyOPE [SCN:INPP22] at SCN 2022 in Amalfi.
Apr 15, 2022	Presenting MyOPE [SCN:INPP22] at the Journées C2 in Hendaye.
Feb 17, 2022	MyOPE [SCN:INPP22] at ALMASTY Seminar in Paris.
Oct 13, 2021	Presenting MyOPE [SCN:INPP22] at Protocol Labs’s Research Seminar.

Latest Posts

Oct 23, 2023	A video presentation of Covercrypt [ESORICS:BrePerPoi23]
Jul 17, 2023	A blog post for a gentle introduction to Covercrypt [ESORICS:BrePerPoi23]'s functionalities
May 19, 2022	A video presentation of Two-Client Inner-Product Functional Encryption for Money-Laundering Detection [CCS:PerPoi22].

Teaching

2022-2023, S2	Teaching Assistant for the Algebra and Arithmetics P2.LU3MA120 course directed by Sophie Chemla at Jussieu, for the UFR 929 teaching section of Sorbonne-Université, for third year Maths students.
2021-2022, S2	Teaching Assistant for the Linear and Bilinear Algebra II P2.LU2MA122 course directed by Guillaume Maurin at Jussieu, for the UFR 929 teaching section of Sorbonne-Université, for second year Maths students.
2021-2022, S1	Teaching Assistant for the Topology and Differential Calculus I P1.LU2MA216 course directed by Ayman Moussa at Jussieu, for the UFR 929 teaching section of Sorbonne-Université, for second year Maths students.
2020-2021, S2	Teaching Assistant for the Theory of Formal Languages IF04M050 course directed by Jérôme Delobelle at Descartes, for the université de Paris, for second year Computer Science students.
2019-2020, S2	Teaching Assistant for the Numerical Algorithmics ANUM course (now MU4IN910) directed by Stef Graillat at Jussieu, for Sorbonne université, for fourth year Computer Science students in the sécurité, fiabilité et performance du numérique (SFPN) Computer Science Master.

Reviewing

2023	Subreviewer for Eurocrypt 2024, PKC 2024, Asiacrypt 2023, CCS 2023, and CRYPTO 2023.
2022	Subreviewer for Africacrypt 2022 and PKC 2023.