移动云用户轻量级数据保密方法的高效并行实现

M. Bahrami, Dong Li, M. Singhal, A. Kundu
{"title":"移动云用户轻量级数据保密方法的高效并行实现","authors":"M. Bahrami, Dong Li, M. Singhal, A. Kundu","doi":"10.1109/DATACLOUD.2016.11","DOIUrl":null,"url":null,"abstract":"Cloud computing provides an opportunity to users to outsource their data and applications. However, data privacy is one of the key challenges for the users who are outsourcing data on some transparent cloud servers. Data encryption is the best option to protect users' data privacy on the cloud. However, computation overheads of encryption methods could be expensive to some small computing machines, such as mobile or IoT devices with limited resources, such as battery. In our previous study, we developed a light-weight Data Privacy Method (DPM) based on a chaos system that uses a Pseudo Random Permutation (PRP) to scramble the content of original data. Although the nature of PRP is against parallelization, we provide an efficient parallel algorithm to scramble a file while the file splits into multiple chunks. The parallel DPM avoids an adversary to access the original data (e.g., by using a brute-force attack), when the size of each scrambled data is large enough. In this paper, we accelerate DPM on a Graphic Processing Unit (GPU) by using NVIDIA CUDA platform for implementation. We assess the generated shuffle addresses from pseudo-random and the distribution of randomness when the computation on data is parallelized on a multiple GPU-cores. A set of rigorous evaluation results shows that the parallel DPM provides a superior performance over tradition DPM when the most time consuming of native CUDA parallel functions have monitored. We also perform a security analysis of parallel DPM to ensure it is secure and it is a cost effective model to protect users' data privacy in a cloud environment.","PeriodicalId":325593,"journal":{"name":"2016 Seventh International Workshop on Data-Intensive Computing in the Clouds (DataCloud)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"An Efficient Parallel Implementation of a Light-weight Data Privacy Method for Mobile Cloud Users\",\"authors\":\"M. Bahrami, Dong Li, M. Singhal, A. Kundu\",\"doi\":\"10.1109/DATACLOUD.2016.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud computing provides an opportunity to users to outsource their data and applications. However, data privacy is one of the key challenges for the users who are outsourcing data on some transparent cloud servers. Data encryption is the best option to protect users' data privacy on the cloud. However, computation overheads of encryption methods could be expensive to some small computing machines, such as mobile or IoT devices with limited resources, such as battery. In our previous study, we developed a light-weight Data Privacy Method (DPM) based on a chaos system that uses a Pseudo Random Permutation (PRP) to scramble the content of original data. Although the nature of PRP is against parallelization, we provide an efficient parallel algorithm to scramble a file while the file splits into multiple chunks. The parallel DPM avoids an adversary to access the original data (e.g., by using a brute-force attack), when the size of each scrambled data is large enough. In this paper, we accelerate DPM on a Graphic Processing Unit (GPU) by using NVIDIA CUDA platform for implementation. We assess the generated shuffle addresses from pseudo-random and the distribution of randomness when the computation on data is parallelized on a multiple GPU-cores. A set of rigorous evaluation results shows that the parallel DPM provides a superior performance over tradition DPM when the most time consuming of native CUDA parallel functions have monitored. We also perform a security analysis of parallel DPM to ensure it is secure and it is a cost effective model to protect users' data privacy in a cloud environment.\",\"PeriodicalId\":325593,\"journal\":{\"name\":\"2016 Seventh International Workshop on Data-Intensive Computing in the Clouds (DataCloud)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 Seventh International Workshop on Data-Intensive Computing in the Clouds (DataCloud)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DATACLOUD.2016.11\",\"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 Seventh International Workshop on Data-Intensive Computing in the Clouds (DataCloud)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DATACLOUD.2016.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

云计算为用户提供了外包数据和应用程序的机会。然而,对于将数据外包到一些透明云服务器上的用户来说,数据隐私是主要挑战之一。数据加密是保护云上用户数据隐私的最佳选择。然而,加密方法的计算开销对于一些小型计算机器来说可能是昂贵的,例如具有有限资源(如电池)的移动或物联网设备。在我们之前的研究中,我们开发了一种基于混沌系统的轻量级数据隐私方法(DPM),该方法使用伪随机排列(PRP)来打乱原始数据的内容。尽管PRP的本质是反对并行化的,但我们提供了一种高效的并行算法,可以在文件分割成多个块时对文件进行乱置。当每个加密数据的大小足够大时,并行DPM避免对手访问原始数据(例如,通过使用暴力攻击)。在本文中,我们使用NVIDIA CUDA平台在图形处理单元(GPU)上实现DPM加速。我们评估了在多个gpu核上并行计算数据时,伪随机生成的shuffle地址和随机性的分布。一组严格的评估结果表明,在监测最耗时的本地CUDA并行功能时,并行DPM提供了优于传统DPM的性能。我们还对并行DPM进行了安全分析,以确保它是安全的,并且它是一种在云环境中保护用户数据隐私的成本效益模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Efficient Parallel Implementation of a Light-weight Data Privacy Method for Mobile Cloud Users
Cloud computing provides an opportunity to users to outsource their data and applications. However, data privacy is one of the key challenges for the users who are outsourcing data on some transparent cloud servers. Data encryption is the best option to protect users' data privacy on the cloud. However, computation overheads of encryption methods could be expensive to some small computing machines, such as mobile or IoT devices with limited resources, such as battery. In our previous study, we developed a light-weight Data Privacy Method (DPM) based on a chaos system that uses a Pseudo Random Permutation (PRP) to scramble the content of original data. Although the nature of PRP is against parallelization, we provide an efficient parallel algorithm to scramble a file while the file splits into multiple chunks. The parallel DPM avoids an adversary to access the original data (e.g., by using a brute-force attack), when the size of each scrambled data is large enough. In this paper, we accelerate DPM on a Graphic Processing Unit (GPU) by using NVIDIA CUDA platform for implementation. We assess the generated shuffle addresses from pseudo-random and the distribution of randomness when the computation on data is parallelized on a multiple GPU-cores. A set of rigorous evaluation results shows that the parallel DPM provides a superior performance over tradition DPM when the most time consuming of native CUDA parallel functions have monitored. We also perform a security analysis of parallel DPM to ensure it is secure and it is a cost effective model to protect users' data privacy in a cloud environment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信