Earticle

Location privacy has been a serious concern for mobile users who use location-based services to acquire geographical location. Spatial cloaking technique is a well-known privacy preserving method, which blurs an exact user location into a cloaked region to meet privacy requirements. In this paper, we propose a new semantic privacy preservation method rely on the well-established k-anonymity and l-diversity privacy metrics for semantic cloaking. We also define a representative cloaking region which helps in communication cost reduction caused by user movement. Experimental implementation and analysis exhibit that our proposed method renders good performance in efficiency and scalability. We also show that our proposed method outperforms the existing privacy preservation method by effectively enhance privacy against various adversaries.

It is expected that utilization and expansion of cyber-space on the basis of big data, cloud computing and IoT(Internet of Things) will be a critical factor which determines national competitiveness. In the meantime, cyber threat accompanied by the utilization of cyber space, attacks targeting cyber space, became enhanced and complicated. Besides this, attackers were also more organized with economic and political intention. As a result, damage caused by the attacks targeting cyber-space has already brought about social confusion. This paper analyzes various countries' cyber security strategy by focusing on public-private partnership, which is one of the common grounds of the strategies. Especially, it focuses on how each country establishes institutional framework of the partnership related to infra-protection. The subject of analysis is limited to U. S. A, EU and Japan. Consequently, the countries, to some degree, adopt intervention policy through cyber security strategy, and government control is changing from voluntary self-regulation to enforced self- regulation in general. Additionally, public-partnership is more and more emphasized.

The bandwidth of kernel function is invariance in Mean-Shift tracking process which led to the problem of actual process of tracking failure. To solve this question a method is proposed to combine object contour, RGB color histogram and Mean-Shift tracking algorithm. In each frame the contour and color feature of target object are extracted to as a model. Meanwhile the size of contour is used as the bandwidth for kernel function in the next frame. Based on this Method the accuracy of Mean-Shift tracking is improved and the error of Mean-Shift tracking is reduced.

Network information security suffered many network threats; the existing encryption algorithm has been unable to meet the needs of network and information security problems. The improved ECC algorithm based on network information security, the algorithm based on the original ECC algorithm and its optimization dot product operation optimization and square residual determination, optimization and transformation of the private key update to improve the original operational efficiency and safety performance of the ECC algorithm. The experiments show that the ECC algorithm based on network information security improvements in safety performance than the RSA algorithm as well as the original ECC algorithms have significantly improved the program is effective.

Most of small startup companies are exposed to various dangers like hackings or DDoS attacks due to their poor knowledge in server operation and its security. In this project, we have implemented the Graphic Based Network Intrusion Detection System to assist users to operate the server more easily by offering them an intuitive interface for the purpose of stable server operation. When one runs individual or small sized startup business in Republic of Korea, they often overlook the possibility of security accidents or forgo security arrangements because of the costs. Consequently such companies suffer heavy damages in their businesses when they defenselessly exposed to the hackers, leading to serious security accidents. We expect that many companies could be relieved from such difficulties, and proposing our program to encourage the use. Moreover, since all of the network based attacks go through interface cards, it is possible to prepare for the diverse attacks with consistent updating. While network analysis tools are difficult to use and need professional skills, the system suggested in this paper has made it easier to be utilized by non-professional users showing the analysis results graphically and just checking them with mouse clicks. The system can be utilized in detection of intrusions and malignant Botnets, and enabling the use of network analysis tools which are easily adopted by the ordinary users. That is, by checking the information related to the Network Intrusion Detection with a graphic Based method, which does not require expert knowledge, the system can contribute to overall network security.

Chaos theory has provided a new pattern for understanding the interacting process of risk factors in system analysis. Software project risk system is a nonlinear system and so it also can be seen as a chaos system. This paper introduces chaos theory into the analysis on software project risk systems to find the evolution law of risk system From the point of chaotic dynamics a dynamic model based on three main parameters for software project risk system on the basis of rational assumption is established. According to judging principles of Lyapunov exponent on chaotic characteristics and the calculation of Lyapunov exponent of software project risk system model, this paper proves that the software project risk system is a chaotic one, which lays the foundations for the related risk research based on the chaos theory. Then it discusses chaotic characteristics such as initial sensibility, inner randomness and strange attractor in software project risk system, which gives guidance for risk control. It also brings a new thought for the study of software project risk management from the point of system.

This paper presents the novel selective encryption algorithm for vector map protection for storage, transmission, distribution to authorized users. In proposed algorithm, we just select some values of polylines and polygons in DCT domain to encrypt by random algorithms and cryptography. Experimental results verified that proposed algorithm is effectively and security. Maps are changed whole after encryption process, and unauthorized users cannot access to copy or use them. Encrypted maps do not alter the size of file and not have loss accuracy. The error between original map and decrypted map is approximate zero.

With the rapid development of information technology, information systems security becomes more and more important for both national economics and people’s everyday life. Therefore, in this paper, we study on the problem of information systems security assessment. However, existing traditional methods has two major issues. First, it is unclear that whether there remains severe potential risks unrecognized, and thus the reliability is limited. Second, the assessment results deviate from the real one due to the time and environmental restrictions, the subjective reasons of the researchers, or biased observed data, etc. To this end, we propose to leverage system dynamics (SD) for information systems security assessment. Specifically, based on the analysis of casual loops and positive and negative feedbacks among factors, we explore potential risks and capture those who are impossible to be measured using traditional methods.

To deal with the faulted line selection in the single-phase to ground faults caused by neutral non-effective grounding in the distribution network, a new method by using zero-sequence admittance is proposed in this paper. Compensation admittance, which amplifies the difference in zero-sequence admittance between the faulted line and the unfaulted line, is convenient for the formation of the criteria for value setting in engineering. To eliminate the blind zone, combining the criterion of the susceptance error in the compensated admittance with the phase angle criterion helps form a new algorithm to identify the single-phase to ground faults in the neutral non-effectively grounded system. Results of simulation tests show that the algorithm has nothing to do with the network structure and parameters, fault conditions and fault resistance, significantly escalating the successful selection of the faulted line.

Recently, the e-Navigation is main flow of worldwide maritime communications. The e-Navigation suggested by the International Maritime Organization (IMO) and International Association of Lighthouse Authorities (IALA) is about collecting/integrating/expressing /analyzing/exchanging the marine data between ships and the land in harmony through the electronic method for protecting marine environment, keeping safe navigation, and maintain-ing marine safety/security [2]. However, the e-Navigation is concentrated only the maritime service and a common data structure to share maritime information, so security considera-tions especially when ship starts to communicate other ships is insufficient. In this paper, we analyze the e-Navigation Maritime Service Portfolios (MSPs) and ship-to-ship information sharing protocol. We propose security requirements of MSPs and secure ship-to-ship infor-mation sharing scheme to provide reliable communication between ships based on the analy-sis results. Our proposed scheme has 3 steps to authenticate each other using the each ship’s Maritime Mobile Sevice Identify (MMSI) is a unique key of each ship and increases the secu-rity of reliable ship-to-ship communication.

Algebraic immunity is a cryptographic criterion for Boolean functions used in cryptosystem to resist algebraic attacks. They usually should have high algebraic immunity. Chen proposed a first order recursive construction of Boolean functions and checked that they had optimum algebraic immunity for n<8.This paper gives a detail proof of having optimum algebraic and being balanced for all n>0.

Port hopping is a typical proactive cyber defense technology, which hides the service identity and confuses attackers during reconnaissance by constantly altering service ports. Although several kinds of port hopping mechanisms have been proposed and implemented, but it is still unknown how effective port hopping is and under what circumstances it is a viable moving target defense because the existed works are limited and they usually discuss only a few parameters. Besides, in many cases the defense effectiveness has been studied empirically. In order to have an insight into the effectiveness of port hopping, this paper introduces a quantitative analysis based on the urn model, which quantifies the probability of attacker success in terms of port pool size, number of probes, number of vulnerable services, and hopping frequency. Theoretical analysis shows that port hopping is an effective and promising proactive defense technology in thwarting cyber attacks.

In order to design a reasonable pedestrian evacuation and exclude the security risks in large stadiums, this thesis proposes the research of security model of evacuation in stadiums combined with multi-agent and cellular automata. The research is based on cellular automata model and the process makes extended analysis to the cell’s behavior of autologous, and then it makes simulation experiments of the process of simulating the evacuation in large stadiums. Simulation results finally show that Agent-CA combines the advantages of multi-agent and cellular automata, which fully considers the individual internal factors. Compared to traditional cell cellular automata, it is more close evacuation situation of the realistic major sports stadium, and it shortens the evacuation time and improves the safety.

To overcome the drawback of KNN algorithms based on distance measure which did not measure the contributions for each feature accurately. In this paper, a K-Nearest Neighbor (KNN) de-noise method based on likelihood distance entropy is proposed. The relations of feature parameters are used to measure their contributions for de-noise energy, then according to the contributions for each feature leading de-noise of the feature parameters. In order to compare the performance of these relative methods, the Letter corpora and Pima Indians Diabetes data-base are employ to carry out the experiments, the experiment results show that comparing with the other de-noise methods mentioned in this paper, this proposed method have a better ability for de-noise.

Based on computation and network technology, Cyber-Physical Systems (CPS) has achieved rapid growth but it is faced with increasingly serious security problems and needs targeted security protection technologies. Considering the characteristics of the typical architecture of CPS, this paper integrates the analytical method of information flow based on the noninterference theory and proposes the security protection design of CPS through formal methods and provides a kind of safety system based on this design framework.

Ordered multisignature allows signers attest to a common message as well as the order in whey they signed. Unlike multi-signature, aggregate signature aggregate signature scheme provides a method to aggregate signature by signature on different messages. In this paper, we presented an ordered multisignature provably secure without random oracles. We mainly focus on construction of perfectly hiding and computationally binding commitment (PHCBC). Our construction was based on the signature scheme of waters and is computationally suitable for practical application. Experiment showed that this scheme was suitable for the practical application with high computing efficiency. By transmitting individual signatures into a multi-signature, multi-signature scheme can greatly save communication cost.

The significance of digital information security has been enhanced due to the boost of internet communication. Providing security for server client communication over the internet is a critical issue due to open world digital eavesdroppers. Generally, password authentication is required for establishing a connection between server and client environment. The client password is verified by the server ends to establish a valid connection. Successful password verification initiates the client and server to perform further secured request and response mechanisms. The problem of password authentication over insecure networks presents in many application areas, such as web login, remote logins of computer networks. Hence the significance of confidential password transmission over insecure internet becomes the necessity of secure authentication. In this paper, we proposed a secure password transmission over the internet for authentication of server/client environment using encryption and image steganography. Client password is first encrypted and embedded in an image using steganographic algorithm at client side and transmitted over unsecured network to the web server. On the other side server extract safely password from image steganography decoding algorithm, decrypt and verified it’s with SQL database server. In case if the intruder steals the image over network he/she will be unable to decode the password from the image. The prototype of the proposed method is implemented using JavaScript, Html, and ASP.net for verification purpose.

In 1984, Shamir [1] introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a public key generation (PKG) and identify himself before joining a communication network. Once a user is accepted, the PKG will provide him with a secret key. In this way, if a user wants to communicate with others, he only needs to know the “identity” of his communication partner and the public key of the PKG. There is no public file required in this system. However, Shamir did not succeed in constructing an identity based cryptosystem, but only in constructing an identity-based signature scheme. Meshram and Meshram [5] have proposed an identity-based beta cryptosystem, security under the generalized discrete logarithm problem with distinct discrete exponents in the multiplicative group of finite fields and integer factorization problem. In this paper, we propose some modification in identity-based beta cryptosystem based on generalized discrete logarithm problem with distinct discrete exponents in the multiplicative group of finite fields and integer factorization problem and we consider the security against a conspiracy of some entities in the proposed system and show the possibility of establishing a more secure system.

In the era of internet, most of the people all over the world completed their transaction on internet. Though the user of electronic transaction or E-money transaction system increase rapidly but the majority person are concern about the security of this system. The growth in online transactions has resulted in a greater demand for fast and accurate user identification and authentication. Conventional method of identification based on possession of ID cards or exclusive knowledge like a social security number or a password are not all together reliable. Identification and authentication by individuals' biometric characteristics is becoming an accepted procedure that is slowly replacing the most popular identification procedure – passwords. Among all the biometrics, fingerprint based identification is one of the most mature and proven technique. Along with the combination of conventional system, biometric security, Global positioning system(GPS) and mobile messaging we have design an algorithm which increase security of electronic transaction and more reliable to user. A three layer security model to enhancing security of electronic transaction is proposed in this paper.