Cryptology ePrint Archive: Report 2017/1215

Lattice-Based Public Key Encryption with Keyword Search

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 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 promise. In this paper, we propose novel lattice-based PEKS schemes that offer a high computational efficiency along with better security assurances than that of 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 on embedded devices with a deployment on real cloud infrastructures to demonstrate its effectiveness.

Category / Keywords: public-key cryptography /

Original Publication (with major differences): The 31st Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy (DBSec 2017)

Date: received 18 Dec 2017

Contact author: behniar at oregonstate edu

Available format(s): PDF | BibTeX Citation

Version: 20171218:224658 (All versions of this report)

Short URL: ia.cr/2017/1215

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]