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

被引:0
作者
Chen, Zhenhua [1 ,2 ]
Long, Kaili [1 ]
Xie, Junrui [1 ]
Lai, Qiqi [3 ]
Wang, Yilei [4 ]
Li, Ni [1 ]
Huang, Luqi [5 ]
Ge, Aijun [6 ]
机构
[1] Xian Univ Sci & Technol, Coll Comp Sci & Technol, Xian 710054, Peoples R China
[2] Guilin Univ Elect Technol, Guangxi Key Lab Trusted Software, Guilin 541004, Peoples R China
[3] Shaanxi Normal Univ, Sch Comp Sci, Xian 710062, Peoples R China
[4] Qufu Normal Univ, Sch Comp Sci, Rizhao 276826, Peoples R China
[5] Univ Wollongong, Sch Comp & Informat Technol, Wollongong, NSW 2522, Australia
[6] Informat Engn Univ, Henan Key Lab Network Cryptog Technol, Zhengzhou 450001, Peoples R China
基金
中国国家自然科学基金;
关键词
Privacy; Encryption; Data privacy; Servers; Iron; Web services; Electronic mail; Computer science; Proposals; Public key; Multi-input functional encryption; maximum similarity; intermediate result privacy; function privacy; web service;
D O I
10.1109/TIFS.2025.3544072
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:2621 / 2631
页数:11
相关论文
共 29 条
[1]   Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions Without Pairings [J].
Abdalla, Michel ;
Catalano, Dario ;
Fiore, Dario ;
Gay, Romain ;
Ursu, Bogdan .
ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT I, 2018, 10991 :597-627
[2]  
Agrawal S., 2013, Cryptol. ePrint Arch., P1
[3]   Function-Hiding Inner Product Encryption [J].
Bishop, Allison ;
Jain, Abhishek ;
Kowalczyk, Lucas .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2015, PT I, 2015, 9452 :470-491
[4]   Identity-based encryption from the Weil pairing [J].
Boneh, D ;
Franklin, M .
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615
[5]  
Boneh D, 2011, LECT NOTES COMPUT SC, V6597, P253, DOI 10.1007/978-3-642-19571-6_16
[6]   Function-Private Functional Encryption in the Private-Key Setting [J].
Brakerski, Zvika ;
Segev, Gil .
JOURNAL OF CRYPTOLOGY, 2018, 31 (01) :202-225
[7]  
Cheung DW, 2010, LECT NOTES COMPUT SC, V6506, P61, DOI 10.1007/978-3-642-17517-6_8
[8]   Full-Hiding (Unbounded) Multi-input Inner Product Functional Encryption from the k-Linear Assumption [J].
Datta, Pratish ;
Okamoto, Tatsuaki ;
Tomida, Junichi .
PUBLIC-KEY CRYPTOGRAPHY - PKC 2018, PT II, 2018, 10770 :245-277
[9]   Functional Encryption for Inner Product with Full Function Privacy [J].
Datta, Pratish ;
Dutta, Ratna ;
Mukhopadhyay, Sourav .
PUBLIC-KEY CRYPTOGRAPHY - PKC 2016, PT I, 2016, 9614 :164-195
[10]   CANDIDATE INDISTINGUISHABILITY OBFUSCATION AND FUNCTIONAL ENCRYPTION FOR ALL CIRCUITS [J].
Garg, Sanjam ;
Gentry, Craig ;
Halevi, Shai ;
Raykova, Mariana ;
Sahai, Amit ;
Waters, Brent .
SIAM JOURNAL ON COMPUTING, 2016, 45 (03) :882-929