default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Zucca
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2018
[b1]Vincent Zucca:
Towards Efficient Arithmetic for Ring-LWE based Homomorphic Encryption. (Vers une arithmétique efficace pour le chiffrement homomorphe basé sur le Ring-LWE). Pierre and Marie Curie University, Paris, France, 2018
Journal Articles
- 2022
- [j3]Thomas Plantard
, Arnaud Sipasseuth, Willy Susilo, Vincent Zucca:
Tight Bound on NewHope Failure Probability. IEEE Trans. Emerg. Top. Comput. 10(4): 1955-1965 (2022) - 2021
- [j2]Ilia Iliashenko, Vincent Zucca:
Faster homomorphic comparison operations for BGV and BFV. Proc. Priv. Enhancing Technol. 2021(3): 246-264 (2021) - 2020
- [j1]Jean-Claude Bajard, Paulo Martins, Leonel Sousa, Vincent Zucca:
Improving the Efficiency of SVM Classification With FHE. IEEE Trans. Inf. Forensics Secur. 15: 1709-1722 (2020)
Conference and Workshop Papers
- 2022
- [c7]Ahmad Al Badawi, Jack Bates, Flávio Bergamaschi, David Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, Zeyu Liu, Daniele Micciancio, Ian Quah, Yuriy Polyakov, R. V. Saraswathy, Kurt Rohloff, Jonathan Saylor, Dmitriy Suponitsky, Matthew Triplett, Vinod Vaikuntanathan, Vincent Zucca:
OpenFHE: Open-Source Fully Homomorphic Encryption Library. WAHC@CCS 2022: 53-63 - 2021
- [c6]Andrey Kim, Yuriy Polyakov, Vincent Zucca:
Revisiting Homomorphic Encryption Schemes for Finite Fields. ASIACRYPT (3) 2021: 608-639 - [c5]Ilia Iliashenko, Christophe Nègre, Vincent Zucca:
Integer Functions Suitable for Homomorphic Encryption over Finite Fields. WAHC@CCS 2021: 1-10 - 2020
- [c4]Jean-Claude Bajard, Julien Eynard, Paulo Martins, Leonel Sousa, Vincent Zucca:
An asymptotically faster version of FV supported on HPR. ARITH 2020: 80-87 - 2017
- [c3]Jean-Guillaume Dumas, Vincent Zucca:
Prover Efficient Public Verification of Dense or Sparse/Structured Matrix-Vector Multiplication. ACISP (2) 2017: 115-134 - [c2]Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Paulo Martins, Leonel Sousa, Vincent Zucca:
Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes. SAC 2017: 151-171 - 2016
- [c1]Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Vincent Zucca:
A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes. SAC 2016: 423-442
Informal and Other Publications
- 2022
- [i10]Ahmad Al Badawi, Jack Bates, Flávio Bergamaschi, David Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, Zeyu Liu, Daniele Micciancio, Ian Quah, Yuriy Polyakov, R. V. Saraswathy, Kurt Rohloff, Jonathan Saylor, Dmitriy Suponitsky, Matthew Triplett, Vinod Vaikuntanathan, Vincent Zucca:
OpenFHE: Open-Source Fully Homomorphic Encryption Library. IACR Cryptol. ePrint Arch. 2022: 915 (2022) - 2021
- [i9]Andrey Kim, Yuriy Polyakov, Vincent Zucca:
Revisiting Homomorphic Encryption Schemes for Finite Fields. IACR Cryptol. ePrint Arch. 2021: 204 (2021) - [i8]Ilia Iliashenko, Vincent Zucca:
Faster homomorphic comparison operations for BGV and BFV. IACR Cryptol. ePrint Arch. 2021: 315 (2021) - [i7]Ilia Iliashenko, Christophe Nègre, Vincent Zucca:
Integer Functions Suitable for Homomorphic Encryption over Finite Fields. IACR Cryptol. ePrint Arch. 2021: 1335 (2021) - 2019
- [i6]Jean-Claude Bajard, Julien Eynard, Paulo Martins, Leonel Sousa, Vincent Zucca:
An HPR variant of the FV scheme: Computationally Cheaper, Asymptotically Faster. IACR Cryptol. ePrint Arch. 2019: 500 (2019) - [i5]Jean-Claude Bajard, Julien Eynard, Paulo Martins, Leonel Sousa, Vincent Zucca:
Note on the noise growth of the RNS variants of the BFV scheme. IACR Cryptol. ePrint Arch. 2019: 1266 (2019) - [i4]Thomas Plantard, Arnaud Sipasseuth, Willy Susilo, Vincent Zucca:
Tight bound on NewHope failure probability. IACR Cryptol. ePrint Arch. 2019: 1451 (2019) - 2017
- [i3]Jean-Guillaume Dumas, Vincent Zucca:
Prover efficient public verification of dense or sparse/structured matrix-vector multiplication. CoRR abs/1704.02768 (2017) - [i2]Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Paulo Martins, Leonel Sousa, Vincent Zucca:
Efficient reductions in cyclotomic rings - Application to R-LWE based FHE schemes. IACR Cryptol. ePrint Arch. 2017: 748 (2017) - 2016
- [i1]Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Vincent Zucca:
A Full RNS Variant of FV like Somewhat Homomorphic Encryption Schemes. IACR Cryptol. ePrint Arch. 2016: 510 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
