Cryptanalysis of block cipher Piccolo suitable for cloud computing

In this paper, we evaluate the security of lightweight block cipher Piccolo suitable for cloud computing against biclique cryptanalysis. Our attacks on Piccolo-80/128 require computational complexities of 2^79.13 and 2^127.35, respectively. These results are superior to known biclique cryptanalytic results on them.     

Chaos block cipher for wireless sensor network

New block cipher algorithm in single byte for wireless sensor network with excellence of many cipher algorithms is studied. The child keys are generated through the developed discrete Logistic mapping, and the Feistel encrypting function with discrete chaos operation is constructed. The single byte block is encrypted and decrypted through one turn permutation, being divided into two semi-byte, quadri- Feistel structural operation, and one turn permutation again. The amount of keys may be variable with the turns of Feistel structural operation. The random and security of the child key was proven, and the experiment for the block cipher in wireless sensor network was completed. The result indicates that the algorithm is more secure and the chaos block cipher in single byte is feasible for wireless sensor network.     

无线传感器网络的安全认证协议研究

在对现有无线传感器网络公钥认证机制进行研究的基础上,提出了一种新的基于椭圆曲线公钥算法的部分分布式认证协议PDAP(partly distributed authentication protocol).在协议中,综合采用了门限秘密共享及证书合成的思想,将数字证书应用于无线传感器网络.同时,针对传感器节点计算能力、存储空间和能量有限的特点,对传统X.509证书的结构重新设计,通过重构的数字证书实现了节点的分布式认证.分析结果表明,该协议能够满足资源有限的无线传感器网络的安全性要求.     

Biclique cryptanalysis on lightweight block cipher: HIGHT and Piccolo

Biclique cryptanalysis is an attack that improves the computational complexity by finding a biclique which is a kind of bipartite graph. We present a single-key full-round attack of lightweight block ciphers, HIGHT and Piccolo by using biclique cryptanalysis. In this paper, a 9-round biclique is constructed for HIGHT and a 4-round biclique for Piccolo. These new bicliques are used to recover secret keys for the full rounds of HIGHT, Piccolo-80 and Piccolo-128, the computational complexity of 2^125.93, 2^79.34 and 2^127.36, respectively. The computational complexity of attacking HIGHT by a biclique cryptanalysis is reduced from 2^126.4. This is the first full-round attack on both Piccolo-80 and Piccolo-128.     

基于无线传感器网络的分组加密算法的设计

为了适应传感器网络的发展,应对传感器节点计算能力和存储资源的限制,基于无线传感器网的WSW(Wireless Sensor Whisper,无线传感耳语算法)算法是一种专门针对传感器能力限制而提出的分组加密算法。WSW算法通过扩展基本逻辑运算获得256种不同的加密方式,同时通过在算法中引入随机选择算法来增强算法的安全性,该算法使用的加密方法和随机选择可以减少节点运算次数,使得节点数据保证安全的同时能量及时间消耗也尽可能减少。     

Quality-of-service trade-off analysis for wireless sensor networks

Quality of Service (QoS) support for wireless sensor networks (WSN) is a fairly new topic that is gaining more and more interest. This paper introduces a method for determining the node configurations of a WSN such that application-level QoS constraints are met. This is a complex task, since the search space is typically extremely large. The method is based on a recent algebraic approach to Pareto analysis, that we use to reason about QoS trade-offs. It features an algorithm that keeps the working set of possible configurations small, by analysing parts of the network in a modular fashion, and meanwhile discarding configurations that are inferior to other configurations. Furthermore, we give WSN models for two different applications, spatial mapping and target tracking, in which QoS trade-offs are made explicit. Test results for these applications and a heterogeneous WSN combining these two applications show that the models are accurate and that the method is scalable and thus practically usable for WSN, even with large numbers of nodes. Details are given on how to efficiently implement the algorithm.     

Security analysis of the full-round DDO-64 block cipher

DDO-64 is a 64-bit Feistel-like block cipher based on data-dependent operations (DDOs). It is composed of 8 rounds and uses a 128-bit key. There are two versions of DDO-64, named DDO-64V₁ and DDO-64V₂, according to the key schedule. They were designed under an attempt for improving the security and performance of DDP-based ciphers. In this paper, however, we show that like most of the existing DDP-based ciphers, DDO-64V₁ and DDO-64V₂ are also vulnerable to related-key attacks. The attack on DDO-64V₁ requires 2^35.5 related-key chosen plaintexts and 2^63.5 encryptions while the attack on DDO-64V₂ only needs 8 related-key chosen plaintexts and 2³¹ encryptions; our attacks are both mainly due to their simple key schedules and structural weaknesses. These works are the first known cryptanalytic results on DDO-64V₁ and DDO-64V₂ so far.     

一种异构传感器网络时间同步的安全性研究

分布式时间同步技术是无线传感器网络（WSNs）应用中的一项重要支撑技术,保证时间同步的安全性至关重要。针对敌对异构网络环境,通过利用存储有高能量的高级传感器,提出了一种高效的异构WSNs时间同步安全方案。Tmote传感器节点实验表明：该方案比现有的同步方案更能有效提高同步精度,减少通信开销和抵御网络的多种攻击。     

Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks

This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delay-tolerant wireless sensor networks (DTWSN). These networks inherit their characteristics from both delay tolerant networks (DTN) and traditional wireless sensor networks. After introducing DTWSNs, three main problems in the design space of these networks are discussed: routing, data gathering, and neighbor discovery. A general protocol is proposed for DTWSNs based on opportunistic broadcasting in delay-tolerant networks with radio device on-off periods. Three performance measures are defined in the study: the energy for sending queries to ask for data from possible neighbors (querying energy), data transfer energy, and absorption time (delay). A simple yet accurate approximation for the data-transfer energy is proposed. An analytic model is provided to evaluate the querying energy per contact (epc). Simulation results for the data propagation delay show that the querying energy per contact measure obtained from the analytic model is proportional to the product of the querying energy and the delay. A practical rule of thumb for an optimal query interval in terms of delay and energy is derived from different parts of the study.     

Energy-efficient bootstrapping for wireless sensor networks

Wireless sensor networks are poised for increasingly wider uses in many military and civil applications. Such applications has stimulated research in a number of research areas related to energy conservation in such networks. Most such research focuses on energy saving in tasks after the network has been organized. Very little attention has been paid to network bootstrapping as a possible phase where energy can be saved. Bootstrapping is the phase in which the entities in a network are made aware of the presence of all or some of the other entities in the network. This paper describes a bootstrapping protocol for a class of sensor networks consisting of a mix of low-energy sensor nodes and a small number of high-energy entities called gateways. We propose a new approach, namely the slotted sensor bootstrapping (SSB) protocol, which focuses on avoiding collisions in the bootstrapping phase and emphasizes turning off node radio circuits whenever possible to save energy. Our mechanism synchronizes the sensor nodes to the gateway’s clock so that time-based communication can be used. The proposed SSB protocol tackles the issue of node coverage in scenarios, when physical device limitations and security precautions prevent some sensor nodes from communicating with the gateways. Additionally, we present an extension of the bootstrapping protocol, which leverages possible gateway mobility.     

无线传感器网络的RSSI定位技术研究

在许多无线传感器网络应用中,定位已经成为一个基本的服务需求.分析了基于接收信号强度(RSS)测量模型的位置估计,详细地推导了单个盲节点位置的概率密度函数并分析两个盲节点位置的概率分布的关系,通过该模型的极大似然估计可以得出盲节点位置,而且在此基础上修正了该定位估计算法,使得系统中盲节点越多其估计位置的精度越高,最后通过有效的仿真验证了算法.     

无线传感器网络中基于位置信息的路由算法研究

为了保证移动无线传感器网络中数据的高效稳定传输,提出了一种基于地理位置信息支持多个移动sink的路由算法.该算法将监测区域分成一个固定不变的规则网格网络,并对网格簇头节点的选举方法进行了改进;通过数据的冗余传递和搜索框、候选转发节点集合的设置保证了数据传送的可靠性与时延性;同时容忍圆的引入保证了低功耗的要求.仿真结果表明,该算法较两层数据分发协议有更高的传输可靠性和较低的功耗.     

Energy-saving models for wireless sensor networks

Nowadays, wireless sensor networks are being used for a fast-growing number of different application fields (e.g., habitat monitoring, highway traffic monitoring, remote surveillance). Monitoring (i.e., querying) the sensor network entails the frequent acquisition of measurements from all sensors. Since sensor data acquisition and communication are the main sources of power consumption and sensors are battery-powered, an important issue in this context is energy saving during data collection. Hence, the challenge is to extend sensor lifetime by reducing communication cost and computation energy. This paper thoroughly describes the complete design, implementation and validation of the SeReNe framework. Given historical sensor readings, SeReNe discovers energy-saving models to efficiently acquire sensor network data. SeReNe exploits different clustering algorithms to discover spatial and temporal correlations which allow the identification of sets of correlated sensors and sensor data streams. Given clusters of correlated sensors, a subset of representative sensors is selected. Rather than directly querying all network nodes, only the representative sensors are queried by reducing the communication, computation and power costs. Experiments performed on both a real sensor network deployed at the Politecnico di Torino labs and a publicly available dataset from Intel Berkeley Research lab demonstrate the adaptability and the effectiveness of the SeReNe framework in providing energy-saving sensor network models.     

无线传感器网络的覆盖控制

覆盖控制作为无线传感器网络中的一个基本问题,在国内外已经取得了一些研究成果。根据不同的性质,覆盖控制问题可以划分为不同的类型(如,静态覆盖和动态覆盖、确定性覆盖和随机性覆盖)。主要针对静态覆盖(区域覆盖、点覆盖、栅栏覆盖)问题中一些典型算法,分类进行了描述,并比较了它们之间的优缺点,最后,指出了需要进一步的研究工作。     

一种无线传感器网络链式传输分簇路由协议

由于周围环境对无线传感器网络(WSNs)的影响,在布设到特殊环境下时会产生信号的衰减与损耗,导致通信不畅。针对此问题,提出一种以LEACH路由协议为基础适应特殊环境(长直空间)的新型路由算法。本算法采用链式传输,即从内部逐一将信号传输给距空间最外端且距基站位置较近的簇头,克服了内部节点死亡过快的问题。同时簇内采用链式传输并且改进簇头阈值与成簇半径,减小了能量消耗,提高了稳定性,克服了LEACH算法的不足。     

新型无线传感器网络

基于ZigBee技术,并采用星型网络拓扑结构与STOP工作模式,提出了一种新型无线传感器网络,不仅降低了每个传感器节点的功耗、延长了传感器节点的寿命,而且加入了循环冗余校验CRC机制和加密算法,从而更好地增加了系统的可靠性及安全性。