A Secure and Efficient ECC-Based Scheme for Edge Computing and Internet of Things

. 2020 Oct 29;20(21):6158. doi: 10.3390/s20216158

Algorithm 3:Updating $k_{s h}$ , $g k_{s h}$ , and $n L i s t$ for node leaving the group.

Input:

i d_{n i}; H_{1}; k_{s h}

Output:

U p d a t e d k_{s h}, g k_{s h} a n d n L i s t

N o d e s e n d s l e a v e (i d_{n i})

;

E d g e b r o a d c a s t n o d e L e a v e (E n c (g k_{s h}, r e f e r e n c e_{i d}))

;

E d g e a n d c u r r e n t n o d e s u p d a t e k e y k_{s h} = H_{1} (i d_{n i}) \oplus g k_{s h}

;

E d g e a n d c u r r e n t n o d e s u p d a t e s h a r e d p o i n t g k_{s h} = k_{s h} \times G

;

E d g e a n d c u r r e n t n o d e s u p d a t e t h e i r n L i s t