default search action
Hilder Vitor Lima Pereira
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Pierrick Méaux, Jeongeun Park, Hilder V. L. Pereira:
Towards Practical Transciphering for FHE with Setup Independent of the Plaintext Space. IACR Commun. Cryptol. 1(1): 20 (2024) - [j3]Shahla Atapoor, Karim Baghery, Hilder V. L. Pereira, Jannik Spiessens:
Verifiable FHE via Lattice-based SNARKs. IACR Commun. Cryptol. 1(1): 24 (2024) - [c9]Robin Jadoul, Axel Mertens, Jeongeun Park, Hilder V. L. Pereira:
NTRU-Based FHE for Larger Key and Message Space. ACISP (1) 2024: 141-160 - [i13]Shahla Atapoor, Karim Baghery, Hilder V. L. Pereira, Jannik Spiessens:
Verifiable FHE via Lattice-based SNARKs. IACR Cryptol. ePrint Arch. 2024: 32 (2024) - [i12]Robin Jadoul, Axel Mertens, Jeongeun Park, Hilder V. L. Pereira:
NTRU-based FHE for Larger Key and Message Space. IACR Cryptol. ePrint Arch. 2024: 634 (2024) - [i11]Akash Madhusudan, Mustafa A. Mustafa, Hilder V. L. Pereira, Erik Takke:
Fully Privacy-preserving Billing Models for Peer-to-Peer Electricity Trading Markets. IACR Cryptol. ePrint Arch. 2024: 1562 (2024) - 2023
- [j2]Robin Geelen, Michiel Van Beirendonck, Hilder V. L. Pereira, Brian Huffman, Tynan McAuley, Ben Selfridge, Daniel Wagner, Georgios D. Dimou, Ingrid Verbauwhede, Frederik Vercauteren, David W. Archer:
BASALISC: Programmable Hardware Accelerator for BGV Fully Homomorphic Encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(4): 32-57 (2023) - [c8]Antonio Guimarães, Hilder V. L. Pereira, Barry Van Leeuwen:
Amortized Bootstrapping Revisited: Simpler, Asymptotically-Faster, Implemented. ASIACRYPT (6) 2023: 3-35 - [i10]Antonio Guimarães, Hilder V. L. Pereira, Barry Van Leeuwen:
Amortized Bootstrapping Revisited: Simpler, Asymptotically-faster, Implemented. IACR Cryptol. ePrint Arch. 2023: 14 (2023) - [i9]Pierrick Méaux, Jeongeun Park, Hilder V. L. Pereira:
Towards Practical Transciphering for FHE with Setup Independent of the Plaintext Space. IACR Cryptol. ePrint Arch. 2023: 1531 (2023) - 2022
- [j1]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) - [c7]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 - [c6]Kelong Cong, Debajyoti Das, Jeongeun Park, Hilder V. L. Pereira:
SortingHat: Efficient Private Decision Tree Evaluation via Homomorphic Encryption and Transciphering. CCS 2022: 563-577 - [i8]Robin Geelen, Michiel Van Beirendonck, Hilder V. L. Pereira, Brian Huffman, Tynan McAuley, Ben Selfridge, Daniel Wagner, Georgios D. Dimou, Ingrid Verbauwhede, Frederik Vercauteren, David W. Archer:
BASALISC: Flexible Asynchronous Hardware Accelerator for Fully Homomorphic Encryption. CoRR abs/2205.14017 (2022) - [i7]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) - [i6]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) - [i5]Robin Geelen, Michiel Van Beirendonck, Hilder V. L. Pereira, Brian Huffman, Tynan McAuley, Ben Selfridge, Daniel Wagner, Georgios D. Dimou, Ingrid Verbauwhede, Frederik Vercauteren, David W. Archer:
BASALISC: Flexible Asynchronous Hardware Accelerator for Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2022: 657 (2022) - [i4]Kelong Cong, Debajyoti Das, Jeongeun Park, Hilder V. L. Pereira:
SortingHat: Efficient Private Decision Tree Evaluation via Homomorphic Encryption and Transciphering. IACR Cryptol. ePrint Arch. 2022: 757 (2022) - 2021
- [c5]Hilder Vitor Lima Pereira:
Bootstrapping Fully Homomorphic Encryption over the Integers in Less than One Second. Public Key Cryptography (1) 2021: 331-359 - 2020
- [b1]Hilder Vitor Lima Pereira:
Homomorphic encryption and multilinear maps based on the approximate-GCD problem. University of Luxembourg, Luxembourg City, Luxembourg, 2020 - [c4]Hilder Vitor Lima Pereira:
Efficient AGCD-Based Homomorphic Encryption for Matrix and Vector Arithmetic. ACNS (1) 2020: 110-129 - [i3]Hilder V. L. Pereira:
Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic. IACR Cryptol. ePrint Arch. 2020: 491 (2020) - [i2]Hilder Vitor Lima Pereira:
Bootstrapping fully homomorphic encryption over the integers in less than one second. IACR Cryptol. ePrint Arch. 2020: 995 (2020)
2010 – 2019
- 2019
- [c3]Jean-Sébastien Coron, Hilder V. L. Pereira:
On Kilian's Randomization of Multilinear Map Encodings. ASIACRYPT (2) 2019: 325-355 - 2018
- [i1]Jean-Sébastien Coron, Hilder V. L. Pereira:
On Kilian's Randomization of Multilinear Map Encodings. IACR Cryptol. ePrint Arch. 2018: 1129 (2018) - 2017
- [c2]Hilder V. L. Pereira, Diego F. Aranha:
Non-interactive Privacy-preserving k-NN Classifier. ICISSP 2017: 362-371 - 2012
- [c1]Hilder V. L. Pereira, Eder Novais, André Mariotti, Ivandré Paraboni:
Corpus-based Referring Expressions Generation. LREC 2012: 4004-4009
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-11-08 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint