Research on the Secure Multi-Party Computation of some Linear Algebra Problems
Considering constant-round protocols for generating random shared values, for secure multiplication and for addition of shared values, etc are available and can be met by known techniques in all standard models of communication. Protocols are presented allowing the players to securely solve standard computational problems in linear algebra. In particular, securely, efficiently and in constant-round compute determinant of matrices product, rank of a matrix, and determine similarity between matrices. If the basic protocols (addition and multiplication, etc) are unconditionally secure, then so are our protocols. Furthermore our protocols offer more efficient solutions than previous techniques for secure linear algebra.
Q. Zheng et al., "Research on the Secure Multi-Party Computation of some Linear Algebra Problems", Applied Mechanics and Materials, Vols. 20-23, pp. 265-270, 2010