An improved finegrained ciphertext policy based temporary keyword search on encrypted data for secure cloud storage
© 2024. The Author(s)..
We present a temporary keyword search over sensitive and confidential health data in a cloud environment. The cloud constitutes a semi-trusted domain, making it necessary for data owners to secure their data before outsourcing it through techniques like encryption. Attribute-based keyword search techniques tend to perform a search operation using a search token generated by an authorized user. These search tokens can lead to serious privacy threats, as they can extract all ciphertexts that may have been generated along with their keyword. Therefore, restricting search tokens to extract ciphertexts generated within a time interval is a more promising solution. In this paper, we present a novel ciphertext policy fine-grained temporary keyword that prevents the misuse of these search tokens. Further, it mitigates the risk of insider threats within healthcare organizations by limiting the window of opportunity for unauthorized access to minimum. To assess the security, our proposed scheme is formally proven to be secure against Selectively Chosen Keyword Attacks in the generic bilinear group model. Additionally, we demonstrate that the encryption algorithm's complexity is linear in relation to the number of attributes. Our scheme's significance and practicality are revealed by the performance evaluation.
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2024 |
|---|---|
| Erschienen: |
2024 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:14 |
|---|---|
| Enthalten in: |
Scientific reports - 14(2024), 1 vom: 04. März, Seite 5264 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Dabra, Mamta [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
|---|
| Anmerkungen: |
Date Revised 07.03.2024 published: Electronic Citation Status PubMed-not-MEDLINE |
|---|
| doi: |
10.1038/s41598-024-56112-3 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM369284550 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM369284550 | ||
| 003 | DE-627 | ||
| 005 | 20240307232533.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 240305s2024 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1038/s41598-024-56112-3 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n1319.xml |
| 035 | |a (DE-627)NLM369284550 | ||
| 035 | |a (NLM)38438596 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Dabra, Mamta |e verfasserin |4 aut | |
| 245 | 1 | 3 | |a An improved finegrained ciphertext policy based temporary keyword search on encrypted data for secure cloud storage |
| 264 | 1 | |c 2024 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ƒaComputermedien |b c |2 rdamedia | ||
| 338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Date Revised 07.03.2024 | ||
| 500 | |a published: Electronic | ||
| 500 | |a Citation Status PubMed-not-MEDLINE | ||
| 520 | |a © 2024. The Author(s). | ||
| 520 | |a We present a temporary keyword search over sensitive and confidential health data in a cloud environment. The cloud constitutes a semi-trusted domain, making it necessary for data owners to secure their data before outsourcing it through techniques like encryption. Attribute-based keyword search techniques tend to perform a search operation using a search token generated by an authorized user. These search tokens can lead to serious privacy threats, as they can extract all ciphertexts that may have been generated along with their keyword. Therefore, restricting search tokens to extract ciphertexts generated within a time interval is a more promising solution. In this paper, we present a novel ciphertext policy fine-grained temporary keyword that prevents the misuse of these search tokens. Further, it mitigates the risk of insider threats within healthcare organizations by limiting the window of opportunity for unauthorized access to minimum. To assess the security, our proposed scheme is formally proven to be secure against Selectively Chosen Keyword Attacks in the generic bilinear group model. Additionally, we demonstrate that the encryption algorithm's complexity is linear in relation to the number of attributes. Our scheme's significance and practicality are revealed by the performance evaluation | ||
| 650 | 4 | |a Journal Article | |
| 700 | 1 | |a Sharma, Shivani |e verfasserin |4 aut | |
| 700 | 1 | |a Kumar, Sachin |e verfasserin |4 aut | |
| 700 | 1 | |a Min, Hong |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Scientific reports |d 2011 |g 14(2024), 1 vom: 04. März, Seite 5264 |w (DE-627)NLM215703936 |x 2045-2322 |7 nnns |
| 773 | 1 | 8 | |g volume:14 |g year:2024 |g number:1 |g day:04 |g month:03 |g pages:5264 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1038/s41598-024-56112-3 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 14 |j 2024 |e 1 |b 04 |c 03 |h 5264 | ||