Time‐specific encrypted range query with minimum leakage disclosure
Abstract A time‐specific encrypted range query scheme that has the following properties is proposed. (1) The proposed scheme has trapdoor privacy and data privacy so that a semi‐honest cloud is not able to get any useful information from given ciphertexts and given tokens that are used for searching...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | IET Information Security |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/ise2.12010 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850171341151404032 |
|---|---|
| author | Ozgur Oksuz |
| author_facet | Ozgur Oksuz |
| author_sort | Ozgur Oksuz |
| collection | DOAJ |
| description | Abstract A time‐specific encrypted range query scheme that has the following properties is proposed. (1) The proposed scheme has trapdoor privacy and data privacy so that a semi‐honest cloud is not able to get any useful information from given ciphertexts and given tokens that are used for searching ranges. (2) Unlike most of the other studies which report that the cloud server stores single encrypted keyword/element in the database, in our solution, the cloud server stores encrypted multi‐keywords/ranges in the database. Therefore, the semi‐honest cloud compares ciphertexts to tokens as ranges based on a predefined threshold ϕ value. This approach decreases the cloud search time since the cloud compares ranges to ranges (multi‐keywords with multi‐keywords) not points to points (not a keyword with a keyword). Thus, the proposed scheme is efficient based on searching ranges on ciphertexts. (3) Moreover, the communication cost between users and the cloud is decreased from O(n) to O(log n), where n is the size of a range. Users send logarithmic size information to the cloud server instead of sending linear size information. |
| format | Article |
| id | doaj-art-9cb7d5c337484bbb9d0718e85382c9a1 |
| institution | OA Journals |
| issn | 1751-8709 1751-8717 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Information Security |
| spelling | doaj-art-9cb7d5c337484bbb9d0718e85382c9a12025-08-20T02:20:18ZengWileyIET Information Security1751-87091751-87172021-01-0115111713010.1049/ise2.12010Time‐specific encrypted range query with minimum leakage disclosureOzgur Oksuz0Computer Engineering Department Adiyaman University Adiyaman TurkeyAbstract A time‐specific encrypted range query scheme that has the following properties is proposed. (1) The proposed scheme has trapdoor privacy and data privacy so that a semi‐honest cloud is not able to get any useful information from given ciphertexts and given tokens that are used for searching ranges. (2) Unlike most of the other studies which report that the cloud server stores single encrypted keyword/element in the database, in our solution, the cloud server stores encrypted multi‐keywords/ranges in the database. Therefore, the semi‐honest cloud compares ciphertexts to tokens as ranges based on a predefined threshold ϕ value. This approach decreases the cloud search time since the cloud compares ranges to ranges (multi‐keywords with multi‐keywords) not points to points (not a keyword with a keyword). Thus, the proposed scheme is efficient based on searching ranges on ciphertexts. (3) Moreover, the communication cost between users and the cloud is decreased from O(n) to O(log n), where n is the size of a range. Users send logarithmic size information to the cloud server instead of sending linear size information.https://doi.org/10.1049/ise2.12010communication complexitydata privacypublic key cryptographyquery processingsearch problemscloud computing |
| spellingShingle | Ozgur Oksuz Time‐specific encrypted range query with minimum leakage disclosure IET Information Security communication complexity data privacy public key cryptography query processing search problems cloud computing |
| title | Time‐specific encrypted range query with minimum leakage disclosure |
| title_full | Time‐specific encrypted range query with minimum leakage disclosure |
| title_fullStr | Time‐specific encrypted range query with minimum leakage disclosure |
| title_full_unstemmed | Time‐specific encrypted range query with minimum leakage disclosure |
| title_short | Time‐specific encrypted range query with minimum leakage disclosure |
| title_sort | time specific encrypted range query with minimum leakage disclosure |
| topic | communication complexity data privacy public key cryptography query processing search problems cloud computing |
| url | https://doi.org/10.1049/ise2.12010 |
| work_keys_str_mv | AT ozguroksuz timespecificencryptedrangequerywithminimumleakagedisclosure |