Boolean Searchable Symmetric Encryption with Worst Case Sub Linear Complexity

Boolean Searchable Symmetric Encryption with Worst Case Sub Linear Complexity

Explore a groundbreaking paper on Boolean Searchable Symmetric Encryption presented at Eurocrypt 2017. Delve into the innovative approach developed by Seny Kamara and Tarik Moataz, which achieves worst-case sub-linear complexity. Examine the blackbox construction, single keyword construction, and data structures used in this cryptographic solution. Gain insights into the security aspects, intuition behind the design, and key algorithms such as IEXToken, Gate, and Search. Analyze the leakage, complexity, and compact construction of this novel encryption method. Evaluate the new construction and its potential impact on the field of searchable encryption.