Symmetric private polynomial computation from lagrange encoding

J Zhu, Q Yan, X Tang, S Li - IEEE Transactions on Information …, 2022 - ieeexplore.ieee.org
The problem of-secure-colluding symmetric Private Polynomial Computation (PPC) from
coded storage system with Byzantine and unresponsive servers is studied in this paper …
被引用次数：14 相关文章

Symmetric Private Polynomial Computation From Lagrange Encoding

J Zhu, Q Yan, X Tang, S Li - arXiv e-prints, 2020 - ui.adsabs.harvard.edu
The problem of $ X $-secure $ T $-colluding symmetric Private Polynomial Computation
(PPC) from coded storage system with $ B $ Byzantine and $ U $ unresponsive servers is …

Symmetric Private Polynomial Computation From Lagrange Encoding

J Zhu, Q Yan, X Tang, S Li - arXiv preprint arXiv:2010.09326, 2020 - arxiv.org
The problem of $ X $-secure $ T $-colluding symmetric Private Polynomial Computation
(PPC) from coded storage system with $ B $ Byzantine and $ U $ unresponsive servers is …
[PDF] researchgate.net

[PDF][PDF] Symmetric Private Polynomial Computation From Lagrange Encoding

J Zhu, Q Yan, X Tang - arXiv preprint arXiv:2010.09326, 2020 - researchgate.net
The problem of X-secure T-colluding symmetric Private Polynomial Computation (PPC) from
coded storage system with B Byzantine and U unresponsive servers is studied in this paper …

Symmetric Private Polynomial Computation From Lagrange Encoding

J Zhu, Q Yan, X Tang, S Li - IEEE Transactions on Information …, 2022 - repository.ust.hk
The problem of X-secure T-colluding symmetric Private Polynomial Computation (PPC) from
coded storage system with B Byzantine and U unresponsive servers is studied in this paper …