Please wait a minute...

Current Issue

    25 August 2016, Volume 37 Issue 8
    Papers
    Hybrid data synchronization mechanism for mobile computing
    Xiao-long XU,Xiao-xiao LIU
    2016, 37(8):  1-12.  doi:10.11959/j.issn.1000-436x.2016150
    Asbtract ( 391 )   HTML ( 5)   PDF (995KB) ( 524 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The hybrid data synchronization mechanism (HDSM) was proposed,which integrates centralized architecture and ad hoc architecture together,and a series of self-organization domains (SOD) were built as to cut down the traffic of synchronization data and lighten the load of synchronization server.The capacity-value-based data distribution strategy was proposed,which establishes data distribution paths of SOD tree based on the comprehensive processing capacity of mobile nodes to implement the high-efficient data transmission.The increment capture strategy based on track changes was proposed,which captures operation logs with triggers and obtains pure increment data by purification.The experi-mental results show that HDSM can make maintenance of data consistency better in mobile computing environment and shorten the response time of synchronization,and reduce the traffic of data synchronization and the load of synchroniza-tion server.

    Feature importance analysis for spammer detection in Sina Weibo
    Yu-xiang ZHANG,Yu SUN,Jia-hai YANG,Da-lei ZHOU,Xiang-fei MENG,Chun-jing XIAO
    2016, 37(8):  24-33.  doi:10.11959/j.issn.1000-436x.2016152
    Asbtract ( 419 )   HTML ( 9)   PDF (829KB) ( 675 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Microblog has drawn attention of not only legitimate users but also spammers.The garbage information pro-vided by spammers handicaps users' experience significantly.In order to improve the detection accuracy of spammers,most existing studies on spam focus on generating more classification features or putting forward new classifiers.Which kind of issues would be put the high priority of an enormous amount of research effort into? Are extensive features or novel classifiers better for the detection accuracy of spammers? It is tried to address these questions through combining different feature selection methods with different classifiers on a real Sina Weibo dataset.Experimental results show that selected features are more important than novel classifiers for spammer detection.In addition,features should be derived from a wide range,such as text contents,user behaviors,and social relationship,and the dimension of features should not be too high.These results will be useful in finding the breakpoint of Microblog anti-spam works in the future.

    Dynamic P2P trust model based on context factors
    Yi-chun LIU,Ying-hong LIANG
    2016, 37(8):  34-45.  doi:10.11959/j.issn.1000-436x.2016153
    Asbtract ( 427 )   HTML ( 19)   PDF (796KB) ( 712 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A multi-dimensional trust model was constructed based on the context factors.The direct trust of the interac-tive entities was estimated by integrating the time-decay factor,the transaction impact factor and the participation fre-quency.The trust similarity algorithm was designed based on the Dice similarity and the feedback credibility was aggre-gated from multiple trust chains.The direct interaction,the evaluation similarity and the trust chain was integrated for calculating the recommendation trust.The peer's trust was evaluated by combing the direct trust and the recommendation trust.A new mechanisam was proposed for the trust's update,incentive or punishment according to the peer's behavior on the interaction.The practical example analysis shows that the proposed model can effectively explain the effect of the transaction contextual factors on the entity trust,and can improve the trust sensitivity to the context transaction factors.

    Trojan message attack on the concatenated hash functions
    Shi-Wei CHEN,INChen-Hui J
    2016, 37(8):  45-50.  doi:10.11959/j.issn.1000-436x.2016154
    Asbtract ( 317 )   HTML ( 5)   PDF (846KB) ( 484 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The Trojan message attack was proposed by Andreeva,et al.aiming at the hash functions with MD structure.First it was applied on the hash function beyond MD structure,that was,concatenated hash.Utilizing the property of the concatenated hash,and combining the Joux's multicollision and the “diamond” structure with the depth of n?l,a Trojan message of the length n 2k· blocks for the 2n-bit concatenated hash was constructed,based on which a chosen-prefix Trojan message attack was first proposed.And the memory complexity of proposed attack is about 2l+2n?l+1+n·2k+1blocks and the time complexity is about O (n·2n+k+l·2l)computations of the compression function,much less than the ideal value O(n·22n+k).

    Virtual network mapping algorithm with node reliability awareness and shared-path protection
    Guang-yuan LIU,NXiu-fang A,Sen SU
    2016, 37(8):  51-57.  doi:10.11959/j.issn.1000-436x.2016155
    Asbtract ( 317 )   HTML ( 3)   PDF (641KB) ( 773 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Network virtualization has been proposed as a promising way for expanding the network architecture.However,how to provide reliable VN against substrate infrastructure failures has become an increasingly important issue.Meanwhile the substrate network resource cost should be minimized under VN reliability guarantees to maximize the revenue for the in-frastructure providers (InP).A novel heuristic VN mapping algorithm was presented.Simulation results show that proposed algorithm can gain near optimal network bandwidth usage compared to the previous algorithms.

    False traffic information detection based on weak classifiers integration in vehicular ad hoc networks
    Xiang-wen LIU,Ya-li SHI,ENGXia F
    2016, 37(8):  58-66.  doi:10.11959/j.issn.1000-436x.2016156
    Asbtract ( 464 )   HTML ( 6)   PDF (1241KB) ( 444 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Vehicles report traffic information mutually by self-organized manner in vehicular ad hoc networks (VANET),and the message need to be identified in the open network environment.However,it is very difficult for fast moving ve-hicles to detect a lot of traffic alert information in a short time.To solve this problem,a false traffic message detection method was presented based on weak classifiers integration.Firstly,the effective features of traffic alert information was extended and segmentation rules were designed to divide the information feature set into multiple feature subsets,then the corresponding weak classifiers were used to process feature subsets respectively according to the different character-istics of the subsets' features.Simulation experiments and performance analysis show that the selected weak classifiers integration method reduces the detection time,and because of the application of combined features,the detection rate is better than the test of using only some of the characteristics.

    Location-semantic-based location privacy protection for road network
    Hui CHEN,Xiao-lin QIN
    2016, 37(8):  67-76.  doi:10.11959/j.issn.1000-436x.2016157
    Asbtract ( 369 )   HTML ( 7)   PDF (952KB) ( 713 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Mobile users suffer location privacy leakage threat as enjoy location-based services (LBS).Therefore,it was important to provide effective policy for location privacy protection.Conventional protection approaches were mainly based on spatial cloaking,which leads to the anonymous effectiveness suffer great reduction if the attacker obtains more background knowledge with respect to the cloaking region,especially semantic information of the location.To prevent sensitive location information leakage for the location semantics being analyzed,and consider the characteristic that most users move on road networks,a location-semantic-based location privacy protection method for road networks was pro-posed.The proposed method considers users' personalized privacy requirements well.The feasibility and effectiveness of the proposed method are verified through experiments for many scenarios.

    Attribute-based encryption supporting arbitrary conjunctive key word search
    Yan SONG,Zhen HAN,Dong CHEN,Jin-hua ZHAO
    2016, 37(8):  77-85.  doi:10.11959/j.issn.1000-436x.2016158
    Asbtract ( 424 )   HTML ( 16)   PDF (918KB) ( 1008 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new searchable encryption scheme was proposed in prime order bilinear groups based on the attribute-based encryption and polynomial equation.The scheme,in which each conjunctive-keyword ciphertext can be searched by a number of users,may significantly reduce the overhead of network and sending nodes' computation in the application of fine-grained access control.Meanwhile,the scheme facilitates the flexibility of conjunctive search by supporting arbitrary conjunctive search of the keywords.At last,the performance was analyzed and compared with some recent conjunctive search schemes.

    Secrecy outage probability based access strategy for device-to-device communication underlaying cellular networks
    Ya-jun CHEN,Xin-sheng JI,Kai-zhi HUANG,Xiao-lei KANG
    2016, 37(8):  86-94.  doi:10.11959/j.issn.1000-436x.2016159
    Asbtract ( 455 )   HTML ( 12)   PDF (1212KB) ( 840 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A secure access strategy for D2D (device-to-device) communications underlaying cellular networks based on the secrecy outage probability was proposed.Firstly,the secrecy outage probability in the worst case was derived and a transmission power optimization scheme for D2D pairs was given.An access control strategy was further presented to allow the D2D pair with the minimum secrecy outage probability to reuse the cellular resource,which improved the se-cure communications for D2D links and cellular uplinks.Finally,simulation results showed that the proposed scheme was effective.

    Long-term intuitionistic fuzzy time series forecasting model based on DTW
    Xiao-shi FAN,Ying-jie LEI,Yan-li LU,Ya-nan WANG
    2016, 37(8):  95-104.  doi:10.11959/j.issn.1000-436x.2016160
    Asbtract ( 433 )   HTML ( 3)   PDF (948KB) ( 648 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In existing fuzzy time series forecasting models,the intuitionistic fuzzy relationship groups and deterministic transition rules excessively relied on scale of the training data.A long-term intuitionistic fuzzy time series (IFTS) fore-casting model based on DTW was proposed.The IFTS segment base was constructed by IFCM.The complexity of sys-tem was reduced by dynamic update and maintaining of the rule base.The computing method of IFTS segments similar-ity based on the distance of DTW was proposed,which was valid for matching unequal length time series segments.The proposed model implements on the synthetic and the temperature dataset,which including different time series patterns,respectively.The experiments illustrate that the forecasting accuracy of the proposed model is higher than the others on the different tendency patterns of time series.The proposed model overcomes the limitation of single time series pattern and improves the generalization ability.

    Study on virtual computing resource scheduling for network performance optimization
    Yu-wei WANG,Min LIU,Bing-yi FANG,Chen-chong QIN,Xiao-long YAN
    2016, 37(8):  105-118.  doi:10.11959/j.issn.1000-436x.2016161
    Asbtract ( 410 )   HTML ( 2)   PDF (907KB) ( 696 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A deep insight into the relationship between vCPU scheduling and I/O transmit in Xen was provided.Then an effective and lightweight recognition method,through which could identify the so-called NSVM (network queuing sensi-tive virtual machine) that was more vulnerable to the congestion in I/O transmit was put forward.Furthermore,a novel mechanism for resource assignment and scheduling called Diff-Scheduler was proposed.It could schedule the vCPU of the NSVM more frequently than other VM in different pools independently.Evaluations based on a prototype of Xen platform featured Diff-Scheduler show that the proposed mechanism significantly improves the network performance of VM.Specifically,comparing with the default mechanism of Xen,Diff-Scheduler proposed jointly enhances throughput,latency remarkably and ensures the fairness of resource allocation at the same time.

    Routing discovery algorithm based on reliable path stability estimation in MANET
    Zhi-nan LI,Xiao-dong YANG
    2016, 37(8):  119-128.  doi:10.11959/j.issn.1000-436x.2016162
    Asbtract ( 329 )   HTML ( 9)   PDF (785KB) ( 537 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel routing discovery algorithm for MANETs was proposed based on reliable residual path lifetime (RPL) prediction (RLE-RPLP).Correlation between residual link lifetime (RLL) of neighboring links was explicitly investigated and fully taken into account in stability estimation of multi-hop paths in the algorithm.Optimized RPL statistical proper-ties were further explored to offer a more reliable path stability metric.Simulation analysis demonstrates that the pro-posed RLE-RPLP routing discovery algorithm shows prominent superiority in improving network throughput and reduc-ing route reconstruction frequency.Moreover,compared with the existing link stability-aware routing protocol,the RLE-RPLP achieves better performance improvement in terms of throughput and routing overhead.

    374~747 MHz digital tunable microstrip filter
    Deng-yao TIAN,Quan-yuan FENG,Qian-yin XIANG
    2016, 37(8):  129-135.  doi:10.11959/j.issn.1000-436x.2016163
    Asbtract ( 476 )   HTML ( 0)   PDF (667KB) ( 414 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel digital microstrip tunable bandpass filter based on digitally tunable capacitor loading microstrip open ring resonators was proposed.The novel non-uniform open ring resonances with mixed coupling structure was used to make the coupling coefficient of the resonators increases with the decreasing of resonance frequency and achieve a con-stant absolute bandwidth tunable filter.Then the proposed digital tunable microstrip filters based on 5 bit digitally tunable capacitance was simulated and manufactured.The measurement shows that the ?3 dB absolute bandwidth varies from 44~67 MHz while the central frequency of the passband varying from 374~747 MHz,the OIP3 is greater than 50 dBm.

    Privacy matching-based service proxy discovery scheme
    Kui GENG,Sheng WAN,Feng-hua LI,Yuan-yuan HE,Han-yi WANG
    2016, 37(8):  136-143.  doi:10.11959/j.issn.1000-436x.2016164
    Asbtract ( 368 )   HTML ( 11)   PDF (1147KB) ( 503 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to user's requirements on the proxy performance,cost and safety in proxy discovery,and the pri-vacy-preserving issue during the process of the demand private matching,a new private matching algorithm was pre-sented based on Paillier homomorphic encryption,comprehensively considered the attributes of user and agents and their priority.It included four steps:building the similarity function based on Euclidean distance,carrying on the private matching by encryption algorithm,calculating the similarity and screening the proxy chain.Proposed scheme introduced semi trusted primary proxy from the global level,which is to manage all the sub proxy's business type and the connection status,and do the main computational overhead.At the same time,Euclidean distance and Paillier homomorphic encryp-tion algorithm were combined to support the multivariate attributes with priority to match,which can effectively protect the privacy of user and sub proxy.Finally,security analysis and evaluation results show the effectiveness and safety of proposed scheme.

    Improvement and evaluation for algebraic fault attacks on PRESENT
    Jing HUANG,Xin-jie ZHAO,Fan ZHANG,Shi-ze GUO,Ping ZHOU,Hao CHEN,Jian YANG
    2016, 37(8):  144-156.  doi:10.11959/j.issn.1000-436x.2016165
    Asbtract ( 417 )   HTML ( 2)   PDF (712KB) ( 468 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An enhanced algebraic fault analysis on PRESENT was proposed.Algebraic cryptanalysis was introduced to build the algebraic equations for both the target cipher and faults.The equation set of PRESENT was built reversely in order to accelerate the solving speed.An algorithm of estimating the reduced key entropy for given amount of fault injec-tions was proposed,which can evaluate the resistance of PRESENT against fault attacks under different fault models.Fi-nally,extensive glitch-based fault attacks were conducted on an 8-bit smart card PRESENT implemented on a smart card.The best results show that only one fault injection was required for the key recovery,this is the best result of fault attacks on PRESENT in terms of the data complexity.

    Vulnerabilities scoring approach for cloud SaaS
    Zhou LI,Cong TANG,Jian-bin HU,Zhong CHEN
    2016, 37(8):  157-166.  doi:10.11959/j.issn.1000-436x.2016166
    Asbtract ( 322 )   HTML ( 2)   PDF (642KB) ( 577 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    There are full of challenges to score vulnerabilities of cloud services developed by different third-party pro-viders.Although there have been a few systems for scoring vulnerabilities (e.g.,CVSS) of many existing software,most of them are unable to be leveraged to score vulnerabilities in cloud services,because they fail to consider some important factors located in the clouds such as business context (i.e.,dependency relationships between services).VScorer,a novel security frame work to score vulnerabilities in various cloud services were presented based on different given require-ments.By inputting concrete business context and security requirement into VScorer,cloud provider can get a ranking list of vulnerabilities in the business based on the given security requirement.Following the ranking list,cloud provider was able to patch the most critical vulnerabilities first.A prototype was developed and VScorer can be demonstrazed to work better than current representative vulnerability scoring system CVSS.

    Comprehensive Review
    Research progress on cloud data assured deletion based on cryptography
    Jin-bo XIONG,Feng-hua LI,Yan-chao WANG,Jian-feng MA,Zhi-qiang YAO
    2016, 37(8):  167-184.  doi:10.11959/j.issn.1000-436x.2016167
    Asbtract ( 813 )   HTML ( 31)   PDF (712KB) ( 1516 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The major challenges faced by the data assured deletion in cloud computing was analyzed,it was observed the main reasons of performing cloud data assured deletion were the characteristics of cloud virtualization and multi-tenancy,as well as the business models of lease and on-demand delivery in cloud computing,and point out three levels of meaning of the cloud data assured deletion.Secondly,the state-of-the-art works on cloud data assured deletion was systematically surveyed from security-oriented view in terms of trusted execution environments,key managements and access control policies.It is also pointed out their highlights,limitations and general problems.Finally,some developing trends of this emerging research field were introduced.

    Correspondences
    Meet-in-the-middle attacks on FOX block cipher
    IRong-jia L,INChen-hui J
    2016, 37(8):  185-190.  doi:10.11959/j.issn.1000-436x.2016168
    Asbtract ( 524 )   HTML ( 3)   PDF (1087KB) ( 484 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The security of the block cipher FOX against meet-in-the-middle attack was analyzed.Firstly,3-round meet-in-the-middle distinguishers was constructed and 6-round meet-in-the-middle attacks for FOX64 and FOX128 was proposed.The two attacks were beter attacks for 6-round FOX64 and FOX128,respectively.Secondly,the meet-in-the-middle distinguisher was extended of FOX128 to 4 rounds and proposed 7-round meet-in-the-middle attack combined with time/memory/data tradeoff.Compared to the currently known attacks on 7-round FOX128,The attack has a greater time and memory complexity,however the data complexity is much smaller.

    Chaotic hiding and its positive definite blind extraction algorithm of speech signal
    Er-fu WANG,Yuan-shuo ZHENG,Xin-wu CHEN,Xiao-zhen LIU
    2016, 37(8):  191-198.  doi:10.11959/j.issn.1000-436x.2016171
    Asbtract ( 369 )   HTML ( 3)   PDF (612KB) ( 482 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The wavelet transform was used to extract energy accumulation zone of speech signal hidden in the chaotic carrier signal for transmission,and a blind extraction algorithm was designed to achieve speech signal extraction under different chaotic dynamical systems.Using three different dimensions of the chaotic dynamic system as the background,simulation experiment analysed the performance of the proposed algorithm in aqualitative and quantitative ways,and verified the algorithm's reliability under the noise environment that prove the blind extraction algorithm can be used as an effective method of security verification of chaotic secure communication system.

Copyright Information
Authorized by: China Association for Science and Technology
Sponsored by: China Institute of Communications
Editor-in-Chief: Zhang Ping
Associate Editor-in-Chief:
Zhang Yanchuan, Ma Jianfeng, Yang Zhen, Shen Lianfeng, Tao Xiaofeng, Liu Hualu
Editorial Director: Wu Nada, Zhao Li
Address: F2, Beiyang Chenguang Building, Shunbatiao No.1 Courtyard, Fengtai District, Beijing, China
Post: 100079
Tel: 010-53933889、53878169、
53859522、010-53878236
Email: xuebao@ptpress.com.cn
Email: txxb@bjxintong.com.cn
ISSN 1000-436X
CN 11-2102/TN
Visited
Total visitors:
Visitors of today:
Now online: