Ariel Hamlin

dblp:157/3800 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
3since 2021 · last 2024
—ORCID · none

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

Security and privacy · 5 · 2 first-author · 2 since 2021Theory of computation · 1 · 1 since 2021
YearPublicationVenuePosition
2024 Upgrading Fuzzy Extractors
Chloé Cachet, Ariel Hamlin, Maryam Rezapour, Benjamin Fuller 0001
ACNS (1)2
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.5
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
AsiaCCS4
2019 On the Plausibility of Fully Homomorphic Encryption for RAMs
Ariel Hamlin, Justin Holmgren, Mor Weiss, Daniel Wichs
CRYPTO (1)1
2019 Private Anonymous Data Access
Ariel Hamlin, Rafail Ostrovsky, Mor Weiss, Daniel Wichs
EUROCRYPT (2)1
2017 SoK: Cryptographically Protected Database Search
abstract
Protected database search systems cryptographically isolate the roles of reading from, writing to, and administering the database. This separation limits unnecessary administrator access and protects data in the case of system breaches. Since protected search was introduced in 2000, the area has grown rapidly, systems are offered by academia, start-ups, and established companies. However, there is no best protected search system or set of techniques. Design of such systems is a balancing act between security, functionality, performance, and usability. This challenge is made more difficult by ongoing database specialization, as some users will want the functionality of SQL, NoSQL, or NewSQL databases. This database evolution will continue, and the protected search community should be able to quickly provide functionality consistent with newly invented databases. At the same time, the community must accurately and clearly characterize the tradeoffs between different approaches. To address these challenges, we provide the following contributions:1) An identification of the important primitive operations across database paradigms. We find there are a small number of base operations that can be used and combined to support a large number of database paradigms.2) An evaluation of the current state of protected search systems in implementing these base operations. This evaluation describes the main approaches and tradeoffs for each base operation. Furthermore, it puts protected search in the context of unprotected search, identifying key gaps in functionality.3) An analysis of attacks against protected search for different base queries.4) A roadmap and tools for transforming a protected search system into a protected database, including an open-source performance evaluation platform and initial user opinions of protected search.
Benjamin Fuller 0001, Mayank Varia, Arkady Yerukhimovich, Emily Shen, Ariel Hamlin, Vijay Gadepally, Richard Shay, John Darby Mitchell, Robert K. Cunningham
IEEE Symposium on Security and Privacy5