1: Given a candidate node C, and N vehicles in a group $G\left(V_1\cdots V_N\right)$ .

2: C begins to broadcast its signed certificate.

3: K vehicles ( $1\le K\le N$ ) receive C’s certificate and copy the message to the group. GK[PRVi(m)]xK messages are sent to the group.

4: J vehicles ( $0\le J\le N$ ), who could not verify C’s certificate, should notify others. GK[PRvi(NOT(C))]xJ messages are sent to the group.

5: Vehicles who could verify C or accept the neighbor’s view on the matter, should transmit their public keys to C, and add C’s public key to their private group key PUc[m].

6: In total, up to 2N + 1 messages are sent in the network to setup a new vehicle to the VANET group.