TY - UNPB
T1 - Perfectly Secure Communication, based on Graph-Topological Addressing in Unique-Neighborhood Networks
AU - Rass, Stefan
PY - 2023/1
Y1 - 2023/1
N2 - We consider network graphs G=(V,E) in which adjacent nodes share common secrets. In this setting, certain techniques for perfect end-to-end security (in the sense of confidentiality, authenticity (implying integrity) and availability, i.e., CIA+) can be made applicable without end-to-end shared secrets and without computational intractability assumptions. To this end, we introduce and study the concept of a unique-neighborhood network, in which nodes are uniquely identifiable upon their graph-topological neighborhood. While the concept is motivated by authentication, it may enjoy wider applicability as being a technology-agnostic (yet topology aware) form of addressing nodes in a network.
AB - We consider network graphs G=(V,E) in which adjacent nodes share common secrets. In this setting, certain techniques for perfect end-to-end security (in the sense of confidentiality, authenticity (implying integrity) and availability, i.e., CIA+) can be made applicable without end-to-end shared secrets and without computational intractability assumptions. To this end, we introduce and study the concept of a unique-neighborhood network, in which nodes are uniquely identifiable upon their graph-topological neighborhood. While the concept is motivated by authentication, it may enjoy wider applicability as being a technology-agnostic (yet topology aware) form of addressing nodes in a network.
UR - http://arxiv.org/abs/1810.05602
M3 - Preprint
T3 - arXiv.org
BT - Perfectly Secure Communication, based on Graph-Topological Addressing in Unique-Neighborhood Networks
PB - arxiv.org
ER -