April 6, 2022
Evgenios Kornaropoulos - GMU
Abstract. The growing area of searchable encryption combines cryptographic advancements with system designs so that the end product can search directly on ciphertexts without decrypting. Searchable encryption schemes typically reveal some formally-defined information, known as leakage, during computations on encrypted data. In this talk, I present a few key findings from my research that show a foundational approach to understanding leakage in practical encrypted search. First, I present a new family of leakage-abuse attacks against various encrypted queries under realistic scenarios. Second, I use the insights from this cryptanalysis towards developing a principled approach to understanding privacy in searchable encryption.