Searchable encryption on the cloud: a survey
Abstract Outsourcing data to the cloud can be considered as a perfect solution for the storage and computationally constrained data owners. However, data confidentiality is compromised when data are shared through the cloud. Cryptographic techniques like searchable encryption offer possible solution...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Andola, Nitish [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2022 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 |
|---|
| Übergeordnetes Werk: |
Enthalten in: The journal of supercomputing - Springer US, 1987, 78(2022), 7 vom: 20. Jan., Seite 9952-9984 |
|---|---|
| Übergeordnetes Werk: |
volume:78 ; year:2022 ; number:7 ; day:20 ; month:01 ; pages:9952-9984 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11227-022-04309-6 |
|---|
| Katalog-ID: |
OLC2078498416 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2078498416 | ||
| 003 | DE-627 | ||
| 005 | 20230506010616.0 | ||
| 007 | tu | ||
| 008 | 221220s2022 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11227-022-04309-6 |2 doi | |
| 035 | |a (DE-627)OLC2078498416 | ||
| 035 | |a (DE-He213)s11227-022-04309-6-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 620 |q VZ |
| 100 | 1 | |a Andola, Nitish |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Searchable encryption on the cloud: a survey |
| 264 | 1 | |c 2022 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 | ||
| 520 | |a Abstract Outsourcing data to the cloud can be considered as a perfect solution for the storage and computationally constrained data owners. However, data confidentiality is compromised when data are shared through the cloud. Cryptographic techniques like searchable encryption offer possible solutions of protect data from unauthorized access while facilitating searching without disclosure. Different searchable encryption techniques have been proposed; however, the techniques are limited in one way or the other, and none of them satisfies all the needs of confidentiality while sharing of data outsourced on the cloud. In this survey, we have identified the key performance indicators for confidentiality while sharing for cloud data along with possible attacks on searchable encryption techniques. A comprehensive study of the existing techniques searchable encryption on the anvil of the key performance indicators and robustness to attacks has been done. It was found that a technique may be suitable for an application with specific data confidentiality requirements, although no cryptographic silver bullet exists that satisfies all the performance metrics or is impervious to all the attacks. Moreover, most of the existing techniques are impracticable due to paradoxical requirements of data confidentiality and performance. A single mechanism may not suffice, and there is a need for a basket of efficient techniques that may provide accurate search with data confidentiality to make data sharing over the cloud an economically attractive option. | ||
| 650 | 4 | |a Cloud | |
| 650 | 4 | |a Searchable encryption | |
| 650 | 4 | |a Bilinear pairing | |
| 650 | 4 | |a Homomorphic encryption | |
| 700 | 1 | |a Gahlot, Raghav |4 aut | |
| 700 | 1 | |a Yadav, Vijay Kumar |4 aut | |
| 700 | 1 | |a Venkatesan, S. |4 aut | |
| 700 | 1 | |a Verma, Shekhar |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t The journal of supercomputing |d Springer US, 1987 |g 78(2022), 7 vom: 20. Jan., Seite 9952-9984 |w (DE-627)13046466X |w (DE-600)740510-8 |w (DE-576)018667775 |x 0920-8542 |7 nnns |
| 773 | 1 | 8 | |g volume:78 |g year:2022 |g number:7 |g day:20 |g month:01 |g pages:9952-9984 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11227-022-04309-6 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 951 | |a AR | ||
| 952 | |d 78 |j 2022 |e 7 |b 20 |c 01 |h 9952-9984 | ||
| author_variant |
n a na r g rg v k y vk vky s v sv s v sv |
|---|---|
| matchkey_str |
article:09208542:2022----::erhbenrpinnhc |
| hierarchy_sort_str |
2022 |
| publishDate |
2022 |
| allfields |
10.1007/s11227-022-04309-6 doi (DE-627)OLC2078498416 (DE-He213)s11227-022-04309-6-p DE-627 ger DE-627 rakwb eng 004 620 VZ Andola, Nitish verfasserin aut Searchable encryption on the cloud: a survey 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 Abstract Outsourcing data to the cloud can be considered as a perfect solution for the storage and computationally constrained data owners. However, data confidentiality is compromised when data are shared through the cloud. Cryptographic techniques like searchable encryption offer possible solutions of protect data from unauthorized access while facilitating searching without disclosure. Different searchable encryption techniques have been proposed; however, the techniques are limited in one way or the other, and none of them satisfies all the needs of confidentiality while sharing of data outsourced on the cloud. In this survey, we have identified the key performance indicators for confidentiality while sharing for cloud data along with possible attacks on searchable encryption techniques. A comprehensive study of the existing techniques searchable encryption on the anvil of the key performance indicators and robustness to attacks has been done. It was found that a technique may be suitable for an application with specific data confidentiality requirements, although no cryptographic silver bullet exists that satisfies all the performance metrics or is impervious to all the attacks. Moreover, most of the existing techniques are impracticable due to paradoxical requirements of data confidentiality and performance. A single mechanism may not suffice, and there is a need for a basket of efficient techniques that may provide accurate search with data confidentiality to make data sharing over the cloud an economically attractive option. Cloud Searchable encryption Bilinear pairing Homomorphic encryption Gahlot, Raghav aut Yadav, Vijay Kumar aut Venkatesan, S. aut Verma, Shekhar aut Enthalten in The journal of supercomputing Springer US, 1987 78(2022), 7 vom: 20. Jan., Seite 9952-9984 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:78 year:2022 number:7 day:20 month:01 pages:9952-9984 https://doi.org/10.1007/s11227-022-04309-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 78 2022 7 20 01 9952-9984 |
| spelling |
10.1007/s11227-022-04309-6 doi (DE-627)OLC2078498416 (DE-He213)s11227-022-04309-6-p DE-627 ger DE-627 rakwb eng 004 620 VZ Andola, Nitish verfasserin aut Searchable encryption on the cloud: a survey 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 Abstract Outsourcing data to the cloud can be considered as a perfect solution for the storage and computationally constrained data owners. However, data confidentiality is compromised when data are shared through the cloud. Cryptographic techniques like searchable encryption offer possible solutions of protect data from unauthorized access while facilitating searching without disclosure. Different searchable encryption techniques have been proposed; however, the techniques are limited in one way or the other, and none of them satisfies all the needs of confidentiality while sharing of data outsourced on the cloud. In this survey, we have identified the key performance indicators for confidentiality while sharing for cloud data along with possible attacks on searchable encryption techniques. A comprehensive study of the existing techniques searchable encryption on the anvil of the key performance indicators and robustness to attacks has been done. It was found that a technique may be suitable for an application with specific data confidentiality requirements, although no cryptographic silver bullet exists that satisfies all the performance metrics or is impervious to all the attacks. Moreover, most of the existing techniques are impracticable due to paradoxical requirements of data confidentiality and performance. A single mechanism may not suffice, and there is a need for a basket of efficient techniques that may provide accurate search with data confidentiality to make data sharing over the cloud an economically attractive option. Cloud Searchable encryption Bilinear pairing Homomorphic encryption Gahlot, Raghav aut Yadav, Vijay Kumar aut Venkatesan, S. aut Verma, Shekhar aut Enthalten in The journal of supercomputing Springer US, 1987 78(2022), 7 vom: 20. Jan., Seite 9952-9984 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:78 year:2022 number:7 day:20 month:01 pages:9952-9984 https://doi.org/10.1007/s11227-022-04309-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 78 2022 7 20 01 9952-9984 |
| allfields_unstemmed |
10.1007/s11227-022-04309-6 doi (DE-627)OLC2078498416 (DE-He213)s11227-022-04309-6-p DE-627 ger DE-627 rakwb eng 004 620 VZ Andola, Nitish verfasserin aut Searchable encryption on the cloud: a survey 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 Abstract Outsourcing data to the cloud can be considered as a perfect solution for the storage and computationally constrained data owners. However, data confidentiality is compromised when data are shared through the cloud. Cryptographic techniques like searchable encryption offer possible solutions of protect data from unauthorized access while facilitating searching without disclosure. Different searchable encryption techniques have been proposed; however, the techniques are limited in one way or the other, and none of them satisfies all the needs of confidentiality while sharing of data outsourced on the cloud. In this survey, we have identified the key performance indicators for confidentiality while sharing for cloud data along with possible attacks on searchable encryption techniques. A comprehensive study of the existing techniques searchable encryption on the anvil of the key performance indicators and robustness to attacks has been done. It was found that a technique may be suitable for an application with specific data confidentiality requirements, although no cryptographic silver bullet exists that satisfies all the performance metrics or is impervious to all the attacks. Moreover, most of the existing techniques are impracticable due to paradoxical requirements of data confidentiality and performance. A single mechanism may not suffice, and there is a need for a basket of efficient techniques that may provide accurate search with data confidentiality to make data sharing over the cloud an economically attractive option. Cloud Searchable encryption Bilinear pairing Homomorphic encryption Gahlot, Raghav aut Yadav, Vijay Kumar aut Venkatesan, S. aut Verma, Shekhar aut Enthalten in The journal of supercomputing Springer US, 1987 78(2022), 7 vom: 20. Jan., Seite 9952-9984 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:78 year:2022 number:7 day:20 month:01 pages:9952-9984 https://doi.org/10.1007/s11227-022-04309-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 78 2022 7 20 01 9952-9984 |
| allfieldsGer |
10.1007/s11227-022-04309-6 doi (DE-627)OLC2078498416 (DE-He213)s11227-022-04309-6-p DE-627 ger DE-627 rakwb eng 004 620 VZ Andola, Nitish verfasserin aut Searchable encryption on the cloud: a survey 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 Abstract Outsourcing data to the cloud can be considered as a perfect solution for the storage and computationally constrained data owners. However, data confidentiality is compromised when data are shared through the cloud. Cryptographic techniques like searchable encryption offer possible solutions of protect data from unauthorized access while facilitating searching without disclosure. Different searchable encryption techniques have been proposed; however, the techniques are limited in one way or the other, and none of them satisfies all the needs of confidentiality while sharing of data outsourced on the cloud. In this survey, we have identified the key performance indicators for confidentiality while sharing for cloud data along with possible attacks on searchable encryption techniques. A comprehensive study of the existing techniques searchable encryption on the anvil of the key performance indicators and robustness to attacks has been done. It was found that a technique may be suitable for an application with specific data confidentiality requirements, although no cryptographic silver bullet exists that satisfies all the performance metrics or is impervious to all the attacks. Moreover, most of the existing techniques are impracticable due to paradoxical requirements of data confidentiality and performance. A single mechanism may not suffice, and there is a need for a basket of efficient techniques that may provide accurate search with data confidentiality to make data sharing over the cloud an economically attractive option. Cloud Searchable encryption Bilinear pairing Homomorphic encryption Gahlot, Raghav aut Yadav, Vijay Kumar aut Venkatesan, S. aut Verma, Shekhar aut Enthalten in The journal of supercomputing Springer US, 1987 78(2022), 7 vom: 20. Jan., Seite 9952-9984 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:78 year:2022 number:7 day:20 month:01 pages:9952-9984 https://doi.org/10.1007/s11227-022-04309-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 78 2022 7 20 01 9952-9984 |
| allfieldsSound |
10.1007/s11227-022-04309-6 doi (DE-627)OLC2078498416 (DE-He213)s11227-022-04309-6-p DE-627 ger DE-627 rakwb eng 004 620 VZ Andola, Nitish verfasserin aut Searchable encryption on the cloud: a survey 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 Abstract Outsourcing data to the cloud can be considered as a perfect solution for the storage and computationally constrained data owners. However, data confidentiality is compromised when data are shared through the cloud. Cryptographic techniques like searchable encryption offer possible solutions of protect data from unauthorized access while facilitating searching without disclosure. Different searchable encryption techniques have been proposed; however, the techniques are limited in one way or the other, and none of them satisfies all the needs of confidentiality while sharing of data outsourced on the cloud. In this survey, we have identified the key performance indicators for confidentiality while sharing for cloud data along with possible attacks on searchable encryption techniques. A comprehensive study of the existing techniques searchable encryption on the anvil of the key performance indicators and robustness to attacks has been done. It was found that a technique may be suitable for an application with specific data confidentiality requirements, although no cryptographic silver bullet exists that satisfies all the performance metrics or is impervious to all the attacks. Moreover, most of the existing techniques are impracticable due to paradoxical requirements of data confidentiality and performance. A single mechanism may not suffice, and there is a need for a basket of efficient techniques that may provide accurate search with data confidentiality to make data sharing over the cloud an economically attractive option. Cloud Searchable encryption Bilinear pairing Homomorphic encryption Gahlot, Raghav aut Yadav, Vijay Kumar aut Venkatesan, S. aut Verma, Shekhar aut Enthalten in The journal of supercomputing Springer US, 1987 78(2022), 7 vom: 20. Jan., Seite 9952-9984 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:78 year:2022 number:7 day:20 month:01 pages:9952-9984 https://doi.org/10.1007/s11227-022-04309-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 78 2022 7 20 01 9952-9984 |
| language |
English |
| source |
Enthalten in The journal of supercomputing 78(2022), 7 vom: 20. Jan., Seite 9952-9984 volume:78 year:2022 number:7 day:20 month:01 pages:9952-9984 |
| sourceStr |
Enthalten in The journal of supercomputing 78(2022), 7 vom: 20. Jan., Seite 9952-9984 volume:78 year:2022 number:7 day:20 month:01 pages:9952-9984 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Cloud Searchable encryption Bilinear pairing Homomorphic encryption |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
The journal of supercomputing |
| authorswithroles_txt_mv |
Andola, Nitish @@aut@@ Gahlot, Raghav @@aut@@ Yadav, Vijay Kumar @@aut@@ Venkatesan, S. @@aut@@ Verma, Shekhar @@aut@@ |
| publishDateDaySort_date |
2022-01-20T00:00:00Z |
| hierarchy_top_id |
13046466X |
| dewey-sort |
14 |
| id |
OLC2078498416 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2078498416</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506010616.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2022 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11227-022-04309-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2078498416</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11227-022-04309-6-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Andola, Nitish</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Searchable encryption on the cloud: a survey</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Outsourcing data to the cloud can be considered as a perfect solution for the storage and computationally constrained data owners. However, data confidentiality is compromised when data are shared through the cloud. Cryptographic techniques like searchable encryption offer possible solutions of protect data from unauthorized access while facilitating searching without disclosure. Different searchable encryption techniques have been proposed; however, the techniques are limited in one way or the other, and none of them satisfies all the needs of confidentiality while sharing of data outsourced on the cloud. In this survey, we have identified the key performance indicators for confidentiality while sharing for cloud data along with possible attacks on searchable encryption techniques. A comprehensive study of the existing techniques searchable encryption on the anvil of the key performance indicators and robustness to attacks has been done. It was found that a technique may be suitable for an application with specific data confidentiality requirements, although no cryptographic silver bullet exists that satisfies all the performance metrics or is impervious to all the attacks. Moreover, most of the existing techniques are impracticable due to paradoxical requirements of data confidentiality and performance. A single mechanism may not suffice, and there is a need for a basket of efficient techniques that may provide accurate search with data confidentiality to make data sharing over the cloud an economically attractive option.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cloud</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Searchable encryption</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bilinear pairing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Homomorphic encryption</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gahlot, Raghav</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yadav, Vijay Kumar</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Venkatesan, S.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Verma, Shekhar</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The journal of supercomputing</subfield><subfield code="d">Springer US, 1987</subfield><subfield code="g">78(2022), 7 vom: 20. Jan., Seite 9952-9984</subfield><subfield code="w">(DE-627)13046466X</subfield><subfield code="w">(DE-600)740510-8</subfield><subfield code="w">(DE-576)018667775</subfield><subfield code="x">0920-8542</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:78</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:7</subfield><subfield code="g">day:20</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:9952-9984</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11227-022-04309-6</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">78</subfield><subfield code="j">2022</subfield><subfield code="e">7</subfield><subfield code="b">20</subfield><subfield code="c">01</subfield><subfield code="h">9952-9984</subfield></datafield></record></collection>
|
| author |
Andola, Nitish |
| spellingShingle |
Andola, Nitish ddc 004 misc Cloud misc Searchable encryption misc Bilinear pairing misc Homomorphic encryption Searchable encryption on the cloud: a survey |
| authorStr |
Andola, Nitish |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)13046466X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0920-8542 |
| topic_title |
004 620 VZ Searchable encryption on the cloud: a survey Cloud Searchable encryption Bilinear pairing Homomorphic encryption |
| topic |
ddc 004 misc Cloud misc Searchable encryption misc Bilinear pairing misc Homomorphic encryption |
| topic_unstemmed |
ddc 004 misc Cloud misc Searchable encryption misc Bilinear pairing misc Homomorphic encryption |
| topic_browse |
ddc 004 misc Cloud misc Searchable encryption misc Bilinear pairing misc Homomorphic encryption |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
The journal of supercomputing |
| hierarchy_parent_id |
13046466X |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering |
| hierarchy_top_title |
The journal of supercomputing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 |
| title |
Searchable encryption on the cloud: a survey |
| ctrlnum |
(DE-627)OLC2078498416 (DE-He213)s11227-022-04309-6-p |
| title_full |
Searchable encryption on the cloud: a survey |
| author_sort |
Andola, Nitish |
| journal |
The journal of supercomputing |
| journalStr |
The journal of supercomputing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2022 |
| contenttype_str_mv |
txt |
| container_start_page |
9952 |
| author_browse |
Andola, Nitish Gahlot, Raghav Yadav, Vijay Kumar Venkatesan, S. Verma, Shekhar |
| container_volume |
78 |
| class |
004 620 VZ |
| format_se |
Aufsätze |
| author-letter |
Andola, Nitish |
| doi_str_mv |
10.1007/s11227-022-04309-6 |
| dewey-full |
004 620 |
| title_sort |
searchable encryption on the cloud: a survey |
| title_auth |
Searchable encryption on the cloud: a survey |
| abstract |
Abstract Outsourcing data to the cloud can be considered as a perfect solution for the storage and computationally constrained data owners. However, data confidentiality is compromised when data are shared through the cloud. Cryptographic techniques like searchable encryption offer possible solutions of protect data from unauthorized access while facilitating searching without disclosure. Different searchable encryption techniques have been proposed; however, the techniques are limited in one way or the other, and none of them satisfies all the needs of confidentiality while sharing of data outsourced on the cloud. In this survey, we have identified the key performance indicators for confidentiality while sharing for cloud data along with possible attacks on searchable encryption techniques. A comprehensive study of the existing techniques searchable encryption on the anvil of the key performance indicators and robustness to attacks has been done. It was found that a technique may be suitable for an application with specific data confidentiality requirements, although no cryptographic silver bullet exists that satisfies all the performance metrics or is impervious to all the attacks. Moreover, most of the existing techniques are impracticable due to paradoxical requirements of data confidentiality and performance. A single mechanism may not suffice, and there is a need for a basket of efficient techniques that may provide accurate search with data confidentiality to make data sharing over the cloud an economically attractive option. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 |
| abstractGer |
Abstract Outsourcing data to the cloud can be considered as a perfect solution for the storage and computationally constrained data owners. However, data confidentiality is compromised when data are shared through the cloud. Cryptographic techniques like searchable encryption offer possible solutions of protect data from unauthorized access while facilitating searching without disclosure. Different searchable encryption techniques have been proposed; however, the techniques are limited in one way or the other, and none of them satisfies all the needs of confidentiality while sharing of data outsourced on the cloud. In this survey, we have identified the key performance indicators for confidentiality while sharing for cloud data along with possible attacks on searchable encryption techniques. A comprehensive study of the existing techniques searchable encryption on the anvil of the key performance indicators and robustness to attacks has been done. It was found that a technique may be suitable for an application with specific data confidentiality requirements, although no cryptographic silver bullet exists that satisfies all the performance metrics or is impervious to all the attacks. Moreover, most of the existing techniques are impracticable due to paradoxical requirements of data confidentiality and performance. A single mechanism may not suffice, and there is a need for a basket of efficient techniques that may provide accurate search with data confidentiality to make data sharing over the cloud an economically attractive option. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 |
| abstract_unstemmed |
Abstract Outsourcing data to the cloud can be considered as a perfect solution for the storage and computationally constrained data owners. However, data confidentiality is compromised when data are shared through the cloud. Cryptographic techniques like searchable encryption offer possible solutions of protect data from unauthorized access while facilitating searching without disclosure. Different searchable encryption techniques have been proposed; however, the techniques are limited in one way or the other, and none of them satisfies all the needs of confidentiality while sharing of data outsourced on the cloud. In this survey, we have identified the key performance indicators for confidentiality while sharing for cloud data along with possible attacks on searchable encryption techniques. A comprehensive study of the existing techniques searchable encryption on the anvil of the key performance indicators and robustness to attacks has been done. It was found that a technique may be suitable for an application with specific data confidentiality requirements, although no cryptographic silver bullet exists that satisfies all the performance metrics or is impervious to all the attacks. Moreover, most of the existing techniques are impracticable due to paradoxical requirements of data confidentiality and performance. A single mechanism may not suffice, and there is a need for a basket of efficient techniques that may provide accurate search with data confidentiality to make data sharing over the cloud an economically attractive option. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT |
| container_issue |
7 |
| title_short |
Searchable encryption on the cloud: a survey |
| url |
https://doi.org/10.1007/s11227-022-04309-6 |
| remote_bool |
false |
| author2 |
Gahlot, Raghav Yadav, Vijay Kumar Venkatesan, S. Verma, Shekhar |
| author2Str |
Gahlot, Raghav Yadav, Vijay Kumar Venkatesan, S. Verma, Shekhar |
| ppnlink |
13046466X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11227-022-04309-6 |
| up_date |
2024-07-03T20:44:19.243Z |
| _version_ |
1803592096015187968 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2078498416</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506010616.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2022 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11227-022-04309-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2078498416</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11227-022-04309-6-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Andola, Nitish</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Searchable encryption on the cloud: a survey</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Outsourcing data to the cloud can be considered as a perfect solution for the storage and computationally constrained data owners. However, data confidentiality is compromised when data are shared through the cloud. Cryptographic techniques like searchable encryption offer possible solutions of protect data from unauthorized access while facilitating searching without disclosure. Different searchable encryption techniques have been proposed; however, the techniques are limited in one way or the other, and none of them satisfies all the needs of confidentiality while sharing of data outsourced on the cloud. In this survey, we have identified the key performance indicators for confidentiality while sharing for cloud data along with possible attacks on searchable encryption techniques. A comprehensive study of the existing techniques searchable encryption on the anvil of the key performance indicators and robustness to attacks has been done. It was found that a technique may be suitable for an application with specific data confidentiality requirements, although no cryptographic silver bullet exists that satisfies all the performance metrics or is impervious to all the attacks. Moreover, most of the existing techniques are impracticable due to paradoxical requirements of data confidentiality and performance. A single mechanism may not suffice, and there is a need for a basket of efficient techniques that may provide accurate search with data confidentiality to make data sharing over the cloud an economically attractive option.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cloud</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Searchable encryption</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bilinear pairing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Homomorphic encryption</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gahlot, Raghav</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yadav, Vijay Kumar</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Venkatesan, S.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Verma, Shekhar</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The journal of supercomputing</subfield><subfield code="d">Springer US, 1987</subfield><subfield code="g">78(2022), 7 vom: 20. Jan., Seite 9952-9984</subfield><subfield code="w">(DE-627)13046466X</subfield><subfield code="w">(DE-600)740510-8</subfield><subfield code="w">(DE-576)018667775</subfield><subfield code="x">0920-8542</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:78</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:7</subfield><subfield code="g">day:20</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:9952-9984</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11227-022-04309-6</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">78</subfield><subfield code="j">2022</subfield><subfield code="e">7</subfield><subfield code="b">20</subfield><subfield code="c">01</subfield><subfield code="h">9952-9984</subfield></datafield></record></collection>
|
| score |
7.399544 |