0000000000160896
AUTHOR
Wei Ren
showing 10 related works from this author
Fast Secure Routing for Highly Mobile Large-Scale Ad-Hoc Vehicular Networks
2009
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
2009
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
2009
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…
Secure, dependable and publicly verifiable distributed data storage in unattended wireless sensor networks
2010
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…
HybridS: A Scheme for Secure Distributed Data Storage in WSNs
2008
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…
Viewpoint: Atomic-Scale Design Protocols toward Energy, Electronic, Catalysis, and Sensing Applications
2019
Nanostructured materials are essential building blocks for the fabrication of new devices for energy harvesting/storage, sensing, catalysis, magnetic, and optoelectronic applications. However, because of the increase of technological needs, it is essential to identify new functional materials and improve the properties of existing ones. The objective of this Viewpoint is to examine the state of the art of atomic-scale simulative and experimental protocols aimed to the design of novel functional nanostructured materials, and to present new perspectives in the relative fields. This is the result of the debates of Symposium I "Atomic-scale design protocols towards energy, electronic, catalysis…
Lightweight Privacy-aware yet Accountable Secure Scheme for SM-SGCC communications in smart grid
2011
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…
H2S: A Secure and Efficient Data Aggregative Retrieval Scheme in Unattended Wireless Sensor Networks
2009
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.
TBRA: A scalable routing algorithm in highly mobile large scale pure ad hoc wireless mesh networks
2009
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…
BVS: A Lightweight Forward and Backward Secure Scheme for PMU Communications in Smart Grid
2011
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…