A Full RNS Variant of FV like Somewhat Homomorphic Encryption Schemes. - Jean-Claude Bajard; Julien Eynard; M. Anwar Hasan; Vincent Zucca (IACR Cryptol. ePrint Arch., 2016)

Prover Efficient Public Verification of Dense or Sparse/Structured Matrix-Vector Multiplication. - Jean-Guillaume Dumas; Vincent Zucca (ACISP (2), 2017)

Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes. - Jean-Claude Bajard; Julien Eynard; M. Anwar Hasan; Paulo Martins 002; Leonel Sousa; Vincent Zucca (SAC, 2017)

Efficient reductions in cyclotomic rings - Application to R-LWE based FHE schemes. - Jean-Claude Bajard; Julien Eynard; M. Anwar Hasan; Paulo Martins 002; Leonel Sousa; Vincent Zucca (IACR Cryptol. ePrint Arch., 2017)

Towards Efficient Arithmetic for Ring-LWE based Homomorphic Encryption. (Vers une arithmétique efficace pour le chiffrement homomorphe basé sur le Ring-LWE). - Vincent Zucca (2018)

An HPR variant of the FV scheme: Computationally Cheaper, Asymptotically Faster. - Jean-Claude Bajard; Julien Eynard; Paulo Martins 002; Leonel Sousa; Vincent Zucca (IACR Cryptol. ePrint Arch., 2019)

Note on the noise growth of the RNS variants of the BFV scheme. - Jean-Claude Bajard; Julien Eynard; Paulo Martins 002; Leonel Sousa; Vincent Zucca (IACR Cryptol. ePrint Arch., 2019)

An asymptotically faster version of FV supported on HPR. - Jean-Claude Bajard; Julien Eynard; Paulo Martins 002; Leonel Sousa; Vincent Zucca (ARITH, 2020)

Improving the Efficiency of SVM Classification With FHE. - Jean-Claude Bajard; Paulo Martins 002; Leonel Sousa; Vincent Zucca (IEEE Trans. Inf. Forensics Secur., 2020)

Integer Functions Suitable for Homomorphic Encryption over Finite Fields. - Ilia Iliashenko; Christophe Nègre; Vincent Zucca (IACR Cryptol. ePrint Arch., 2021)

Revisiting Homomorphic Encryption Schemes for Finite Fields. - Andrey Kim; Yuriy Polyakov; Vincent Zucca (IACR Cryptol. ePrint Arch., 2021)

Faster homomorphic comparison operations for BGV and BFV. - Ilia Iliashenko; Vincent Zucca (Proc. Priv. Enhancing Technol., 2021)

OpenFHE: Open-Source Fully Homomorphic Encryption Library. - Ahmad Al Badawi; Jack Bates; Flávio Bergamaschi; David Bruce Cousins; Saroja Erabelli; Nicholas Genise; Shai Halevi; Hamish Hunt; Andrey Kim; Yongwoo Lee 002; Zeyu Liu 008; Daniele Micciancio; et al. (IACR Cryptol. ePrint Arch., 2022)

Tight Bound on NewHope Failure Probability. - Thomas Plantard; Arnaud Sipasseuth; Willy Susilo; Vincent Zucca (IEEE Trans. Emerg. Top. Comput., 2022)