DocumentCode :
3512612
Title :
Secure Multi-party Confidential Protocol of Matrix Factorization
Author :
Haiyan Xiao ; Xiaoyuan Yang
Author_Institution :
Key Lab. of Comput. Network & Inf. Security of Eng., Inst. of the Armed Police, Xi´an, China
fYear :
2013
fDate :
9-11 Sept. 2013
Firstpage :
480
Lastpage :
484
Abstract :
The confidential computation of matrix is a very important issue in secure multi-party computation. But there is no literature proposed truly multi-party confidential computation protocol on matrix factorization. In this paper, we use data perturbation assumptions and oblivious transfer protocol to construct a multi-party confidential computation protocol on matrix factorization which has high efficiency.
Keywords :
cryptographic protocols; matrix decomposition; data perturbation assumptions; matrix confidential computation; matrix factorization; oblivious transfer protocol; secure multiparty confidential computation protocol; Computational efficiency; Computer networks; Eigenvalues and eigenfunctions; Information security; Laboratories; Protocols; data perturbation assumption; matrix factorication; oblivious transfer protocol; secure multi-party computation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Networking and Collaborative Systems (INCoS), 2013 5th International Conference on
Conference_Location :
Xi´an
Type :
conf
DOI :
10.1109/INCoS.2013.89
Filename :
6630460
Link To Document :
بازگشت