Huang Liusheng

An improved trusted cloud computing platform model based on DAA and privacy CA scheme

Security and privacy are two prime barriers to adoption of the cloud computing. To address this problem on Infrastructure-as-a-Service model, a trusted cloud computing platform model has been proposed to provide a closed box execution environment that guarantees confidential execution of guest virtual machines. However this model has significant drawbacks that it relies on the trusted third party outside of the cloud circumstance too much. In this paper we show how to address this issue based on the neutral feature of the Trusted Platform Module. By moving the responsibility of managing trusted platforms from the trusted third party to the trusted platforms of Infrastructure-as-a-Service model, our improved TCCP model achieves higher availability, reliability and safety.

A Statistical Algorithm for Linguistic Steganography Detection Based on Distribution of Words

In this paper, a novel statistical algorithm for linguistic steganography detection, which takes advantage of distribution of words in the text segment detected, is presented. Linguistic steganography is the art of using written natural language to hide the very presence of secret messages. Using the text data, which is the foundational media in Internet communications, as its carrier, linguistic steganography plays an important part in Information Hiding (IH) area. The previous work was mainly focused on linguistic steganography and there were few researches on linguistic steganalisys. We attempt to do something to help to fix this gap. In our experiment of detecting the three different linguistic steganography methods: NICETEXT, TEXTO and Markov-chain-Based, the total accuracies on discovering stego-text segments and normal text segments are found to be 87.39% 95.51%, 98.50%, 99.15% and 99.57% respectively when the segment size is 5 kB, WkB, 20 kB, 30 kB and 40 kB. Our research shows that the linguistic steganalysis based on distribution of words is promising.

A fast algorithm for mining association rules

In this paper, the problem of discovering association rules between items in a lange database of sales transactions is discussed, and a novel algorithm, BitMatrix, is proposed. The proposed algorithm is fundamentally different from the known algorithms Apriori and AprioriTid. Empirical evaluation shows that the algorithm outperforms the known ones for large databases. Scale-up experiments show that the algorithm scales linearly with the number of transactions.

Cryptanalysis of fair quantum blind signatures

We investigate the fair quantum blind signature scheme proposed by Wang and Wen [Wang T Y and Wen Q Y 2010 Chin. Phys. B 19 060307], which uses the fundamental properties of quantum mechanics and the availability of a trusted arbitrator. However, in this paper, we find that the protocol cannot satisfy the property of non-forgeability even under the condition that the trusted arbitrator is totally credible. Moreover, a simple feasible suggestion for improving the protocol is proposed.

A new approach for computing the discrete Fourier transform of arbitrary length

A new approach for computing DFT of arbitrary length is proposed, which is based on the arithmetic Fourier transform (AFT). The algorithm needs only /spl Oscr/(N) multiplications and has a simple computational structure, so it can be easily performed in parallel and it is very suitable for VLSI design. The algorithm is faster than the classical FFT when the length of the DFT contains relatively large factors. It is especially efficient for computing the DFT of prime length, where FFT does not work. The algorithm is competitive with the FFT in term of accuracy. A method to enhance the accuracy of the algorithm is also proposed for cases when higher accuracy is required.

A Novel Multiparty Quantum Secret Sharing Scheme of Secure Direct Communication Based on Bell States and Bell Measurements

We present a novel quantum secret sharing scheme of secure direct communication and analyze its security. This scheme takes Einstein?Podolsky?Rosen (EPR) pairs in Bell states as quantum resources. In order to obtain the direct communication message, all agents only need to perform Bell measurements, not to perform any local unitary operation. The total efficiency in this scheme approaches 100% as the classical information exchanged is unnecessary except for the eavesdropping checks.

A Threshold Multi-secret Sharing Scheme

This paper proposes a threshold multi-secret sharing scheme. In such a scheme, many secrets are shared in such a way that all secrets can be reconstructed independently without refreshing the shares. Every share is of the same size as that of any single shared secret in the proposed scheme. The number of public values in the proposed scheme is same as that of He and Dawsons scheme, which has been proved that it is only one-time-use scheme, but the proposed scheme is a multi-use scheme really, what is more important, it is more efficient since there will be ti secrets to be shared and reconstructed at the same time according to each (ti,n) -threshold access structure. That is, there are more secrets to be shared and reconstructed in the proposed scheme.

A new steganography method via combination in PowerPoint files

Steganography is the science of communicating secret information which no one apart from the intended recipient can be aware of. Most researchers focus on the medium of image, video and audio, while text is paid less attention, especially PowerPoint documents due to some shortcomings. In this paper, a new steganography method which hides information via different combinations of different objects in a PowerPoint file is proposed. Combination is widely used in PowerPoint files to help people operate different objects simultaneously. During our hiding process, the original content of the PowerPoint file is not changed at all, thus making the result stegodocument more natural and safe from traditional attacks compared to other steganography method.

Efficient Secure Protocols to Determine Whether a Point is inside a Convex Hull

Secure Multi-party Computation (SMC) is dedicated to solve trust problems in cooperative computing with each participant’s private data. Privacy Preserving Computational Geometry (PPCG) is a special area in SMC and is being widely used. This paper investigates the problem of judging whether a point is in a convex hull or not. We firstly present a secure protocol to determine the position of a private point and a private line, based on which two efficient point-inclusion schemes are proposed. Compared with previous solutions, our protocols perform better in efficiency, especially when the number of the convex hull’s points is large.

A Secure Protocol for Determining the Meeting Points of Two Intersected Circles

Secure Multi-party Computation (SMC) deals with the problem of secure computation among participants who are not trusted by others. Privacy Preserving Computational Geometry is a special area in SMC and has been applied to various of areas such as military, commerce and governments et al. In this paper, we will propose an efficient secure protocol, which is based on numerical computation, for the problem of determining the meeting points of two intersected circles, which is a practical problem in our daily life. In our solution, the communicational complexity can be lowered to just Ο(12*(logR1+ logr2)), where R1 and R2 are the radius of the two circles respectively. We also present the experimental results in this paper.