Efficient Secure Inference Scheme in Multiparty Settings for Industrial Internet of Things

被引:2
作者
Lin, Jie [1 ]
Miao, Yinbin [1 ]
Wei, Linfeng [2 ]
Leng, Tao [3 ,4 ,5 ]
Choo, Kim-Kwang Raymond [6 ]
机构
[1] Xidian Univ, Sch Cyber Engn, Xian 710071, Peoples R China
[2] Jinan Univ, Sch Cyber Secur, Guangzhou 510632, Peoples R China
[3] Sichuan Police Coll, Intelligent Policing Key Lab Sichuan Prov, Luzhou 646000, Peoples R China
[4] Chinese Acad Sci, Inst Informat Engn, Beijing 100085, Peoples R China
[5] Univ Chinese Acad Sci, Sch Cyber Secur, Beijing 100049, Peoples R China
[6] Univ Texas San Antonio, Dept Informat Syst & Cyber Secur, San Antonio, TX 78258 USA
基金
中国国家自然科学基金;
关键词
Protocols; Cryptography; Computational modeling; Industrial Internet of Things; Data models; Costs; Artificial neural networks; Privacy preserving; secret sharing (SS); secure inference; secure multiparty computation;
D O I
10.1109/TII.2024.3413324
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Secure inference is the main technology to avoid privacy leakage when reasoning with machine learning models in multiparty settings for industrial Internet of Things (IoT). Existing solutions based on secure multiparty computation have been extensively explored in both academic and industrial fields, but these solutions are deployed in single user single model provider setting. When multiparty collaborate to handle tasks in multiuser multimodel provider setting, these solutions are no longer applicable as the mechanism of the linear computation protocol restricting the number of parties increases. In addition, these existing schemes need to conduct multiple checks during the inference of malicious models, which results in additional communication overhead. To solve these issues, we propose a multiparty secure inference scheme by using an improved multiplication protocol for achieving matrix multiplication, which achieves efficient linear calculation and supports adaptive parties. We also design a new check protocol to inspect calculation results of all layers with just one execution, which achieves lower communication and calculation overheads. Formal security analysis proves that our scheme achieves malicious security in the honest-majority setting, and extensive experiments demonstrate that our scheme reduces the communication costs by about 30% in large neural networks when compare with previous solutions.
引用
收藏
页码:11877 / 11886
页数:10
相关论文
共 24 条
[1]   Universally composable security: A new paradigm for cryptographic protocols [J].
Canetti, R .
42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, :136-145
[2]  
Chandran N, 2022, PROCEEDINGS OF THE 31ST USENIX SECURITY SYMPOSIUM, P1361
[3]  
Cramer R, 2005, LECT NOTES COMPUT SC, V3378, P342
[4]   Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority<bold> </bold> [J].
Dalskov, Anders ;
Escudero, Daniel ;
Nof, Ariel .
PROCEEDINGS OF THE 2022 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, CCS 2022, 2022, :653-666
[5]  
Damgård I, 2012, LECT NOTES COMPUT SC, V7417, P643
[6]  
Evans D., 2018, Privacy and Security, V2, P70
[7]  
Juvekar C, 2018, PROCEEDINGS OF THE 27TH USENIX SECURITY SYMPOSIUM, P1651
[8]  
Karpathy Andrej., 2019, Convolutional Neural Networks for Visual Recognition
[9]  
Koti A., 2022, NETW DISTRIB SYST SE, P24
[10]  
Koti N, 2021, PROCEEDINGS OF THE 30TH USENIX SECURITY SYMPOSIUM, P2651