矩阵分解的安全多方保密协议

2013 5th International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2013-09-09 DOI:10.1109/INCoS.2013.89

Haiyan Xiao, Xiaoyuan Yang

{"title":"矩阵分解的安全多方保密协议","authors":"Haiyan Xiao, Xiaoyuan Yang","doi":"10.1109/INCoS.2013.89","DOIUrl":null,"url":null,"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.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"277 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Secure Multi-party Confidential Protocol of Matrix Factorization\",\"authors\":\"Haiyan Xiao, Xiaoyuan Yang\",\"doi\":\"10.1109/INCoS.2013.89\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":353706,\"journal\":{\"name\":\"2013 5th International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":\"277 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 5th International Conference on Intelligent Networking and Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INCoS.2013.89\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCoS.2013.89","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

矩阵的保密计算是安全多方计算中的一个重要问题。但目前还没有文献提出真正的基于矩阵分解的多方保密计算协议。本文利用数据摄动假设和不经意传输协议，构造了一个高效的多方保密矩阵分解计算协议。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Secure Multi-party Confidential Protocol of Matrix Factorization

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 5th International Conference on Intelligent Networking and Collaborative Systems

自引率

0.00%

发文量