all InfoSec news
A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem. (arXiv:2207.07964v1 [cs.CR])
July 19, 2022, 1:20 a.m. | Mohammad Anagreh, Peeter Laud
cs.CR updates on arXiv.org arxiv.org
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, but their length is private. The protocol works in
the Arithmetic Black Box (ABB) model on top of the separator tree of the graph,
achieving good time complexity if the subgraphs of the graph have small
separators (which is the case for e.g. planar graphs); the achievable
parallelism is significantly higher than that of …
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Security Architect - Hardware
@ Intel | IND - Bengaluru
Elastic Consultant
@ Elastic | Spain
OT Cybersecurity Specialist
@ Emerson | Abu Dhabi, United Arab Emirates
Security Operations Program Manager
@ Kaseya | Miami, Florida, United States
Senior Security Operations Engineer
@ Revinate | Vancouver