default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlia Iliashenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Robin Geelen
, Ilia Iliashenko, Jiayi Kang, Frederik Vercauteren:
On Polynomial Functions Modulo pe and Faster Bootstrapping for Homomorphic Encryption. EUROCRYPT (3) 2023: 257-286- 2022
- [j4]Ilia Iliashenko, Malika Izabachène, Axel Mertens, Hilder V. L. Pereira:
Homomorphically counting elements with the same property. Proc. Priv. Enhancing Technol. 2022(4): 670-683 (2022) - [c9]Charlotte Bonte, Ilia Iliashenko, Jeongeun Park, Hilder V. L. Pereira, Nigel P. Smart:
FINAL: Faster FHE Instantiated with NTRU and LWE. ASIACRYPT (2) 2022: 188-215 - [i14]Charlotte Bonte, Ilia Iliashenko, Jeongeun Park, Hilder V. L. Pereira, Nigel P. Smart:
FINAL: Faster FHE instantiated with NTRU and LWE. IACR Cryptol. ePrint Arch. 2022: 74 (2022) - [i13]Ilia Iliashenko, Malika Izabachène, Axel Mertens, Hilder V. L. Pereira:
Homomorphically counting elements with the same property. IACR Cryptol. ePrint Arch. 2022: 572 (2022) - [i12]Robin Geelen, Ilia Iliashenko, Jiayi Kang, Frederik Vercauteren:
On Polynomial Functions Modulo pe and Faster Bootstrapping for Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2022: 1364 (2022) - 2021
- [j3]Ilia Iliashenko, Vincent Zucca:
Faster homomorphic comparison operations for BGV and BFV. Proc. Priv. Enhancing Technol. 2021(3): 246-264 (2021) - [c8]Ilia Iliashenko, Christophe Nègre, Vincent Zucca:
Integer Functions Suitable for Homomorphic Encryption over Finite Fields. WAHC@CCS 2021: 1-10 - [c7]Kelong Cong, Radames Cruz Moreno, Mariana Botelho da Gama, Wei Dai, Ilia Iliashenko, Kim Laine, Michael Rosenberg:
Labeled PSI from Homomorphic Encryption with Reduced Computation and Communication. CCS 2021: 1135-1150 - [c6]Hao Chen, Ilia Iliashenko, Kim Laine:
When HEAAN Meets FV: A New Somewhat Homomorphic Encryption with Reduced Memory Overhead. IMACC 2021: 265-285 - [i11]Ilia Iliashenko, Vincent Zucca:
Faster homomorphic comparison operations for BGV and BFV. IACR Cryptol. ePrint Arch. 2021: 315 (2021) - [i10]Kelong Cong, Radames Cruz Moreno, Mariana Botelho da Gama, Wei Dai, Ilia Iliashenko, Kim Laine, Michael Rosenberg:
Labeled PSI from Homomorphic Encryption with Reduced Computation and Communication. IACR Cryptol. ePrint Arch. 2021: 1116 (2021) - [i9]Ilia Iliashenko, Christophe Nègre, Vincent Zucca:
Integer Functions Suitable for Homomorphic Encryption over Finite Fields. IACR Cryptol. ePrint Arch. 2021: 1335 (2021) - 2020
- [j2]Carl Bootland, Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Efficiently Processing Complex-Valued Data in Homomorphic Encryption. J. Math. Cryptol. 14(1): 55-65 (2020) - [c5]Charlotte Bonte, Ilia Iliashenko:
Homomorphic String Search with Constant Multiplicative Depth. CCSW 2020: 105-117 - [i8]Hao Chen, Ilia Iliashenko, Kim Laine:
When HEAAN Meets FV: a New Somewhat Homomorphic Encryption with Reduced Memory Overhead. IACR Cryptol. ePrint Arch. 2020: 121 (2020) - [i7]Charlotte Bonte, Ilia Iliashenko:
Homomorphic string search with constant multiplicative depth. IACR Cryptol. ePrint Arch. 2020: 931 (2020)
2010 – 2019
- 2018
- [c4]Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Homomorphic SIM ^2 D Operations: Single Instruction Much More Data. EUROCRYPT (1) 2018: 338-359 - [i6]Carl Bootland, Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Efficiently Processing Complex-Valued Data in Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2018: 785 (2018) - 2017
- [c3]Joppe W. Bos, Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Privacy-Friendly Forecasting for the Smart Grid Using Homomorphic Encryption and the Group Method of Data Handling. AFRICACRYPT 2017: 184-201 - [c2]Charlotte Bonte, Carl Bootland, Joppe W. Bos, Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Faster Homomorphic Function Evaluation Using Non-integral Base Encoding. CHES 2017: 579-600 - [i5]Charlotte Bonte, Carl Bootland, Joppe W. Bos, Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Faster Homomorphic Function Evaluation using Non-Integral Base Encoding. IACR Cryptol. ePrint Arch. 2017: 333 (2017) - [i4]Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Homomorphic SIM2D Operations: Single Instruction Much More Data. IACR Cryptol. ePrint Arch. 2017: 1013 (2017) - 2016
- [j1]Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
On error distributions in ring-based LWE. LMS J. Comput. Math. 19(A): 130-145 (2016) - [c1]Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Provably Weak Instances of Ring-LWE Revisited. EUROCRYPT (1) 2016: 147-167 - [i3]Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Provably Weak Instances of Ring-LWE Revisited. IACR Cryptol. ePrint Arch. 2016: 239 (2016) - [i2]Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
On the tightness of the error bound in Ring-LWE. IACR Cryptol. ePrint Arch. 2016: 240 (2016) - [i1]Joppe W. Bos, Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Privacy-friendly Forecasting for the Smart Grid using Homomorphic Encryption and the Group Method of Data Handling. IACR Cryptol. ePrint Arch. 2016: 1117 (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 21:22 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:
