Date of Completion
Spring 4-18-2022
Thesis Advisor(s)
Benjamin Fuller
Honors Major
Computer Science and Engineering
Disciplines
Information Security | Other Engineering | Theory and Algorithms
Abstract
Consider a database that contains thousands of entries of the iris biometric. Each entry identifies an individual, so it is especially important that it remains secure. However, searching for entries among an encrypted database proves to be a security problem - how should one search encrypted data without leaking any information to a potential attacker? The proximity searchable encryption scheme, as discussed in the work by Cachet et al., uses the notions of inner product encryption developed by Kim et al.. In this paper, we will focus on the efficiency of these schemes. Specifically, how the symmetry of the bilinear pairing group effects the time required to execute a search.
Recommended Citation
Riback, Serena, "Performance Improvements in Inner Product Encryption" (2022). Honors Scholar Theses. 902.
https://digitalcommons.lib.uconn.edu/srhonors_theses/902