default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlaria Chillotti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Ilaria Chillotti, Emmanuela Orsini
, Peter Scholl, Barry Van Leeuwen:
Scooby: Improved multi-party homomorphic secret sharing based on FHE. Inf. Comput. 297: 105133 (2024)- [i16]Jean-Philippe Bossuat, Rosario Cammarota, Jung Hee Cheon, Ilaria Chillotti, Benjamin R. Curtis, Wei Dai, Huijing Gong, Erin Hales, Duhyeong Kim, Bryan Kumara, Changmin Lee, Xianhui Lu, Carsten Maple, Alberto Pedrouzo-Ulloa, Rachel Player, Luis Antonio Ruiz Lopez, Yongsoo Song, Donggeon Yhee, Bahattin Yildiz:
Security Guidelines for Implementing Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2024: 463 (2024) - 2023
- [j2]Loris Bergerat, Anas Boudi, Quentin Bourgerie, Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap:
Parameter Optimization and Larger Precision for (T)FHE. J. Cryptol. 36(3): 28 (2023) - [i15]Loris Bergerat, Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Adeline Roux-Langlois, Samuel Tap:
Faster Secret Keys for (T)FHE. IACR Cryptol. ePrint Arch. 2023: 979 (2023) - 2022
- [c11]Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Nigel P. Smart, Barry Van Leeuwen:
Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE. SCN 2022: 540-563 - [i14]Loris Bergerat, Anas Boudi, Quentin Bourgerie, Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap:
Parameter Optimization & Larger Precision for (T)FHE. IACR Cryptol. ePrint Arch. 2022: 704 (2022) - [i13]Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Nigel P. Smart, Barry Van Leeuwen:
Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE. IACR Cryptol. ePrint Arch. 2022: 862 (2022) - 2021
- [c10]Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap:
Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE. ASIACRYPT (3) 2021: 670-699 - [c9]Ilaria Chillotti, Marc Joye, Pascal Paillier:
Programmable Bootstrapping Enables Efficient Homomorphic Inference of Deep Neural Networks. CSCML 2021: 1-19 - [i12]Ilaria Chillotti, Marc Joye, Pascal Paillier:
Programmable Bootstrapping Enables Efficient Homomorphic Inference of Deep Neural Networks. IACR Cryptol. ePrint Arch. 2021: 91 (2021) - [i11]Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap:
Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE. IACR Cryptol. ePrint Arch. 2021: 729 (2021) - 2020
- [j1]Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène:
TFHE: Fast Fully Homomorphic Encryption Over the Torus. J. Cryptol. 33(1): 34-91 (2020) - [c8]Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi:
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. USENIX Security Symposium 2020: 2111-2128
2010 – 2019
- 2019
- [c7]Hao Chen, Ilaria Chillotti, Yongsoo Song:
Multi-Key Homomorphic Encryption from TFHE. ASIACRYPT (2) 2019: 446-472 - [c6]Hao Chen, Ilaria Chillotti, Ling Ren:
Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE. CCS 2019: 345-360 - [c5]Hao Chen, Ilaria Chillotti, Yongsoo Song:
Improved Bootstrapping for Approximate Homomorphic Encryption. EUROCRYPT (2) 2019: 34-54 - [i10]Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi:
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. CoRR abs/1904.02033 (2019) - [i9]Hao Chen, Ilaria Chillotti, Yongsoo Song:
Multi-Key Homomophic Encryption from TFHE. IACR Cryptol. ePrint Arch. 2019: 116 (2019) - [i8]Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi:
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. IACR Cryptol. ePrint Arch. 2019: 359 (2019) - [i7]Hao Chen, Ilaria Chillotti, Ling Ren:
Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE. IACR Cryptol. ePrint Arch. 2019: 736 (2019) - 2018
- [c4]Christina Boura, Ilaria Chillotti, Nicolas Gama, Dimitar Jetchev, Stanislav Peceny, Alexander Petric:
High-Precision Privacy-Preserving Real-Valued Function Evaluation. Financial Cryptography 2018: 183-202 - [i6]Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène:
TFHE: Fast Fully Homomorphic Encryption over the Torus. IACR Cryptol. ePrint Arch. 2018: 421 (2018) - [i5]Hao Chen, Ilaria Chillotti, Yongsoo Song:
Improved Bootstrapping for Approximate Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2018: 1043 (2018) - 2017
- [c3]Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène:
Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE. ASIACRYPT (1) 2017: 377-408 - [i4]Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène:
Improving TFHE: faster packed homomorphic operations and efficient circuit bootstrapping. IACR Cryptol. ePrint Arch. 2017: 430 (2017) - [i3]Christina Boura, Ilaria Chillotti, Nicolas Gama, Dimitar Jetchev, Stanislav Peceny, Alexander Petric:
High-Precision Privacy-Preserving Real-Valued Function Evaluation. IACR Cryptol. ePrint Arch. 2017: 1234 (2017) - 2016
- [c2]Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène:
Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds. ASIACRYPT (1) 2016: 3-33 - [c1]Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène:
A Homomorphic LWE Based E-voting Scheme. PQCrypto 2016: 245-265 - [i2]Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène:
Faster Fully Homomorphic Encryption: Bootstrapping in less than 0.1 Seconds. IACR Cryptol. ePrint Arch. 2016: 870 (2016) - [i1]Ilaria Chillotti, Nicolas Gama, Louis Goubin:
Attacking FHE-based applications by software fault injections. IACR Cryptol. ePrint Arch. 2016: 1164 (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-08-05 20:12 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:
