Privacy-preserving Parallel Computation of Shortest Path Algorithms with Low Round Complexity

Mohammad Anagreh, Mohammad Anagreh, Peeter Laud, Eero Vainikko

2022

Abstract

Reducing the round complexity in secure multiparty computation (SMC) protocols is a worthy goal due to the latency of the network. The SIMD approach is considered an efficient strategy to reduce the round complexity of an SMC protocol. This paper studies the secure multiparty computation (SMC) protocol for the shortest path problem in sparse and dense graphs, building upon the breadth-first search algorithm. The sensitivity of operations in processing the algorithms led us to produce two different structural algorithms for computing the shortest path. We present state-of-the-art parallel privacy-preserving shortest path algorithms for weighted and unweighted graphs based on the breadth-first search. We have implemented the proposed algorithms on top of the Sharemind SMC protocol set and tested it for different graphs, dense and sparse, represented as the adjacency matrix.

Paper Citation

in Harvard Style

Anagreh M., Laud P. and Vainikko E. (2022). Privacy-preserving Parallel Computation of Shortest Path Algorithms with Low Round Complexity. In Proceedings of the 8th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP, ISBN 978-989-758-553-1, pages 37-47. DOI: 10.5220/0010775700003120

in Bibtex Style

@conference{icissp22,
author={Mohammad Anagreh and Peeter Laud and Eero Vainikko},
title={Privacy-preserving Parallel Computation of Shortest Path Algorithms with Low Round Complexity},
booktitle={Proceedings of the 8th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,},
year={2022},
pages={37-47},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010775700003120},
isbn={978-989-758-553-1},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 8th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,
TI - Privacy-preserving Parallel Computation of Shortest Path Algorithms with Low Round Complexity
SN - 978-989-758-553-1
AU - Anagreh M.
AU - Laud P.
AU - Vainikko E.
PY - 2022
SP - 37
EP - 47
DO - 10.5220/0010775700003120