Communication Lower Bounds Sample Clauses

Communication Lower Bounds. In [5], ▇▇▇▇▇▇ and ▇▇▇▇▇ proved the lower bound for communication complexity of static group key agreement (where the goal is for n group members to share a key without considering subsequent membership changes). Assuming a broadcast channel, they prove the following theorem: