Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths: (Extended Abstract)

Yefim Dinitz, Shlomi Dolev, Manish Kumar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The shortest secure path (routing) problem in communication networks has to deal with multiple attack layers e.g., man-in-the-middle, eavesdropping, packet injection, packet insertion, etc. Consider different probabilities for each such attack over an edge, probabilities that can differ across edges. Furthermore, a usage of a single shortest paths (for routing) implies possible traffic bottleneck, which should be avoided if possible, which we term pathneck security avoidance. Finding all Pareto–optimal solutions for the multi-criteria single-source single-destination shortest secure path problem with non-negative edge lengths might yield a solution with an exponential number of paths. In the first part of this paper, we study specific settings of the multi-criteria shortest secure path problem, which are based on prioritized multi-criteria and on k-shortest secure paths. In the second part, we show a polynomial-time algorithm that, given an undirected graph G and a pair of vertices (s, t), finds prioritized multi-criteria 2-disjoint (vertex/edge) shortest secure paths between s and t. In the third part of the paper, we introduce the k-disjoint all-criteria-shortest secure paths problem, which is solved in time O(min (k| E|, | E|3 / 2) ).

Original languageEnglish GB
Title of host publicationCyber Security Cryptography and Machine Learning - 5th International Symposium, CSCML 2021, Proceedings
EditorsShlomi Dolev, Oded Margalit, Benny Pinkas, Alexander Schwarzmann
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages9
ISBN (Print)9783030780852
StatePublished - 1 Jan 2021
Event5th International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2021 - Be'er Sheva, Israel
Duration: 8 Jul 20219 Jul 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12716 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2021
CityBe'er Sheva


  • Disjoint shortest paths
  • k-shortest paths
  • Multi-criteria
  • Path selection
  • Shortest secure path

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths: (Extended Abstract)'. Together they form a unique fingerprint.

Cite this