Secure Inverted Index Based Search over Encrypted Cloud Data with User Access Rights Management
Cloud computing is a technology that provides users with a large storage space and an enormous computing power. However, the outsourced data are often sensitive and confidential, and hence must be encrypted before being outsourced. Consequently, classical search approaches have become obsolete and n...
Gespeichert in:
Veröffentlicht in: | Journal of computer science and technology 2019, Vol.34 (1), p.133-154 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 154 |
---|---|
container_issue | 1 |
container_start_page | 133 |
container_title | Journal of computer science and technology |
container_volume | 34 |
creator | Boucenna, Fateh Nouali, Omar Kechid, Samir Tahar Kechadi, M. |
description | Cloud computing is a technology that provides users with a large storage space and an enormous computing power. However, the outsourced data are often sensitive and confidential, and hence must be encrypted before being outsourced. Consequently, classical search approaches have become obsolete and new approaches that are compatible with encrypted data have become a necessity. For privacy reasons, most of these approaches are based on the vector model which is a time consuming process since the entire index must be loaded and exploited during the search process given that the query vector must be compared with each document vector. To solve this problem, we propose a new method for constructing a secure inverted index using two key techniques, homomorphic encryption and the dummy documents technique. However, 1) homomorphic encryption generates very large ciphertexts which are thousands of times larger than their corresponding plaintexts, and 2) the dummy documents technique that enhances the index security produces lots of false positives in the search results. The proposed approach exploits the advantages of these two techniques by proposing two methods called the compressed table of encrypted scores and the double score formula. Moreover, we exploit a second secure inverted index in order to manage the users’ access rights to the data. Finally, in order to validate our approach, we performed an experimental study using a data collection of one million documents. The experiments show that our approach is many times faster than any other approach based on the vector model. |
doi_str_mv | 10.1007/s11390-019-1903-2 |
format | Article |
fullrecord | <record><control><sourceid>wanfang_jour_proqu</sourceid><recordid>TN_cdi_wanfang_journals_jsjkxjsxb_e201901009</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A719996787</galeid><wanfj_id>jsjkxjsxb_e201901009</wanfj_id><sourcerecordid>jsjkxjsxb_e201901009</sourcerecordid><originalsourceid>FETCH-LOGICAL-c420t-6e90eff8256d69e8bd6718161ddf775e7595db0305b23e6fa8b81c831d7235eb3</originalsourceid><addsrcrecordid>eNp9kcFu1DAQhi0EEmXhAbhZ4krKTJzE8XFZClQqQqL0bDn2OJuw6yx2tt2-PV4FqSeQJXvk-f6Z0fyMvUW4RAD5ISEKBQWgKlCBKMpn7ALbBopKVup5jgGgUPl6yV6lNAIICVV1wfQt2WMkfh3uKc7kcuDoxD-alONbMtFu-ZRT_CrY-Hg4E5vddHT8k5kNfxjmLb9LOb22llLiP4Z-Oyf-zQTT057C_Jq98GaX6M3fd8XuPl_93Hwtbr5_ud6sbwpblTAXDSkg79uyblyjqO1cI7HFBp3zUtYka1W7DgTUXSmo8abtWrStQCdLUVMnVuz9UvfBBG9Cr8fpGEPuqMc0_jqN6dRpKvN6IG9CZfzdgh_i9PtIaX7iS4VtDaUU_6dQosAacvsVu1yo3uxID8FPczQ2H0f7wU6B_JD_1xKVUo1sZRbgIrBxSimS14c47E181Aj67KZe3NR5XH12U5-blIsmZTb0FJ9G-bfoD4-Qn6c</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2171315072</pqid></control><display><type>article</type><title>Secure Inverted Index Based Search over Encrypted Cloud Data with User Access Rights Management</title><source>Springer Online Journals Complete</source><creator>Boucenna, Fateh ; Nouali, Omar ; Kechid, Samir ; Tahar Kechadi, M.</creator><creatorcontrib>Boucenna, Fateh ; Nouali, Omar ; Kechid, Samir ; Tahar Kechadi, M.</creatorcontrib><description>Cloud computing is a technology that provides users with a large storage space and an enormous computing power. However, the outsourced data are often sensitive and confidential, and hence must be encrypted before being outsourced. Consequently, classical search approaches have become obsolete and new approaches that are compatible with encrypted data have become a necessity. For privacy reasons, most of these approaches are based on the vector model which is a time consuming process since the entire index must be loaded and exploited during the search process given that the query vector must be compared with each document vector. To solve this problem, we propose a new method for constructing a secure inverted index using two key techniques, homomorphic encryption and the dummy documents technique. However, 1) homomorphic encryption generates very large ciphertexts which are thousands of times larger than their corresponding plaintexts, and 2) the dummy documents technique that enhances the index security produces lots of false positives in the search results. The proposed approach exploits the advantages of these two techniques by proposing two methods called the compressed table of encrypted scores and the double score formula. Moreover, we exploit a second secure inverted index in order to manage the users’ access rights to the data. Finally, in order to validate our approach, we performed an experimental study using a data collection of one million documents. The experiments show that our approach is many times faster than any other approach based on the vector model.</description><identifier>ISSN: 1000-9000</identifier><identifier>EISSN: 1860-4749</identifier><identifier>DOI: 10.1007/s11390-019-1903-2</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Artificial Intelligence ; Cloud computing ; Comparative analysis ; Computer Science ; Cybersecurity ; Data acquisition ; Data collection ; Data encryption ; Data Structures and Information Theory ; Documents ; Encryption ; Information Systems Applications (incl.Internet) ; Keywords ; Outsourcing ; Privacy ; Regular Paper ; Search process ; Software Engineering ; Theory of Computation</subject><ispartof>Journal of computer science and technology, 2019, Vol.34 (1), p.133-154</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2019</rights><rights>COPYRIGHT 2019 Springer</rights><rights>Journal of Computer Science and Technology is a copyright of Springer, (2019). All Rights Reserved.</rights><rights>Springer Science+Business Media, LLC, part of Springer Nature 2019.</rights><rights>Copyright © Wanfang Data Co. Ltd. All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c420t-6e90eff8256d69e8bd6718161ddf775e7595db0305b23e6fa8b81c831d7235eb3</citedby><cites>FETCH-LOGICAL-c420t-6e90eff8256d69e8bd6718161ddf775e7595db0305b23e6fa8b81c831d7235eb3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://www.wanfangdata.com.cn/images/PeriodicalImages/jsjkxjsxb-e/jsjkxjsxb-e.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11390-019-1903-2$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11390-019-1903-2$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,4024,27923,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Boucenna, Fateh</creatorcontrib><creatorcontrib>Nouali, Omar</creatorcontrib><creatorcontrib>Kechid, Samir</creatorcontrib><creatorcontrib>Tahar Kechadi, M.</creatorcontrib><title>Secure Inverted Index Based Search over Encrypted Cloud Data with User Access Rights Management</title><title>Journal of computer science and technology</title><addtitle>J. Comput. Sci. Technol</addtitle><description>Cloud computing is a technology that provides users with a large storage space and an enormous computing power. However, the outsourced data are often sensitive and confidential, and hence must be encrypted before being outsourced. Consequently, classical search approaches have become obsolete and new approaches that are compatible with encrypted data have become a necessity. For privacy reasons, most of these approaches are based on the vector model which is a time consuming process since the entire index must be loaded and exploited during the search process given that the query vector must be compared with each document vector. To solve this problem, we propose a new method for constructing a secure inverted index using two key techniques, homomorphic encryption and the dummy documents technique. However, 1) homomorphic encryption generates very large ciphertexts which are thousands of times larger than their corresponding plaintexts, and 2) the dummy documents technique that enhances the index security produces lots of false positives in the search results. The proposed approach exploits the advantages of these two techniques by proposing two methods called the compressed table of encrypted scores and the double score formula. Moreover, we exploit a second secure inverted index in order to manage the users’ access rights to the data. Finally, in order to validate our approach, we performed an experimental study using a data collection of one million documents. The experiments show that our approach is many times faster than any other approach based on the vector model.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Cloud computing</subject><subject>Comparative analysis</subject><subject>Computer Science</subject><subject>Cybersecurity</subject><subject>Data acquisition</subject><subject>Data collection</subject><subject>Data encryption</subject><subject>Data Structures and Information Theory</subject><subject>Documents</subject><subject>Encryption</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Keywords</subject><subject>Outsourcing</subject><subject>Privacy</subject><subject>Regular Paper</subject><subject>Search process</subject><subject>Software Engineering</subject><subject>Theory of Computation</subject><issn>1000-9000</issn><issn>1860-4749</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kcFu1DAQhi0EEmXhAbhZ4krKTJzE8XFZClQqQqL0bDn2OJuw6yx2tt2-PV4FqSeQJXvk-f6Z0fyMvUW4RAD5ISEKBQWgKlCBKMpn7ALbBopKVup5jgGgUPl6yV6lNAIICVV1wfQt2WMkfh3uKc7kcuDoxD-alONbMtFu-ZRT_CrY-Hg4E5vddHT8k5kNfxjmLb9LOb22llLiP4Z-Oyf-zQTT057C_Jq98GaX6M3fd8XuPl_93Hwtbr5_ud6sbwpblTAXDSkg79uyblyjqO1cI7HFBp3zUtYka1W7DgTUXSmo8abtWrStQCdLUVMnVuz9UvfBBG9Cr8fpGEPuqMc0_jqN6dRpKvN6IG9CZfzdgh_i9PtIaX7iS4VtDaUU_6dQosAacvsVu1yo3uxID8FPczQ2H0f7wU6B_JD_1xKVUo1sZRbgIrBxSimS14c47E181Aj67KZe3NR5XH12U5-blIsmZTb0FJ9G-bfoD4-Qn6c</recordid><startdate>2019</startdate><enddate>2019</enddate><creator>Boucenna, Fateh</creator><creator>Nouali, Omar</creator><creator>Kechid, Samir</creator><creator>Tahar Kechadi, M.</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><general>Security Division, Research Center for Scientific and Technical Information, Algiers 16028, Algeria</general><general>Laboratory of Research in Artificial Intelligence, Department of Computer Science, University of Sciences and Technology Houari Boumediene, Algiers 16111, Algeria%Security Division, Research Center for Scientific and Technical Information, Algiers 16028, Algeria%Laboratory of Research in Artificial Intelligence, Department of Computer Science, University of Sciences and Technology Houari Boumediene, Algiers 16111, Algeria%The Insight Centre, University College Dublin, Dublin, D04 V1W8, Ireland</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>2B.</scope><scope>4A8</scope><scope>92I</scope><scope>93N</scope><scope>PSX</scope><scope>TCJ</scope></search><sort><creationdate>2019</creationdate><title>Secure Inverted Index Based Search over Encrypted Cloud Data with User Access Rights Management</title><author>Boucenna, Fateh ; Nouali, Omar ; Kechid, Samir ; Tahar Kechadi, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c420t-6e90eff8256d69e8bd6718161ddf775e7595db0305b23e6fa8b81c831d7235eb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Cloud computing</topic><topic>Comparative analysis</topic><topic>Computer Science</topic><topic>Cybersecurity</topic><topic>Data acquisition</topic><topic>Data collection</topic><topic>Data encryption</topic><topic>Data Structures and Information Theory</topic><topic>Documents</topic><topic>Encryption</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Keywords</topic><topic>Outsourcing</topic><topic>Privacy</topic><topic>Regular Paper</topic><topic>Search process</topic><topic>Software Engineering</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Boucenna, Fateh</creatorcontrib><creatorcontrib>Nouali, Omar</creatorcontrib><creatorcontrib>Kechid, Samir</creatorcontrib><creatorcontrib>Tahar Kechadi, M.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Wanfang Data Journals - Hong Kong</collection><collection>WANFANG Data Centre</collection><collection>Wanfang Data Journals</collection><collection>万方数据期刊 - 香港版</collection><collection>China Online Journals (COJ)</collection><collection>China Online Journals (COJ)</collection><jtitle>Journal of computer science and technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Boucenna, Fateh</au><au>Nouali, Omar</au><au>Kechid, Samir</au><au>Tahar Kechadi, M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Secure Inverted Index Based Search over Encrypted Cloud Data with User Access Rights Management</atitle><jtitle>Journal of computer science and technology</jtitle><stitle>J. Comput. Sci. Technol</stitle><date>2019</date><risdate>2019</risdate><volume>34</volume><issue>1</issue><spage>133</spage><epage>154</epage><pages>133-154</pages><issn>1000-9000</issn><eissn>1860-4749</eissn><abstract>Cloud computing is a technology that provides users with a large storage space and an enormous computing power. However, the outsourced data are often sensitive and confidential, and hence must be encrypted before being outsourced. Consequently, classical search approaches have become obsolete and new approaches that are compatible with encrypted data have become a necessity. For privacy reasons, most of these approaches are based on the vector model which is a time consuming process since the entire index must be loaded and exploited during the search process given that the query vector must be compared with each document vector. To solve this problem, we propose a new method for constructing a secure inverted index using two key techniques, homomorphic encryption and the dummy documents technique. However, 1) homomorphic encryption generates very large ciphertexts which are thousands of times larger than their corresponding plaintexts, and 2) the dummy documents technique that enhances the index security produces lots of false positives in the search results. The proposed approach exploits the advantages of these two techniques by proposing two methods called the compressed table of encrypted scores and the double score formula. Moreover, we exploit a second secure inverted index in order to manage the users’ access rights to the data. Finally, in order to validate our approach, we performed an experimental study using a data collection of one million documents. The experiments show that our approach is many times faster than any other approach based on the vector model.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11390-019-1903-2</doi><tpages>22</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1000-9000 |
ispartof | Journal of computer science and technology, 2019, Vol.34 (1), p.133-154 |
issn | 1000-9000 1860-4749 |
language | eng |
recordid | cdi_wanfang_journals_jsjkxjsxb_e201901009 |
source | Springer Online Journals Complete |
subjects | Algorithms Artificial Intelligence Cloud computing Comparative analysis Computer Science Cybersecurity Data acquisition Data collection Data encryption Data Structures and Information Theory Documents Encryption Information Systems Applications (incl.Internet) Keywords Outsourcing Privacy Regular Paper Search process Software Engineering Theory of Computation |
title | Secure Inverted Index Based Search over Encrypted Cloud Data with User Access Rights Management |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T16%3A43%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wanfang_jour_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Secure%20Inverted%20Index%20Based%20Search%20over%20Encrypted%20Cloud%20Data%20with%20User%20Access%20Rights%20Management&rft.jtitle=Journal%20of%20computer%20science%20and%20technology&rft.au=Boucenna,%20Fateh&rft.date=2019&rft.volume=34&rft.issue=1&rft.spage=133&rft.epage=154&rft.pages=133-154&rft.issn=1000-9000&rft.eissn=1860-4749&rft_id=info:doi/10.1007/s11390-019-1903-2&rft_dat=%3Cwanfang_jour_proqu%3Ejsjkxjsxb_e201901009%3C/wanfang_jour_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2171315072&rft_id=info:pmid/&rft_galeid=A719996787&rft_wanfj_id=jsjkxjsxb_e201901009&rfr_iscdi=true |