远程数据存储的高效跨用户重复数据删除

Priteshkumar Prajapati, Parth Shah
{"title":"远程数据存储的高效跨用户重复数据删除","authors":"Priteshkumar Prajapati, Parth Shah","doi":"10.1109/I2CT.2014.7092019","DOIUrl":null,"url":null,"abstract":"Cloud data storage service providers such as Mozy, Dropbox, and others perform deduplication to save space by only storing one copy of each file uploaded. While using cloud data storage clients always concern for confidentiality of data. So clients usually encrypt their data, and put it on to the storage. If client specific key is used for encryption then each client has different key so in this case deduplication is not possible. Single key within the network is used for encryption then all data is insecure even if one client is compromised and attacker gets the key. Message-locked encryption resolves this problem. But it is inherently subject to brute-force attacks that can recover files falling into a known set. In DupLESS get and put operations are most expensive operations in terms of time. In proposed architecture, we provide secure deduplicated storage resisting brute-force attacks, and realize it in a modification of existing system DupLESS using blowfish algorithm. Clients encrypt under message-based keys obtained via an oblivious PRF protocol from a key-server. Clients encrypt data and send it to the storage server provider then storage server performs deduplication. It is observed that compare to DupLESS, Proposed System achieve more performance in terms of time. Post process and target deduplication is used at storage server side.","PeriodicalId":384966,"journal":{"name":"International Conference for Convergence for Technology-2014","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Efficient cross user data deduplication in remote data storage\",\"authors\":\"Priteshkumar Prajapati, Parth Shah\",\"doi\":\"10.1109/I2CT.2014.7092019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud data storage service providers such as Mozy, Dropbox, and others perform deduplication to save space by only storing one copy of each file uploaded. While using cloud data storage clients always concern for confidentiality of data. So clients usually encrypt their data, and put it on to the storage. If client specific key is used for encryption then each client has different key so in this case deduplication is not possible. Single key within the network is used for encryption then all data is insecure even if one client is compromised and attacker gets the key. Message-locked encryption resolves this problem. But it is inherently subject to brute-force attacks that can recover files falling into a known set. In DupLESS get and put operations are most expensive operations in terms of time. In proposed architecture, we provide secure deduplicated storage resisting brute-force attacks, and realize it in a modification of existing system DupLESS using blowfish algorithm. Clients encrypt under message-based keys obtained via an oblivious PRF protocol from a key-server. Clients encrypt data and send it to the storage server provider then storage server performs deduplication. It is observed that compare to DupLESS, Proposed System achieve more performance in terms of time. Post process and target deduplication is used at storage server side.\",\"PeriodicalId\":384966,\"journal\":{\"name\":\"International Conference for Convergence for Technology-2014\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference for Convergence for Technology-2014\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/I2CT.2014.7092019\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference for Convergence for Technology-2014","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I2CT.2014.7092019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

云数据存储服务提供商(如Mozy、Dropbox等)通过重复数据删除来节省空间,每个上传的文件只存储一个副本。在使用云数据存储时,客户总是关心数据的机密性。因此,客户端通常会加密他们的数据,并将其放入存储器中。如果使用特定于客户端的密钥进行加密,那么每个客户端都有不同的密钥,因此在这种情况下,重复数据删除是不可能的。在网络中使用单个密钥进行加密,那么即使一个客户端被攻破并且攻击者获得密钥,所有数据也是不安全的。消息锁定加密解决了这个问题。但它本身就容易受到暴力攻击,这些攻击可以恢复落入已知集合的文件。在DupLESS中,获取和放置操作是时间上最昂贵的操作。在提出的架构中,我们提供了安全的重复数据删除存储,以抵抗暴力攻击,并在现有系统的修改中使用河豚算法实现。客户端使用通过无关PRF协议从密钥服务器获得的基于消息的密钥进行加密。客户端加密数据并将其发送给存储服务器提供商,然后存储服务器执行重复数据删除。实验结果表明,本文提出的系统在时间上的性能优于双字系统。存储服务器端使用后进程重复数据删除和目标重复数据删除。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient cross user data deduplication in remote data storage
Cloud data storage service providers such as Mozy, Dropbox, and others perform deduplication to save space by only storing one copy of each file uploaded. While using cloud data storage clients always concern for confidentiality of data. So clients usually encrypt their data, and put it on to the storage. If client specific key is used for encryption then each client has different key so in this case deduplication is not possible. Single key within the network is used for encryption then all data is insecure even if one client is compromised and attacker gets the key. Message-locked encryption resolves this problem. But it is inherently subject to brute-force attacks that can recover files falling into a known set. In DupLESS get and put operations are most expensive operations in terms of time. In proposed architecture, we provide secure deduplicated storage resisting brute-force attacks, and realize it in a modification of existing system DupLESS using blowfish algorithm. Clients encrypt under message-based keys obtained via an oblivious PRF protocol from a key-server. Clients encrypt data and send it to the storage server provider then storage server performs deduplication. It is observed that compare to DupLESS, Proposed System achieve more performance in terms of time. Post process and target deduplication is used at storage server side.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信