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 Lingyun Xiang
Total Records ( 7 ) for Lingyun Xiang
  Gang Luo , Xingming Sun and Lingyun Xiang
  In this research, a steganographic algorithm based on the directed Hamiltonian path selection in the complete digraph mapped from multi-blogs with same article has been proposed. Firstly, we can regard n different blogs referring to a same article as n different virtual vertices and then connect them virtually to construct a complete digraph. As there exist n! different directed Hamiltonian paths at most in a complete digraph with n vertices, after numbering all directed Hamiltonian paths, a large number converted from arbitrary secret information smaller than n! can be expressed as a certain Hamiltonian path. In the process of the actual realization, the cited links of the same article are used to indicate the location of the former vertex of the current in a selected Hamiltonian path. In the information-extracting process, we can recover the whole Hamiltonian path by tracing the cited links and then decode this Hamiltonian path to retrieve the hidden information. Based on the theoretical analysis and the experimental proof, it demonstrates that the proposed steganography has good imperceptibility and security.
  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.
  Lingyun Xiang , Xingming Sun , Yuling Liu and Hengfu Yang
  In this study, a novel secure steganographic method was proposed by taking advantage of Multiple-Choice Questions (MCQs). Selecting a series of MCQs to automatically generate a stego text could conceal secret information. The proposed method could achieve a considerable embedding bit rate while being able to hide more information by reordering the options of the generated MCQs. The final outputting stego texts were kept the same linguistic and statistic characteristics as normal texts, thus the hidden information had good imperceptibility and could survive under potential steganalysis attacks, which was also demonstrated by experiments. More experimental results showed that the average embedding bit rate achieved more than 1 bit per sentence, which was superior to the bit rate of most existing linguistic steganographic methods.
  Bin Xia , Xingming Sun , Lingyun Xiang , Haijun Luo and Hengfu Yang
  This study presented a method to detect Least Significant Bit (LSB) matching steganography in gray images based on the neighborhood node degree characteristic. Natural images have a strong correlation between adjacent pixels and it’s disturbed by LSB matching. Accordingly the effects of LSB matching steganography on neighborhood node degree were examined at first. Then features were extracted from neighborhood node degree histogram. A new calibration algorithm based on neighborhood node degree was proposed to get more effective features. Support Vector Machine (SVM) was used as classifier. Experimental results demonstrated that the proposed method was efficient to detect the LSB matching steganography and had superior results compared with other recently proposed algorithms on compressed images and low embedding rate uncompressed images.
  Bin Yang , Xingming Sun , Jianjun Zhang , Lingyun Xiang , Xianyi Chen and Xu Li
  In many critical application areas, such as military, legal and literature fields, methods of protecting copyright for text data could not cause any distortion in textual content. In this study, we evaluate a novel reversible (lossless) data hiding scheme for MS office 2007 document. The proposed scheme modifies the unnoticeable content and the synonyms of a document to hide information. While in extraction processing, the original content can be recovered without any distortion from the marked textual. Our scheme is achieved by using two common text information hiding methods simultaneously. The secret information is embedded into the cover document by synonym substitution. Original synonyms in the document are mapped into a compressed Synonym Index Table (SIT) and concealed into the MS office 2007 document. Experiments results demonstrated that proposed scheme can not only successfully embed and extract the secret information but also keep the original textual content undistorted.
  Jiaohua Qin , Xiaoyu Guo , XuyuXiang , Lingyun Xiang and LiliPan
  This study was proposed by a steganalysis algorithm against Multiple Least Significant Bits (MLSB) steganography to estimate the secret message length in images. Firstly, a local masked estimation function by using weighted average of the masked pixels was used to estimate an approximately original image. Then, the weighted stego image was constructed by extending the definition of LSB steganalysis to MLSB one. Finally, the secret message length estimator was constructed through a least square equation. The detailed theoretical proofs of the detection and estimation methods were presented in this study. Experimental results revealed that this method can estimate the length of secret message with high accuracy and low time complexity.
  Wang Li , Gang Luo and Lingyun Xiang
  In practical applications, in order to extract data from the stego, some data hiding encryption methods need to identify themselves. When performing data hiding, they embed some specific logo for self-identification. However, it is unavoidable to bring themselves the risk of exposure. Suppose each hidden method has a corresponding logo S and the attacker has a logo set Φ which consists of some hidden methods’ logos. Once he find the logo S which matches a logo in Φ, he can easily recognize the very method. To solve this problem, we propose a method based on synchronization to hide the specific sign or logo. First, the sender generates a key using a public variable parameter which is always changing from time to time. Then, we can calculate the hidden data’s location in the cover from the key. According to the locations, we can embed the logo into the cover. As the public parameter is changing from time to time, each transmission of hidden data has a unique location sequence. When the stego reaches its receiver, according to the public parameter, the receiver could generate the key and get the hidden data’s location to extract the secret data correctly. Experimental results verify that the data hiding method performs well and hardly has impacts on the cover’s quality and has little impacts on the robustness, imperceptibility and capacity of the original stego-cover. Besides, it is able to recover the key with linear time complexity when the critical information which is used to generate the key is missing.
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility