Parallel Privacy-preserving Computation of Minimum Spanning Trees

Mohammad Anagreh, Mohammad Anagreh, Eero Vainikko, Peeter Laud

2021

Abstract

In this paper, we propose a secret sharing based secure multiparty computation (SMC) protocol for computing the minimum spanning trees in dense graphs. The challenges in the design of the protocol arise from the necessity to access memory according to private addresses, as well as from the need to reduce the round complexity. In our implementation, we use the single-instruction-multiple-data (SIMD) operations to reduce the round complexity of the SMC protocol; the SIMD instructions reduce the latency of the network among the three servers of the SMC platform. We present a state-of-the-art parallel privacy-preserving minimum spanning tree algorithm which is based on Prim’s algorithm for finding a minimum spanning tree (MST) in dense graphs. Performing permutation of the graph with sharemind to be able to perform the calculation of the MST on the shuffled graph outside the environment. We compare our protocol to the state of the art and find that its performance exceeds the existing protocols when being applied to dense graphs.

Paper Citation

in Harvard Style

Anagreh M., Vainikko E. and Laud P. (2021). Parallel Privacy-preserving Computation of Minimum Spanning Trees.In Proceedings of the 7th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP, ISBN 978-989-758-491-6, pages 181-190. DOI: 10.5220/0010255701810190

in Bibtex Style

@conference{icissp21,
author={Mohammad Anagreh and Eero Vainikko and Peeter Laud},
title={Parallel Privacy-preserving Computation of Minimum Spanning Trees},
booktitle={Proceedings of the 7th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,},
year={2021},
pages={181-190},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010255701810190},
isbn={978-989-758-491-6},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 7th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,
TI - Parallel Privacy-preserving Computation of Minimum Spanning Trees
SN - 978-989-758-491-6
AU - Anagreh M.
AU - Vainikko E.
AU - Laud P.
PY - 2021
SP - 181
EP - 190
DO - 10.5220/0010255701810190