A multi-key compressed sensing and machine learning privacy preserving computing scheme

M. Fakhr
{"title":"A multi-key compressed sensing and machine learning privacy preserving computing scheme","authors":"M. Fakhr","doi":"10.1109/ISCBI.2017.8053548","DOIUrl":null,"url":null,"abstract":"Recently there has been a huge interest in secure and private cloud computing. In particular; to perform signal processing and machine learning tasks in the encrypted domain. Homomorphic encryption offers provably secure, asymmetric encryption solution to this problem, however, it comes with a high storage and computation cost. Compressed sensing (CS) and random projection (RP) approaches are much lighter; however, they lack privacy since the encryption uses a symmetric key which is the random projection matrix. A multi-key, compressed sensing encryption approach is proposed in this paper for performing basic generic computations. The computing architecture consists of a User, a Cloud (which stores encrypted data from an Owner), and a Trusted Third Party (TTP) which is responsible for distributing the random CS keys. The TTP also trains two machine learning modules; ML1 and ML2. ML1, used at the cloud, takes as input the multi-key encrypted data and produces an intermediate encrypted result. ML2, available at the user side, decrypts the results. This novel approach is much cheaper than homomorphic encryption in terms of data expansion, storage as well as encryption time. Also, it offers the privacy of the multi-keys. The proposed approach is applied on 2 generic computing tasks; namely, squared Euclidean distance and dot product. The developed approach is tested on the COREL image classification task using the squared Euclidean distance and on an autoregressive (AR) stock prediction task using the dot product.","PeriodicalId":128441,"journal":{"name":"2017 5th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 5th International Symposium on Computational and Business Intelligence (ISCBI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCBI.2017.8053548","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Recently there has been a huge interest in secure and private cloud computing. In particular; to perform signal processing and machine learning tasks in the encrypted domain. Homomorphic encryption offers provably secure, asymmetric encryption solution to this problem, however, it comes with a high storage and computation cost. Compressed sensing (CS) and random projection (RP) approaches are much lighter; however, they lack privacy since the encryption uses a symmetric key which is the random projection matrix. A multi-key, compressed sensing encryption approach is proposed in this paper for performing basic generic computations. The computing architecture consists of a User, a Cloud (which stores encrypted data from an Owner), and a Trusted Third Party (TTP) which is responsible for distributing the random CS keys. The TTP also trains two machine learning modules; ML1 and ML2. ML1, used at the cloud, takes as input the multi-key encrypted data and produces an intermediate encrypted result. ML2, available at the user side, decrypts the results. This novel approach is much cheaper than homomorphic encryption in terms of data expansion, storage as well as encryption time. Also, it offers the privacy of the multi-keys. The proposed approach is applied on 2 generic computing tasks; namely, squared Euclidean distance and dot product. The developed approach is tested on the COREL image classification task using the squared Euclidean distance and on an autoregressive (AR) stock prediction task using the dot product.
一种多密钥压缩感知和机器学习隐私保护计算方案
最近,人们对安全和私有云计算产生了巨大的兴趣。特别是;在加密域中执行信号处理和机器学习任务。同态加密为该问题提供了可证明的安全、非对称的加密解决方案,然而,它带来了较高的存储和计算成本。压缩感知(CS)和随机投影(RP)方法要轻得多;然而,由于加密使用随机投影矩阵的对称密钥,因此它们缺乏隐私性。本文提出了一种多密钥压缩感知加密方法,用于执行基本的通用计算。计算架构由用户、云(存储来自所有者的加密数据)和负责分发随机CS密钥的可信第三方(TTP)组成。TTP还训练了两个机器学习模块;ML1和ML2。在云端使用的ML1将多密钥加密数据作为输入,并产生中间加密结果。用户端可用的ML2对结果进行解密。这种新颖的方法在数据扩展、存储和加密时间方面都比同态加密便宜得多。此外,它还提供了多密钥的私密性。该方法应用于2个通用计算任务;也就是欧氏距离的平方和点积。在COREL图像分类任务和自回归(AR)库存预测任务上使用点积进行了测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信