Verifiable Fine-Grained Top-k Queries in Tiered Sensor Networks
Verifiable Fine-Grained Top-k Queries in Tiered Sensor Networks
复制标题
DOI：
10.1109/infcom.2010.5461927
复制
发表时间：
2010-03
期刊：
影响因子：
--
通讯作者：
Rui Zhang;Jing Shi;Yunzhong Liu;Yanchao Zhang
中科院分区：
文献类型：
--
作者：
Rui Zhang;Jing Shi;Yunzhong Liu;Yanchao Zhang
大多数大规模的传感器网络都遵循两层结构，资源贫乏的传感器节点位于下层，资源丰富的主节点位于上层。主节点从传感器节点收集数据，然后代表它们回答来自网络所有者的查询。在恶劣的环境中，主节点可能会被对手破坏，然后被指示返回虚假和/或不完整的数据以响应数据查询。这种应用级攻击比对网络通信的盲目拒绝服务攻击更有害，更难检测，特别是当查询结果是做出军事行动等关键决策的基础时。本文提出了三种方案，网络所有者可以验证的真实性和完整性细粒度的top-k查询结果在疲惫的传感器网络，这是第一次工作。所提出的方案是建立在对称密码原语和强制妥协的主节点返回真实和完整的top-k查询结果，以避免被抓获。详细的理论和定量结果证实了所提出的计划的高功效和效率。
Most large-scale sensor networks are expected to follow a two-tier architecture with resource-poor sensor nodes at the lower tier and resource-rich master nodes at the upper tier. Master nodes collect data from sensor nodes and then answer the queries from the network owner on their behalf. In hostile environments, master nodes may be compromised by the adversary and then instructed to return fake and/or incomplete data in response to data queries. Such application-level attacks are more harmful and difficult to detect than blind DoS attacks on network communications, especially when the query results are the basis for making critical decisions such as military actions. This paper presents three schemes whereby the network owner can verify the authenticity and completeness of fine-grained top-k query results in tired sensor networks, which is the first work of its kind. The proposed schemes are built upon symmetric cryptographic primitives and force compromised master nodes to return both authentic and complete top-k query results to avoid being caught. Detailed theoretical and quantitative results confirm the high efficacy and efficiency of the proposed schemes.