Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
Articles by Zhiqiang Ruan
Total Records ( 7 ) for Zhiqiang Ruan
  Zhiqiang Ruan , Xingming Sun , Wei Liang , Decai Sun and Zhihua Xia
  In this study, we focus on design efficient security techniques to maximize chances of data survival in wireless sensor networks, which involve disconnected or unattended operation with periodic visited by the sink, we refer to such networks as UWSNs. Data security in such UWSNs poses a number of challenges when applied in security-sensitive environments. First, sensors must accumulate data for a long time until it can be off loaded to a periodic sink. The adversary has lots of time to mount various attacks that aim to learn, erase, or modify potentially valuable data collected and held by sensors. Second, there is no ever-present sink, thus real time detection dose not help and the adversary can reach its goal and remain undetected. To address these security problems, we present CADS, a novel Co-operative and Anti-fraud Data Storage scheme for UWSNs by integrating the techniques of secret sharing and Discrete Logarithm Problem (DLP). We first propose a share generation and distributed scheme to achieve reliable and fault-tolerant initial data storage by providing redundancy for original data components, we then utilize discrete logarithm problem to ensure the integrity of the distributed data shares. The proposed scheme enables individual sensors to verify all the related data shares simultaneously in the absence of the original data in each round. Security analysis and simulations show that the proposed scheme has resistance against node capture attacks and outperforms existing security scheme in terms of data survival quantity and false negative probability.
  Heng Ren , Xingming Sun , Zhiqiang Ruan and Baowei Wang
  In this study, we aim to design an efficient scheme against node capture attacks using secure pairwise key in Wireless Sensor Networks (WSNs). Prior pairwise key establishment schemes based on random key pre-distribution are vulnerable to node capture attacks. In order to improve the resilience against node capture attacks, we are the first to present the Key Superset (KS) scheme. In this scheme, the entire sensor network is devided into several non-overlapping triangle cells and nodes are separated into groups, each of which is deployed in a cell and each pair of adjacent cells selects randomly a certain number of keys from the key subset which belongs to the key superset. By using deployment knowledge and KS scheme we can restrict the consequence of node capture attacks within a small range and establish pairwise key for each pair of neighboring cells efficiently. Compared to existing schemes, our proposal outperforms others in resilience against node capture attacks and achieves high local connectivity.
  Wei Liang , Xingming Sun , Zhiqiang Ruan and Jing Long
  A Finite State Machine (FSM)-based Intellectual Property (IP) watermark algorithm at behavioral level is presented for the protection of IP reuse techniques in Very Large Scale Integration (VLSI). The proposed algorithm extracts the maximal delay state set through state transformation relations among circuit signals. The watermark is mapped into additional delay constraint sequence by constraint generator, and the value in the sequence is added into the maximal delay state set in the circuit for embedding watermark. The algorithm is tested on Virtex XCV600-6bg432 Field-Programmable Gate Array (FPGA), the experimental results show that the algorithms has lower impact on logical function, ensures better security and lower (resource) overhead in comparison with other methods.
  Bin Yang , Xingming Sun , Lingyun Xiang , Zhiqiang Ruan and Ruizhen Wu
  Most text steganographic methods are taken the formatted text documents, such as MS Word, PDF, PPT and etc., as cover carriers to hide secret information. This study concerns on the steganography in MS Excel document and proposes a new steganographic method hiding information efficiently by text-rotation technique. The proposed method is implemented by slightly rotating the angle of the text inside the cell to reduce the visible detection of the embedded information. Measuring the text angle of the cells retrieves the secret information. Experiments for different threshold in the algorithm are presented and the results show the proposed method not only has a good imperceptibility but also achieve high embedding rate while most of cells in Excel document are short in length.
  Baowei Wang , Xingming Sun , Zhiqiang Ruan and Heng Ren
  To achieve a more comprehensive and sustained privacy control and tamper detection for the data in wireless sensor networks, we propose a novel multiple watermarking method, called Multi-mark, which consists of an annotation part and a fragile part. On the one hand, encrypted user’s personal information is embedded into the routine monitoring data, as annotation watermark, which can be extracted when, needed. On the other hand, tampering is detected using fragile watermark. The former can resist various manipulative attacks, while the latter can detect any malicious modifications. Multi-mark not only provides privacy and security, but also saves data transmission amount and storage space. The experimental results show that Multi-mark can reduce 30% of data traffic and only introduces very low computation cost. Multi-mark is a network structure-free scheme, which can be easily and efficiently applied to the resource limited sensor networks.
  Zhiqiang Ruan and Xingming Sun
  This paper study the data delivery mechanisms that can with high probability thwarting node capture attacks in unattended or distributed wireless sensor networks. Classic cryptographic approaches are vulnerable to such attacks, mainly due to their deterministic nature. Because once the adversary compromises the sensor nodes, it can acquire the credential as well as the data collected and held by sensors. Furthermore, the adversary can easily insert bogus sensor readings or change the processing results and then use these keys to authenticate forged information. This study proposes and analyzes the application of Reed-Solomon (RS) codes to address the problem. In the proposed scheme, each sensor node encodes the original data into multiple redundancy data shares by applying predefined (n, k) RS codes and applies non-uniform allocation through multiple node-disjoint paths to the destination. Analysis and simulation results demonstrate that the proposed scheme is efficient and resilient against node capture attack.
  Decai Sun , Xingming Sun , Xiaoxia Wang and Zhiqiang Ruan
  Sequence alignment was one of the most popular operations in bioinformatics. The key issue of alignment was how to improve matching speed in a large sequences database. In this study, a full-sensitivity algorithm was proposed to solve the problem of finding all local alignments over a given length w with an error rate at most e. The proposed algorithm was implemented on a q-gram index. First, a large part of irrelevant subsequences were eliminated quickly by effective filtrating with new diagonal features. These new diagonal features were extracted from match-regions by analyzing the edit matrix of query sequence and database. Second, the unfiltered regions were verified by smith-waterman algorithm to search the true matches. The experimental results demonstrate that the proposed algorithm improves the filtration efficiency in a short filtration time and the algorithm is always faster than the well-known SWIFT on condition of low max error rate. This result is of great practical to local alignment with low error rate and short window size.
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility