We present a new technique for robust secret reconstruction with O(n) communication complexity. By applying this technique, we achieve O(n) communication complexity per multiplication for a wide class of robust practical Multi-Party Computation (MPC) protocols. In particular our technique applies to robust threshold computationally secure protocols in the case of t < n) and in the case of perfectly-secure robust protocols with t
CITATION STYLE
Choudhury, A., Orsini, E., Patra, A., & Smart, N. P. (2016). Linear overhead optimally-resilient robust MPC using preprocessing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9841 LNCS, pp. 147–168). Springer Verlag. https://doi.org/10.1007/978-3-319-44618-9_8
Mendeley helps you to discover research relevant for your work.