Linear encryption with keyword search
Nowadays an increasing amount of data stored in the public cloud need to be searched remotely for fast accessing. For the sake of privacy, the remote files are usually encrypted, which makes them difficult to be searched by remote servers. It is also harder to efficiently share encrypted data in the...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2016
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7364 https://ink.library.smu.edu.sg/context/sis_research/article/8367/viewcontent/Linear_encryption_with_keyword_search.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-8367 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-83672022-10-13T07:49:59Z Linear encryption with keyword search ZHANG, Shiwei YANG, Guomin MU, Yi Nowadays an increasing amount of data stored in the public cloud need to be searched remotely for fast accessing. For the sake of privacy, the remote files are usually encrypted, which makes them difficult to be searched by remote servers. It is also harder to efficiently share encrypted data in the cloud than those in plaintext. In this paper, we develop a searchable encryption framework called Linear Encryption with Keyword Search (LEKS) that can semi-generically convert some existing encryption schemes meeting our Linear Encryption Template (LET) to be searchable without re-encrypting all the data. For allowing easy data sharing, we convert a Key-Policy Attributed-Based Encryption (KP-ABE) scheme to a Key-Policy Attributed-Based Keyword Search (KP-ABKS) scheme as a concrete instance of our LEKS framework, making both the encrypted data and the search functionality under fine-grained access control. Notably, the resulting KP-ABKS is the first proven secure ABKS scheme with IND-sCKA security in the random oracle model, assuming the hardness of the -DCBDH problem derived from the (P, f)-DBDH problem family 2016-07-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/7364 info:doi/10.1007/978-3-319-40367-0_12 https://ink.library.smu.edu.sg/context/sis_research/article/8367/viewcontent/Linear_encryption_with_keyword_search.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Cloud security Keyword search Searchable encryption Data Storage Systems Information Security |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Cloud security Keyword search Searchable encryption Data Storage Systems Information Security |
spellingShingle |
Cloud security Keyword search Searchable encryption Data Storage Systems Information Security ZHANG, Shiwei YANG, Guomin MU, Yi Linear encryption with keyword search |
description |
Nowadays an increasing amount of data stored in the public cloud need to be searched remotely for fast accessing. For the sake of privacy, the remote files are usually encrypted, which makes them difficult to be searched by remote servers. It is also harder to efficiently share encrypted data in the cloud than those in plaintext. In this paper, we develop a searchable encryption framework called Linear Encryption with Keyword Search (LEKS) that can semi-generically convert some existing encryption schemes meeting our Linear Encryption Template (LET) to be searchable without re-encrypting all the data. For allowing easy data sharing, we convert a Key-Policy Attributed-Based Encryption (KP-ABE) scheme to a Key-Policy Attributed-Based Keyword Search (KP-ABKS) scheme as a concrete instance of our LEKS framework, making both the encrypted data and the search functionality under fine-grained access control. Notably, the resulting KP-ABKS is the first proven secure ABKS scheme with IND-sCKA security in the random oracle model, assuming the hardness of the -DCBDH problem derived from the (P, f)-DBDH problem family |
format |
text |
author |
ZHANG, Shiwei YANG, Guomin MU, Yi |
author_facet |
ZHANG, Shiwei YANG, Guomin MU, Yi |
author_sort |
ZHANG, Shiwei |
title |
Linear encryption with keyword search |
title_short |
Linear encryption with keyword search |
title_full |
Linear encryption with keyword search |
title_fullStr |
Linear encryption with keyword search |
title_full_unstemmed |
Linear encryption with keyword search |
title_sort |
linear encryption with keyword search |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2016 |
url |
https://ink.library.smu.edu.sg/sis_research/7364 https://ink.library.smu.edu.sg/context/sis_research/article/8367/viewcontent/Linear_encryption_with_keyword_search.pdf |
_version_ |
1770576319709446144 |