TY - JOUR
T1 - ESCM
T2 - A Toolkit for Efficient and Secure Outsourced Computation with Multiple Keys
AU - Zhang, Yunzhen
AU - Jiang, Yupeng
N1 - Publisher Copyright:
© 2005-2012 IEEE.
PY - 2026
Y1 - 2026
N2 - With the widespread availability of cloud computing and big data, homomorphic encryption has become a crucial technique employed to protect the data privacy in outsourced computation. However, the existing outsourced computation toolkits based on homomorphic encryption either require all participants to share the same key or result in enormous computational and communication overheads. In order to address these shortcomings, we put forward a toolkit for efficient and secure outsourced computation in multiple key scenarios (ESCM). ESCM can permit the servers to process the most frequently used arithmetic operations such as multiplication, division, sorting and so on across different encrypted domains. Moreover, to tackle the security concerns that may arise from collusion among some servers, as well as the problem of service disruption due to server outages, we propose the distributed two trapdoor cryptosystem with threshold decryption, the core cryptographic primitive, which is able to support (k, n) threshold decryption. Theoretical analysis validates the security of the proposed ESCM and compares the computation and communication complexity with existing most advanced solutions. Finally, simulation experiments illustrate the practicality and efficiency of ESCM.
AB - With the widespread availability of cloud computing and big data, homomorphic encryption has become a crucial technique employed to protect the data privacy in outsourced computation. However, the existing outsourced computation toolkits based on homomorphic encryption either require all participants to share the same key or result in enormous computational and communication overheads. In order to address these shortcomings, we put forward a toolkit for efficient and secure outsourced computation in multiple key scenarios (ESCM). ESCM can permit the servers to process the most frequently used arithmetic operations such as multiplication, division, sorting and so on across different encrypted domains. Moreover, to tackle the security concerns that may arise from collusion among some servers, as well as the problem of service disruption due to server outages, we propose the distributed two trapdoor cryptosystem with threshold decryption, the core cryptographic primitive, which is able to support (k, n) threshold decryption. Theoretical analysis validates the security of the proposed ESCM and compares the computation and communication complexity with existing most advanced solutions. Finally, simulation experiments illustrate the practicality and efficiency of ESCM.
KW - Homomorphic encryption
KW - data privacy
KW - multiple keys
KW - outsourced computation
UR - https://www.scopus.com/pages/publications/105036415568
U2 - 10.1109/TIFS.2026.3685083
DO - 10.1109/TIFS.2026.3685083
M3 - 文章
AN - SCOPUS:105036415568
SN - 1556-6013
JO - IEEE Transactions on Information Forensics and Security
JF - IEEE Transactions on Information Forensics and Security
ER -