Search

Virtual machine security issues have been the focus of attention. The permissions of traditional management domain DomO are too large, so that the user's privacy is threatened. At the same time, once the attacker compromises DomO, it can threaten all the users. This paper presented a separate privilege virtual machine security model based on mutual trust (MTSP). It split DomO's privileges into three parts: the device driver, forming the isolated driver domain; the operations of the user's privacy, forming a DomU management domain; remaining forming Thin DomO. It achieved the startup of the system by the VMM and user together restricting each other. Combined with the model, the prototype system was implemented and security analysis and performance testing were done. It can protect the users' privacy, apportion the risk and isolate fault. [ABSTRACT FROM AUTHOR]

Aiming at solving the problems of attack graphs that the complicated relationships between nodes, the existing of cyclic attack paths and reflecting merely the static risk when evaluating the network security, this paper put forward the concept of Bayesian-attack graphs which simplified attack graphs and avoided the appearing of the cyclic paths by an optimized algorithm, combining attack graphs and Bayesian theory. By importing attack evidence and CVSS, this paper proposed a new method against to the vulnerability which could dynamically evaluate the whole and partial network security based on Bayesian-attack graphs. Experimental results in the real network show its veracity and validity, and the method can dynamically reflect the changes of the network security situation comparing to traditional assessment methods. [ABSTRACT FROM AUTHOR]

In order to improve the security of batch steganography, this paper proposed a novel adaptive batch steganography system. First, it estimated embedding capacity of images under current steganalysis techniques by bringing ensemble classifier based on random forest into steganalysis, then distributed message bits to the images according to their embedding capacities. The new system could make full use of the images and improve batch steganography security further by dividing the message into groups. Experimental results show that the new security definition decreases the total detection error and running time, having a good balance between missed detection rate and false alarm rate. [ABSTRACT FROM AUTHOR]

This paper introduced the definition and the properties of Chebyshev polynomial. According to the deterministic public-key cryptosystem of Chebyshev polynomial, found that it couldn't resist chosen cipher-text attacks. Combining with the security model against chosen cipher-text attacks, this paper proposed the probabilistic public-key cryptosystem of Chebyshev polynomial. The analysis show that the proposed cryptosystem is correct. Through the result of the reduction proof, the proposed cryptosystem can resist the adaptive chosen cipher-text attacks and has the IND-CCA2 security. [ABSTRACT FROM AUTHOR]

In order to guarantee the security of cloud computing, based on the analysis of cloud computing security requirements and elliptic curve cryptosystems, this paper proposed a covert mapping combined public key management scheme that was suitable for the distributed cloud computing. It made detailed description of the process of key management, such as key initialization, key distribution, key agreement, key update and key revocation. The analysis results show that the scheme can solve the problem of large scale keys storage and management correctly and efficiently, has high scalability, can resist collusion attack and ensure the security services provided by cloud computing. [ABSTRACT FROM AUTHOR]

This paper put forward a cooperating method for key derivation based on the idea of combination of radio interface and core network. It produced the radio child-keys according to the security algorithm list provided by plain radio message and obtained parent-key, and decided the right key by comparing the plain context and the decrypted context. It proves that the correct rate of key derivation is more than 90% in the case that the symbol error rate (SER) is less than 10-3 according to the analysis of feasibility. Therefore it has practical application values. [ABSTRACT FROM AUTHOR]

DaaS is a kind of cloud service which can provide the database services for others based on cloud infrastructure. It can effectively solve the difficulty of storage and management for massive data of individuals and enterprises. However, privacy leaks greatly hinder the development of DaaS. How to enhance the privacy protection of the existing DaaS becomes an urgent problem needed to be solved. Adopting the literature analysis method, this paper firstly summarized service architecture of DaaS and its privacy leaks mode. Then comprehensively analyzed the present researches on data confidentiality, query privacy preserving and query result validation, privacy preserving during data integrity validation of DaaS. From the analysis, it can be inferred that existing privacy preserving methods exist varying degrees of impairment in the aspects of efficiency of data update and query of DaaS and its practical applications. How to design more efficient algorithms for data confidential and the data queries with privacy preserving and query results validation are still the future research focus. Finally, it gave the he future research directions of in the privacy preserving in DaaS. [ABSTRACT FROM AUTHOR]

In order to enhance the security and embedding efficiency and to avert the localization of WPC, this paper presented WSC. The scheme used the generator matrix to create coset, and presented WSC coding scheme based on the mapping of syndrome and coset. At the last, with the image adaptive steganography, this paper provided the stego-flow based on WSC and analysed the capability of WSC. Experiment and analysis show that, compared to WPC, WSC has the higher embedding efficiency, and lower of compute complexity when k is less than or equal to 16. [ABSTRACT FROM AUTHOR]

To resolve the security problems in P2P networks, this paper proposed a trust model based on infinitely repeated game theory. Reward and punishment strategy in this paper not only punished the malicious behavior, but also incentivized the cooperation nodes, and the duration of penalty was determined in the times of fraudulent conduct. Mathematic analysis and simulation experiments show that the strategy of cooperation will be Pareto optimal strategy, which can punish and stifle availably malicious behavior, and improve incentives of the nodes trading honestly, then the security and stability of the P2P network environment will be enhanced efficiently. [ABSTRACT FROM AUTHOR]