Loading...

Table of Content

    10 August 2017, Volume 17 Issue 8 Previous Issue    Next Issue

    Orginal Article
    For Selected: Toggle Thumbnails
    Orginal Article
    A Survey of the Key Technology of Binary Program Vulnerability Discovery
    Xiajing WANG, Changzhen HU, Rui MA, Xinzhu GAO
    2017, 17 (8):  1-13.  doi: 10.3969/j.issn.1671-1122.2017.08.001
    Abstract ( 1274 )   HTML ( 47 )   PDF (12556KB) ( 501 )  

    In the current cyberspace, vulnerability has been attracted the widespread attention. Although source-code-oriented vulnerability analysis has made significant progress and has the characteristics of rich semantic, but many commercial software exists in the form of binary code in practical application. Therefore, binary-executable-oriented vulnerability discovery is more meaningful and useful. This paper first briefly introduces the typical binary vulnerability analysis framework. Based on the existing research work, this paper puts forward the whole idea of the research on the vulnerability discovery technology of binary program in the future, and then makes some research on some key points and key technologies respectively. Firstly, this paper briefly introduces the research on the key technologies of binary-executable-oriented background and significance of the intermediate language. Secondly, according to the three key technologies of taint analysis, symbolic execution and fuzzing, this paper introduces the basic principles and classification standards, processing flow, research situation and existing problems, respectively, and finally gives a simple summary. In this paper, a brief study of the binary program vulnerability discovery technology is given, which is helpful to carry out the follow-up research work.

    Figures and Tables | References | Related Articles | Metrics
    A Dynamic Deduplication Scheme Based on Linked List in Cloud Storage
    Jianhong ZHANG, Hongxin MENG
    2017, 17 (8):  14-18.  doi: 10.3969/j.issn.1671-1122.2017.08.002
    Abstract ( 437 )   HTML ( 1 )   PDF (3776KB) ( 78 )  

    Deduplication based on cloud can remove encrypted data from the same plaintext, thereby increasing the utilization of cloud storage space. Currently, deduplication can be achieved on both file-level and file-block level. However, most of the existing schemes do not support the dynamic operation of data, are short of flexibility, and can not meet the actual needs. This paper proposes a safe, high efficient cloud deduplication schema based on the advantages of flexible memory management and simple operation of linked list. The scheme can achieve high efficient deduplication on file-block level when the file changes dynamically, thus effectively saving the space of the cloud server.

    Figures and Tables | References | Related Articles | Metrics
    A Privacy-preserving Multi-authority Attribute-based Encryption Scheme on Ideal Lattices in the Cloud Environment
    Xixi YAN, Yuan LIU, Zichen Li, Qinlong Huang
    2017, 17 (8):  19-25.  doi: 10.3969/j.issn.1671-1122.2017.08.003
    Abstract ( 445 )   HTML ( 2 )   PDF (6166KB) ( 123 )  

    Based on the small key size and high encryption efficiency on ideal lattices, a privacy-preserving multi-authority attribute-based encryption scheme on ideal lattices in the cloud was proposed in this paper, which can support different attribute authorities to manage different attribute sets and generate privacy keys for the user. In the scheme, a partially-hidden policy is introduced to protect the users’ privacy. Thus, the sensitive values of user’s attributes are hidden to prevent from revealing to any third parties. In addition, the extended linear secret-sharing scheme is used to construct the access structure with a high flexibility. Besides, the scheme is proved to be secure against chosen plaintext attack under the standard mode. Compared to the existing related schemes, the users’ secret key and ciphertext in our scheme is reduced and it is more effective in the cloud environment.

    Figures and Tables | References | Related Articles | Metrics
    A Fine-Grained Face Privacy Protection Scheme in Social Networks
    Guojun MA, Kai LI, Qingqi PEI, Yang ZHAN
    2017, 17 (8):  26-32.  doi: 10.3969/j.issn.1671-1122.2017.08.004
    Abstract ( 492 )   HTML ( 3 )   PDF (6442KB) ( 78 )  

    In social networks, the large scale of users, the interaction of mass information and the diversity of services lead to a large amount of shared data, which mainlyformed by images. The coarse-grained access control scheme for sensitive facial information of images makes the shared data spread widely in existing social networks and also causes severe problems in revealing facial sensitive information, and even leads to vicious incidents. By establishing fine-grained relationships among publishers, visitors and accessing resources, subdividing access control cell into facial patches. Proposed a scheme for fine-grained protection offacial sensitive information of images, combining the AES encryption with the attribute-based encryption and the mixing distributed face recognition.A fine-grained facial sensitive information protection scheme is proposed. The scheme realizes the fine-grain and dynamic access control strategy which can ensure the sensitive facial information only be revealed to special visitors while images sharing, achieves the security of facial sensitive information while sharing and accessing.

    Figures and Tables | References | Related Articles | Metrics
    Research on Hardware Trojans Detection Based on Support Vector Machine
    Jing SU, Wenling LU, Yiqiang ZHAO, Yancui SHI
    2017, 17 (8):  33-38.  doi: 10.3969/j.issn.1671-1122.2017.08.005
    Abstract ( 544 )   HTML ( 1 )   PDF (5007KB) ( 107 )  

    In this paper the hardware Trojans theory and circuit design are described firstly,then the machine learning pattern classification theory are studied and applied into the data processing and analysis of side channelin integrated circuits. The two classification detection model of the hardware Trojans will be set up based on Support Vector Machine, and the model will be optimized by Cross Validation method. Finally the experiments are implemented in FPGA platform. When the Trojan circuit of area 0.69% is implanted into the standard circuit, the detection and recognition rate can reach the value of 98.64% according to the CV algorithm.

    Figures and Tables | References | Related Articles | Metrics
    A Secondary Index Scheme of Big Data in HBase Based on Solr
    Wenxian WANG, Xingshu CHEN, Haizhou WANG, Xiaosong WU
    2017, 17 (8):  39-44.  doi: 10.3969/j.issn.1671-1122.2017.08.006
    Abstract ( 636 )   HTML ( 9 )   PDF (5235KB) ( 309 )  

    For the problem that HBase cannot provide secondary indexes and Huawei hindex scheme is difficult to meet the project demand of retrieval speed, designed an HBase secondary index scheme named SIHBase (Solr Indexing HBase) based on Solr. The scheme uses HBase Coprocessor to achieve the related callback function for creating, changing, deleting operations of the data tables and inserting, updating, deleting recovering operations of data. Thus, it can create and manage secondary indexes in Solr for HBase automatically and ensure the consistency of the data and index. The scheme has favorable generality and can create index for multi-column data of multiple tables in the meantime. And then extended the client-side function of HBase, increased the direct query interface of Solr, using efficient, flexible and diversified retrieval functions which Solr provided to realize quick retrieval for the mass data of HBase. Finally, a contrast experiment about query performance with hindex show that SIHBase was turned out to be much faster than hindex in query speed.

    Figures and Tables | References | Related Articles | Metrics
    Regional Autonomous Identity Authentication Management Scheme for Space Self-organized Networks
    Jian ZHOU, Liyan SUN, Aihua DUAN, Wenjun SHI
    2017, 17 (8):  45-52.  doi: 10.3969/j.issn.1671-1122.2017.08.007
    Abstract ( 570 )   HTML ( 1 )   PDF (7144KB) ( 88 )  

    Due to long time delay, broad coverage area, limited node capability and high mobility in mobile space self-organized networks, it is difficult to recognize the identity of node efficiently and safely. In order to solve the question, this paper put forwards a scheme based on random key graph, with which two nodes could prove the identity each other if they have a same edge from the random key graph based on DH protocol. At time, pre-configurationidentity authentication protocol is suggested for distributed networks, space entities get part of the material of identity authentication so as to recognize all legal nodes identity directly and indirectly according to parameters including network size, key graph scale, connective probability, and recognizing the legal identity of neighbor nodes successfully is a high probability event.So the scale of secret value for node identity can be lessened in the condition of guaranteeing the efficiency of identity authentication with increasing the number of certificates.

    Figures and Tables | References | Related Articles | Metrics
    A Lightweight Fast Security Authentication Strategy towards Software Defined Satellite Networks
    Yan PENG, Shan LIAO, Baokang ZHAO
    2017, 17 (8):  53-59.  doi: 10.3969/j.issn.1671-1122.2017.08.008
    Abstract ( 481 )   HTML ( 2 )   PDF (5830KB) ( 158 )  

    By decoupling the control plane and the data plane, software defined satellite networks achieves a unified network management, which is a new type of satellite network architecture. Security authentication is a core problem in software defined satellite networks. The control path between the control plane and the data plane has the characteristic of periodic switching, which makes the network face significant security threats. However, there are few studies on software defined satellite network security now around the world. This paper proposes a lightweight fast security authentication strategy that reduces the time overhead of frequent handover under proven security. Experimental results in the simulation experiment platform show that the computational cost of the strategy is large, but the strategy saves communication time, which is suitable for software defined satellite networks.

    Figures and Tables | References | Related Articles | Metrics
    An Improved RFID Ownership Transfer Protocol Based on Cloud
    Ping WANG, Zhiping ZHOU
    2017, 17 (8):  60-68.  doi: 10.3969/j.issn.1671-1122.2017.08.009
    Abstract ( 542 )   HTML ( 2 )   PDF (8435KB) ( 102 )  

    Aiming at the deficiency of CROP protocol, an improved ownership transfer protocol is proposed in this paper. In order to resist the inner reader impersonation attack, the improved scheme adds new storage information to the cloud, which introduces the current reader’s shared key for Hash encryption to ensure the key confidentiality. In the tag authentication information, the random numbers generated by the current and new reader are added to perform the pseudo random function and the quadratic residue encryption to resist tag impersonation and reader tracing attacks. To solve the de-synchronization attack, the reader simultaneously stores the updated and un-updated key to ensure synchronization between the reader and the tag. Using the quadratic residue theorem to encrypt the index to ensure the current reader can use the index quickly retrieve the legal tag and improve the authentication efficiency. Based on the Vaudenay privacy model, this paper proves the improved scheme satisfies the privacy performance of strong forward as well as backward un-traceability and can resist inner reader impersonation, de-synchronization, tag impersonation attacks and other security risks. The experimental results show that the improved scheme effectively reduces the reader’s authentication time. Compared with the existing protocols, this paper improves the scalability of the protocol while satisfying the secure ownership transfer.

    Figures and Tables | References | Related Articles | Metrics
    Research and Implementation on Multi-Layer User Classification Method Based on Cloud System
    Zhuojian JIANG, Chunhua WU, Ming XIA
    2017, 17 (8):  69-75.  doi: 10.3969/j.issn.1671-1122.2017.08.010
    Abstract ( 555 )   HTML ( 2 )   PDF (5609KB) ( 83 )  

    How to analyze user information and summarize user behavior from large-scale network traffic is now a key technology in the Internet era. This paper makes a full investigation on the existing research results, summarizes the advantages and disadvantages of the previous methods in user classification and traffic analysis and analyzes the potential security risks in the cloud system,finally proposes a multi-scale user classification technology based on cloud system. Through analyze user behavior from the IP session and some other information, our method puts forward the classification label accordingly, and extracting effective classification features, last, we classify the user by machine learning methods combined with statistic. This method can extract valuable information from network traffic, and use the information to distinguish users, generalize user behavior in traffic.

    Figures and Tables | References | Related Articles | Metrics
    Research on a Method of Data Theft Detection Based on Time Series Decomposition
    Ran AN, Xiaobo ZHU, Hanbing YAN
    2017, 17 (8):  76-82.  doi: 10.3969/j.issn.1671-1122.2017.08.011
    Abstract ( 509 )   HTML ( 1 )   PDF (5602KB) ( 170 )  

    In the field of network security, data theft detection is an important part of research contents. This paper proposes a time series decomposition algorithm in network traffic scenarios which decomposes data into three parts of seasonal data, trend data and residual data. The algorithm uses median in sliding window to fit better with the trend data, filters discrete single points, and takes the time interval containing continuous outliers as the final output form of the algorithm. The paper proposes that the information entropy of payload length is helpful detecting the hidden data theft behaviors. In the part of experiment, the algorithm is compared with STL and Piecewise Median algorithm. The algorithm is used to detect the time series that are processed with information entropy tool. Experiments show that, compared with STL and Piecewise Median algorithm, this algorithm improves the performances greatly, data theft detection effect is well.

    Figures and Tables | References | Related Articles | Metrics
    Research of Private Cloud Security’s Response to BlackMail Virus
    Fan JIANG, Yixiang WEI, Yan ZHUANG, Jingbo ZHANG
    2017, 17 (8):  83-88.  doi: 10.3969/j.issn.1671-1122.2017.08.012
    Abstract ( 582 )   HTML ( 3 )   PDF (5570KB) ( 163 )  

    The outbreak of BlackMail Virus exposes the problem of enterprise data assets protection, and the performance of cloud storage also draws enterprise users’ attention. This paper firstly analyzes the risks that the enterprises facing during the Virus outbreak, explores the advantages and disadvantages of several traditional Data Protection Technologies. Then it points out the difficulty of them and analyzes the fundamental principles of private cloud storage’s confidentiality, integrity and availability. What’s more, the Trade Secrets’ protection effectively responds to the virus attacks, and draws on the experience of data security on complete period and whole process.

    Figures and Tables | References | Related Articles | Metrics