Lattice-Based Public Key Searchable Encryption from Experimental Perspectives

• Published in: IEEE transactions on dependable and secure computing Vol. 17; no. 6; pp. 1269 - 1282
• Main Authors: Behnia, Rouzbeh, Ozmen, Muslum Ozgur, Yavuz, Attila Altay
• Format: Journal Article
• Language: English
• Published: Washington IEEE 01.11.2020; IEEE Computer Society
• Subjects: Applied cryptography; Cloud computing; Computer crime; Data encryption; Delays; Encryption; lattice-based cryptography; public key encryption with keyword search (PEKS); Receivers; searchable ecnryption; Security; Servers; Web services
• ISSN: 1545-5971; 1941-0018
• DOI: 10.1109/TDSC.2018.2867462

Public key Encryption with Keyword Search (PEKS) aims in mitigating the impacts of data privacy versus utilization dilemma by allowing any user in the system to send encrypted files to the server to be searched by a receiver. The receiver can retrieve the encrypted files containing specific keywords by providing the corresponding trapdoors of these keywords to the server. Despite their merits, the existing PEKS schemes introduce a high end-to-end delay that may hinder their adoption in practice. Moreover, they do not scale well for large security parameters and provide no post-quantum security promises. In this paper, we propose two novel lattice-based PEKS schemes that offer a high computational efficiency along with better security assurances than that of the existing alternatives. Specifically, our NTRU-PEKS scheme achieves 18 times lower end-to-end delay than the most efficient pairing-based alternatives. Our LWE-PEKS offers provable security in the standard model with a reduction to the worst-case lattice problems. We fully implemented our NTRU-PEKS scheme and benchmarked its performance as deployed on Amazon Web Services cloud infrastructures.