Practical Privacy-Preserving Outsourcing of Large-Scale Matrix Determinant Computation in the Cloud

Jaggi-Sanders algorithm is generalized to its nonlinear form for multicast network. Precise details of the algorithm implementation and the proof on the algorithm existence are given. It may has meaningful significance in the two following aspects. First, it may offer a thinking for the urgent need to find a nonlinear coding scheme for non-multicast network some of which can not be coded by linear coding. Second, some interesting mathematical concepts such as shared agreements, composite functions and n-dimensional maximal independent set (nMIS) based on combinatorics are proposed. These new concepts may offer beneficial lessons for further research on nonlinear network coding.