0000000000160895
AUTHOR
Yi Ren
Fast Secure Routing for Highly Mobile Large-Scale Ad-Hoc Vehicular Networks
In highly mobile large-scale vehicular ad-hoc networks, routing protocols must be fast and efficient in terms of low routing discovery delay and communication overhead to support the applications such as car talk. Such requirement becomes more difficult to achieve when inducing security enhancement to tackle the authentication of routing messages. In this paper, we propose a lightweight (fast) secure routing protocol, Secure Proactive Tree-based Routing (SPTR) to hit these two points. SPTR makes use of the characteristics of VANET networks, that is, the traffic originates from or terminates at the gateway or road side unit. SPRT also takes advantages of certificate-less ID-based cryptograph…
MSS: A Multi-Level Data Placement Scheme for Data Survival in Wireless Sensor Networks
In recently popularized unattended wireless sensor networks, sensed data are stored locally or some designated nodes for a long term and retrieved sometime by collectors on demand. Such data may be delete or modified as sensor nodes are always exposed to risks such as random failure and mobile adversary. To maximize the data survival, we propose a secure and efficient scheme - MSS. MSS makes use of hopbounded computational secret sharing to achieve fault tolerance and compromise resilience, and takes advantages of multi-level secret sharing to mitigate communication overhead and improve overall security. MSS has the most advantages in terms of security and efficiency among presented schemes…
Efficient and Lightweight Data Integrity Check in In-Networking Storage Wireless Sensor Networks
In In-networking storage Wireless Sensor Networks, sensed data are stored locally for a long term and retrieved on-demand instead of real-time. To maximize data survival, the sensed data are normally distributively stored at multiple nearby nodes. It arises a problem that how to check and grantee data integrity of distributed data storage in the context of resource constraints. In this paper, a technique called Two Granularity Linear Code (TGLC) that consists of Intra-codes and Inter-codes is presented. An efficient and lightweight data integrity check scheme based on TGLC is proposed. Data integrity can be checked by any one who holds short Inter-codes, and the checking credentials is shor…
Security in Mobile Wireless Sensor Networks – A Survey
Published version of an article in the journal: Journal of Communications. Also available from the publisher at: http://dx.doi.org/10.4304/jcm.6.2.128-142. OA Thanks to recent advances in robotics, sensors and wireless communications, it is feasible to develop a variety of new architectures for Mobile Wireless Sensor Networks (MWSNs) that play an important role in various applications such as battlefield surveillance, harbor monitoring, etc. However, due to the dynamic of mobile network topology in MWSNs, many new security challenges have emerged. In this article, we give a survey on the state of the art technologies in security aspects of MWSNs. We review existing work that provides securi…
Secure, dependable and publicly verifiable distributed data storage in unattended wireless sensor networks
Published version of an article from the journal : Science in China, Series F: Information Sciences. The original publication is available at Spingerlink. http://dx.doi.org/10.1007/s11432-010-0096-7 In unattended wireless sensor networks (UWSNs), sensed data are stored locally or at designated nodes and further accessed by authorized collectors on demand. This paradigm is motivated by certain scenarios where historical or digest data (e.g., average temperature in a day), instead of real-time data, are of interest. The data are not instantly forwarded to a central sink upon sensing, thereby saving communication energy for transmission. Such a paradigm can also improve data survivability by m…
Secure and efficient data storage in unattended wireless sensor networks
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Article also available from publisher: http://dx.doi.org/10.1109/NTMS.2009.5384753 Providing forward and backward secrecy is still a big challenge in Unattended Wireless Sensor Networks (UWSNs), though some storage schemes have been proposed. Additionally, high storage requirement needs efficient storage techniques. In this paper, we propose a novel homomorphic…
HybridS: A Scheme for Secure Distributed Data Storage in WSNs
In unattended wireless sensor networks (WSNs), data is stored locally or at designated nodes upon sensing, and users can access it on demand. This paradigm can improve energy efficiency by making use of the upcoming cheap and large flash memory, as well as system robustness. Nevertheless, the security and dependability of distributed storage are critical for the applicability of such WSNs. In this paper, we propose a secure and dependable data storage scheme by taking advantages of secret sharing and Reed-Solomon code, which has computational security and yet maintains optimal data size. The extensive analysis verifies our scheme can provide secure and dependable data storage in WSNs in the…
A Scheme for Secure and Reliable Distributed Data Storage in Unattended WSNs
Unattended Wireless Sensor Networks (UWSNs) operated in hostile environments face a risk on data security due to the absence of real-time communication between sensors and sinks, which imposes sensors to accumulate data till the next visit of a mobile sink to off-load the data. Thus, how to ensure forward secrecy, backward secrecy and reliability of the accumulated data is a great challenge. For example, if a sensor is compromised, pre-compromise data accumulated in the sensor is exposed to access. In addition, by holding key secrecy of the compromised sensor, attackers also can learn post-compromise data in the sensor. Furthermore, in practical UWSNs, once sensors stop working for accident…
Lightweight Privacy-aware yet Accountable Secure Scheme for SM-SGCC communications in smart grid
Abstract Smart grid is envisioned as a critical application of cyber-physical systems and of the internet of things. In the smart grid, smart meters equipped with wireless sensors can upload meter readings (data) to smart grid control and schedule centers via the advanced metering infrastructure to improve power delivery efficiency. However, data gathered in short intervals, such as 15 minutes, will expose customers' detailed daily activities (for example, when they get up and when they use oven) using nonintrusive appliance load monitoring. Thus, data must be hidden to protect customers' privacy. However, data accountability is still required for emergency responses or to trace back suspec…
An Efficient, Robust, and Scalable Trust Management Scheme for Unattended Wireless Sensor Networks
Unattended Wireless Sensor Networks (UWSNs) are characterized by long periods of disconnected operation and fixed or irregular intervals between visits by the sink. The absence of an online trusted third party, i.e., an on-site sink, makes existing trust management schemes used in legacy wireless sensor networks not applicable to UWSNs directly. In this paper, we propose a trust management scheme for UWSNs to provide efficient, robust and scalable trust data storage. For trust data storage, we employ geographic hash table to efficiently identify data storage nodes and to significantly reduce storage cost. We demonstrate, through detailed analyses and extensive simulations, that the proposed…
A distributed data storage and retrieval scheme in unattended WSNs using Homomorphic Encryption and secret sharing
Many data storage schemes have been proposed in the past for keeping dependable data storage, but they are not designed for Unattended Wireless Sensor Networks (UWSNs). When applying these schemes to UWSNs, most of them have limitations such as high storage requirement, transmission cost, and not resilient to a large number of node compromises. To address the problem of data storage, transmission cost, and resilience of node compromise in UWSNs, we propose a novel Homomorphic Encryption and Homomorphic Secret Sharing based scheme (HEHSS) to accomplish the goals of confidentiality, resilience to node compromises, reliability, and efficiency of storage and transmission. Our scheme exploits th…
H2S: A Secure and Efficient Data Aggregative Retrieval Scheme in Unattended Wireless Sensor Networks
In unattended wireless sensor networks, data are stored locally and retrieved on demand. To efficiently transmit the collector’s retrieval results, data are aggregated along being forwarded. The data confidentiality and integrity should be protected at the intermediate nodes. End-to-end encryption or hop-by-hop encryption based schemes are not efficient. Straightforward homomorphic encryption based scheme is not compromise resilient. To achieve all the desires, we propose a scheme - H2S by making use of both homomorphic secret sharing and homomorphic encryption. The security and efficiency of our scheme are justified by extensive analysis.
An efficient Chinese remainder theorem based node capture resilience scheme for Mobile WSNs
Node capture attack is a critical issue in Mobile WSNs where attacker-controlled replicas may act maliciously. In this paper, we present a novel Chinese remainder theorem based node capture resilience scheme that can be utilized to discover and revoke captured nodes. Moreover, our scheme can limit the ability of captured nodes to further compromise forward security, backward security, and launch collusion attacks. Detailed analysis shows that our scheme indeed achieves the expected design goals.
TBRA: A scalable routing algorithm in highly mobile large scale pure ad hoc wireless mesh networks
In highly mobile pure ad-hoc wireless mesh networks, fast rerouting within low routing discovery delay is a mandatory requirement for routing algorithm to support interactive applications such as VoIP. Also, the communication overhead should be thwarted when networks grow to a large scale. We propose a Tree-Based Routing Algorithm - TBRA to facilitate such two goals. On one hand, TBRA has very low routing discovery delay due to its proactive property. On the other hand, TBRA performs more efficiently than other proactive protocols with respect to low communication overhead, which thanks to its short routing packet length, less numbers and smaller routing table size. Our modeling analysis an…
Proportional and Preemption-Enabled Traffic Offloading for IP Flow Mobility: Algorithms and Performance Evaluation
IP Flow Mobility (IFOM) enables a user equipment to offload data traffic at the IP flow level. Although the procedure of IFOM-based flow offloading has been specified by 3GPP, how many IP flows should be offloaded and when offloading should be performed are not defined. Consequently, IP flows may be routed to a target access network which has a strong signal strength but with backhaul congestion or insufficient access capability. In this paper, we propose two algorithms, referred to as proportional offloading (PO), and proportional and preemption-enabled offloading (PPO), respectively, for IP flow offloading in hybrid cellular and wireless local area networks. The PO algorithm decides an op…
A spatial role-based authorization framework for sensor network-assisted indoor WLANs
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Article also available from publisher: http://dx.doi.org/10.1109/WIRELESSVITAE.2009.5172549 In this paper, we propose a spatial role-based authorization framework which specifies authorization based on both role and location constrains in a wireless local area network with assistance from a sensor network. The framework performs a location-restricted verificati…
SCARKER: A sensor capture resistance and key refreshing scheme for mobile WSNs
How to discover a captured node and to resist node capture attack is a challenging task in Wireless Sensor Networks (WSNs). In this paper, we propose a node capture resistance and key refreshing scheme for mobile WSNs which is based on the Chinese remainder theorem. The scheme is able of providing forward secrecy, backward secrecy and collusion resistance for diminishing the effects of capture attacks. By implementing our scheme on a Sun SPOT based sensor network testbed, we demonstrate that the time for updating a new group key varies from 56 ms to 546 ms and the energy consumption is limited to 16.5–225 mJ, depending on the length of secret keys and the number of sensors in a group.
FoSBaS: A bi-directional secrecy and collusion resilience key management scheme for BANs
Body Area Network (BAN) consists of various types of small physiological sensors, transmission modules and low computational components and can thus form an E-health solution for continuous all-day and any-place health monitoring. To protect confidentiality of collected data, a shared group key is usually deployed in a BAN, and consequently a secure communication group is generated. In this paper, we propose a bi-directional security and collusion resilience key management scheme for BAN, referred to as FoSBaS. Detailed analysis shows that the scheme can provide both forward security and backward security and resist against collusion attacks. Furthermore, the FoSBaS is implemented on a Sun …
BVS: A Lightweight Forward and Backward Secure Scheme for PMU Communications in Smart Grid
In smart grid, phaser measurement units (PMUs) can upload readings to utility centers via supervisory control and data acquisition (SCADA) or energy management system (EMS) to enable intelligent controlling and scheduling. It is critical to maintain the secrecy of readings so as to protect customers' privacy, together with integrity and source authentication for the reliability and stability of power scheduling. In particular, appealing security scheme needs to perform well in PMUs that usually have computational resource constraints, thus designed security protocols have to remain lightweight in terms of computation and storage. In this paper, we propose a family of schemes to solve this p…
Optimized secure and reliable distributed data storage scheme and performance evaluation in unattended WSNs
Unattended Wireless Sensor Networks (UWSNs), characterized by the absence of real-time communication between sensors and sinks, impose sensors to retain data till the next visit of a mobile sink to off-load their data. In such networks, if a sensor is compromised, data accumulated in the sensor are exposed to attackers. In addition, by holding the secret key of the compromised sensor, attackers can also learn post-compromise data accumulated by the sensor. Furthermore, once sensors stop working due to, for instance, node crash or battery depletion, all the accumulated data will be lost. In this paper, we propose a secure and reliable data distribution scheme that addresses these challenges.…