most citedA Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CR2022★ 1 cited

A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem

Mohammad Anagreh, Peeter Laud

In this paper, we present a secure multiparty computation (SMC) protocol for single-source shortest distances (SSSD) in undirected graphs, where the location of edges is public, bu…