SecBNN: Efficient Secure Inference on Binary Neural Networks

被引:0
作者
Chen, Hanxiao [1 ]
Li, Hongwei [1 ]
Hao, Meng [1 ]
Hu, Jia [1 ]
Xu, Guowen [1 ]
Zhang, Xilin [1 ]
Zhang, Tianwei [2 ]
机构
[1] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu 610056, Peoples R China
[2] Nanyang Technol Univ, Coll Comp & Data Sci, Singapore 639798, Singapore
基金
中国国家自然科学基金;
关键词
Wide area networks; Protocols; Accuracy; Quantization (signal); Neural networks; Buildings; Computer architecture; Inference algorithms; Logic; Adders; Binary neural networks; private inference; secure two-party computation;
D O I
10.1109/TIFS.2024.3484936
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This work studies secure inference on Binary Neural Networks (BNNs), which have binary weights and activations as a desirable feature. Although previous works have developed secure methodologies for BNNs, they still have performance limitations and significant gaps in efficiency when applied in practice. We present SecBNN, an efficient secure two-party inference framework on BNNs. SecBNN exploits appropriate underlying primitives and contributes efficient protocols for the non-linear and linear layers of BNNs. Specifically, for non-linear layers, we introduce a secure sign protocol with an innovative adder logic and customized evaluation algorithms. For linear layers, we propose a new binary matrix multiplication protocol, where a divide-and-conquer strategy is provided to recursively break down the matrix multiplication problem into multiple sub-problems. Building on top of these efficient ingredients, we implement and evaluate SecBNN over two real-world datasets and various model architectures under LAN and WAN. Experimental results show that SecBNN substantially improves the communication and computation performance of existing secure BNN inference works by up to 29 x and 14 x, respectively.
引用
收藏
页码:10273 / 10286
页数:14
相关论文
共 52 条
[1]   QUOTIENT: Two-Party Secure Neural Network Training and Prediction [J].
Agrawal, Nitin ;
Shamsabadi, Ali Shahin ;
Kusner, Matt J. ;
Gascon, Adria .
PROCEEDINGS OF THE 2019 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'19), 2019, :1231-1247
[2]  
Asharov G., 2013, 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS'13, Berlin, Germany, November 4-8, 2013, P535, DOI [DOI 10.1145/2508859.2516738, 10.1145/2508859.2516738]
[3]   nGraph-HE: A Graph Compiler for Deep Learning on Homomorphically Encrypted Data [J].
Boemer, Fabian ;
Lao, Yixing ;
Cammarota, Rosario ;
Wierzynski, Casimir .
CF '19 - PROCEEDINGS OF THE 16TH ACM INTERNATIONAL CONFERENCE ON COMPUTING FRONTIERS, 2019, :3-15
[4]   Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation [J].
Boyle, Elette ;
Couteau, Geoffroy ;
Gilboa, Niv ;
Ishai, Yuval ;
Kohl, Lisa ;
Rindal, Peter ;
Scholl, Peter .
PROCEEDINGS OF THE 2019 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'19), 2019, :291-308
[5]  
Bulat A., 2020, P ICLR, P1
[6]   Universally composable security: A new paradigm for cryptographic protocols [J].
Canetti, R .
42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, :136-145
[7]   Security and composition of multiparty cryptographic protocols [J].
Canetti, R .
JOURNAL OF CRYPTOLOGY, 2000, 13 (01) :143-202
[8]   EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning [J].
Chandran, Nishanth ;
Gupta, Divya ;
Rastogi, Aseem ;
Sharma, Rahul ;
Tripathi, Shardul .
2019 4TH IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY (EUROS&P), 2019, :496-511
[9]  
Courbariaux M, 2016, Arxiv, DOI arXiv:1602.02830
[10]   EVA: An Encrypted Vector Arithmetic Language and Compiler for Efficient Homomorphic Computation [J].
Dathathri, Roshan ;
Kostova, Blagovesta ;
Saarikivi, Olli ;
Dai, Wei ;
Laine, Kim ;
Musuvathi, Madan .
PROCEEDINGS OF THE 41ST ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '20), 2020, :546-561