Huang Liusheng

Learn More
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(More)
As the number of transistors integrated in a microprocessor chip increases continuously, more and more researches focus on how to efficiently utilize the on-chip resources recently. Research on the relationship between the instruction window size and program ILP can guide the design of clustered architecture and heterogeneous CMP. A theoretical model is(More)
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(More)
In this paper the authors present an attack on 7-round AES-128/256 to improve the known cryptanalysis by changing the order of round transformation, using the alternative representation of the round keys, exploiting the relationship of keys, designing the key difference pattern properly. By using the improved attack method, the complexity is reduced from(More)
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(More)
An efficient (t, n) threshold multi-secret sharing scheme is proposed in this paper. This scheme has the same power as Yang et al. 's scheme, in which there are p (p > 1) secrets to be shared among n participants according to (t, n)-threshold access structure. But it uses the fixed ( t -1 )th degree Lagrange interpolation polynomial whenever p les t or p(More)
  • 1