Table 2 Big-O complexity of our (sub)protocols, implemented in the MPyC framework
Building block | Invocations | Rounds |
|---|---|---|
Pre-processing (one-time) | \(O(n^2 + np^2)\) | O(1) |
Secure exponentiation | \(O(\tilde{k}n^2)\) | \(O(\tilde{k})\) |
Computing \(\varvec{G}\) and \(\varvec{H}\) | \(O(n+Jp^2)\) | O(n) |
Secure matrix inverse | \(O(p^3 \log p)\) | \(O(\log p)\) |
Update \(\beta\) | O(p) | O(1) |
Checking convergence criterion | O(p) | O(1) |
Secure CPH | \(O(\tilde{k}n^2 + np^2 + p^3\log p)\) | \(O(\tilde{k} + n + \log p)\) |