Attribute-Hiding Fuzzy Encryption for Privacy-Preserving Data Evaluation

被引:0
作者
Chen, Zhenhua [1 ,2 ]
Huang, Luqi [3 ]
Yang, Guomin [4 ]
Susilo, Willy [3 ]
Fu, Xingbing [5 ]
Jia, Xingxing [6 ]
机构
[1] Xian Univ Sci & Technol, Coll Comp Sci & Technol, Xian 710054, Peoples R China
[2] Guilin Univ Elect Technol, Guangxi Key Lab Cryptog & Informat Secur, Guilin 541004, Peoples R China
[3] Univ Wollongong, Inst Cybersecur & Cryptol, Sch Comp & Informat Technol, Wollongong, NSW 2522, Australia
[4] Singapore Management Univ, Sch Comp & Informat Syst, Singapore 188065, Singapore
[5] Hangzhou Dianzi Univ, Sch Cyberspace, Hangzhou 310018, Peoples R China
[6] Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Peoples R China
基金
中国国家自然科学基金;
关键词
Encryption; Medical diagnostic imaging; Vectors; Security; Inspection; Privacy; Hamming distances; Attribute-hiding; data evaluation; fuzzy encryption; overlap distance; predicate encryption; INNER-PRODUCT ENCRYPTION;
D O I
10.1109/TSC.2024.3376198
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Privacy-preserving data evaluation is one of the prominent research topics in the Big Data era. In many data evaluation applications that involve sensitive information, such as the medical records of patients in a medical system, protecting data privacy during the data evaluation process has become an essential requirement. Aiming at solving this problem, numerous fuzzy encryption systems for different similarity metrics have been proposed in literature. Unfortunately, the existing fuzzy encryption systems either fail to achieve attribute-hiding or achieve it, but are impractical. In this article, we propose a new fuzzy encryption scheme for privacy-preserving data evaluation based on overlap distance, which can work in an integer domain while achieving attribute-hiding. In particular, we develop a novel approach to enable an accurate overlap distance to be fast calculated. This technique makes the number of pairing operations during decryption stage negative correlation with the size of the threshold, which is pretty practical for some applications especially with a large threshold. Additionally, we provide a formal security analysis of the proposed scheme, followed by a comprehensive experimental. Also we show that our scheme can be well applied to some scenarios, such as fuzzy keyword searchable encryption and attribute-hiding closest substring encryption.
引用
收藏
页码:789 / 803
页数:15
相关论文
共 22 条
[1]  
Al-Riyami SS, 2003, LECT NOTES COMPUT SC, V2894, P452
[2]   Short group signatures [J].
Boneh, D ;
Boyen, X ;
Shacham, H .
ADVANCES IN CRYPTOLOGY - CRYPTO 2004, PROCEEDINGS, 2004, 3152 :41-55
[3]  
Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
[4]  
Cheung DW, 2010, LECT NOTES COMPUT SC, V6506, P61, DOI 10.1007/978-3-642-17517-6_8
[5]  
Dodis Y, 2004, LECT NOTES COMPUT SC, V3027, P523
[6]  
Freeman DM, 2010, LECT NOTES COMPUT SC, V6110, P44
[7]  
Granlund Torbjorn, 2010, The GNU multiple precision arithmetic library
[8]  
Guillevic A., 2013, P 11 INT C APPL CRYP, P357
[9]   Generalized closest substring encryption [J].
Guo, Fuchun ;
Susilo, Willy ;
Mu, Yi .
DESIGNS CODES AND CRYPTOGRAPHY, 2016, 80 (01) :103-124
[10]   Distance-Based Encryption: How to Embed Fuzziness in Biometric-Based Encryption [J].
Guo, Fuchun ;
Susilo, Willy ;
Mu, Yi .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2016, 11 (02) :247-257