Efficient Privacy-Preserving Outsourcing of Large-Scale QR Factorization

Changqing Luo, Kaijin Zhang, Sergio Salinas, Pan Li
{"title":"Efficient Privacy-Preserving Outsourcing of Large-Scale QR Factorization","authors":"Changqing Luo, Kaijin Zhang, Sergio Salinas, Pan Li","doi":"10.1109/Trustcom/BigDataSE/ICESS.2017.331","DOIUrl":null,"url":null,"abstract":"Modern organizations have collected vast amounts of data created by various systems and applications. Scientists and engineers have a strong desire to advance scientific and engineering knowledge from such massive data. QR factorization is one of the most fundamental mathematical tools for data analysis. However, conducting QR factorization of a matrix requires high computational complexity. This incurs a formidable challenge in efficiently analyzing large-scale data sets by normal users or small companies on traditional resource limited computers. To overcome this limitation, industry and academia propose to employ cloud computing that can offer abundant computing resources. This, however, raises privacy concerns because users' data may contain sensitive information that needs to be hidden for ethical, legal, or security reasons. To this end, we propose a privacy-preserving outsourcing algorithm for efficiently performing large-scale QR factorization. We implement the proposed algorithm on the Amazon Elastic Compute Cloud (EC2) platform and a laptop. The experiment results show significant time saving for the user.","PeriodicalId":170253,"journal":{"name":"2017 IEEE Trustcom/BigDataSE/ICESS","volume":"130 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Trustcom/BigDataSE/ICESS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.331","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Modern organizations have collected vast amounts of data created by various systems and applications. Scientists and engineers have a strong desire to advance scientific and engineering knowledge from such massive data. QR factorization is one of the most fundamental mathematical tools for data analysis. However, conducting QR factorization of a matrix requires high computational complexity. This incurs a formidable challenge in efficiently analyzing large-scale data sets by normal users or small companies on traditional resource limited computers. To overcome this limitation, industry and academia propose to employ cloud computing that can offer abundant computing resources. This, however, raises privacy concerns because users' data may contain sensitive information that needs to be hidden for ethical, legal, or security reasons. To this end, we propose a privacy-preserving outsourcing algorithm for efficiently performing large-scale QR factorization. We implement the proposed algorithm on the Amazon Elastic Compute Cloud (EC2) platform and a laptop. The experiment results show significant time saving for the user.
大规模QR分解的高效隐私保护外包
现代组织已经收集了由各种系统和应用程序创建的大量数据。科学家和工程师都有强烈的愿望,希望从如此庞大的数据中推进科学和工程知识。QR分解是数据分析最基本的数学工具之一。然而,对矩阵进行QR分解需要很高的计算复杂度。这给普通用户或小公司在传统资源有限的计算机上有效分析大规模数据集带来了巨大的挑战。为了克服这一限制,工业界和学术界都提出采用能够提供丰富计算资源的云计算。然而,这引起了隐私问题,因为用户的数据可能包含出于道德、法律或安全原因需要隐藏的敏感信息。为此,我们提出了一种保护隐私的外包算法,用于高效地执行大规模QR分解。我们在Amazon Elastic Compute Cloud (EC2)平台和笔记本电脑上实现了所提出的算法。实验结果表明,该方法为用户节省了大量的时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信