loading
Papers Papers/2020

Research.Publish.Connect.

Paper

Authors: Mohammad Anagreh 1 ; 2 ; Eero Vainikko 2 and Peeter Laud 1

Affiliations: 1 Cybernetica, Mäealuse 2/1, Tallinn, Estonia ; 2 Institute of Computer Science, University of Tartu, Narva maantee 18, Tartu, Estonia

Keyword(s): Privacy-preserving Computation, Multi-party Computation (SMC), Single-Instruction-Multiple-Data (SIMD), Protocol of Reading Private Array, Prim’s Algorithm, Minimum Spanning Tree, Sharemind.

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 pr otocols when being applied to dense graphs. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.206.14.36

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 - ICISSP, ISBN 978-989-758-491-6; ISSN 2184-4356, pages 181-190. DOI: 10.5220/0010255701810190

@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 - ICISSP,},
year={2021},
pages={181-190},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010255701810190},
isbn={978-989-758-491-6},
issn={2184-4356},
}

TY - CONF

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