Expressive Public-Key Encryption With Keyword Search: Generic Construction From KP-ABE and an Efficient Scheme Over Prime-Order Groups

Public key encryption with keyword search (PEKS) allows a cloud server to retrieve particular ciphertexts without leaking the contents of the searched ciphertexts. This kind of cryptographic primitive gives users a special way to retrieve the encrypted documents they need while preserving privacy. N...

Full description

Bibliographic Details
Main Authors: Chen Shen, Yang Lu, Jiguo Li
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8939440/
_version_ 1818617011233619968
author Chen Shen
Yang Lu
Jiguo Li
author_facet Chen Shen
Yang Lu
Jiguo Li
author_sort Chen Shen
collection DOAJ
description Public key encryption with keyword search (PEKS) allows a cloud server to retrieve particular ciphertexts without leaking the contents of the searched ciphertexts. This kind of cryptographic primitive gives users a special way to retrieve the encrypted documents they need while preserving privacy. Nevertheless, most existing PEKS schemes only offer single-keyword search or conjunctive-keyword searcha. The poorly expressive ability and constantly inaccurate search results make them hard to meet users' requirements. Although several expressive PEKS (EPEKS) schemes were proposed, they entail high computation and communication costs. An ideal EPEKS scheme should enable fast and accurate ciphertext retrieval, while lowering the storage server's load and reducing the amount of communication data. Drawing on the strongly expressive ability of key-policy attribute-based encryption (KP-ABE), we propose a generic construction of EPEKS from KP-ABE. We demonstrate that the derived EPEKS scheme is secure under the chosen keyword attack if the implicit KP-ABE scheme fulfills the anonymity under the chosen plaintext attack. Furthermore, we present a concrete EPEKS scheme over the prime-order groups. The comparison and experimental results indicate that our scheme is more efficient than the existing EPEKS schemes.
first_indexed 2024-12-16T16:58:54Z
format Article
id doaj.art-7b2281370628478883adef47aadf7307
institution Directory Open Access Journal
issn 2169-3536
language English
last_indexed 2024-12-16T16:58:54Z
publishDate 2020-01-01
publisher IEEE
record_format Article
series IEEE Access
spelling doaj.art-7b2281370628478883adef47aadf73072022-12-21T22:23:49ZengIEEEIEEE Access2169-35362020-01-0189310310.1109/ACCESS.2019.29616338939440Expressive Public-Key Encryption With Keyword Search: Generic Construction From KP-ABE and an Efficient Scheme Over Prime-Order GroupsChen Shen0https://orcid.org/0000-0003-2212-4664Yang Lu1https://orcid.org/0000-0003-4860-8384Jiguo Li2https://orcid.org/0000-0002-6532-2081College of Computer and Information, Hohai University, Nanjing, ChinaCollege of Computer and Information, Hohai University, Nanjing, ChinaCollege of Mathematics and Informatics, Fujian Normal University, Fuzhou, ChinaPublic key encryption with keyword search (PEKS) allows a cloud server to retrieve particular ciphertexts without leaking the contents of the searched ciphertexts. This kind of cryptographic primitive gives users a special way to retrieve the encrypted documents they need while preserving privacy. Nevertheless, most existing PEKS schemes only offer single-keyword search or conjunctive-keyword searcha. The poorly expressive ability and constantly inaccurate search results make them hard to meet users' requirements. Although several expressive PEKS (EPEKS) schemes were proposed, they entail high computation and communication costs. An ideal EPEKS scheme should enable fast and accurate ciphertext retrieval, while lowering the storage server's load and reducing the amount of communication data. Drawing on the strongly expressive ability of key-policy attribute-based encryption (KP-ABE), we propose a generic construction of EPEKS from KP-ABE. We demonstrate that the derived EPEKS scheme is secure under the chosen keyword attack if the implicit KP-ABE scheme fulfills the anonymity under the chosen plaintext attack. Furthermore, we present a concrete EPEKS scheme over the prime-order groups. The comparison and experimental results indicate that our scheme is more efficient than the existing EPEKS schemes.https://ieeexplore.ieee.org/document/8939440/Searchable encryptionexpressive keyword searchkey-policy attribute-based encryptionprime-order group
spellingShingle Chen Shen
Yang Lu
Jiguo Li
Expressive Public-Key Encryption With Keyword Search: Generic Construction From KP-ABE and an Efficient Scheme Over Prime-Order Groups
IEEE Access
Searchable encryption
expressive keyword search
key-policy attribute-based encryption
prime-order group
title Expressive Public-Key Encryption With Keyword Search: Generic Construction From KP-ABE and an Efficient Scheme Over Prime-Order Groups
title_full Expressive Public-Key Encryption With Keyword Search: Generic Construction From KP-ABE and an Efficient Scheme Over Prime-Order Groups
title_fullStr Expressive Public-Key Encryption With Keyword Search: Generic Construction From KP-ABE and an Efficient Scheme Over Prime-Order Groups
title_full_unstemmed Expressive Public-Key Encryption With Keyword Search: Generic Construction From KP-ABE and an Efficient Scheme Over Prime-Order Groups
title_short Expressive Public-Key Encryption With Keyword Search: Generic Construction From KP-ABE and an Efficient Scheme Over Prime-Order Groups
title_sort expressive public key encryption with keyword search generic construction from kp abe and an efficient scheme over prime order groups
topic Searchable encryption
expressive keyword search
key-policy attribute-based encryption
prime-order group
url https://ieeexplore.ieee.org/document/8939440/
work_keys_str_mv AT chenshen expressivepublickeyencryptionwithkeywordsearchgenericconstructionfromkpabeandanefficientschemeoverprimeordergroups
AT yanglu expressivepublickeyencryptionwithkeywordsearchgenericconstructionfromkpabeandanefficientschemeoverprimeordergroups
AT jiguoli expressivepublickeyencryptionwithkeywordsearchgenericconstructionfromkpabeandanefficientschemeoverprimeordergroups