Fully Private Coded Matrix Multiplication From Colluding Workers
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Minchul | - |
dc.contributor.author | Yang, Heecheol | - |
dc.contributor.author | Lee, Jungwoo | - |
dc.date.available | 2021-04-27T08:40:13Z | - |
dc.date.created | 2021-04-27 | - |
dc.date.issued | 2021-03 | - |
dc.identifier.issn | 1089-7798 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/kumoh/handle/2020.sw.kumoh/19043 | - |
dc.description.abstract | Recently, coded computation has been used to reduce the completion time in distributed computing by mitigating straggler effects with erasure codes. As a variation of coded computation, fully private coded matrix multiplication (FPCMM) has been proposed to preserve a master's privacy in a scenario where the master wants to obtain a matrix multiplication result from the libraries which are shared at the workers, while concealing both of the two indices of the desired matrices from each worker. In this letter, we propose a new FPCMM scheme to keep a master's privacy from up to T colluding workers. Furthermore, we compare the performance of our scheme with those of the existing private coded matrix multiplication schemes for non-colluding workers and for concealing the index of a single desired matrix. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Fully Private Coded Matrix Multiplication From Colluding Workers | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Yang, Heecheol | - |
dc.identifier.doi | 10.1109/LCOMM.2020.3037744 | - |
dc.identifier.wosid | 000628911700012 | - |
dc.identifier.bibliographicCitation | IEEE COMMUNICATIONS LETTERS, v.25, no.3, pp.730 - 733 | - |
dc.relation.isPartOf | IEEE COMMUNICATIONS LETTERS | - |
dc.citation.title | IEEE COMMUNICATIONS LETTERS | - |
dc.citation.volume | 25 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 730 | - |
dc.citation.endPage | 733 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordAuthor | Coded computation | - |
dc.subject.keywordAuthor | cross subspace alignment | - |
dc.subject.keywordAuthor | private information retrieval | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
350-27, Gumi-daero, Gumi-si, Gyeongsangbuk-do, Republic of Korea (39253)054-478-7170
COPYRIGHT 2020 Kumoh University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.