A Method to Implement Full Anonymous Attestation for Trusted Computing Platform

Trusted computing （TC） technology is brought out by trusted computing group （TCG） to make computing as safe and reliable as people expect. Attestation is one main function specified by TCG, which is the means by which a trusted computer assures a remote computer whose platform is not tampered with. There are two protocols that implement attestation without disclosing the platform＇s real identity, which are Privacy CA-based protocol and direct anonymous attestation （DAA） protocol. However, in the first protocol the privacy CA is the bottleneck and the platform＇s identity will be disclosed if the privacy CA is compromise, while DAA protocol can do profiling when dealing with rogue hardware device. In this paper, we propose a DAA-extended new approach to ensure full anonymous attestation that can not only detect a rogue TPM, but also reveal rogue TPM＇s real identity.     

An Authentication Method of Distinguishing Proxy＇s Secure Accident Responsibility

The publish/subscribe （pub/sub） paradigm has asynchronous, loosely-coupled and many-to-many communication properties and is widely used in the application of large-scale distributed computing environment. There is the problem that is mutual trustable between network proxies in terms of pub/sub systems and the problem which is hardly to distinguish accident responsibility while the accident happens in Kerberos based on symmetrical encryption algorithm. A proxy identity authentication algorithm based on RSA encryption is proposed to solve the problem of mutual trust between proxies, and the security of the messages is guaranteed through certificate delegation. The algorithm can distinguish accident responsibility. The feasibility analysis, security analysis and efficiency analysis of the algorithm are carried out.     

Intrusion Detection Method for Program Vulnerability via Library Calls

Library function call sequence is the direct reflection of a program＇s behavior. The relationship between program vulnerability and library calls is analyzed, and an intrusion detection method via library calls is proposed, in which the short sequences of library call are used as signature profile. In this intrusion detection method, library interposition is used to hook library calls, and with the discussion of the features of the library call sequence in detail, an algorithm based on information-theory is applied to determine the appropriate length of the library call sequence. Experiments show good performance of our method against intrusions caused by the popular program vulnerabilities.     

Learning Vector Quantization Neural Network Method for Network Intrusion Detection

A new intrusion detection method based on learning vector quantization （LVQ） with low overhead and high efficiency is presented. The computer vision system employs LVQ neural networks as classifier to recognize intrusion. The recognition process includes three stages： （1） feature selection and data normalization processing;（2） learning the training data selected from the feature data set; （3） identifying the intrusion and generating the result report of machine condition classification. Experimental results show that the proposed method is promising in terms of detection accuracy, computational expense and implementation for intrusion detection.     

Fair E-Payment Protocol Based on Simple Partially Blind Signature Scheme

0 Introduction The advent of E-commerce demands for a secure communication of digital information. It has been proven for years that this can be achieved by cryptography. Digital signature schemes are essential for E-commerce as they allow one to authoriz…     

Offlattice Model in the Prediction of Protein 3D Structure

3-dimension HPNX offiattice model is developed from the 2-dimension HP offiattice model. In the HP model, 20 types of amino acid monomers are divided into two classes, H （non-polar monomer） and P （polar monomer）. In the HPNX model, polar monomers are split into positively charged （P）, negatively charged （N） and neutral （X） monomers. A new evolutionary algorithm is applied to study long chains of the HPNX offiattice protein model. This method successfully predict the structures of several proteins in the 3-dimension space that are similar to the structures gotten by X-Ray Crystallography and NMR and published in the PDB（Protein Data Bank）.     

Development and Research on the Internet Resources Aggregation Platform

We proposed an Intemet resource aggregation platform based on semantic web. The platform includes an Web Ontology Language（OWL） ontology design toolkit（VO-Editor） and a selective inference algorithm engine so that it can visually editing ontology and using novel selective reasoning for information aggregation. We introduce the VO-Editor and the principle of selective inference algorithm. At last a case of budget travel system is used to interpret the approach of Internet resources aggregation by this platform.     

Joint Power Control Algorithm for CDMA TDD System

Current uplink power control algorithm of code division multiple access （CDMA） time division duplex（TDD） system contains signal-to-interference-ratio（SIR） and interference measurement, which is based on history information. However, the adjustment of transmission power of one user equipment（UE） will affect SIR of the others, because the power control is done independently of the power adjustment of other UE＇s. So the convergence speed of power control is not fast and the system performance degrades. In the proposed algorithm, all UE＇s assigned in same time slot adjust their transmission power based on current information, which takes into account the adjustments of transmission power of all UE＇s. The simulation results indicated that the proposed algorithm outperforms the old algorithm.     

从内心的彷惶到现实的呐喊——余华的《活着》与张艺谋电影改编的比较

张艺谋的电影《活着》是根据余华的同名小说改编而成 ,但是 ,二者有很大的差异。余华有强烈的虚无主义色彩 ,表现的是内心真实。而张艺谋则具有强烈的人道主义倾向 ,他竭力要表现的是历史真实     

异质数据库中具有矛盾结构的关系的集成

局部方案之间存在各种各样的语义差异 ,所以在构造异质数据库系统中 ,方案的集成就成为一个重要的规则。本论文给出的方法是根据本地策略中元数据的不同将关系分成不同的类型 ,把具有不同策略结构冲突的本地关系转换成具有同种结构的新的关系 ,然后将这些新的关系进行集成