Security Service Technology for Mobile Networks

As mobile networks become high speed and attain an all-IP structure, more services are possible. This brings about many new security requirements that traditional security programs cannot handle. This paper analyzes security threats and the needs of 3G/4G mobile networks, and then proposes a novel protection scheme for them based on their whole structure. In this scheme, a trusted computing environment is constructed on the mobile terminal side by combining software validity verification with access control. At the security management center, security services such as validity verification and integrity check are provided to mobile terminals. In this way, terminals and the network as a whole are secured to a much greater extent. This paper also highlights problems to be addressed in future research and development.

Optimizing of large-number-patterns string matching algorithms based on definite-state automata

Because the small CACHE size of computers, the scanning speed of DFA based multi-pattern string-matching algorithms slows down rapidly especially when the number of patterns is very large. For solving such problems, we cut down the scanning time of those algorithms (i.e. DFA based) by rearranging the states table and shrinking the DFA alphabet size. Both the methods can decrease the probability of large-scale random memory accessing and increase the probability of continuously memory accessing. Then the hitting rate of the CACHE is increased and the searching time of on the DFA is reduced. Shrinking the alphabet size of the DFA also reduces the storage complication. The AC++algorithm, by optimizing the Aho-Corasick (i.e. AC) algorithm using such methods, proves the theoretical analysis. And the experimentation results show that the scanning time of AC++and the storage occupied is better than that of AC in most cases and the result is much attractive when the number of patterns is very large. Because DFA is a widely used base algorithm in may string matching algorithms, such as DAWG, SBOM etc., the optimizing method discussed is significant in practice.

An Improved Binary Search Anti-Collision Protocol for RFID Tag Identification

Radio frequency identification(RFID)has been widespread used in massive items tagged domains.However,tag collision increases both time and energy consumption of RFID network.Tag collision can seriously affect the success of tag identification.An efficient anti-collision protocol is very crucially in RFID system.In this paper,an improved binary search anti-collision protocol namely BRTP is proposed to cope with the tag collision concern,which introduces a Bi-response mechanism.In Bi-response mechanism,two groups of tags allowed to reply to the reader in the same slot.According to Bi-response mechanism,the BRTP strengthens the tag identification of RFID network by reducing the total number of queries and exchanged messages between the reader and tags.Both theoretical analysis and numerical results verify the effectiveness of the proposed BRTP in various performance metrics including the number of total slots,system efficiency,communication complexity and total identification time.The BRTP is suitable to be applied in passive RFID systems.

Cryptanalysis and improvement of a quantum secret sharing scheme based on χ-type entangled states

In the paper [2010 Chin. Phys. B 19 050306], Yang et al. put forward a novel three-party quantum secret sharing protocol of secure direct communication based on x-type entangled states, they claimed that the scheme is secure. However, in this paper, we study the security of the protocol and find that it is insecure. Applying intercept and resend attack, the agent Bob can obtain Alice＇s secret without the help from the other agent Charlie. In the end, we give our effective modification for its improvement.

An Addressing and Routing Scheme Based on Modified Euclidean Space for Hexagonal Networks

The addressing and routing algorithm on hexagonal networks is still an open problem so far.Although many related works have been done to resolve this problem to some extent,the properties of hexagonal networks are still not explored adequately.In this paper,we first create an oblique coordinate system and redefine the Euclidean space to address the hexagonal nodes.Then an optimal routing algorithm using vectors and angles of the redefined Euclidean space is developed.Compared with the traditional 3-directions scheme and the Cayley graph method,the proposed routing algorithm is more efficient and totally independent of the scale of networks with two-tuples addresses.We also prove that the path(s) obtained by this algorithm is always the shortest one(s).

The TOGAF Based Govemance Framework Proposition for Technology Management Systems

A computer-based technology management system is needed to manage technology assessment, technology acquisition, and technology planning capabilities to shape and accomplish the strategic and operational objectives of an organization. During the design of technology management intelligence, it has appeared that there has been a need to establish an integrated and systematic approach. The Open Group Architecture Framework （TOGAF） provides this systematic approach to the planning, development, implementation, and governance of the enterprise architecture. This exploratory paper examines the TOGAF approach to develop a technology management architecture in a product development organization. The paper discusses the development and proactive governance of the technology management architecture from various perspectives such as architecture capability, architecture development, transition planning, and architecture implementation. The paper presents a TOGAF based governance framework for the technology management system in an organization that develops s0ft＇ware-intensive systems. The framework supports an iterative approach in the architecture capability, architecture development, transition planning, and architecture implementation phases. The implementation governance phase can deal with multiple projects simultaneously. Therefore, the framework suggests applying agile system development principles to the projects that develop and deploy the architecture-compliant technology management solutions. The proposed framework helps organizations to design and implement a technology management architecture that meets the needs of the business. The framework also aims to simplify development and maintenance processes of a technology management system.

Anonymity control in electronic check systems

Electronic check systems, as one of electronic payment systems, are more desirable than other electronic cash systems. In the system, only a single cheek is used to pay any price that is not more than the face value. The main problem in check systems is to design an efficient refund mechanism that makes refired cheeks undistinguished from initial checks during payment and deposit. The problem of anonymity control also called fairmess is also an important issue in check systelns. All check systems yet are unconditional anonymity that opens the door to misuse for crime such as laundering and blackmailing. In this paper, the notion of anonylnity revocation is introduced to electronic check system for the fitst thne, and a model of fair electronic check system is proposed. An effieient fair online electronic check system with reusable refund is presented. In the system, a passive trustee is elnployed to revoke the anonymity of unhonest users. Moreover, the system solves the reusability problem of refunds thanks to the RSA-based partially signature. The system is efficient and meets all basic security requirements.

Novel architectures and security solutions of programmable software-defined networking:a comprehensive survey

Nowadays, cyberspace has become a vital part of social infrastructure. With the rapid development of the scale of networks, applications and services have become enriched, and the bearing function of the underlying network devices(such as switches and routers) has also been extended. To promote the dynamics architecture, high-level security, and high quality of service of the network, control network architecture forward separation is a development trend of the networking technology. Currently, software-defined networking(SDN) is one of the most popular and promising technologies. In SDN, high-level strategies are deployed by the proprietary equipment, which is used to guide the data forwarding of the network equipment. This can reduce many complicated functions of the network equipment and improve the flexibility and operability of the implementation and deployment of new network technologies and protocols. However, this novel networking technology faces novel challenges in term of architecture and security. The aim of this study is to offer a comprehensive review of the state-of-the-art research on novel advances of programmable SDN, and to highlight what has been investigated and what remains to be addressed, particularly, in terms of architecture and security.

Anomaly Detection in Microblogging via Co-Clustering

Traditional anomaly detection on microblogging mostly focuses on individual anomalous users or messages. Since anomalous users employ advanced intelligent means, the anomaly detection is greatly poor in performance. In this paper, we propose an innovative framework of anomaly detection based on bipartite graph and co-clustering. A bipartite graph between users and messages is built to model the homogeneous and heterogeneous interactions. The proposed co- clustering algorithm based on nonnegative matrix tri-factorization can detect anomalous users and messages simultaneously. The homogeneous relations modeled by the bipartite graph are used as constraints to improve the accuracy of the co- clustering algorithm. Experimental results show that the proposed scheme can detect individual and group anomalies with high accuracy on a Sina Weibo dataset.