Public Key Cryptography Based on Ergodic Matrices over Finite Field

A new public key encryption scheme is proposed in this paper, which is based on a hard problem over ergodic matrices. The security of this scheme is equal to the MQ-problem： multivariate quadratic equations over finite fields. This problem has been shown to be NP-complete and can＇t be solved with polynomial time algorithm.     

A New ID-Based Proxy Multi-Signature Scheme from Bilinear Pairings

ID-based public key cryptosystem can be a good alternative for certifieate-based public key setting. This paper provides an efficient ID-based proxy multi signature scheme from pairings. In the random oracle model, we prove that our new scheme is secure against existential delegation forgery with the assumption that Hess＇s scheme-1 is existential unforgeable, and that our new scheme is secure against existential proxy multi-signature forgery under the hardness assumption of the computational Diffie-Hellman problem.     

An Improved Model of Attack Probability Prediction System

This paper presents a novel probability generation algorithm to predict attacks from an insider who exploits known system vulnerabilities through executing authorized operations. It is different from most intrusion detection systems （IDSs） because these IDSs are inefficient to resolve threat from authorized insiders. To deter cracker activities, this paper introduces an improved structure of augmented attack tree and a notion of ＂minimal attack tree＂, and proposes a new generation algorithm of minimal attack tree. We can provide a quantitative approach to help system administrators make sound decision.     

Analysis and Application for Integrity Model on Trusted Platform

To build a trusted platform based on Trusted Computing Platform Alliance (TCPA)‘s recommendation, we analyze the integrity mechanism for such a PC platform in this paper. By combinning access control model with information flow model, we put forward a combined process-based lattice model to enforce security. This model creates a trust chain by which we can manage a series of processes from a core root of trust module to some other application modules. In the model,once the trust chain is created and managed correctly,the integrity of the computer‘s hardware and sofware has been mainfained, so does the confidentiality and authenticity. Moreover, a relevant implementation of the model is explained.     

Cryptanalysis of the One-Time Proxy Signature Scheme Used in Mobile Agents

We cryptanalyze Kim et al ‘ s onetime proxy signature scheme used in mobile agents, and then a successful forgery is introduced. It is showed that a dishonest customer can successfully forge a va[id onetime proxy signature by impersonating the server. Furthermore, he can request the server with responsibility for the forged bidding information.     

Architecture of Trusted PC

This paper, focusing on the trusted computing group＇s standards, explained the key concept of trusted compuling and provided the architecture of trusted PC. It built trust bottom-up by starting with trusted hardware and adding layers of trusted software. It is a system-level solution available to all applications running on the member platforms. This solution reduces the security burden on applications and thus simplifies application programming.     

A New （ t, n） Threshold Signature Scheme Withstanding the Conspiracy Attack

A conspiracy attack is proposed to show that Wang-Li‘s scheme is insecure, because any t or more group members can impersonate other t members to sign any message without holding the responsibility. To avoid the conspiracy attack, this paper presents a new (t, n) threshold signature scheme with traceable signers.     

Efficient Identity Based Signcryption Scheme with Public Verifiability and Forward Security

In this paper, we point out that Libert and Quisquater‘s signeryption scheme cannot provide public verifiability. Then we present a new identity based signcryption scheme using quadratic residue and pairings over elliptic curves. It combines the functionalities of both public verifiability and forward security at the same time. Under the Bilinear Diffie-Hellman and quadratic residue assumption, we describe the new scheme that is more secure and can be some what more efficient than Libert and Quisquater‘s one.     

A New Mechanism Based on Similar Clouds Watermark for Database＇s Information Security

This paper studies the digit watermark technology of numeric attributes in relational database for database‘s information security. It proposes a new mechanism based on similar clouds watermark and gives the concept of similar clouds. The algorithm SCWA that can insert the meaning wa-termark and detect it from the watermarked data is described. The mechanism can effectively and broadly scatter the watermark in the database; therefore the watermark is very robust.     

A Secure MAKAP for Wireless Communication

A mutual authentication and key establishment protocol proposed by Aydos et al, for wireless communication based on elliptic curve cryptography can provide authentication between the user and server and they agreement a session key in the end of it. Unfortunately, Mangipudi pointed out Aydos＇ scheme was incurred the man-in-middle attack denial-of-service attack and impersonation based on man-in-middle attack. Then he proposed an improved scheme m overcome the above weakness. However, there is an attack which can forge the message required in the protocol and impersonation a valid user to the server.     

Verifiable （ t, n） Threshold Signature Scheme Based on Elliptic Curve

Based on the difficulty of solving the ECDLP (elliptic curve discrete logarithm problem) on the finite field, we present a (t, n) threshold signature scheme and a verifiable key agreement scheme without trusted party. Applying a modified elliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA (ellipticcurve digital signature algorithm) from the computability and security view. Our scheme has a shorter key, faster computation, and better security.     

Improved Authenticated Multi-Key Agreement Protocol

Zhou et al give an attack on Ham＇s modified authenticated multi-key agreement protocol, and give a protocol that can prevent the unknown key-share attack. The paper points out that the protocol is vulnerable to a concatenation attack. This paper proposes an improved authenticated multi-key agreement protocol which shows how to make Harn＇s protocol more secure by modifying the signature and verification. And this protocol can escape the concatenation attack.     

Trust Based Pervasive Computing

Pervasive computing environment is a distributed and mobile space. Trust relationship must be established and ensured between devices and the systems in the pervasive computing environment. The trusted computing （TC） technology introduced by trusted computing group is a distributed-system-wide approach to the provisions of integrity protection of resources. The TC＇s notion of trust and security can be described as conformed system behaviors of a platform environment such that the conformation can be attested to a remote challenger. In this paper the trust requirements in a pervasive/ubiquitous environment are analyzed. Then security schemes for the pervasive computing are proposed using primitives offered by TC technology.     

Analysis and Application of Covert Channels of Internet Control Message Protocol

Based on the analysis of the covert channel＇s working mechanism of the internet control message protocol （ICMP） in internet protocol version 4 （IPv4） and Internet Protocol version 6 （IPv6）, the ICMP covert channd＇s algorithms of the IPv4 and IPv6 are presented, which enable automatic channeling upon IPv4/v6 nodes with non-IPv4-compatible address, and the key transmission is achieved by using this channel in the embedded Internet terminal. The result shows that the covert channel＇s algorithm, which we implemented if, set correct, the messages of this covert channel might go through the gateway and enter the local area network.     

A Secure Anonymous Internet Electronic Voting Scheme Based on the Polynomial

In this paper, we use the polynomial function and Chaum＇s RSA （Rivest, Shamir, Adleman） blind signature scheme to construct a secure anonymous internet electronic voting scheme. In our scheme, each vote does not need to be revealed in the tallying phase. The ballot number of each candidate gets is counted by computing the degrees of two polynomials＇ greatest common divisor. Our scheme does not require a special voting channel and communication can occur entirely over the current internet.     

Integrating Multi-Source Web Records into Relational Database

How to integrate heterogeneous semi-structured Web records into relational database is an important and challengeable research topic. An improved model of conditional random fields was presented to combine the learning of labeled samples and unlabeled database records in order to reduce the dependence on tediously hand-labeled training data. The pro- posed model was used to solve the problem of schema matching between data source schema and database schema. Experimental results using a large number of Web pages from diverse domains show the novel approach＇s effectiveness.     

Fault Tolerant Approach for Data Encryption and Digital Signature Based on ECC System

An integrated fault tolerant approach for data encryption and digital signature based on elliptic curve cryptography is proposed. This approach allows the receiver to verify the sender‘s identity and can simultaneously deal with error detection and data correction. Up to three errors in our approach can be detected and corrected. This approach has atleast the same security as that based on RSA system, but smaller keys to achieve the same level of security. Our approach is more efficient than the known ones and more suited for limited environments like personal digital assistants (PDAs), mobile phones and smart cards without RSA coprocessors.     

A two-level subspace evolutionary algorithm for solving multi-modal function optimization problems

In this paper, a new algorithm for solving multimodal function optimization problems-two-level subspace evolutionary algorithm is proposed. In the first level, the improved GT algorithm is used to do global recombination search so that the whole population can be separated into several niches according to the position of solutions; then, in the second level, the niche evolutionary strategy is used for local search in the subspaces gotten in the first level till solutions of the problem are found. The new algorithm has been tested on some hard problems and some good results are obtained. Foundation item: Supported by the National Natural Science Foundation of China (70071042, 60073043, 60133010). Biography: Li Yan( 1974-), female, Ph. D candidate, research interest: evolutionary computation.     

Binary Sequences from a Pair of Elliptic Curves

A family of binary sequences were constructed by using an elliptic curve and its twisted curves over finite fields. It was shown that these sequences possess ＂good＂ cryptographie properties of 0-1 distribution, long period and large linear complexity. The results indicate that such se quences provide strong potential applications in cryptography.     

A Trusted Host＇s Authentication Access and Control Model Faced on User Action

The conception of trusted network connection （TNC） is introduced, and the weakness of TNC to control user＇s action is analyzed. After this, the paper brings out a set of secure access and control model based on access, authorization and control, and related authentication protocol. At last the security of this model is analyzed. The model can improve TNC＇s security of user control and authorization.