Adding a semi-honest trusted third party to an existing lattice-based MPC protocol yields robustness with complete identifiability under dishonest majority, at the cost of higher runtime.
Publicly account- able robust multi-party computation,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.CR 1years
2025 1verdicts
REJECT 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Robust and Verifiable MPC with Applications to Linear Machine Learning Inference
Adding a semi-honest trusted third party to an existing lattice-based MPC protocol yields robustness with complete identifiability under dishonest majority, at the cost of higher runtime.