Constructing Disjoint Paths for Secure Communication

@inproceedings{Bagchi2003ConstructingDP,
  title={Constructing Disjoint Paths for Secure Communication},
  author={Amitabha Bagchi and Amitabh Chaudhary and Michael T. Goodrich and Shouhuai Xu},
  booktitle={DISC},
  year={2003}
}
We propose a bandwidth-efficient algorithmic solution for perfectly-secure communication in the absence of secure infrastructure. Our solution involves connecting vertex pairs by a set of k edge-disjoint paths (a structure we call a k-system) where k is a parameter determined by the connectivity of the network. This structure is resilient to adversaries with bounded eavesdropping capability. To ensure that bandwidth is efficiently used we consider connection requests as inputs to the kEdge… CONTINUE READING
BETA

Similar Papers

Loading similar papers…