Paper 2023/909
Efficient 3PC for Binary Circuits with Application to Maliciously-Secure DNN Inference
Abstract
In this work, we focus on maliciously secure 3PC for binary circuits with honest majority. While the state-of-the-art (Boyle et al. CCS 2019) has already achieved the same amortized communication as the best-known semi-honest protocol (Araki et al. CCS 2016), they suffer from a large computation overhead: when comparing with the best-known implementation result (Furukawa et al. Eurocrypt 2017) which requires
Note: A full version of paper "Efficient 3PC for Binary Circuits with Application to Maliciously-Secure DNN Inference" (to be appeared at Usenix Security'23).
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Usenix Security'23
- Keywords
- Three-Party ComputationBinary CircuitsSecure DNN Inference
- Contact author(s)
-
liyun19 @ mails tsinghua edu cn
duanyufi @ foxmail com
zhicong hzc @ alibaba-inc com
vince hc @ antgroup com
chaoz @ tsinghua edu cn
yfsong @ mail tsinghua edu cn - History
- 2023-06-13: last of 2 revisions
- 2023-06-12: received
- See all versions
- Short URL
- https://ia.cr/2023/909
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/909, author = {Yun Li and Yufei Duan and Zhicong Huang and Cheng Hong and Chao Zhang and Yifan Song}, title = {Efficient {3PC} for Binary Circuits with Application to Maliciously-Secure {DNN} Inference}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/909}, year = {2023}, url = {https://eprint.iacr.org/2023/909} }