Partition Results. Figure 15 shows partition cost when the number of current group members is 16, 32, 64, and 128 respectively. As expected from the conceptual results, XXX has the worst performance due to many modular exponentiations. TGDH shows an interesting graph: it increases until 40% of the group members leave the group, and decreases afterwards. This is because 1) as the number of leaving members increases, the number of modular exponentiations decreases, 2) when many members leave the group, the resulting group has many empty bkeys spread over the tree, and, hence, requires more messages. The cost of BD and GDH decreases almost linearly, because it depends on the number of resulting group members. As described in Section 6.4, the cost of partition for TGDH can be improved when the group experiences repeated network partition on the same link.
Appears in 2 contracts
Samples: typeset.io, www.ics.uci.edu
Partition Results. Figure 15 shows partition cost when the number of current group members is 16, 32, 64, and 128 respectively. As expected from the conceptual results, XXX STR has the worst performance due to many modular exponentiations. TGDH shows an interesting graph: it increases until 40% of the group members leave the group, and decreases afterwards. This is because 1) as the number of leaving members increases, the number of modular exponentiations decreases, 2) when many members leave the group, the resulting group has many empty bkeys spread over the tree, and, hence, requires more messages. The cost of BD and GDH decreases almost linearly, because it depends on the number of resulting group members. As described in Section 6.4, the cost of partition for TGDH can be improved when the group experiences repeated network partition on the same link.
Appears in 2 contracts
Samples: eprint.iacr.org, www.ics.uci.edu