CRAug 27, 2019

Authenticated Hand-Over Algorithm for Group Communication

arXiv:1908.10320v1
Originality Incremental advance
AI Analysis

This addresses secure group communication for wireless networks with mobility support, offering incremental improvements over existing methods.

The paper tackles secure group authentication and hand-over in wireless networks by proposing a novel method using Lagrange's polynomial interpolation and Weil pairing, resulting in lower computational load for members and enabling multi-user authorization and hand-over between groups.

Shamir or Blakley secret sharing schemes are used for the authentication process in the studies before, but still secure group authentication and hand-over process remain as challenges in group authentication approaches. In this study, a novel method is proposed to provide a secure group authentication. The proposed approach also enables a hand-over process between groups by using Lagrange's polynomial interpolation and Weil pairing in elliptic curve groups for wireless networks with mobility support. One of the advantages of our proposed scheme is that the computational load for a member in the group is lower than the other schemes in the state-of-the-art. It is also possible to authorize many users at the same time, not one-to-one as in the group authentication methods in current cellular networks including Long Term Evolution (LTE). Another advantage that is not covered in other secret sharing methods is that the proposed approach constitutes a practical solution for the hand-over of members between different groups. We have also proposed a solution for replay and man-in-the-middle attacks in secret exchange.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes