Comparison of honest-majority MPC protocols based on Shamir secret sharing
|Semi-honest MPC||Comm. per mult. gate per party||Maliciously secure MPC||Comm. overhead|
|||6 elements (2.5 elements)||||7×|
|119, ||5.5 elements (2.5 elements)||[138, 140]||2×|
|118||4 elements (2 elements)||[125, 137]||1 + o(1) ×|
Note: We compare the communication cost for evaluating a single arithmetic circuit. We use “Comm.” to denote communication and “mult.” to denote multiplication. If the values are in parenthesis “()”, then they represent the communication costs in the computational setting using the PRSS approach, otherwise they denote the communication costs in the information-theoretic setting.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.