Chloé Cachet

dblp:220/2473 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
5since 2021 · last 2025
0009-0002-7320-3127ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5 · 2 first-author · 4 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2025 Private Eyes: Zero-Leakage Iris Searchable Encryption
abstract
This work introduces Private Eyes, the first zero-leakage biometric database. The only leakage of the system is unavoidable: 1) the log of the dataset size and 2) the fact that a query occurred. Private Eyes is built from oblivious symmetric searchable encryption. Approximate proximity queries are used: given a noisy reading of a biometric, the goal is to retrieve all stored records that are close enough according to a distance metric.
Julie Ha, Chloé Cachet, Luke Demarest, Sohaib Ahmad, Benjamin Fuller 0001
CODASPY2
2024 Upgrading Fuzzy Extractors
Chloé Cachet, Ariel Hamlin, Maryam Rezapour, Benjamin Fuller 0001
ACNS (1)1
2023 Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric
Chloé Cachet, Sohaib Ahmad, Luke Demarest, Serena Riback, Ariel Hamlin, Benjamin Fuller 0001
Inf. Comput.1
2022 Proximity Searchable Encryption for the Iris Biometric
abstract
Biometric databases collect people's information and allow users to perform proximity searches (finding all records within a bounded distance of the query point) with few cryptographic protections. This work studies proximity searchable encryption applied to the iris biometric.
Chloé Cachet, Sohaib Ahmad, Luke Demarest, Ariel Hamlin, Benjamin Fuller 0001
AsiaCCS1
2022 Nonmalleable Digital Lockers and Robust Fuzzy Extractors in the Plain Model
Daniel Apon, Chloé Cachet, Benjamin Fuller 0001, Feng-Hao Liu
ASIACRYPT (4)2
2018 Pseudoentropic Isometries: A New Framework for Fuzzy Extractor Reusability
abstract
Fuzzy extractors (Dodiset al., Eurocrypt 2004) turn a noisy secret into a stable, uniformly distributed key. Reusable fuzzy extractors remain secure when multiple keys are produced from a single noisy secret (Boyen, CCS 2004). Boyen showed information-theoretically secure reusable fuzzy extractors are subject to strong limitations. Simoens et al. (IEEE S&P, 2009) then showed deployed constructions suffer severe security breaks when reused. Canetti et al. (Eurocrypt 2016) used computational security to sidestep this problem, building a computationally secure reusable fuzzy extractor that corrects a sublinear fraction of errors.
Quentin Alamélou, Paul-Edmond Berthier, Chloé Cachet, Stéphane Cauchie, Benjamin Fuller 0001, Philippe Gaborit, Sailesh Simhadri
AsiaCCS3