Please wait a minute...


    15 June 2016, Volume 2 Issue 6
    Overview of Internet of vehicles for 5G
    Liang-min WANG,Xiao-long LIU,Chun-xiao LI,Jing YANG,Wei-dong YANG
    2016, 2(6):  1-12.  doi:10.11959/j.issn.2096-109x.2016.00064
    Asbtract ( 123 )   HTML ( 19)   PDF (943KB) ( 97 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The functions and characteristics of current IOV(Internet of vehicles) Internet of vehicles were analyzed.Moreover,combined with 5G communication technology,the architecture of IOV for 5G was proposed to imple-ment access and integration of multi-network.Different from the IEEE 802.11p based architecture of VANET,de-vice-to-device (D2D) technology was introduced to achieve flexible terminals communication of IOV.In comparing with VANET based on IEEE 802.11p in terms of key technology parameters,the IOV for 5G possesses the better characteristics in terms of low latency and efficient spectrum utilization,and also need to face new interference management and security challenges.At the end,the application and development trends of IOV for 5G in the busi-ness and the specific environment were prospected.

    academic paper
    Efficient three-party authenticated key agreement protocol based on chaotic map
    Xiong LI,Fan WU,Jun-guo LIAO,Yu-zhen LIU
    2016, 2(6):  13-21.  doi:10.11959/j.issn.2096-109x.2016.00060
    Asbtract ( 36 )   HTML ( 1)   PDF (368KB) ( 36 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Chaotic map has been used in the design of key agreement protocol due to its excellent properties.In most of password three-party authenticated key agreement protocol based on chaotic map,the server needs to store a sensitive password table.It makes these protocols vulnerable to some password related attacks.Besides,it would be dangerous if the password table was leaked.To resolve the aforementioned problems,a new password three-party authenticated key agreement protocol based on chaotic maps was proposed.The server didn't need to maintain a password table,so the proposed scheme was free from password related attack.Compared with other related proto-cols,the proposed protocol not only enhances the security,but also improves the efficiency greatly.

    Research on privacy-preserving learning machines
    Yi-zhang JIANG,Shi-tong WANG
    2016, 2(6):  22-31.  doi:10.11959/j.issn.2096-109x.2016.00062
    Asbtract ( 27 )   HTML ( 0)   PDF (461KB) ( 23 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the increasing development of data mining,more and more data mining methods need to be carried out on the privacy data,which leads to the serious problem of privacy disclosure.Therefore,Study of privacy-preserving learning machines is becoming a key data mining topic.Current privacy-preserving learning machines were surveyed and analyzed,including their basic ideas and their learning models.

    Identity authentication scheme based on identity-based encryption
    Ren-ji HUANG,Xiao-ping WU,Hong-cheng LI
    2016, 2(6):  32-37.  doi:10.11959/j.issn.2096-109x.2016.00047
    Asbtract ( 71 )   HTML ( 6)   PDF (619KB) ( 56 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In large-scale communication nodes network,there are a large number of network nodes and so many types of equipment.So there are problems of certificate management difficulties and resource waste in the tradi-tional PKI cryptosystem.A mutual node authentication scheme based on identity-based encryption,which solved the problem of the digital certificate management in the PKI system by the identity-based encryption and the key escrow problem in identity based cryptograph by splitting the key as well,was designed.At the same time,the introduction of random factor,timestamp and hash algorithm in the authentication protocol prevented various network attacks.Finally,the security and efficiency of the encryption algorithm and the security of the authentication protocol were analyzed,which proved the security and reliability of the authentication scheme.

    Android malware family classification method based on the image of bytecodeConstruction of MDS matrices
    Yi-min YANG,Tie-ming CHEN
    2016, 2(6):  38-43.  doi:10.11959/j.issn.2096-109x.2016.00066
    Asbtract ( 66 )   HTML ( 1)   PDF (5118KB) ( 43 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An Android malware family classification method based on the image of bytecode was proposed accord-ing to the exponential growth of Android malware.A bytecode file of Android malware was converted to a 256-level grayscale image and texture features was extracted from the image by GIST.The random forest algorithm was ap-plied to classify the extracted features.The method by the experimental data of 14 kinds of common Android mal-ware families was verified and was compared against the DREBIN on the same dataset.The experimental results show that the proposed method has high detection precision and low false positive rate.

    Construction of MDS matrices
    Peng-fei LI,Yong-qiang LI
    2016, 2(6):  44-53.  doi:10.11959/j.issn.2096-109x.2016.00063
    Asbtract ( 54 )   HTML ( 1)   PDF (1203KB) ( 118 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A survey for MDS matrices design strategy was made.Design strategies and the key issues during the de-sign were elaborated,and many aspects such as principle and implementation mechanisms of some typical and common construction of MDS matrices were analyzed and discussed.In addition,the research results on lightweight MDS matrices in recent years were investigated.

    Unknown attack detection model based on network behavior analysis
    Yi-han YU,Yu FU,Xiao-ping WU
    2016, 2(6):  54-57.  doi:10.11959/j.issn.2096-109x.2016.00058
    Asbtract ( 36 )   HTML ( 0)   PDF (254KB) ( 21 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    As for the intranet security threats of the increasing number of unknown attacks,an unknown attack detection model based on network behavior analysis was proposed.With the help of the information resources within the intranet,firstly,the information resources of the intranet were collected,then the risk factors of abnormal behav-ior of the internet information node were analyzed,finally,the information node and the information resources ac-quisition path as the key element were used to construct the detection model of the directed graph.By verifying,the model can achieve the desired detection results.

    Discovery and research of network security vulnerabilities based on Web application
    Xiao-shuang ZHANG,Yi-ling XU,Yuan LIU
    2016, 2(6):  58-65.  doi:10.11959/j.issn.2096-109x.2016.00065
    Asbtract ( 46 )   HTML ( 4)   PDF (793KB) ( 38 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Web security vulnerabilities can be divided into two categories,including security vulnerabilities Web platform and Web their own application.By analyzing the attack principle and process of Web application network security vulnerabilities,XSS vulnerability including type of the reflective,stored,and DOM,SQL injection vulner-ability and session authentication management vulnerability were studied.The corresponding preventive measures of the three kinds of vulnerabilities were put forward.

    Digital multi-signature scheme based on bilinear pairing
    Cai-juan ZHANG,Lin YOU
    2016, 2(6):  66-70.  doi:10.11959/j.issn.2096-109x.2016.00061
    Asbtract ( 20 )   HTML ( 1)   PDF (235KB) ( 10 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on bilinear pairing and three complicated problems,a new digital multi-signature scheme was pro-posed.In the new scheme,the advantage of fast signature in broadcasting digital multi-signature was applied to se-quential digital multi-signature.By changing the general mechanism of signature,signing could be done simultane-ously by the signers.Then,the signature was sent to verifier after it was verified by trusted third party.The trans-formation from concurrent signature to sequential signature was finally realized by the verifier.The security capa-bilities in three complicated problems,anti-fake attack and anti-conspiracy attack from some members of the new scheme were analyzed.Proposed scheme has many advantages over the old ones,such as fewer calculation,simpler algorithm,faster signing,higher security.

    Deniable authentication for multi-party protocol
    Yong CHEN,Long LU,Sheng-ke ZENG,Ming-xing HE
    2016, 2(6):  71-81.  doi:10.11959/j.issn.2096-109x.2016.00059
    Asbtract ( 19 )   HTML ( 0)   PDF (1589KB) ( 13 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Deniable authentication can authenticate messages like digital signatures,and its non-public verification can meet many requirements that cannot be met by signatures,such as privacy preservation.How to achieve deni-able authentication with multi-party protocol was the study aim.A deniable authentication for multi-party protocol using string commitment scheme was proposed.As a generic method,it can pass the most of protocol to deniable protocol,such as the deniable group key agreement protocol.The adversarial model was formalized and the security was proved strictly.The research content provide a new idea for studying deniable authentication.

Copyright Information
Bimonthly, started in 2015
Authorized by:Ministry of Industry and Information Technology of the People's Republic of China
Sponsored by:Posts and Telecommunications Press
Co-sponsored by:Xidian University, Beihang University, Huazhong University of Science and Technology, Zhejiang University
Edited by:Editorial Board of Chinese Journal of Network and Information Security
Editor-in-Chief:FANG Bin-xing
Executive Editor-in-Chief:LI Feng-hua
Director:YI Dong-shan
Address:F8,You Dian Publisher Building,No.11,Chengshousi Road,Fengtai District,Beijing 100078,PR China
Tel:+8610-81055479, 81055456
ISSN 2096-109X
CN 10-1366/TP
Total visitors:
Visitors of today:
Now online: