Title :
The Security Matrix Factorization Agreement with Two Parties
Author :
Yang, XiaoYuan ; Liu, Zhen
Author_Institution :
Key Lab. of Comput. Network & Inf., Security of Eng. Inst. of the Armed Police, Xi´´an, China
Abstract :
In the confidential computing issues of scientific computing, the confidential computing of matrix factorization is still no fruit home and abroad. This paper using Data perturbation assumption and Oblivious Transfer 1 out of k protocol, successfully construct confidential computing protocols of matrix general factorization and QR factorization. On the model of semi-honest, it can meet the confidentiality. At the same time, the method of this protocol is also suitable for confidential computing of matrix other factorizations.
Keywords :
matrix decomposition; security of data; QR factorization; confidential computing protocols; data perturbation assumption; matrix factorization agreement; security matrix; Computer networks; Computer security; Data security; Eigenvalues and eigenfunctions; Equations; Home computing; Information security; Laboratories; Protocols; Scientific computing;
Conference_Titel :
Computational Intelligence and Security, 2009. CIS '09. International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-5411-2
DOI :
10.1109/CIS.2009.254
