Loading...

Table of Content

    10 July 2015, Volume 15 Issue 7 Previous Issue    Next Issue

    Orginal Article
    For Selected: Toggle Thumbnails
    Orginal Article
    Analysis and Research on Big Data Security in Smart City
    Hong-song CHEN, Zhi HAN, Shu-ning DENG
    2015, 15 (7):  1-6.  doi: 10.3969/j.issn.1671-1122.2015.07.001
    Abstract ( 386 )   HTML ( 2 )   PDF (2311KB) ( 267 )  

    Human society has completely entered the information age, the amount and complexity of information in modern society has exceeded peoples' vision in ten or twenty years ago. How to make use of big data within the national legal framework is important, it is a great challenge for the researchers of information security to coordinate and process the contradiction between the openness of big data and the protection of information. ICT (information and communication technology) is used to realize sustainable development of smart city. With the rapid increasing of big data in the construction and implementation of smart city, there are great challenges in data collection transmission storage and audit. The security of big data is the foundation and assurance of smart city. This paper analyzes the security policies during data storage data application and data management, introduces a multi-label based access control model for big data, which the owners of the data can add security labels to implement security access control according to the real security requirements. Taking the construction of London smart city as example, this paper analyzes the key function of big data in smart city.

    Figures and Tables | References | Related Articles | Metrics
    Cloud Data Integrity Verification Scheme without Bilinear Pairing
    Yang ZHAO, Hua-qiang REN, Hu XIONG, Yang CHEN
    2015, 15 (7):  7-12.  doi: 10.3969/j.issn.1671-1122.2015.07.002
    Abstract ( 361 )   HTML ( 1 )   PDF (1539KB) ( 175 )  

    Cloud storage system brings conveniences to the modern life, the user can store their data in the cloud storage system and access data through the Internet in different places. But due to the cloud server is half credible, in order to ensure the completeness and correctness of the cloud data, the user needs to provable cloud data possession. This paper proposes a cloud data integrity verification scheme without bilinear pairing. The users can entrust a third party agent to audit cloud data. Firstly, the third party agent send challenge information to the cloud server, the cloud server according the information to generate the corresponding proof sent to the third party agent for validation. Before the third party agent audit the proof, it needs to be sent to the re-signature server for re-signature, and then the third party agent using its own private key to verify the proof of re-signature. When audit fails, the third party agent notifies the user. Since the scheme proves without bilinear pairing, the computing performance is superior to the existing scheme which requires expensive bilinear pairing operation. At the same time, because in the audit process it requires the participation of re-signature server, so this scheme can realize the function which the users undo rights of the third party auditor. By security analysis and performance analysis which in the end of this article, we can be seen that this scheme is an efficient security provable data possession scheme.

    Figures and Tables | References | Related Articles | Metrics
    Application and Implementation of Hadoop Cloud Computing Technology in Junk Message Filtering
    Da-peng SUN
    2015, 15 (7):  13-19.  doi: 10.3969/j.issn.1671-1122.2015.07.003
    Abstract ( 438 )   HTML ( 0 )   PDF (1861KB) ( 85 )  

    The problem of junk message has become more severe. The flood of junk message has not only greatly disturbed people’s life and also endangered public security and social stability. Therefore, the research of accurate and intelligent filter of junk message is of great significance. The research of existing filtration methods indicates that their implement has some shortcoming. The filtration methods based on black and white list are too simple and brutal. Although, the accuracy of content-based filtration has been improved greatly, their complexity of algorithm usually is cause of operator service network jam. The research indicates that the cloud computing technology has a great advantage in scalability, reliability, cost and other aspects. In particular, the scale of computing power can be made of infinite size in low cost relied on its high-expansion of scale. So the cloud computing is a good platform. Based on this foundation, the essay conducted a careful analysis of algorithm principle of content-based filtration and found that almost all the algorithm of content-based filtration currently used is based on Bayes classification theory. After a detailed study and relevant experiment, found that the content-based filter can be implemented by relying on the cloud computing platform and MapReduce programming model.

    Figures and Tables | References | Related Articles | Metrics
    Research on Multi-Level Management Mechanism in Trusted Cloud Computing
    Wei MA, Zhen HAN, Yang CHENG
    2015, 15 (7):  20-25.  doi: 10.3969/j.issn.1671-1122.2015.07.004
    Abstract ( 417 )   HTML ( 0 )   PDF (1929KB) ( 97 )  

    More and more attentions are paid to security issues in cloud computing with the rapid development of cloud computing. The CSA (Cloud Security Alliance) pointed out that the risks of Cloud computing, mainly includes data center security and incident response, application security, key management, authentication and access control, the virtualization layer security, and disaster preparedness and business consistency, etc. There are a lot of differences between cloud computing and traditional IT services, so cloud computing service providers must gain the trust from clients by providing the safety of the service provided by them. Hence, cloud computing is constitutionally a trusted computing model. And it would be a fundamental approach to enhance the transparency of the service. This paper proposes a multi-level management mechanism for intrusted cloud computing. This mechanism is able to enhance the transparency of cloud computing so that the clients can get involved into the management of their own data and services. Meanwhile, this mechanism would improve the confidence of clients for the cloud computing service and reduce the operation and maintenance overhead of the cloud service provider.

    Figures and Tables | References | Related Articles | Metrics
    Research on FTP Protocol Identification Method Based on Tagged Word
    Jing-zhong WANG, Wei-meng WANG
    2015, 15 (7):  26-31.  doi: 10.3969/j.issn.1671-1122.2015.07.005
    Abstract ( 516 )   HTML ( 5 )   PDF (1580KB) ( 198 )  

    The development and popularization of the Internet lead to the development of the Internet broadband business, pushing the network supervision technology to the field of vision of people. Internet regulators and network service providers need to accurately understand the increasingly complicated Internet traffic through the network supervision technology. But, with the development of network technology, some traditional network supervision technologies gradually lose their original functions. Among them, traditional FTP port identification technology has been unable to identify the FTP protocol accurately. This paper proposes a FTP protocol identification method based on tagged word, in order to identify FTP data packets transferring on the existing network, and accurately detect the FTP protocol. This paper also puts forward a scheme, which combines with the FTP protocol port identification and FTP protocol tagged word identification. Compared with single FTP protocol port identification method, with no effect on identification efficiency, the scheme can improve the FTP protocol identification accuracy. Compared with single FTP protocol tagged word identification method, with no effect on identification accuracy, the scheme can improve the FTP protocol identification efficiency. In the end, this paper proposes an automatic extraction method of FTP features, which could classify the FTP protocols automatically.

    Figures and Tables | References | Related Articles | Metrics
    Research on the Identification Scheme of IoT Based on Space Coordinates
    Ying-chuan ZHAO, Ke XU
    2015, 15 (7):  32-40.  doi: 10.3969/j.issn.1671-1122.2015.07.006
    Abstract ( 283 )   HTML ( 2 )  

    The rapid development of the Internet of things (IoT) brings the explosive growth of equipments that access in network, at the same time brings the problems that network address space is deficient, information search efficiency is low, and security and privacy are hard to control. In order to solve the problems, this paper starts from the perspective of identity, and proposes an IoT identification scheme based on the space coordinates on the base of analyzing and summarizing the identification systems in the IoT. The scheme introduces the 3D coordinates, which are the latitude, the longitude and the altitude of the object, adding the extended code which distinguishes the object more accurately. This scheme can directly acquire the precise locations of object in the identification information, according with peoples' cognitive habits and increasing the security of network information to some extent. The method that the object with or without location capability applies, distributes and obtains identification is proposed in this paper based on the identification scheme. At last, this paper gives some simple experiments to demonstrate the identification scheme.

    Figures and Tables | References | Related Articles | Metrics
    Research on Full Homomorphic Encryption Scheme Based on Binary LWE
    Zhi-gang WANG, Chun-guang MA, Xiao-qian SHI
    2015, 15 (7):  41-50.  doi: 10.3969/j.issn.1671-1122.2015.07.007
    Abstract ( 611 )   HTML ( 2 )   PDF (2579KB) ( 290 )  

    The paper constructs a fully homomorphic encryption method based on Binary LWE with a shorter secret key and smaller cipher text. The main obstacle when doing implementation of the fully homomorphic encryption method is that the size of secret key and the scale of the cipher text are too big and that its efficiency is too low. This article improved the key technology of the basic encrypting method. In the previous methods, some collections chosen uniformly and randomly are added to LWE’s random samples. However, the method this article proposes will add some Gausian Error to the LWE samples chosen from Gausian Distribution. This will decrease the sample size of LWE from 2nlogq to n+1. And the private key of this method will be chosen directly from the set {0,1}n instead of the Binary decomposition algorithm. This method will adopt the key conversion technology to avoid the rapid expansion of the scale of the cipher text after tensor multiplication, and meanwhile get a smaller size of secret key. In the end, the article will attribute the security of the method to the assumptions of difficult problems when searching Binary LWE and then give a security proof.

    Figures and Tables | References | Related Articles | Metrics
    Provable Security Research on User Authentication Scheme of Roaming Network
    Hui-zhi LI, Guang-guo HAN, Yi WANG
    2015, 15 (7):  51-57.  doi: 10.3969/j.issn.1671-1122.2015.07.008
    Abstract ( 326 )   HTML ( 0 )   PDF (1752KB) ( 202 )  

    Global mobility network (GLOMONET) is a useful network environment which allows a mobile user to access the services provided by his home network in a foreign network. In order to ensure the secure communications conducted over the GLOMONET, it is important to authenticate mobile users before providing services. Recently, due to the advantages of tamper-resistance and convenience in managing the password files, some secure authentication schemes based on smart cards are proposed. The article points out the security vulnerabilities in some schemes and proposes a modified user authentication scheme. The scheme adopts the elliptic curve encryption system and uses low-cost function such as one-way hash function and exclusive-OR operation, so it is more secure and it has smaller amounts of calculations and smaller storage spaces. It is more suitable for battery-powered mobile equipments. It only requires four information exchanges between user and two agents. It possesses important security attributes including single registration, user anonymity, and no password table. The scheme is proved that can resist various attacks such as replay attack, known-key attack, imitation attack, and inside attack.

    Figures and Tables | References | Related Articles | Metrics
    Detection of Mobile Terminal Malware Based on Kernel Log
    Jian-yi LI, Hui LI, Meng-yuan HUANG
    2015, 15 (7):  58-63.  doi: 10.3969/j.issn.1671-1122.2015.07.009
    Abstract ( 394 )   HTML ( 0 )   PDF (2613KB) ( 129 )  

    With the intelligent mobile terminal, mobile terminal store a large amount of personal privacy information. Due to the growing number of malicious applications on mobile terminals and for detecting malicious applications lack of effective mechanism, the existence of malicious applications will result in the leakage of personal privacy information, personal property, and reputation damage. In order to prevent the happening of this kind of harm, kernel is proposed in this paper, based on system call log information to identify the behavior of the application. Detection method is as follows, first download malicious application with benign application, run and collect their system kernel call log information, the statistics system call frequency information as the original data. Then normalized processing the raw data, generated for the analysis of the input data and generate the input vector. Finally use the K-Means clustering algorithm to cluster the input vector, the generated two clustering cluster, malicious and benign application of clustering cluster respectively, and then apply some unknown types of kernel call information as the validation data generated input vector, determine the application belongs to which cluster, can know the application of the presence of malicious behavior. This paper test the method using WEKA, test results show that the method is effective to distinguish the malicious applications and benign applications.

    Figures and Tables | References | Related Articles | Metrics
    A DTW Signature Verification System Based on Statistical Modeling
    Chen-dan YAN, Yang YANG, Jiu-jun CHENG, Jian-yu SHAO
    2015, 15 (7):  64-70.  doi: 10.3969/j.issn.1671-1122.2015.07.010
    Abstract ( 405 )   HTML ( 0 )   PDF (2275KB) ( 107 )  

    Signature is an essential authentication means for document approvals and transactions. Online handwritten signature verification has become a key issue in information security with the development of electronic transactions. The principle of signature verification is, supposing the signature of a person is unique and stable, to compare the image, stroke, pressure and velocity information of an inspecting signature with the true signature samples. Thus, the signature can be verified or not. Dynamic time warping (DTW) algorithm is a common algorithm for checking the verification of signatures. It calculates the distance between an inspecting signature and its true signature to judge the verification in the nonlinear time alignment. However, it is hard to determine the threshold, which is related with the individual writing habits. So, it is difficult to do statistics or training. The optimized DTW algorithm, which is based on statistical model of characteristic points, views signature’s characteristic points as a certain probability distribution. Through statistical models, the probability less than the threshold of the feature point is regarded as illegal signature. In this algorithm, the threshold is independent from the individual characteristics. However, this method still needs a lot of a certain person’s true signature samples to train for statistics. In this paper, an improved DTW algorithm based on statistical models is proposed, in which a small amount or even one true signature can be authenticated, and its validity is proved by using this method.

    Figures and Tables | References | Related Articles | Metrics
    Research on Authentication Protocol Security Based on Formal Verification Tool
    Ran DUAN, Nai-yang XU, Ai-qun HU
    2015, 15 (7):  71-76.  doi: 10.3969/j.issn.1671-1122.2015.07.011
    Abstract ( 411 )   HTML ( 1 )   PDF (1726KB) ( 165 )  

    With the rapid development of the Internet services, the computer network has been the main approach to interchange of information. The Internet brings convenience to people, while also brings about privacy leakage and further more monetary loss. People devotes to themselves to protect information security in which authentication protocol is in major. Formal analysis assists protocol-design and covers the bug of protocol security. Formal analysis includes model checking, theorem proving and belief logic. AVISPA includes model checking and some else formal analysis, and also can be automatic. SPAN makes the function of AVISPA vivid and localization which is described as Message Sequence Charts. Choose SPAN to analyze SSL protocol and Kerberos protocol. It turns out that SSL protocol tends to suffer from falsify certification and the public key system isn’t secure on Kerberos protocol. To improve SSL protocol, make users not believe in SSL certification and provide the intruder from fetching public-key for encrypting certification; to improve Kerberos protocol, public-key replacing symmetric-key keeps other keys safe even if the intruder crack one key.

    Figures and Tables | References | Related Articles | Metrics
    Research on Community Detection Method for Social Networks Based on User Interaction and Similarity
    Wei XU, Bo-gang LIN, Si-juan LIN, Yang YANG
    2015, 15 (7):  77-83.  doi: 10.3969/j.issn.1671-1122.2015.07.012
    Abstract ( 441 )   HTML ( 5 )   PDF (2152KB) ( 245 )  

    With the development of the complex social networks, researches on algorithms about social networks community detection also develop constantly. Researches on algorithms about social networks community detection only take advantage of single dimension information of the network. This paper presents a community detection method that considers user interaction and the similarity comprehensively, detecting community structure in social network by mixing together multiple dimensions information effectively. The method summarizes multi-dimensional relations between users as interaction and similarity .using similarity modularity that is added similarity penalty factor as object function to guide the community division. Experimental results on real data sets show that the method not only can reflect the dynamic changes in the network, but also can get closely linked collection of nodes with similar attributes, proving the rationality and effectiveness of the method.

    Figures and Tables | References | Related Articles | Metrics
    Research on the Popular Microblogging Classification Based on User Clustering
    Shi-hao ZHANG, Yi-jun GU, Jun-hao ZHANG
    2015, 15 (7):  84-89.  doi: 10.3969/j.issn.1671-1122.2015.07.013
    Abstract ( 779 )   HTML ( 2 )   PDF (1500KB) ( 154 )  

    On the basis of the existing classification of microblogging,this paper proposes a classification method based on the clustering of user which has forwarded a popular microblogging.By using this method,the classification result we obtain will be more useful in the policing work.Clustering algorithm used in the text is a maturealgorithm called K-means and its improved algorithm called X-means.X-means algorithm uses a more scientific criterion called BIC to measure the similarity between the classes, and users no longer need to specify the number of clusters. All they need to do is just specifying the number of clusters range. By this kind of mechanism, X-means clustering algorithm is able to improve its accuracy and scientific.We analyzed and compared the results of the experiment and find that the results of X-means clustering algorithm derived fit better than K-meansclustering algorithm, and therefore,this paper will use X-means clustering algorithm in the microblogging category study.In addition, this paper listed case of different types of users gathered under different kinds of microblogging, and proposed different strategiesto the different kinds of microblogging.

    Figures and Tables | References | Related Articles | Metrics