Privacy Preserving Image Retrieval Using Multi-Key Random Projection Encryption and Machine Learning Decryption

Alaa Mahmoud Ibrahim, Mohamed Farouk, M. Fakhr
{"title":"Privacy Preserving Image Retrieval Using Multi-Key Random Projection Encryption and Machine Learning Decryption","authors":"Alaa Mahmoud Ibrahim, Mohamed Farouk, M. Fakhr","doi":"10.37934/araset.42.2.155174","DOIUrl":null,"url":null,"abstract":"Homomorphic Encryption (HE), Multiparty Computation (MPC), Differential Privacy (DP) and Random Projection (RP) have been used in privacy preserving computing. The main benefit of the random projection approach is the lighter time and space complexity compared to the other available techniques. However, RP is typically used in a symmetric encryption mode, with one random projection matrix single key, making it vulnerable to attacks. An enhanced multi-key RP approach is proposed in this paper where a set of N random matrices are used as projection keys. Moreover, a randomly chosen one is used for each new query. Machine learning models are trained to perform specific vector operations on the randomly projected vectors and produce another randomly projected results vector. Another machine learning model is trained to decrypt the final result at the user’s side. The proposed system is shown to offer privacy against known plaintext and cipher-only attacks while preserving Euclidean distance calculations accuracy in the randomly projected domain which are demonstrated on the COREL 1K image retrieval task. Results show that the cyphertext space took sixteen times less than the ciphertext done with homomorphic encryption, and the computation of distance using random projection was 8 times faster than homomorphic encryption distance calculation.","PeriodicalId":506443,"journal":{"name":"Journal of Advanced Research in Applied Sciences and Engineering Technology","volume":"85 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advanced Research in Applied Sciences and Engineering Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37934/araset.42.2.155174","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Homomorphic Encryption (HE), Multiparty Computation (MPC), Differential Privacy (DP) and Random Projection (RP) have been used in privacy preserving computing. The main benefit of the random projection approach is the lighter time and space complexity compared to the other available techniques. However, RP is typically used in a symmetric encryption mode, with one random projection matrix single key, making it vulnerable to attacks. An enhanced multi-key RP approach is proposed in this paper where a set of N random matrices are used as projection keys. Moreover, a randomly chosen one is used for each new query. Machine learning models are trained to perform specific vector operations on the randomly projected vectors and produce another randomly projected results vector. Another machine learning model is trained to decrypt the final result at the user’s side. The proposed system is shown to offer privacy against known plaintext and cipher-only attacks while preserving Euclidean distance calculations accuracy in the randomly projected domain which are demonstrated on the COREL 1K image retrieval task. Results show that the cyphertext space took sixteen times less than the ciphertext done with homomorphic encryption, and the computation of distance using random projection was 8 times faster than homomorphic encryption distance calculation.
利用多密钥随机投影加密和机器学习解密实现隐私保护图像检索
同态加密(HE)、多方计算(MPC)、差分隐私(DP)和随机投影(RP)已被用于隐私保护计算。与其他可用技术相比,随机投影方法的主要优点是时间和空间复杂度较低。然而,RP 通常用于对称加密模式,只有一个随机投影矩阵和一个密钥,因此容易受到攻击。本文提出了一种增强的多密钥 RP 方法,使用一组 N 个随机矩阵作为投影密钥。此外,每次新查询都会使用一个随机选择的矩阵。对机器学习模型进行训练,以便对随机投影向量执行特定的向量运算,并生成另一个随机投影结果向量。另一个机器学习模型经过训练,可在用户端解密最终结果。研究表明,所提出的系统能抵御已知明文攻击和纯密码攻击,同时保持随机投影域的欧氏距离计算精度,这在 COREL 1K 图像检索任务中得到了验证。结果表明,明文空间所需的时间是同态加密所需的明文空间的 16 倍,使用随机投影计算距离的速度是同态加密距离计算速度的 8 倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.30
自引率
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学术官方微信