A one round protocol for tripartite Diffie-Hellman (Q1772225)

The paper studies an analog of the Diffie-Hellman protocol that involves three participants, A, B and C. It requires a single pass of communication and allows a common secret to be constructed. The main idea is to start from some elliptic curve and some torsion point. Then A, B and C each choose a random number and respectively use this number to compute a point from the torsion point. These points will be broadcasted. Then each participant computes a value from the three points. It is shown that there are various ways to compute this value, using the Weil and Tate pairing. For the tripartite Diffie-Hellman to be efficient, it is shown how to choose a finite field and an elliptic curve such that the chosen pairing can be efficiently computed. Finally, the security issue is addressed.