Abstract
For the privacy-preserving computation of multi-source large scale data sets, the secure multi-party computation protocol with high-throughput is of the utmost importance. However, the existing high-throughput secure multi-party protocols only involve the fixed 3-party or 4-party setting, limiting its practicality. To achieve a high-throughput n-party (n ≥ 3) secure protocol, low communication and simple computation are two major issues to be considered, which can be used to reduce network load and increase concurrency processing. In this paper, we design a secure multi-party multiplication protocol with only a single round interaction and simple computation by using replicated sharing, which is generated according to the partition of all cross-terms in the sharing-based multiplication operation. Furthermore, in order to implement the optimal communication for each round, we model all cross-terms of the sharing-based multiplication operation as a bipartite graph, and propose a bipartite graph partitioning algorithm. Due to the bipartite graph model, the optimal partition of the cross-terms can be reduced to partition the bipartite graph into n independent subgraphs with the least number of vertices in each subgraph. Finally, the evaluation results show the proposed protocol is both low communication and simple computation. In the case of the 4-party setting Boolean circuits, it only needs to send 1.5 bits and carry out 4 AND and 3 XOR operations on average per AND gate for each party, and achieving a rate of over 0.65 million AES per second.
Similar content being viewed by others
References
Ben-Or M, Goldwasser S, Wigderson A (1988) In: Proceedings of the twentieth annual ACM symposium on Theory of computing. ACM, pp 1–10
Goldwasser S (1987) In: Proceedings of the Nineteenth Annual ACM STOC’87, pp 218–229
Yao A C (1982) In: 23rd annual symposium on foundations of computer science (sfcs 1982). IEEE, pp 160–164
Demmler D, Schneider T, Zohner M (2015) In: Annual Network and Distributed System Security Symposium (NDSS’15). IEEE, pp 8–11
Mohassel P, Rindal P (2018) In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. ACM, pp 35–52
Mohassel P, Zhang Y (2017) In: 2017 IEEE Symposium on Security and Privacy (SP). IEEE, pp 19–38
Cho H, Wu D J, Berger B (2018) Nat Biotechnol 36(6):547
Jagadeesh K A, Wu D J, Birgmeier J A, Boneh D, Bejerano G (2017) Science 357 (6352):692–695
Araki T, Furukawa J, Lindell Y, Nof A, Ohara K (2016) In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. ACM, pp 805–817
Chaudhari H, Choudhury A, Patra A, Suresh A (2019) IACR Cryptol ePrint Arch 2019:429
Furukawa J, Lindell Y, Nof A, Weinstein O (2017) In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, pp 225–255
Araki T, Barak A, Furukawa J, Lichter T, Lindell Y, Nof A, Ohara K, Watzman A, Weinstein O (2017) In: 2017 IEEE Symposium on Security and Privacy (SP). IEEE, pp 843–862
Boyle E, Gilboa N, Ishai Y, Nof A (2019) In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp 869–886
Ohara K, Watanabe Y, Iwamoto M, Ohta K (2019) IEICE Trans Fundam Electron Commun Comput Sci 102(9):1079–1090
Gordon S D, Ranellucci S, Wang X (2018) In: International Conference on the Theory and Application of Cryptology and Information Security. Springer, pp 59–85
Chaudhari H, Rachuri R, Suresh A (2020) In: 27th Annual Network and Distributed System Security Symposium, NDSS, pp 23–26
Yoshida M, Obana S (2018) IEEE Trans Inf Theory 65(5):3233–3245
Barkol O, Ishai Y, Weinreb E (2010) J Cryptol 23(4):580–593
Liu M, Xiao L, Zhang Z (2007) IEEE Trans Inf Theory 53(11):3973–3978
Ben-David A, Nisan N, Pinkas B (2008) In: Proceedings of the 15th ACM conference on Computer and communications security. ACM, pp 257–266
Choi S G, Hwang K-W, Katz J, Malkin T, Rubenstein D (2012) In: Cryptographers’ Track at the RSA Conference. Springer, pp 416–432
Ben-Efraim A, Lindell Y, Omri E (2016) In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. ACM, pp 578–590
Wang X, Ranellucci S, Katz J (2017) In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM, pp 39–56
Lindell Y, Nof A (2017) In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM, pp 259–276
Chida K, Genkin D, Hamada K, Ikarashi D, Kikuchi R, Lindell Y, Nof A (2018) In: Annual International Cryptology Conference. Springer, pp 34–64
Damgård I, Pastro V, Smart N, Zakarias S (2012) In: Annual Cryptology Conference. Springer, pp 643–662
Damgård I, Escudero D, Frederiksen T, Keller M, Scholl P, Volgushev N (2019) In: 2019 IEEE Symposium on Security and Privacy (SP). IEEE, pp 1102–1120
Cramer R, Damgård I, Escudero D, Scholl P, Xing C (2018) In: Shacham H, Boldyreva, A (eds) Advances in Cryptology – CRYPTO 2018. Springer International Publishing, Cham, pp 769–798
Cramer R, Damgård I, Ishai Y (2005) In: Theory of Cryptography Conference. Springer, pp 342–362
Canetti R (2001) In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science. IEEE, pp 136–145
Chartrand G (1977) Introductory graph theory. Courier Corporation
Kushilevitz E, Lindell Y, Rabin T (2010) SIAM J Comput 39(5):2090–2112
Canetti R (2000) . J Cryptol 13(1):143–202
Goldreich O (2009) Foundations of cryptography: volume 2, basic applications. Cambridge University Press
Wang X emp-toolkit. https://github.com/emp-toolkit
Acknowledgements
This work is supported by the Natural Science Foundation of China (No. U1836205, 61662009, 61772008, 11761020), Guizhou-Science-Contract- Foundation [2019]1249, Guizhou-Science-Contract-Foundation [2020]1Y421, the Youth Science and Technology Talents Growth Project of the Guizhou Provincial Department of Education [Guizhou-Education-Contract-KY-Word [2018]260]. The Project of Innovative Group in Guizhou Education Department ([2013]09), The Science and Technology Program of Guizhou Province (Guizhou-Science-Contract-Major-Program [2018]3001, Guizhou-Science-Contract- Major-Program [2018]3007, Guizhou-Science-Contract-Major-Program [2017]3002, Guizhou-Science-Contract-Support [2019]2004, Guizhou-Science- Contract-Support [2018]2162, Guizhou-Science-Contract-Support [2018]2159, Guizhou-Science-Contract-Foundation [2019]1049, and Guizhou-Science- Contract-Foundation [2017]1045, Guizhou-Science-Contract-Platform-Talent [2020]5017), and the 13th Five-Year National Cryptography Development Foundation (No. MMJJ20170129), Research Fund Project for Graduate Students of Guizhou Province (KYJJ2017005), Guizhou-Science-Contract-Foundation [2016]1116.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This article belongs to the Topical Collection: Special Issue on Privacy-Preserving Computing
Guest Editors: Kaiping Xue, Zhe Liu, Haojin Zhu, Miao Pan and David S.L. Wei
Rights and permissions
About this article
Cite this article
Xu, Y., Peng, C., Tan, W. et al. High-throughput secure multiparty multiplication protocol via bipartite graph partitioning. Peer-to-Peer Netw. Appl. 14, 1414–1430 (2021). https://doi.org/10.1007/s12083-020-01035-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12083-020-01035-9