Table 3: Summary of complexity of the advanced protocol. N is the number of nodes in the cluster.

Election Aggregation Query

Message complexity
Modular exponentiations 4 0 0
Hash computations 0 0 1

14 exponentiations for generating the two messages with knowledge proofs and 4N-4 exponentiations for checking the received knowledge proofs.