Contextual Oblivious Similarity Searching for Encrypted Data on Cloud Storage Services

Sneha Umesh Lavnis, D. Elango, H. González-Vélez
{"title":"Contextual Oblivious Similarity Searching for Encrypted Data on Cloud Storage Services","authors":"Sneha Umesh Lavnis, D. Elango, H. González-Vélez","doi":"10.1109/SC2.2018.00017","DOIUrl":null,"url":null,"abstract":"With the development of collaborative cloud storage services, files have been typically stored and secured through encryption making them hard to retrieve and search. Search over encrypted cloud approaches have consequently been utilizing cryptographic and indexing procedures. The vast majority use exact matching to fulfill their search criteria, which is then expanded by incorporating similarity ranking algorithms. However, this complex expansion does not always succeed due to its dependence on third parties to evaluate the search and the possible compromise on the privacy of the stored information. It also requires significant computational resources. This work demonstrates novel approach to similarity search, known as Contextual Oblivious Similarity based Search (COS2). In the proposed system, authorized users can categories searches resilient to typing errors. COS2 also introduces browsing caches to improve subscriber experience. Dual encryption mechanisms improve the relevance in searches without revealing confidential data on untrusted cloud service providers. Finally, this contextual search thrives to reduce the computational overhead of the overall search procedure, leading to a 86% improvement in terms of search efficiency.","PeriodicalId":340244,"journal":{"name":"2018 IEEE 8th International Symposium on Cloud and Service Computing (SC2)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 8th International Symposium on Cloud and Service Computing (SC2)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SC2.2018.00017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

With the development of collaborative cloud storage services, files have been typically stored and secured through encryption making them hard to retrieve and search. Search over encrypted cloud approaches have consequently been utilizing cryptographic and indexing procedures. The vast majority use exact matching to fulfill their search criteria, which is then expanded by incorporating similarity ranking algorithms. However, this complex expansion does not always succeed due to its dependence on third parties to evaluate the search and the possible compromise on the privacy of the stored information. It also requires significant computational resources. This work demonstrates novel approach to similarity search, known as Contextual Oblivious Similarity based Search (COS2). In the proposed system, authorized users can categories searches resilient to typing errors. COS2 also introduces browsing caches to improve subscriber experience. Dual encryption mechanisms improve the relevance in searches without revealing confidential data on untrusted cloud service providers. Finally, this contextual search thrives to reduce the computational overhead of the overall search procedure, leading to a 86% improvement in terms of search efficiency.
云存储服务中加密数据的上下文无关相似性搜索
随着协作云存储服务的发展,文件通常通过加密进行存储和保护,这使得它们难以检索和搜索。因此,对加密云方法的搜索一直在使用加密和索引过程。绝大多数使用精确匹配来满足他们的搜索标准,然后通过合并相似度排序算法来扩展搜索标准。然而,这种复杂的扩展并不总是成功的,因为它依赖于第三方来评估搜索,并可能损害存储信息的隐私。它还需要大量的计算资源。这项工作展示了一种新的相似性搜索方法,称为基于上下文无关的相似性搜索(COS2)。在建议的系统中,授权用户可以根据输入错误对搜索进行分类。COS2还引入了浏览缓存来改善用户体验。双重加密机制提高了搜索的相关性,而不会泄露不受信任的云服务提供商的机密数据。最后,这种上下文搜索可以减少整个搜索过程的计算开销,从而使搜索效率提高86%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信