Cryptology ePrint Archive: Report 2017/1215

Lattice-Based Public Key Searchable Encryption from Experimental Perspectives

Rouzbeh Behnia and Muslum Ozgur Ozmen and Attila A. Yavuz

Abstract: Public key Encryption with Keyword Search (PEKS) aims in mitigating the impacts of data privacy versus utilization dilemma by allowing {\em 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.

Category / Keywords: public-key cryptography, Public Key Encryption with Keyword Search (PEKS), lattice-based cryptography, searchable ecnryption

Original Publication (in the same form): IEEE Transactions on Dependable and Secure Computing (TDSC)

Date: received 18 Dec 2017, last revised 9 Nov 2018

Contact author: behniar at oregonstate edu

Available format(s): PDF | BibTeX Citation

Version: 20181109:215604 (All versions of this report)

Short URL: ia.cr/2017/1215


[ Cryptology ePrint archive ]