solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看106次
Private Information Retrieval in Asynchronous Coded Computation. (arXiv:1807.01170v1 [cs.IT])
来源于:arXiv
We firstly consider fully asynchronous coded computation for matrix
multiplication and combining this asynchronous coded computation with private
information retrieval (PIR). Our scheme based on polynomial code, which has
optimal recovery threshold. First, we propose the polynomial code for
asynchronous coded computation. We also propose the polynomial code for PIR. By
combining two polynomial codes, we propose asynchronous polynomial code for
PIR. We compare the runtime performance of proposed scheme with conventional
robust PIR (RPIR) scheme for coded computation. 查看全文>>