Vincent Zucca

Orcid: 0000-0001-7487-6986

According to our database1, Vincent Zucca authored at least 14 papers between 2016 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Tight Bound on NewHope Failure Probability.
IEEE Trans. Emerg. Top. Comput., 2022

OpenFHE: Open-Source Fully Homomorphic Encryption Library.
IACR Cryptol. ePrint Arch., 2022

2021
Faster homomorphic comparison operations for BGV and BFV.
Proc. Priv. Enhancing Technol., 2021

Revisiting Homomorphic Encryption Schemes for Finite Fields.
IACR Cryptol. ePrint Arch., 2021

Integer Functions Suitable for Homomorphic Encryption over Finite Fields.
IACR Cryptol. ePrint Arch., 2021

2020
Improving the Efficiency of SVM Classification With FHE.
IEEE Trans. Inf. Forensics Secur., 2020

An asymptotically faster version of FV supported on HPR.
Proceedings of the 27th IEEE Symposium on Computer Arithmetic, 2020

2019
Note on the noise growth of the RNS variants of the BFV scheme.
IACR Cryptol. ePrint Arch., 2019

An HPR variant of the FV scheme: Computationally Cheaper, Asymptotically Faster.
IACR Cryptol. ePrint Arch., 2019

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

2017
Efficient reductions in cyclotomic rings - Application to R-LWE based FHE schemes.
IACR Cryptol. ePrint Arch., 2017

Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes.
Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017

Prover Efficient Public Verification of Dense or Sparse/Structured Matrix-Vector Multiplication.
Proceedings of the Information Security and Privacy - 22nd Australasian Conference, 2017

2016
A Full RNS Variant of FV like Somewhat Homomorphic Encryption Schemes.
IACR Cryptol. ePrint Arch., 2016


  Loading...