.png){kind=icon}
返回
Verifiable Coded Computation of Multiple Functions
.png){kind=icon}
OA
AI
DOI：10.1109/TIFS.2024.3450288.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of evaluating distinct multivariate polynomials over several massive datasets in a distributed computing system with a single master node and multiple worker nodes. We focus on the general case when each multivariate polynomial is evaluated over its corresponding dataset and propose a generalization of the Lagrange Coded Computing framework (Yu et al., 2019) to perform all computations simultaneously while providing robustness against stragglers who do not respond in time, adversarial workers who respond with wrong computation and information-theoretic security of dataset against colluding workers. Our scheme introduces a small computation overhead which results in a reduction in download cost and also offers comparable resistance to stragglers over existing solutions. On top of it, we also propose two verification schemes to detect the presence of adversaries, which leads to incorrect results, without involving additional nodes.
Keyword:
Polynomials
Servers
Costs
Task analysis
Distributed computing
Vectors
Security
communication efficiency
verifiability
privacy
期刊
IF:
8
论文数:
5.3K
被引数:
2.3W
机构
引用论文
.png){kind=icon}
A Conductivity Method for Screening Populations of Eucalypts for Frost Damage and Frost Tolerance
PREAI
分享收藏分享收藏Study of Components in Crude Drugs by Head Space Gas Chromatography. I. Components of Asiasari Radix
OAAI
OAAI分享收藏分享收藏
查看更多内容