Public key encryption with conjunctive keyword search secure against keyword guessing attack from lattices. Issue 11 (22nd October 2018)

• Record Type: Journal Article
• Authors: Mao, Yaojun; Fu, Xingbing; Guo, Chen; Wu, Guohua
• Other Names: Alam Muhammad guestEditor.; Wu Ting guestEditor.; Xu Xiaohua guestEditor.; He Xiangjian guestEditor.; Tsang Kim guestEditor.; Rayes Ammar guestEditor.
• Is Part Of: Transactions on emerging telecommunications technologies. Volume 30:Issue 11(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-10-22
• Subjects: Telecommunication -- Periodicals; 384.05
• DOI: 10.1002/ett.3531
• Languages: English
• ISSNs: 2161-5748

Abstract

Abstract: Public key encryption With keyword search (PEKS) enables a cloud server (CS) to get the search trapdoor to identify ciphertext containing the target keyword without decrypting the ciphertext or knowing the target keyword. With the advent of mobile cloud computing, PEKS has ushered in an era of new development opportunities and new challenges. In mobile cloud computing environment, the PEKS schemes demand strict bounded timing response and security. However, traditional PEKS schemes rely on heavy bilinear pairing computations, which causes a delay from the CS to the mobile terminal. Moreover, as computing power increases, PEKS is more vulnerable to suffer from an inherent insecurity known as inside keyword guessing attack, which leaks user data query information. To achieve a secure and efficient searchable encryption scheme in the mobile cloud computing environment, we put forward a lattice‐based searchable encryption scheme that supports conjunctive keyword search. Our scheme achieves higher computational efficiency and is resistant against quantum attacks compared with traditional PEKS schemes. To further enhance security and make our scheme secure against keyword guessing attack, we hide the decryption parameters by outsourcing part of the decryption process to a semitrusted third party called unusual keyword server, so that the CS cannot guess the exact keyword by performing consistency verification. Abstract : To achieve a secure and efficient searchable encryption scheme in the mobile cloud computing environment, we put forward a lattice‐based searchable encryption scheme that supports conjunctive keyword search. To further enhance security and make our scheme secure against keyword guessing attack, we hide the decryption parameters by outsourcing part of the decryption process to a semitrusted third party called unusual keyword server, so that the cloud server cannot guess the exact keyword by performing consistency verification.