Current Issue

25 March 2010, Volume 31 Issue 3

Previous Issue    Next Issue

Academic paper

Steganalysis of LSB matching based on regional correlation

Ming CHEN,Ru ZHANG,Fan-fan LIU,Jia WU,Xin-xin NIU

2010, 31(3):  1-11.  doi:1000-436X(2010)03-0001-11

Asbtract ( 0 )   HTML ( 0)   PDF (424KB) ( 21 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

LSB matching improves the security of hidden message through changing the pixel's LSB randomly,which breaks the rules of pairs of values of LSB replacement.A new steganalysis technique which focuses on LSB matching embedding based on the local area's smoothness in grayscale images was proposed.The detection method defines the difference between the sum of 8-neighbor pixels and the center pixel as the correlation between regional pixels.The exis-tence of embedded information can be detected by observing the change of the regional correlation before and after em-bedding.Compared with the existing algorithms,the advantages of the proposed method include simplicity,computation-al efficiency and low false positive rate.The detection achieves high reliability when embedding rate is above 30%.

Quasi-orthogonal polarization space time block codes with signal constellations rotation and performance analysis

Zheng-quan LI,Lian-feng SHEN,Jing-jing WANG

2010, 31(3):  12-18.  doi:1000-436X(2010)03-0012-07

Asbtract ( 0 )   HTML ( 0)   PDF (478KB) ( 7 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new kind of rate 3/4 space time block code based on quaternion quasi-orthogonal and the quasi-orthogonal polarization space time block code with signal optimal constellation rotation for eight and six transmit antennas were de-signed.The pair-wise decoding algorithm was adopted at the receiver.The simulation and comparison among polarization quasi-orthogonal,rotational polarization quasi-orthogonal,quasi-orthogonal and rotational quasi-orthogonal were given respectively.The results show that there is only a little improvement by signal constellations rotation when the dual-polarized antennas are used and there is a great improvement by signal constellations rotation when the sin-gle-polarized antennas are used for bit error rate performance at same conditions.

New location aware clustering algorithm

Wei TIAN,Zhen YANG

2010, 31(3):  25-30.  doi:1000-436X(2010)03-0025-06

Asbtract ( 187 )   HTML ( 3)   PDF (241KB) ( 220 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new location aware clustering algorithm was proposed aiming at the problem of the energy efficiency and reliability in the wireless sensor networks .Using the two aware parameters of the angle ratio and distance ratio,the node makes itself to become the clustering head based on its location,which was verified by NS2 simulator.Simulation results demonstrate that the LACA not only can improve the energy efficiency and prolong the network lifetime,but also restrain the isolated nodes and guarantee the reliability effectively,compared with the LEACH and GAF.

Multi-keyword partial matching algorithm based on text fragments

Wei-qi LIAO,Wei ZOU

2010, 31(3):  31-36.  doi:1000-436X(2010)03-0031-06

Asbtract ( 83 )   HTML ( 0)   PDF (244KB) ( 68 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Network content detection based on keywords in security gateway often need to reassemble the TCP packets and even the whole file,which will cause a long delay.In order to resolve the problem,a new concept of pattern par-tial-matching based on text fragments was presented.A novel multi-keyword partial matching algorithm was also de-signed and realized which could detect the fraction of keywords in data block without re-flow or re-file.Comparing to the normal multi-keyword matching algorithm,it was proved by experiments that the false negative of the algorithm is zero,and the false positive rate is little enough when the data block is large enough.

Maximum lifetime routing in data aggregated wireless sensor networks with multiple sinks

Wei TANG,Wei GUO

2010, 31(3):  37-44.  doi:1000-436X(2010)03-0037-08

Asbtract ( 58 )   HTML ( 0)   PDF (313KB) ( 69 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The maximum lifetime routing problem in multi-sink data aggregated wireless sensor networks was studied.The NP-hardness of the routing algorithm was shown,and a shortest path forest-based heuristic algorithm was proposed.Subgradient method was adopted to design the distributed algorithm as well.By conducting extensive simulation experi-ments,the performance of the proposed routing algorithm was analyzed,and the convergence efficiency of the distributed algorithm was presented.

Publicly verifiable public key encryption scheme with short keys

Yong-gang CUI,Yu-jun LIU

2010, 31(3):  45-50.  doi:1000-436X(2010)03-0045-06

Asbtract ( 62 )   HTML ( 1)   PDF (198KB) ( 222 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Based on a selective identity secure identity-based encryption scheme and two target collision resistant hash functions,a new public verifiable encryption scheme was presented.The adaptively chosen ciphertext security of the new scheme was proved under the decisional BDHI assumption in the standard model.Furthermore,new scheme has very short public and private keys that are independent of the security parameter.

Analysis and improvement of a password-based authenticated key exchange protocol

Jian SHU,Chun-xiang XU

2010, 31(3):  51-56.  doi:1000-436X(2010)03-0051-06

Asbtract ( 67 )   HTML ( 0)   PDF (210KB) ( 205 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The security of a recently proposed password-based authenticated key exchange protocol was analyzed.Al-though it was provably secure in the standard model,i was vulnerable to reflection attacks.A modify scheme was pro-posed,which eliminated the defect of original scheme and improved the efficiency of the protocol.The security of the proposed scheme had been proven in the standard model under DDH assumption.The results show that it provides per-fect forward secrecy.

Research of fast decoding for longer constraint length convolutional codes

Xiao-ling HUANG,Hua-long YANG

2010, 31(3):  57-64.  doi:1000-436X(2010)03-0057-08

Asbtract ( 50 )   HTML ( 0)   PDF (290KB) ( 190 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To overcome the disadvantage of Viterbi decoding algor m,in which its complexity exponentially increases with the increasing constraint length of convolutional codes,and the decoding delay was too large to fit the decoding of longer constraint length convolutional codes,a fast decoding of convolutional codes for longer constraint length,based on improved particle swarm optimization algorithm,was proposed.The proposed method reduces the searching area in the grid of decoding and shortens the decoding delay by setting the population size M to determine the number of decoding path,therefore was more suitable for longer constraint length convolutional codes.Another method of decoding convolu-tional codes based on self-adapting of decoding width was also proposed.Simulation results show that the proposed both methods have advantages in reducing the computational complexity and the decoding time.

Analysis of chopping stabilizing zero for adaptive interference cancellation system

Yun-hao JIANG,Wei-ming MA,Zhi-hua ZHAO

2010, 31(3):  65-74.  doi:1000-436X(2010)03-0065-10

Asbtract ( 50 )   HTML ( 0)   PDF (418KB) ( 229 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The time-domain characteristics of weights and error in analog ve interference cancellation system were analyzed with null shifts in weight branches.Analysis shows that the steady weights drift the optimal weights and the in-terference cancellation ratio decreases due to null shifts,but the average convergence speed is not influenced.Chopping stabilizing zero is a main method for solving null shi The theoretical derivations were gained with the fundamental wave chopping and simulation results were got.Fundamental wave chopping makes the system a time-variation system.Weights have new frequency components and the new interferences come out.The interference cancellation ratio (ICR) decreases simultaneity.

Novel scheduling algorithm for TD-HSDPA systems

Jie CUI,Yong-yu CHANG,Shu-hui LIU,Da-cheng YANG

2010, 31(3):  75-81.  doi:1000-436X(2010)03-0075-07

Asbtract ( 45 )   HTML ( 0)   PDF (263KB) ( 82 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

According to the existed analysis reports of key techniques in TD-HSDPA (TD-SCDMA high speed downlink packet access) systems,the impact of CQI (channel qual information) feedback delay upon the system performance was studied,and the relationship between signaling overhead and feedback precision was also illuminated.As the effi-ciency and precision of fast-scheduler in Node B were always influenced by the CQI feedback delay,a l scheduling algorithm,for which the scheduling process and the priority calculation scheme had been improved,was proposed to achieve greater system performance.System-level simulation shows that,when the system load was increasing,the pro-posed scheduling algorithm can efficiently guarantee high cell throughput and low packet delay.

Technical Reports

Availability based trust evaluation model for MANET

Xi-bin ZHAO,Zhi-yang YOU,Zhi-feng ZHAO

2010, 31(3):  82-88.  doi:1000-436X(2010)03-0082-07

Asbtract ( 105 )   HTML ( 0)   PDF (215KB) ( 346 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

ABTEM was presented,an availability based trust model,and many availability ented security service can be obtained based on this model.The performance results show that malicious nodes can be successfully discovered in accordance with its malicious acts in the routing layer when apply ABTEM on the DSR protocol.Furthermore malicious nodes can be isolated to protect the network from the attack of them,and which will significantly increases system avail-ability.

Security model for ID-based key exchange

Wen-ju LIU,Jun-wei ZHANG,Jian-feng MA,Chao YANG,Xing-hua LI

2010, 31(3):  89-94.  doi:1000-436X(2010)03-0089-06

Asbtract ( 62 )   HTML ( 1)   PDF (189KB) ( 63 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The provable security of ID-based key exchange protocols was investigated.In the niversally composable framework,the provable secure model of ID-based key exchange was proposed.The ability of the adversary to corrupt key generation center was added to the adversary model.According to the characteristics of ID-based key exchange,the ideal functionality of ID-based key exchange was presented.Based on the adversary model and the ideal functionality,the proposed model captures not only the universally composable security of ID-based key exchange,but also implies one of the important properties of ID-based key exchange——key generation center forward secrecy.In addition,the protocol (with key confirmation) proposed by Chen and Kudla can securely realize the functionality of ID-based KE with KGC-FS.

Improved HMM model based method for detecting cyber attacks

Xiao-feng YANG,Ming-ming SUN,Xue-lei HU,Jing-yu YANG

2010, 31(3):  95-101.  doi:1000-436X(2010)03-0095-07

Asbtract ( 129 )   HTML ( 18)   PDF (246KB) ( 812 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An improved HMM model based method for detecting cyber attacks was proposed.Normal network behaviors followed a regular grammar,while anomalies deviated the normal grammar.Grammar model represented by HMM model trained with normal network behavior samples easily distinguished normal and malicious requests by their contrasting conforming degrees.A significantly improved performance was achieved in real data tests compared with other anomaly methods.

Outage probability for cooperative communication system with asymmetric channel

Gang CHUAI,Sheng LIU,Xiao-jun WEN

2010, 31(3):  102-108.  doi:1000-436X(2010)03-0102-07

Asbtract ( 51 )   HTML ( 0)   PDF (372KB) ( 87 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Firstly,a mathematical model of cooperative system in asymmetric channel considering the link diversity gain between the source and destination was presented.An analytical expression of the average outage probability which was proved accurate by simulation was derived by using the method of characteristic function.Theory and simulation indicate that the outage probability of the cooperative system has a close relationship with the relays' number,location and the power allocation ratio of the cooperative system and it makes higher performance gain to consider the direct link between the source and the destination.And then the effect of the relay nodes location for the optimal power allocation tio was studied based on the mathematical model.The results show that the optimal power allocation ratio is limited by the re-lays' locations.

Concise Papers

Intrusion detection method based on hierarchical hidde kov model and variable-length semantic pattern

Xue-tao DUAN,Chun-fu JIA,Chun-bo LIU

2010, 31(3):  109-114.  doi:1000-436X(2010)03-0109-06

Asbtract ( 48 )   HTML ( 1)   PDF (190KB) ( 54 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The defects of intrusion detection using fixed-length short system call sequences were analyzed.A method of extracting variable-length short system call sequences,grounded on the function return addresses stored in the process stacks,was proposed.Based on the hierarchical relationship and the state transition characteristics of the variable-length semantic patterns,a hierarchical hidden Markov intrusion detection model was presented.The experimental results show that the hierarchical hidden Markov intrusion detection model is superior to the traditional hidden Markov model.

Identity-based authentication localization scheme for wireless sensor network

Xiao HUANG,Hong-bing CHENG,Geng YANG

2010, 31(3):  115-122.  doi:1000-436X(2010)03-0115-08

Asbtract ( 30 )   HTML ( 1)   PDF (271KB) ( 215 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel identity-based authentication localization scheme for wireless sensor networks was proposed.The proposed authentication localization scheme can be applied in the three components of localizaton system and make them safe through verification.Comparing the proposed authentication localization scheme with other secure localization technologies through comprehensive analysis in terms of the energy usage,storage cost and security in the presence of all kinds of attacks,the results show that the proposed uthentication localization scheme is the most efficient for wireless sensor networks.

MDR codes and self-dual codes on Cartesian product codes

Xiu-sheng LIU

2010, 31(3):  123-125.  doi:1000-436X(2010)03-0123-03

Asbtract ( 56 )   HTML ( 0)   PDF (103KB) ( 107 )   Knowledge map   

References | Related Articles | Metrics

A Cartesian product code of the linear codes C ₁,…,C_s in $Z_{r_1},Z_{r_2},\dots ,Z_{r_s}$was defined.According to the theorem of submodulo isomorphism,the relationship between the rank of the Cartesian product code C₁×C₂×…×C_s over$Z_{r_1},Z_{r_2},\dots ,Z_{r_s}$and C₁,C₂,…,C_scodes over $Z_{r_1},Z_{r_2},\dots ,Z_{r_s}$were studied.Furthermore,it can include that Cartesian product code of MDS codes is MDR code,and so do the self -dual.

Correspondences

Survivability strategy with conditional risk disjunction degree in multi-domain optical networks

Ji-hong ZHAO,Hua QU,Li WANG,Hong-bao MAO

2010, 31(3):  126-132.  doi:1000-436X(2010)03-0126-07

Asbtract ( 59 )   HTML ( 0)   PDF (266KB) ( 118 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A survivability strategy based on CRDD(conditional risk disjunction degree) in multi-domain optical networks was provided in order to overcome the defect of the scalability constrained and provide differentiated service.The con-cept of CRDD was provided in this strategy,then the intra-domain virtual links reflection was achieved and the end-to-end work route and backup route to differentiate service reliability were computed with CRDD.The results show that the supported survivability strategy not only can differentiate the service reliability,reduce the blocking probability of service,but also can improve reliability for service requirement by 6.5% on average.

Dynamic self-configuration of user QoS oriented to cognitive network

Guang-sheng FENG,Hui-qiang WANG,Chun-guang MA,Bing-yang LI,Qian ZHAO

2010, 31(3):  133-140.  doi:1000-436X(2010)03-0133-08

Asbtract ( 63 )   HTML ( 3)   PDF (260KB) ( 306 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To solve the rapid drop of user QoS under network congestion,improve the accuracy of user QoS and advance the ability of dynamic adjustment,a dynamic self-configuration method for user QoS protection was proposed.Utility function was introduced to initialize the priorities of user QoS,and then the active features of cognitive network and the interruption management were utilized to determine the priorities and also correct them dynamically by cognitive nodes.Simulation results show that the proposed method is better than traditional DiffServ,and able to guarantee user QoS ef-fectively in case of network congestion.