A binary images watermarking algorithm based on adaptable matrix

A watermarking algorithm of binary images using adaptable matrix is presented. An adaptable matrix is designed to evaluate the smoothness and the connectivity of binary images. The watermark is embedded according to the adaptable matrix in this algorithm. In the proposed watermarking algorithm, each image block implements a XOR operation with the binary adaptable matrix, which has the same size with the image block, and in order to embed the watermark data, a multiplication operation are also implemented with the weight matrix. The experimental results show that proposed scheme has a good performance.     

Dynamic Vector Space Secret Sharing Based on Certificates

A vector space secret sharing scheme based on certificates is proposed in this paper. The difficulties of solving discrete logarithm assure confidential information＇s security, and the use of each participant＇s certificate makes the dealer have no need to transfer secret information to the participants. The proposed scheme is dynamic. It can effectively check cheaters and does not have secure channel requirements.     

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.     

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.     

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.     

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.     

Gomory＇s Method Based on the Objective Equivalent Face Technique

This paper discusses a re-examinatlon of dual methods based on Gomory＇s cutting plane for the solution of the integer programming problem, in which the increment of objection function is allowed as a pivot variable to decide the search direction and stepsize. Meanwhile, we adopt the current equivalent face technique so that lattices are found in the discrete integral face and stronger valid inequalities are acquired easily.     

Singularity detecting with the second generation wavelet

Adopting the lifting scheme, introduced by Sweldens, a new wavelet is constructed. It overcomes the shortcoming of the classical wavelets that has no flexibility in the number of vanishing moment. Two examples are given to prove the second-generation wavelets‘s potentialities in the singularity detection of signal: a wavelet with vanishing moment and symmetry can be constructed according to the problem.     

Computer Simulation of Turbulent Flow through a Hydraulic Turbine Draft Tube

Based on the Naviev-Stokes equations and the standard κ-ε turbulence model, this paper presents the derivation of the governing equations for the turbulent flow field in a draft tube. The mathematical model for the turbulent flow through a draft tube is set up when the boundary conditions, including the inlet boundary conditions, the outlet boundary conditions and the wall boundary conditions, have been implemented. The governing equations are formulated in a discrete form on a staggered grid system by the finite volume method. The second-order central difference approximation and hybrid scheme are used for discretization. The computation and analysis on internal flow through a draft tube have been carried out by using the simplee algorithm and cfx-tasc flow software so as to obtain the simulated flow fields. The calculation results at the design operating condition for the draft tube are presented in this paper. Thereby, an effective method for simulating the internal flow field in a draft tube has been explored.     

Wiener-Hopf factorization of a class of matrix functions and Corona theorem

By using Riemann-Hilbert method and Corona theorem, Wiener-Hopf factorization for a class of matrix functions is studied. Under appropriate assumption, a sufficient and necessary condition for the existence of the matrix function admitting canonical factorization is obtained and the solution to a class of non-linear Riemann-Hilbert problem is also given. Furthermore, by means of non-standard Corona theorem partial estimation of the general factorization can be obtained. Foundation item: Supported by the National Natural Science Foundation of China(10471107) and the Specialized Research Fund for the Doctoral Program of Higher Education of China (20060486001)     

Methods of constructing optimal wavelet filters based on genetic algorithm

In this paper, algorithms of constructing wavelet filters based on genetic algorithm are studied with emphasis on how to construct the optimal wavelet filters used to compress a given image,due to efficient coding of the chromosome and the fitness function, and due to the global optimization algorithm, this method turns out to be perfect for the compression of the images. Foundation item: Supported by the Natural Science Foundation of Education of Hunan Province(21010506) Biography: Wen Gao-jin( 1978-), male, Master candidate, research direction: evolutionary computing.     

A Neural Network Approach for Misuse and Anomaly Intrusion Detection

An MLP(Multi-Layer Perceptron)/ Elman neural network is proposed in this paper, which realizes classification with memory of past events using the real-time classification of MI.P and the memorial functionality of Elman. The system‘s sensitivity for the memory of past events can be easily reconfigured without retraining the whole network. This approach can be used for both misuse and anomaly detection system. The intrusion detection systems(IDSs) using the hybrid MLP/Elman neural network are evaluated by the intrusion detection evaluation data sponsored by U. S. Defense Advanced Research Projects Agency (DARPA). The results of experiment are presented in Receiver Operating Characteristic (ROC) curves. The capabilites of these IDSs to identify Deny of Service(DOS) and probing attacks are enhanced.     

Multi-Seed Key Distribution Scheme Test

The key problem of securing multieast is to generate, distribute and update Session Encryption Key（SEK）. Polynomial expansion with multi-seed （MPE） scheme is an approach which is based on Polynomial expansion （PE） scheme and overcomes PE＇s shortage. Its operation is demonstrated by using multi-seed, the group member is partitioned to many subgroups. While updating the SEK, computation is needed only in one of subgroups, the other of them will use the computation history to update their SEK. The key problems to design a MPE scheme application includes to find a feasible one way function as well as to generate a Strict Prime Number （SPN）. Those technologies with multi-seed and computation history concepts make MPE as a good choice in practical applications. A prototype test system is designed and solutions of all above mentioned problems are included in this proposed paper.     

The microscopic approach of sdgIBM-1 and its application to nucleus<Superscript>154</Superscript>Gd

Based on the Dyson expansion theory, a microscopic approach of sdgIBM-1 is presented and applied to nucleus¹⁵⁴Gd in this paper. The energy spectra andE2 transition have been calculated. Good agreement is obtained in comparison with experimental results. Foundation item: Supported by the Foundation of Administration of Education of China Biography: Sang Jian ping (1959), male. Ph. D. Professor, research direction: nuclear physics     

A New Forward-Secure Authenticated Encryption Scheme with Message Linkages

Yoon and Yoo recently proposed a robust authenticated encryption scheme and claimed their scheme has the properties of forward secrecy and confidentiality. The current paper, however, points out that Yoon-Yoo＇s scheme also can not provide forward secrecy and confidentiality such that any adversary can easily recover the transferred message. Based on intractability of reversing the one-way hash function and discrete logarithm problem, an improved authenticated encryption scheme with messages linkage is proposed. The above security faults get solved perfectly. The new scheme is proven to satisfy all the basic security requirements of the authenticated encryption scheme. And by the concrete comparison, it has the similar efficiency of the original scheme.     

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.     

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.     

An efficient certificateless ring signature scheme

To overcome the drawbacks such as high computational cost, unreasonable security model and long signature length in existing certificateless ring signature schemes, we propose an efficient certificateless ring signature scheme in this paper. Our construction is inspired by some efficient ID-based ring signature schemes, and uses bilinear pairings as a basic tool. Using a reasonable security model, the unforgeability of the proposed scheme is proven based on the intractability of the computational Diffie-Hellman （CDH） problem. The signature length of the new scheme is only ｜G2｜＋n｜G1｜ （｜Gi｜ is the bit length of an element in group Gi, i =1, 2）. Compared with other existing certificateless ring signature schemes, the newly proposed scheme has a shorter signature length and is more efficient and practical.     

A Signature Scheme with Non-Repudiation

Based on the Schnorr signature scheme, a new signature scheme with non-repudiation is proposed. In this scheme, only the signer and the designated receiver can verify the signature signed by the signer, and if necessary, both the signer and the designated receiver can prove and show the validity of the signature signed by the signer. The proof of the validity of the signature is noninteractive and transferable. To verify and prove the validity of the signature, the signer and the nominated receiver needn＇t store extra information besides the signature. At the same time, neither the signer nor the designated receiver can deny a valid signature signed. Then, there is no repudiation in this new signature scheme. According to the security analysis of this scheme, it is found the proposed scheme is secure against existential forgery on adaptive chosen message attack.     

Study on security enhancement technology for disaster tolerant system

This paper proposes a security enhancement scheme for disaster tolerant system based on trusted computing technology which combines with the idea of distributed threshold storage. This scheme takes advantage of trusted computing platform with trusted computing module, which is provided with such excellent features as security storage, remote attestation, and so on. Those features effectively ensure trustworthiness of disaster tolerant point. Furthermore, distributed storage based on Erasure code not only disposes the storage problem about a great deal of data, but also preferably avoids one node invalidation, alleviates network load and deals with joint cheat and many other security problems. Consequently, those security enhancement technologies provide mass data with global security protection during the course of disaster tolerance. Foundation Items: Supported by the National High Technology Research and Development Program of China (863 Program) (2008AA01Z404), the Science and Technical Key Project of Ministry of Education (108087) and the Scientific and Technological Project of Wuhan City (200810321130)