云计算环境下的永久参与式数据安全

Sara Ibn El Ahrache, Hassan Badir, P. Ghodous, A. Sbihi
{"title":"云计算环境下的永久参与式数据安全","authors":"Sara Ibn El Ahrache, Hassan Badir, P. Ghodous, A. Sbihi","doi":"10.1109/CIST.2016.7805064","DOIUrl":null,"url":null,"abstract":"Recently, there has been increasing confidence for a favorable usage of big data drawn out from the huge amount of information deposited in a cloud computing system. Data kept on such systems can be retrieved through the network at the user's convenience. However, the data that users send include private information, and therefore, information leakage from these data is now a major social problem. The usage of secret sharing schemes for cloud computing have lately been approved to be relevant in which users deal out their data to several servers. Notably, in a (k, n) threshold scheme, data security is assured if and only if all through the whole life of the secret the opponent cannot compromise more than k of the n servers. In fact, a number of secret sharing algorithms have been suggested to deal with these security issues. However, a limitation of these methods is that first they do not consider long term data storage and second they assume that data tempering only occurs at retrieval time, after the distribution of the shares has been correctly done. In this paper we address these two problems by presenting a novel scheme to ensure a perpetual secure data storage and retrieval.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"54 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Permanent participatory data security in a cloud computing environment\",\"authors\":\"Sara Ibn El Ahrache, Hassan Badir, P. Ghodous, A. Sbihi\",\"doi\":\"10.1109/CIST.2016.7805064\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, there has been increasing confidence for a favorable usage of big data drawn out from the huge amount of information deposited in a cloud computing system. Data kept on such systems can be retrieved through the network at the user's convenience. However, the data that users send include private information, and therefore, information leakage from these data is now a major social problem. The usage of secret sharing schemes for cloud computing have lately been approved to be relevant in which users deal out their data to several servers. Notably, in a (k, n) threshold scheme, data security is assured if and only if all through the whole life of the secret the opponent cannot compromise more than k of the n servers. In fact, a number of secret sharing algorithms have been suggested to deal with these security issues. However, a limitation of these methods is that first they do not consider long term data storage and second they assume that data tempering only occurs at retrieval time, after the distribution of the shares has been correctly done. In this paper we address these two problems by presenting a novel scheme to ensure a perpetual secure data storage and retrieval.\",\"PeriodicalId\":196827,\"journal\":{\"name\":\"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)\",\"volume\":\"54 6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIST.2016.7805064\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIST.2016.7805064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

最近,人们越来越有信心从云计算系统中存储的大量信息中提取出有利的大数据。保存在这些系统上的数据可以在用户方便时通过网络检索。然而,用户发送的数据包含私人信息,因此,这些数据的信息泄露现在是一个重大的社会问题。云计算的秘密共享方案的使用最近被批准与用户将他们的数据分发给几个服务器相关。值得注意的是,在(k, n)阈值方案中,当且仅当对手在秘密的整个生命周期内无法入侵n个服务器中的k个以上时,数据安全性才得到保证。事实上,已经提出了许多秘密共享算法来处理这些安全问题。然而,这些方法的局限性在于,首先,它们不考虑长期数据存储,其次,它们假设数据回火只发生在检索时,即正确完成份额分配之后。在本文中,我们通过提出一种新的方案来解决这两个问题,以确保数据的永久安全存储和检索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Permanent participatory data security in a cloud computing environment
Recently, there has been increasing confidence for a favorable usage of big data drawn out from the huge amount of information deposited in a cloud computing system. Data kept on such systems can be retrieved through the network at the user's convenience. However, the data that users send include private information, and therefore, information leakage from these data is now a major social problem. The usage of secret sharing schemes for cloud computing have lately been approved to be relevant in which users deal out their data to several servers. Notably, in a (k, n) threshold scheme, data security is assured if and only if all through the whole life of the secret the opponent cannot compromise more than k of the n servers. In fact, a number of secret sharing algorithms have been suggested to deal with these security issues. However, a limitation of these methods is that first they do not consider long term data storage and second they assume that data tempering only occurs at retrieval time, after the distribution of the shares has been correctly done. In this paper we address these two problems by presenting a novel scheme to ensure a perpetual secure data storage and retrieval.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Semantically enhanced term frequency based on word embeddings for Arabic information retrieval Automatic generation of TestNG tests cases from UML sequence diagrams in Scrum process Coordination by sharing demand forecasts in a supply chain using game theoretic approach Robust approach for textured image clustering High speed efficient FPGA implementation of pipelined AES S-Box
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1