VNet拓扑提取的请求复杂度:基于字典的攻击
Request Complexity of VNet Topology Extraction: Dictionary-Based Attacks
摘要:
网络虚拟化范例设想了一种互联网,其中任意虚拟网络(VNet)可以被指定并嵌入在共享基底(例如,物质基础设施)。由于VNet可以在很短的时间内被请求,并且仅在期望的时间段内被请求,因此该范例实现了灵活的服务部署和高效的资源利用。本文探讨了这种架构的安全性影响。我们考虑一个简单的模型,攻击者试图提取秘密信息的基板拓扑结构,通过发出重复的VNet嵌入请求。我们提出了一个通用的框架,利用VNet嵌入关系的基本属性来推断整个拓扑结构。我们的框架是基于一个图形主题字典适用于各种图形类。此外,我们还提供了请求复杂度的上限,即攻击者成功所需的请求数量。
英文摘要:
The network virtualization paradigm envisions an Internet where arbitrary virtual networks (VNets) can be specified and embedded over a shared substrate (e.g., the physical infrastructure). As VNets can be requested at short notice and for a desired time period only, the paradigm enables a flexible service deployment and an efficient resource utilization. This paper investigates the security implications of such an architecture. We consider a simple model where an attacker seeks to extract secret information about the substrate topology, by issuing repeated VNet embedding requests. We present a general framework that exploits basic properties of the VNet embedding relation to infer the entire topology. Our framework is based on a graph motif dictionary applicable for various graph classes. Moreover, we provide upper bounds on the request complexity, the number of requests needed by the attacker to succeed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。