More Like this

1. Set Covering with Our Eyes Wide Shut

   Gupta, Anupam; Kehne, Gregory; Levin, Roie (January 2024, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA))
2. Seeing fear: It’s all in the eyes?

   https://doi.org/10.1016/j.tins.2018.06.009  

   Barrett, L. F. (January 2018, Trends in neurosciences)

   null (Ed.)
3. Private Eyes: Zero-Leakage Iris Searchable Encryption

   Ha, Julie; Cachet, Chloe; Demarest, Luke; Ahmad, Sohaib; Fuller, Benjamin (June 2025, ACM)

   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. Private Eyes combines locality sensitive-hashing or LSHs (Indyk and Motwani, STOC 1998) and oblivious maps which map keywords to values. One computes many LSHs of each record in the database and uses these hashes as keywords in the oblivious map with the matching biometric readings concatenated as the value. At search time with a noisy reading, one computes the LSHs and retrieves the disjunction of the resulting values from the map. The underlying oblivious map needs to answer disjunction queries efficiently. We focus on the iris biometric which requires a large number of LSHs, approximately 1000. Boldyreva and Tang’s (PoPETS 2021) design yields a suitable map for a small number of LSHs (their application was in zeroleakage k-nearest-neighbor search). Our solution is a zero-leakage disjunctive map designed for the setting when most clauses do not match any records. For the iris, on average at most 6% of LSHs match any stored value. We evaluate using the ND-0405 dataset; this dataset has 356 irises suitable for testing. To scale our evaluation, we use a generative adversarial network to produce synthetic irises. Accurate statistics on sizes beyond available datasets is crucial to optimizing the cryptographic primitives. This tool may be of independent interest. For the largest tested parameters of a 5000 synthetic iris database, a search requires 18 rounds of communication and 25ms of parallel computation. Our scheme is implemented and open-sourced. 

   more » « less
4. Private Eyes: Zero-Leakage Iris Searchable Encryption

   https://doi.org/10.1145/3714393.3726497  

   Ha, Julie; Cachet, Chloe; Demarest, Luke; Ahmad, Sohaib; Fuller, Benjamin (June 2024, ACM)

   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. Private Eyes combines locality sensitive-hashing or LSHs (Indyk and Motwani, STOC 1998) and oblivious maps which map keywords to values. One computes many LSHs of each record in the database and uses these hashes as keywords in the oblivious map with the matching biometric readings concatenated as the value. At search time with a noisy reading, one computes the LSHs and retrieves the disjunction of the resulting values from the map. The underlying oblivious map needs to answer disjunction queries efficiently. We focus on the iris biometric which requires a large number of LSHs, approximately 1000. Boldyreva and Tang's (PoPETS 2021) design yields a suitable map for a small number of LSHs (their application was in zero-leakage k-nearest-neighbor search). Our solution is a zero-leakage disjunctive map designed for the setting when most clauses do not match any records. For the iris, on average at most 6% of LSHs match any stored value. For the largest tested parameters of a 5000 synthetic iris database, a search requires 18 rounds of communication and 25ms of parallel computation. Our scheme is implemented and open-sourced. 

   more » « less
5. GestureCalc: An Eyes-Free Calculator for Touch Screens

   https://doi.org/10.1145/3308561.3353783  

   Chaudhuri, Bindita; Perlmutter, Leah; Petelka, Justin; Garrison, Philip; Fogarty, James; Wobbrock, Jacob O.; Ladner, Richard E. (October 2019, The ACM SIGACCESS Conference on Computers and Accessibility)

   null (Ed.)