Secure Top- $k$ Query Processing in Unattended Tiered Sensor Networks
Secure Top- $k$ Query Processing in Unattended Tiered Sensor Networks
复制标题
DOI：
10.1109/tvt.2014.2312014
复制
发表时间：
2014-11
影响因子：
6.8
通讯作者：
Rui Zhang;Jing Shi;Yanchao Zhang;Xiaoxia Huang
中科院分区：
文献类型：
--
作者：
Rui Zhang;Jing Shi;Yanchao Zhang;Xiaoxia Huang
许多未来的大规模无人值守传感器网络（USNs）预计将遵循两层结构，资源贫乏的传感器节点在下层，资源丰富的主节点在上层。主节点从传感器节点收集数据，然后代表它们回答来自网络所有者的查询。在敌对环境中，主节点和传感器节点可能会受到对手的攻击，并在响应数据查询时返回错误的数据。这种应用程序级攻击比对网络通信的盲目拒绝服务攻击更有害，更难检测，特别是当查询结果是关键决策的基础时。本文提出了一套新的计划，使可验证的top-k查询处理在统一序列号，这是第一次工作。所提出的方案是建立在对称密码原语，使网络所有者能够检测到任何不正确的top-k查询结果。详细的理论和仿真结果证实了所提出的方案的高效性和效率。
Many future large-scale unattended sensor networks (USNs) are expected to follow a two-tier architecture with resource-poor sensor nodes at the lower tier and fewer 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 and sensor nodes may be compromised by the adversary and return incorrect data in response to data queries. Such application-level attacks are more harmful and difficult to detect than blind denial-of-service attacks on network communications, particularly when the query results are the basis for critical decision making. This paper presents a suite of novel schemes to enable verifiable top-k query processing in USNs, which is the first work of its kind. The proposed schemes are built upon symmetric cryptographic primitives and enable the network owner to detect any incorrect top-k query results. Detailed theoretical and simulation results confirm the high efficacy and efficiency of the proposed schemes.