Discussion. All the proposed schemes reduce the
signaling because they use global values based on a
shared group key. However, the size of the aggregated
authentication vector increases as the size of the group
increases, affecting the bandwidth requirements be-
tween HSS and MME. The introduction of a new role
as the gateway in the AKA procedure is also critical
because it requires several changes at the architecture
level.
We argue that each of the three different schemes
fails to provide an adequate level of security accord-
ing to our threat model. In the first scheme, mutual
authentication cannot be achieved because the authen-
tication of the serving network for each device is done
by the gateway, hence a corrupted gateway can suc-
cessfully impersonate as serving network to all the
group members. The second and third schemes fail
to meet the individual authentication of the devices:
the global G RES cannot be uniquely associated to
a member of the group. Thus, colluding corrupted
group members can successfully authenticate a third
member without its participation.
4.2 SE-AKA
Lai et al. (Lai et al., 2013) design a group-based
AKA protocol, called SE-AKA, for LTE networks.
The key idea of SE-AKA is to provide each member
of the group with the same group key but with dif-
ferent synchronization values. The synchronization
values behave as sequence numbers for the synchro-
nization between each MTC and the serving network.
The protocol adopts an asymmetric key cryptosystem
supported by a PKI to allow the MTC to send their
IMSI encrypted to the serving network, and uses El-
liptic Curve Diffie-Hellman to achieve key forward
and backward secrecy.
SE-AKA distinguishes two protocol procedures.
One procedure is the authentication of the first group
member that visits the serving network. The other
procedure regards the authentication of the remain-
ing members. The message flow occurring during the
authentication of the first member is similar to EPS-
AKA. A major difference is that the HSS sends to the
MME the authentication vector plus a list that con-
tains all the synchronization values of the group mem-
bers. In doing so, the MME will be able to run the
AKA procedure with the remaining members without
involving the HSS.
Discussion. SE-AKA observes the same roles de-
scribed in LTE and reduces the communication over-
head between MME and HSS to only one message ex-
change, independently on the size of the group. How-
ever, it increases the size of the authentication data
response that the HSS sends to the MME, because the
message includes also the list of synchronization val-
ues. The size of the list depends on the size of the
group, hence the protocol may not be suitable for very
large groups. Also, low-end MTC may not be able to
support ECDH and asymmetric encryption.
As a general note, we observe that a potential se-
curity issue of SE-AKA is that the MME is provided
with more information than needed in group-based
AKA. Since the synchronization values behave as se-
quence numbers, and the HSS sends to the MME the
list of synchronization values of all group members,
the MME also obtains data regarding MTC that even-
tually will not visit that serving network.
The authors prove mutual authentication, session
master key confidentiality, and privacy of the identi-
fier in ProVerif. The proofs do not consider an in-
truder able to corrupt members of the group, as we
advocate in the proposed threat model. Since all
the members of the group share a single group key,
and the AKA procedure to authenticate the remaining
group members does not require the use of devices’
pre-shared keys, an intruder that corrupts two MTCs
can break authentication by swapping the two syn-
chronization values assigned to the corrupted MTC.
4.3 Choi-Choi-Lee Scheme
Choi et al. (Choi et al., 2014) propose a new group-
based AKA protocol that uses symmetric cryptogra-
phy only. Their solution adopts an inverted hash tree
(Page, 2009), in which each node is associated to a se-
cret value. The node value is derived from the hashed
value of the node’s parent. Each MTC is assigned
to a leaf node value and is given a set of secret val-
ues. The set contains all the secret values of the tree,
except the secret value assigned to the MTC and all
the secret values of its ancestor nodes. The MME is
also assigned to a leaf node value. The idea of us-
ing an inverted hash tree is to allow each pair of MTC
and MME to agree on a session master key, which is
based on the common node values share by the pair.
The Choi-Choi-Lee protocol distinguishes the role of
leader among one of the members of the group. The
leader bootstraps the AKA procedure and mediates as
gateway between the MME and the rest of the group.
The message flow of the Choi-Choi-Lee protocol is
similar to the second scheme proposed by Broustis
et al. in section 4.1 with two main differences: i) in
Choi-Choi-Lee, the HSS generates a global authen-
tication vector based on a group key that is shared
with the members of the groups, and ii) the responses
RES differ from MTC to MTC such that the leader
Threats to 5G Group-based Authentication
365