A New Functional Encryption Scheme Supporting Privacy-Preserving Maximum Similarity for Web Service Platforms

IF 8 1区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS IEEE Transactions on Information Forensics and Security Pub Date : 2025-02-20 DOI:10.1109/TIFS.2025.3544072
Zhenhua Chen;Kaili Long;Junrui Xie;Qiqi Lai;Yilei Wang;Ni Li;Luqi Huang;Aijun Ge
{"title":"A New Functional Encryption Scheme Supporting Privacy-Preserving Maximum Similarity for Web Service Platforms","authors":"Zhenhua Chen;Kaili Long;Junrui Xie;Qiqi Lai;Yilei Wang;Ni Li;Luqi Huang;Aijun Ge","doi":"10.1109/TIFS.2025.3544072","DOIUrl":null,"url":null,"abstract":"As a common metric, maximum similarity between two objects is widely employed by web platforms to provide matching services. However, the calculation of maximum similarity involves numerous sensitive or confidential users’ data, and the web platform server is often not trusted who might peep these data out of curiosity, or even worse sell them to unauthorized entities to make profits. Therefore, many research lines on functional encryption have been suggested and studied on how to calculate the maximum similarity while ensure the privacy of users’ data. Unfortunately, all of them will divulge some intermediate results to the web platform server when processing this issue. In this paper we present a new functional encryption scheme supporting privacy-preserving maximum similarity, which enables the web service platforms to figure out the maximum similarity without learning anything else about their data. Moreover, we provide a formal analysis to prove the security of the proposed scheme, followed by some experimental evaluations and comprehensive comparisons with the related works. It shows that, our scheme is the first functional encryption realization on maximum similarity without divulging the intermediate result and meanwhile achieve a higher security-function privacy, as well as a traditional data privacy.","PeriodicalId":13492,"journal":{"name":"IEEE Transactions on Information Forensics and Security","volume":"20 ","pages":"2621-2631"},"PeriodicalIF":8.0000,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Forensics and Security","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10896761/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

As a common metric, maximum similarity between two objects is widely employed by web platforms to provide matching services. However, the calculation of maximum similarity involves numerous sensitive or confidential users’ data, and the web platform server is often not trusted who might peep these data out of curiosity, or even worse sell them to unauthorized entities to make profits. Therefore, many research lines on functional encryption have been suggested and studied on how to calculate the maximum similarity while ensure the privacy of users’ data. Unfortunately, all of them will divulge some intermediate results to the web platform server when processing this issue. In this paper we present a new functional encryption scheme supporting privacy-preserving maximum similarity, which enables the web service platforms to figure out the maximum similarity without learning anything else about their data. Moreover, we provide a formal analysis to prove the security of the proposed scheme, followed by some experimental evaluations and comprehensive comparisons with the related works. It shows that, our scheme is the first functional encryption realization on maximum similarity without divulging the intermediate result and meanwhile achieve a higher security-function privacy, as well as a traditional data privacy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种支持Web服务平台最大相似度保护隐私的新功能加密方案
两个对象之间的最大相似度作为一种常用度量,被web平台广泛用于提供匹配服务。然而,最大相似度的计算涉及大量敏感或机密的用户数据,而web平台服务器往往是不可信的,他们可能出于好奇而窥探这些数据,甚至将这些数据出售给未经授权的实体以获取利润。因此,如何在保证用户数据隐私性的前提下计算最大相似度,提出了许多关于功能加密的研究思路。不幸的是,在处理这个问题时,它们都会向web平台服务器泄露一些中间结果。本文提出了一种新的支持最大相似度的功能加密方案,使web服务平台能够在不了解其数据的情况下计算出最大相似度。此外,我们提供了一个形式化的分析来证明所提出的方案的安全性,随后进行了一些实验评估和与相关工作的综合比较。结果表明,我们的方案是第一个在不泄露中间结果的情况下实现最大相似度的功能加密,同时实现了更高的安全性-功能隐私,以及传统的数据隐私。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Forensics and Security 工程技术-工程:电子与电气
CiteScore
14.40
自引率
7.40%
发文量
234
审稿时长
6.5 months
期刊介绍: The IEEE Transactions on Information Forensics and Security covers the sciences, technologies, and applications relating to information forensics, information security, biometrics, surveillance and systems applications that incorporate these features
期刊最新文献
Bandwidth-Efficient Robust Threshold ECDSA in Three Rounds CShard: Blockchain Sharding via Repairable Fountain Codes and the Paradigm for Sharding Design AtomXross: Towards General Cross-Chain Transaction Differentially Private Zeroth-Order Methods for Scalable Large Language Model Fine-tuning PromptGuard: Soft Prompt-Guided Unsafe Content Moderation for Text-to-Image Models
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1