Quorum controlled homomorphic re-encryption for privacy preserving computations in the cloud

被引:3
作者
Xia, Zhe [1 ,2 ]
Yang, Qiliang [3 ]
Qiao, Zirui [3 ]
Feng, Feng [4 ]
机构
[1] Wuhan Univ Technol, Sch Comp Sci & Artificial Intelligence, Wuhan 430070, Peoples R China
[2] Guizhou Univ, Guizhou Key Lab Publ Big Data, Guiyang 550025, Peoples R China
[3] Shaanxi Normal Univ, Sch Comp Sci, Xian 710119, Peoples R China
[4] Ningxia Univ, Sch Informat Engn, Yinchuan 750021, Peoples R China
关键词
Quorum controlled cryptosystems; Homomorphic re-encryption; Provable security; Privacy preserving computations; Cloud computing; DISTRIBUTED KEY GENERATION; SECURE; DECRYPTION; PROOFS; SCHEME;
D O I
10.1016/j.ins.2022.11.084
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud computing provides services to store users' data, so that they can access it anytime, anywhere at their convenience. In order to preserve data privacy, the data is encrypted before being uploaded to the cloud platform. But it is challenging to process and analyse the encrypted data as well as manage its access control. In Information Sciences 2017, Ding et al. have proposed a novel solution to address this challenge, which consists of a homomorphic re-encryption scheme (HRES) and a toolkit of several basic operations over ciphertexts. Ding's work has good potentials for various cloud-based applications in which privacy preserving computations are required and the processed results are shared among multiple users. However, the HRES scheme relies on some relatively strong assumptions, making it less practical for real-world applications. For example, the system parameters have to be generated by a trusted third party (TTP), the two proxies who execute the decryption and re-encryption processes have to follow the protocol, and they can neither be out-of-service nor collude. In this paper, we relax these assumptions by extending the HRES scheme into a quorum controlled homomorphic re-encryption scheme (QHRES). Both the decryption and re-encryption processes are carried out by multiple proxies in a distributed fashion, and all the desirable security properties are guaranteed if there exists a quorum of honest proxies. Moreover, no TTP is required and every proxy's behaviour can be publicly verified. Our extension inherits the homomorphic property as in HRES and it also supports the basic operations over ciphertexts. Therefore, it contributes to a more practical privacy preserving data processing system for real-world applications in the cloud.(c) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页码:58 / 73
页数:16
相关论文
共 39 条
[1]  
Algesheimer J, 2002, LECT NOTES COMPUT SC, V2442, P417
[2]  
[Anonymous], 1987, P 19 ANN ACM STOC 87
[3]  
Bogdanov Dan., 2012, INT C FINANCIAL CRYP, P57
[4]  
Bogetoft P, 2009, LECT NOTES COMPUT SC, V5628, P325, DOI 10.1007/978-3-642-03549-4_20
[5]   EFFICIENT FULLY HOMOMORPHIC ENCRYPTION FROM (STANDARD) LWE [J].
Brakerski, Zvika ;
Vaikuntanathan, Vinod .
SIAM JOURNAL ON COMPUTING, 2014, 43 (02) :831-871
[6]  
Bresson E, 2003, LECT NOTES COMPUT SC, V2894, P37
[7]   Efficient Privacy Preserving Data Collection and Computation Offloading for Fog-Assisted IoT [J].
Chen, Siguang ;
Zhu, Xi ;
Zhang, Haijun ;
Zhao, Chuanxin ;
Yang, Geng ;
Wang, Kun .
IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING, 2020, 5 (04) :526-540
[8]   Blockchain-Based Key Management Scheme in Fog-Enabled IoT Systems [J].
Chen, Tong ;
Zhang, Lei ;
Choo, Kim-Kwang Raymond ;
Zhang, Rui ;
Meng, Xinyu .
IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (13) :10766-10778
[9]   A secure and optimally efficient multi-authority election scheme [J].
Cramer, R ;
Gennaro, R ;
Schoenmakers, B .
EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 1997, 8 (05) :481-490
[10]  
Cramer R, 2002, LECT NOTES COMPUT SC, V2332, P45