Communication vs. Computation

2n

n-k

Easier

3

2n’

0

2n’

2

Burmester-Desmedt (BD)

2k

3

0

3

2

Merge

1

0

1

1

Leave, Partition

Easier

2

1

1

2

1

Join

Skinny

Tree

(STR)

log n

log n

0

log n

log n/2

Partition

log n

1

0

1

1

Leave

Easier

2log n

3

0

3

2

Join, Merge

Tree Group Diffie-Hellman

(TGDH)

n+2k

2

n+2k-1

n+2k+1

k+3

Merge

1

0

1

1

Leave, Partition

Hard

1

1

2

2

Join

Group Diffie- Hellman

(GDH)

Exp

Messages

Multicast

Rounds

Communication

Unicast

Computation

Robust

2n

Previous slide

Next slide

Back to first slide

View graphic version