Next Article in Journal
Towards Accurate Run-Time Hardware-Assisted Stealthy Malware Detection: A Lightweight, yet Effective Time Series CNN-Based Approach
Previous Article in Journal
A Fault Attack on the Family of Enocoro Stream Ciphers
Article

Parallel Privacy-Preserving Shortest Path Algorithms

1
Institute of Computer Science, University of Tartu, Narva Mnt. 18, 51009 Tartu, Estonia
2
Cybernetica AS, Mäealuse 2/1, 12618 Tallinn, Estonia
*
Author to whom correspondence should be addressed.
Academic Editor: Josef Pieprzyk
Cryptography 2021, 5(4), 27; https://doi.org/10.3390/cryptography5040027
Received: 14 August 2021 / Revised: 20 September 2021 / Accepted: 7 October 2021 / Published: 14 October 2021
In this paper, we propose and present secure multiparty computation (SMC) protocols for single-source shortest distance (SSSD) and all-pairs shortest distance (APSD) in sparse and dense graphs. Our protocols follow the structure of classical algorithms—Bellman–Ford and Dijkstra for SSSD; Johnson, Floyd–Warshall, and transitive closure for APSD. As the computational platforms offered by SMC protocol sets have performance profiles that differ from typical processors, we had to perform extensive changes to the structure (including their control flow and memory accesses) and the details of these algorithms in order to obtain good performance. We implemented our protocols on top of the secret sharing based protocol set offered by the Sharemind SMC platform, using single-instruction-multiple-data (SIMD) operations as much as possible to reduce the round complexity. We benchmarked our protocols under several different parameters for network performance and compared our performance figures against each other and with ones reported previously. View Full-Text
Keywords: single-source shortest distance (SSSD); all-pairs shortest distance (APSD); multi-party computation (MPC); single-instruction-multiple-data (SIMD); oblivious memory access; Sharemind single-source shortest distance (SSSD); all-pairs shortest distance (APSD); multi-party computation (MPC); single-instruction-multiple-data (SIMD); oblivious memory access; Sharemind
Show Figures

Figure 1

MDPI and ACS Style

Anagreh, M.; Laud, P.; Vainikko, E. Parallel Privacy-Preserving Shortest Path Algorithms. Cryptography 2021, 5, 27. https://doi.org/10.3390/cryptography5040027

AMA Style

Anagreh M, Laud P, Vainikko E. Parallel Privacy-Preserving Shortest Path Algorithms. Cryptography. 2021; 5(4):27. https://doi.org/10.3390/cryptography5040027

Chicago/Turabian Style

Anagreh, Mohammad, Peeter Laud, and Eero Vainikko. 2021. "Parallel Privacy-Preserving Shortest Path Algorithms" Cryptography 5, no. 4: 27. https://doi.org/10.3390/cryptography5040027

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop