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.

[1]  Martin Rötteler,et al.  Constructing quantum network coding schemes from classical nonlinear protocols , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

[2]  Michael Langberg,et al.  On the Hardness of Approximating the Network Coding Capacity , 2008, IEEE Transactions on Information Theory.

[3]  Peter Sanders,et al.  Polynomial time algorithms for network information flow , 2003, SPAA '03.

[4]  Muriel Médard,et al.  Beyond routing: an algebraic approach to network coding , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Babak Hassibi,et al.  MCMC methods for entropy optimization and nonlinear network coding , 2010, 2010 IEEE International Symposium on Information Theory.

[6]  Robert D. Kleinberg,et al.  Lexicographic Products and the Power of Non-linear Network Coding , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[7]  Mikael Skoglund,et al.  Nonlinear coding and estimation for correlated data in wireless sensor networks , 2009, IEEE Transactions on Communications.

[8]  Randall Dougherty,et al.  Insufficiency of linear coding in network information flow , 2005, IEEE Transactions on Information Theory.

[9]  Qiang Li,et al.  Nonlinear network code for high throughput broadcasting with retransmissions , 2009, 2009 IEEE International Symposium on Information Theory.

[10]  April Rasala Lehman,et al.  Complexity classification of network information flow problems , 2004, SODA '04.

[11]  G. Greuel,et al.  A Singular Introduction to Commutative Algebra , 2002 .

[12]  Randall Dougherty,et al.  Unachievability of network coding capacity , 2006, IEEE Transactions on Information Theory.

[13]  lt,et al.  Nonlinear Network Coding:A Case Study , 2008 .