A secure multi-party computation scheme for matrix polynomials uses polynomial sharing and claims large worker savings, but its transpose procedure is wrong, breaking the arbitrary-polynomial result.
Efficient multiparty protocols using circuit randomization,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Secure Coded Multi-Party Computation for Massive Matrix Operations
A secure multi-party computation scheme for matrix polynomials uses polynomial sharing and claims large worker savings, but its transpose procedure is wrong, breaking the arbitrary-polynomial result.