Patent Grant
10965660
The invention relates to a communication device for communicating with a network device, a method, computer program and computer program product for a communication device in communication with a network device of a communication network, a first network device of a first communication network, a method, computer program and computer program product for a first network node of a first communication network as well as to a system comprising a first network device in a first communication system and a second network device in a second communication system. The invention also relates to the second network device.
Data transferred over communication networks is becoming increasingly sensitive. Communication networks, such as mobile, wireless and fixed communication networks, are nowadays more and more frequently used for e.g. various economical and business related transactions, control of cyber-physical systems, etc. Therefore there is a need for stronger security measures.
In for instance mobile communications it is important that the communication network and user equipment (UE) mutually authenticate each other and are able to encrypt exchanged traffic data, where both of these security services being critically dependent on secure key management including key agreement or key establishment.
In this respect, mobile networks from second generation (2G) and onward have made use of strong, (Universal) Subscriber Identity Module ((U)SIM) card based authentication and encryption key agreement. From third generation (3G) networks and on, authentication has been mutual: both network and user equipment authenticate each other. USIM based 3G/4G authentication is described in e.g. 3GPP TS 33.102 V12.2.0 and 33.401 V12.13.0. The protocol is known as UMTS AKA or LTE AKA, depending on which access network type is used, where UMTS AKA is an acronym for Universal Mobile Telecommunication System Authentication and Key Agreement and LTE AKA is an acronym for Long Term Evolution Authentication and Key Agreement. As a note, while the 3GPP standards use the term key agreement, the protocols actually used are more of key establishment nature. The difference is however not important for the discussion. Variants of this AKA protocol have been developed for IP Multimedia Subsystem (IMS), IMS AKA, non-3GPP access technologies (EAP-AKA, IETF RFC 4187) and for general service layer authentication (Generic Bootstrapping Architecture, GBA, 3GPP TS 33.220 V12.3.0).
In
Thereafter follows an authentication and key establishment (or key agreement) phase 31. When authentication is to take place in this phase 31, the VLR/SGSN selects 18 an available (unused) authentication vector and based on the content of this vector it sends a user authentication request message ARQ 20 comprising a challenge using a random value Rand(i) and an authentication token AUTN(i), where AUTN(i) comprises a challenge verification code, and the index i indicates that the value is associated with AVi. The AUTN(i) is verified in the MS, and if verification succeeds, a result RES(i) is computed in a verification step 22. To be precise, these operations are carried out by the USIM in the MS. The MS then sends a user authentication response message (ARE) 20 comprising the result RES(i). The authentication vector comprises the expected result XRES(i) and the VLR/SGSN then compares 26 the received result RES(i) with the expected result XRES(i), and if the comparison was successful (i.e. the two values being equal), the VLR/SGSN then selects 30 a corresponding ciphering key CK(i) and integrity protection key IK(i). At the same time, the MS (again, to be precise, the USIM) computes 28 the same keys CK(i) and IK(i). In the case of LTE, further keys are derived from CK(i) and IK(i), e.g. a so called Kasme key (not shown), this derivation being done in the part of the MS that is outside the USIM. This part outside of the USIM is referred to as Mobile Equipment (ME).
In an authentication and key agreement of the type shown in
The security of AKA thus depends on the key K being kept secret. Recently, it was reported in media that a USIM card manufacturer's security had been breached and a set of K-keys had “leaked out” (or fallen into wrong hands), thus putting the subscribers associated with these keys at risks such as impersonation, connection hijacking, and eavesdropping (since also the ciphering keys, derived from CK(i) and/or IK(i), are thus potentially also at risk). In the article, https://firstlook.org/theintercept/2015/02/19/great-sim-heist/, retrieved on 6 Jul. 2015, it was mentioned that a potential problem with the AKA protocol, leading to the aforementioned security implications, lied in that AKA lacks so called perfect forward secrecy (PFS).
It is in view of what has been described above of interest to raise the security level of communication between a communication device and a communication network when the security is based on identity modules such as USIM making use of a secret/key shared with a communication network node.
There is thus a need for enhancing communication security between a communication device and a communication network.
One object of invention is to enhance the communication security of a communication device in relation to the use of long-term shared keys.
This object is according to a first aspect achieved by a communication device, which is in communication with a network device of a communication network. The communication device comprises at least one processor circuit and at least one memory connected to the at least one processor circuit and storing program instructions that are executed by the at least one processor to perform operations comprising:
receiving, via a network, a challenge, a first Diffie-Hellman, DH, parameter and a first verification code for the first DH parameter from the network device,
forward the challenge or a derivative thereof to an identity module,
receive at least one result parameter as response from the identity module, the at least one result parameter having been generated by the identity module and being one of a ciphering key, CK, an integrity key, CK, and a response parameter, RES,
responsive to determining that the first DH parameter is authentic, generating a second DH parameter and sending, through the network, the second DH parameter to the network device.
The object is according to a second aspect achieved through a method performed by a communication device, which communication device is in in communication with a network device of a communication network. The method comprises:
receiving, via a network, a challenge, a first Diffie-Hellman, DH, parameter and a first verification code for the first DH parameter from the network device,
forwarding the challenge or a derivative thereof to an identity module,
receiving at least one result parameter as response from the identity module, the at least one parameter having been generated by the identity module and being one of a ciphering key, CK, an integrity key, IJ, and a response parameter, RES,
determining, based on said result parameter whether the first DH parameter is authentic, and
responsive to determining that the first DH parameter is authentic, generating a second DH parameter and sending, through the network, the second DH parameter to the network device.
The object is according to a third aspect achieved through a computer program for a communication device in communication with a network device of a communication network. The computer program comprises computer program code which when run in the communication device, causes the communication device to:
receive, via a network, a challenge, a first Diffie-Hellman, DH, parameter and a first verification code for the first DH parameter from the network device,
forward the challenge or a derivative thereof to an identity module,
receive at least one result parameter as response from the identity module, the at least one response parameter having been generated by the identity module and being one of a ciphering key, CK, an integrity key, IK, and a response parameter, RES,
determine, based on said result parameter whether the first DH parameter is authentic, and
responsive to determining the first DH parameter is authentic, generate a second DH parameter and send, through the network, the second DH parameter to the network device for session key generation based on the first DH parameter and the second DH parameter.
The object is according to a fourth aspect achieved through a computer program product for a communication device in communication with a network node of a communication network. The computer program product comprises a data storage medium with computer program code according to the third aspect.
The invention according to the first, second and fourth aspects have a number of advantages. The enhanced security sets up barriers against attackers who are able to compromise the long term shared key, forcing them to launch so-called man-in-the-middle attacks to exploit the compromised key.
A derivative may be identical to the challenge. A derivative may also be a hash of the challenge.
If a derivative that is a hash of the challenge is used, the size of the challenge is reduced and also adaptable to standardised challenge sizes. The provision of a pure challenge to the identity module has the advantage of reducing processing in the communication device.
In a first variation of the first aspect, the communication device is configured to generate a session key for communication between the communication device and the network device, where the session key is at least based on values used for generating the first DH parameter and the second DH parameter.
In a corresponding variation of the second aspect the method comprises generating a session key for communication between the communication device and the network device, where the session key is at least based on values used for generating the first DH parameter and the second DH parameter.
This variation has the advantage of providing a session that has enhanced communication security against potential future shared-key compromise.
In a more specific embodiment of the first and second aspects, the session key is based on the first DH parameter and an exponent of the second DH parameter.
The first verification code may comprise a message authentication code based on at least the first DH parameter. Being based on at least the second DH parameter means in one embodiment that it may be based on at least a hash of the first DH parameter and that the hash may be a cryptographic hash. Furthermore, the challenge may be based on the first DH parameter. It may for instance be the first DH parameter or a hash of the first DH parameter. It is possible that also this hash is a cryptographic hash. Through the challenge being based on the first DH parameter, there is provided economy in cryptography and bandwidth usage. This economy is even further enhanced through the provision of a hash, which allows the size of the first DH parameter to be adapted to various standardised formats.
In a third variation of the first aspect, the communication device is configured to receive the challenge, the first DH parameter and the first verification code in an authentication request message from the network device and in this case the authentication request message also comprises a challenge verification code. Furthermore, when the communication device receives the at least one result parameter, it is configured to receive a response parameter as a response to the challenge. Finally, when the communication device is configured to generate and send the second DH parameter, it is configured to generate the second DH parameter together with a second verification code and send these in an authentication response message also comprising the response parameter.
In a corresponding variation of the second aspect, the challenge, the first DH parameter and the first verification code are received in an authentication request message, which authentication request message also comprises a challenge verification code. The at least one result parameter also comprises a response parameter received as a response to the challenge. Furthermore, the generating and sending of the second DH parameter comprises generating the second DH parameter together with a second verification code and sending these in an authentication response message also comprising the response parameter.
This variation has the advantage of allowing the first and second DH parameters and the first and second verification codes to be transferred in already existing messages. Thereby additional messages are avoided. This may save energy in the communication device, which may be a limited resource.
The second verification code may be generated as a message authentication code based on at least the second DH parameter. Being based on at least the second DH parameter means in one embodiment that it may be based on at least a hash of the second DH parameter and the hash may be a cryptographic hash.
Hash/message authentication codes may furthermore be based on HMAC/SHA-256.
In a fourth variation of the first and second aspects, the authentication request message comprises the first verification code in a corresponding separate information element of the authentication request message.
In this case the communication device is configured to use the first verification code when determining the authenticity of the first DH parameter.
In this case the determining of the authenticity of the first DH parameter made in the method is made using the first verification code.
In a fifth variation of the first and second aspects, the first verification code is provided as at least part of the challenge verification code.
In this case the communication device is configured to determine the authenticity of the first DH parameter based on the identity module providing the at least one result parameter.
In this case the determining of the authenticity of the first DH parameter made in the method is made based on the identity module providing the at least one result parameter.
This variation provides further economy in the cryptography used in the authentication request message.
In a sixth variation of the first aspect, the communication device is configured to generate the second verification code based on at least one of the at least one result parameters and to send the second verification code in an information element assigned to the response parameter in the authentication response message.
In a corresponding variation of the second aspect, the method comprises basing the second verification code on the response parameter. In this case the sending of the authentication response also comprises sending the second verification code in an information element of the authentication response message assigned to the response parameter.
This variation provides further economy in the bandwidth and cryptography used in the authentication response message and its processing.
The communication device may be a user equipment and may also comprise a mobile equipment, in which the computer instructions that the processor acts on are stored. It is furthermore possible that the communication device comprises the identity module, where the identity module in turn comprises a key and cryptographic processing means.
Another object is to provide enhanced communication security of a first network device in a communication network in relation to the use of long-term shared keys.
This object is according to a fifth aspect achieved through a first network device of a first communication network. The first network device being configured to:
obtain a challenge,
obtain a first DH parameter,
obtain a first verification code for the first DH parameter,
send the challenge, the first DH parameter and the first verification code to a communication device,
receive a second DH parameter, a second verification code and a response parameter from the communication device,
determine the authenticity of the response parameter, and
verify the second DH parameter based on the second verification code.
The object is according to a sixth aspect achieved through a method for a first network device of a communication network. The method is performed by the first network device and comprises:
obtaining a challenge,
obtaining a first DH parameter,
obtaining a first verification code for the first DH parameter,
sending the challenge, the first DH parameter and the first verification code to a communication device,
receiving a second DH parameter, a second verification code and a response parameter from the communication device,
determining the authenticity of the response parameter, and
verifying the second DH parameter based on the second verification code.
The object is according to a seventh aspect achieved through a computer program for a first network device of a communication network. The computer program comprises computer program code which when run in the first network device causes the first network device to:
obtain a challenge,
obtain a first DH parameter,
obtain a first verification code for the first DH parameter,
send the challenge, the first DH parameter and the first verification code to a communication device,
receive a second DH parameter, a second verification code and a response parameter from the communication device,
determine the authenticity of the response parameter, and
verify the second DH parameter based on the second verification code.
The object is according to an eighth aspect achieved through a computer program product for a first network device of a communication network. The computer program product comprises a data storage medium with computer program code according to the seventh aspect.
The invention according to the fifth, sixth, seventh and eighth aspects enhance the security of communication between a first network device and a communication device. The enhanced security sets up barriers against so-called man-in-the-middle attacks.
In a first variation of the fifth aspect, the first network device is further configured to compute a session key for communication between the communication device and the first network device. The session key is at least based on values used for generating the first and second DH parameter.
In a corresponding variation of the sixth aspect the method further comprises computing a session key for communication between the communication device user equipment and the first network device, which session key is at least based on values used for generating the first and second DH parameter.
In a more specific embodiment of the fifth and sixth aspects, the session key is based on the second DH parameter and an exponent of the first DH parameter.
In a second variation of the fifth aspect, the first network device is configured to obtain a challenge verification code when obtaining the challenge, to send the challenge, the first DH parameter and the first verification code in an authentication request message together with the challenge verification code and to receive the second DH parameter, the second verification code and the response parameter in an authentication response message.
In a corresponding variation of the sixth aspect, the obtaining of a challenge comprises obtaining of a challenge verification code, the sending of the challenge, the first DH parameter and the first verification code comprises sending these in an authentication request message together with the challenge verification code and the receiving of the second DH parameter, the second verification code and the response parameter comprises receiving these in an authentication response message.
This has the advantage of re-using existing messages. This means that that the existing message structure of an existing authentication and key agreement protocol may be used without adding new messages. This may save energy on a general environmental level, since the sending of additional messages uses energy, which may be a limited resource in radio networks. Furthermore, network communication is also typically standardised and it is often much harder to agree on the introduction on new messages, than the adding of new information elements in already existing messages.
In a third variation of the fifth aspect, the second network device when obtaining the first verification code is configured to generate the first verification code using the first DH parameter and when sending the authentication request message is configured to send the first verification code in a corresponding separate information element of the authentication request message.
In a corresponding variation of the sixth aspect, the obtaining of the first verification code comprises generating the first verification code using the first DH parameter, and the sending of the authentication request message comprises sending the first verification code in a corresponding separate information element.
In a fourth variation of the fifth aspect, the first network device, when obtaining the first DH parameter, is further configured to receive a value to be used for generating the first DH parameter, to obtain the first verification code as at least part of the challenge verification code and to send the first verification code as at least part of the challenge verification code in the authentication request message.
In a corresponding variation of the sixth aspect, the method further comprises receiving a value for generating the first DH parameter, obtaining the first verification code as at least part of the challenge verification code and sending the first verification code as at least part of the challenge verification code in the authentication request message.
In a fifth variation of the fifth aspect, the first network device is configured to also obtain an expected challenge result and to determine the authenticity of the response parameter through a comparison with the expected challenge result.
In a corresponding variation of the sixth aspect, the method further comprises obtaining an expected challenge result together with the challenge and the determining the authenticity of the response parameter through a comparison with the expected challenge result.
In a sixth variation of the fifth and sixth aspects, the response parameter is included in the authentication response message through the second verification code being based on the response parameter.
In this case the first network device is configured to receive the second verification code in an information element of the authentication response message assigned to the response parameter and to simultaneously determine the authenticity of the response parameter and verify the second PFS parameter using the second verification code.
In this case the receiving of the authentication response message performed in the method comprises receiving the second verification code in an information element of the authentication response message assigned to the response parameter and the determining of the authenticity of the response parameter and the verifying of the second PFS parameter are performed simultaneously using the second verification code.
Yet another object is to provide a system for enhancing the communication security of a network device in relation to the use of long-term shared keys.
This object is according to a ninth aspect achieved through a system comprising a first network device in a first communication network and a second network device in a second communication network. The second network device is configured to send a challenge to the first network device.
The first network device is on the other hand configured to:
receive the challenge,
generate a first DH parameter,
obtain a first verification code for the first DH parameter,
send the challenge, the first DH parameter and the first verification code to the communication device,
receive a second DH parameter, a second verification code and a response parameter from the communication device,
determine the authenticity of the response parameter, and
verify the second DH parameter based on the second verification code.
In a first variation of the ninth aspect the second network device is configured to also provide a value for obtaining of the first DH parameter through generating it at least based on the value x, to generate the challenge verification code using the first DH parameter and send the base value to the first network device. The first network device is in turn configured to send the first verification code as the challenge verification code to the communication device.
The invention according to the ninth aspect also has the advantage of enhancing the security of communication between the first network device and the communication device. The enhanced security sets up barriers against attackers who are able to compromise the long term shared key, forcing them to launch so-called man-in-the-middle attacks to exploit the compromised key.
Furthermore, a tenth aspect of the invention relates to a second network device for a second communication network, the second network device being operative to:
receive, from a first network device of a first communication network, a request for authentication data related to an identity module of a communication device,
generate a first DH parameter,
generate a first verification code based on at least the first DH parameter and a key shared between the second network device and the identity module, and
send in response to the request, to the first network device, at least the first verification code and a value from which the first DH parameter can be derived.
The value from which the first DH parameter can be derived, may in one embodiment of the second network device comprise the first DH parameter.
It should be emphasized that the term “comprises/comprising” when used in this specification is taken to specify the presence of stated features, integers, steps or components, but does not preclude the presence or addition of one or more other features, integers, steps, components or groups thereof. The word ‘parameter’ should be interpreted as covering values of the parameter, e.g. that the calculation of a parameter comprises the calculation of a value for that parameter, and that a calculation or derivation of a result or response based on one or more parameters comprises a calculation of the result or the response based on one or more values of the one or more parameters. In the same manner, receiving a parameter and sending/forwarding a parameter comprise the receiving and sending of a value of that parameter.
The invention will now be described in more detail in relation to the enclosed drawings, in which:
In the following description, for purposes of explanation and not limitation, specific details are set forth such as particular architectures, interfaces, techniques, etc. in order to provide a thorough understanding of the invention. However, it will be apparent to those skilled in the art that the invention may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known devices, circuits, and methods are omitted so as not to obscure the description of the invention with unnecessary detail.
The invention concerns improved communication security in a communication network using pre-shared keys as basis for the communication security.
A communication network may here be a mobile communication network, such as a second Generation (2G) mobile communication network like Global System for Mobile communication (GSM), a third generation (3G) network like Universal Mobile Telecommunications System (UMTS) or a fourth generation (4G) network such as Long-Term Evolution (LTE) or any future, evolved system like the 3GPP 5th Generation (5G) currently being developed. These are just a few examples of networks where the invention may be implemented. Other types of networks that may be used are for instance Wireless Local Area Networks (WLAN). A communication device, such as a user equipment (UE), a Mobile Station (MS), sometimes denoted a cellular phone, may communicate using these communication networks. Furthermore, a communication device here is connected to an identity module, where the identity module may be a smart card such as a universal integrated circuit card (UICC) holding a subscriber identity module (SIM) and/or a Universal Subscriber Identity Module (USIM) or an IP Multimedia Subsystem SIM (ISIM), an embedded SIM (eSIM) module, a software module, a Global Platform Trusted Execution module or the like. The identity module may thus also be implemented in software running in a trusted execution environment, or software running on a general purpose processor, although the latter is not preferred. In the sequel the term USIM will be used as an example in the descriptions, but the man skilled in the art will appreciate that any type of identity module will serve the same purpose. It should be realized that the identity module may be a part of the communication device. It may also be a separate entity that is connected to the communication device, when the communication device is to be used.
As a basis for communication security a key is used, e.g. for authentication and key agreement. The key may advantageously be pre-shared and stored in an identity module as just described.
In the following only the example of the communication device in the form of a UE will be discussed. However, it should be realized that the communication device is not limited to being a UE. It may be any type of wireless endpoint, mobile station, mobile phone, wireless local loop phone, smartphone, user equipment, desktop computer, PDA, cell phone, tablet, laptop, VoIP phone or handset, which is able to wirelessly send and receive data and/or signals to and from a network node. It may also be a communication modem providing, e.g., 3G or 4G connectivity for some form of electronics (e.g. a sensor or digital camera), a vehicle, a home gateway, home/residential WiFi/4G access point, a domestic appliance device like a refrigerator, thermostat, burglary alarm, vacuum cleaner, lawn mower robot or the like. It may also be a stationary terminal connected to a fixed communication network.
As was mentioned earlier and as is shown in
As can be seen in
The VLR/SGSN selects 18 an authentication vector and based on the content of this vector it sends a user authentication request message ARQ 20 comprising a challenge using a parameter RAND assigned a random value RAND(i) and an authentication token AUTN(i), where AUTN(i) also comprises a challenge verification code as will be elaborated in more detail below, and i denotes that the value is associated with AVi. In the UE then AUTN(i) is verified and a result RES(i) is computed in a verification step 22. The UE then sends a user authentication response message (ARE) 20 comprising the result RES(i). The authentication vector comprises an expected result XRES(i) and the VLR/SGSN then compares 26 the received result RES(i) with the expected result XRES(i), and if the comparison was successful, i.e. if they were found to be equal, the VLR/SGSN then selects 30 the ciphering key CK(i) and integrity protection key IK(i). The UE also computes 28 the same keys CK(i) and IK(i). These are then used for obtaining sessions keys. In some systems (e.g. LTE) the keys CK(i) and IK(i) are used for obtaining a session key Kasme.
In an authentication of the type shown in
It is foreseen that UMTS/LTE AKA will be used as a basis also in future generation mobile networks (e.g. 5G) due to its proven track record of security and robustness. In the sequel, unless otherwise noted, “AKA” will be used to denote UMTS AKA, LTE AKA, or a protocol based on these, e.g. a future extension for “5G” networks.
As was also mentioned earlier, the AKA protocol shown in
The AUTN(i) (Authentication Token) is a parameter composed of different fields: AMF (Authentication Management Field), MAC and a sequence number indication (SQN, possibly encrypted/modified by an anonymity key AK). The MAC(i) is a Message Authentication Code that protects the challenge RAND(i) (RANDom number), as well as SQN and AMF from being forged by a 3rd party through the cryptographic functions implemented by the USIM. The keys CK(i) and IK(i) are used directly for ciphering/integrity protection in 3G and are used indirectly for these purposes in 4G/LTE by deriving ciphering/integrity keys from CK(i) and IK(i) (specifically: from a key Kasme, formed by CK(i) and IK(i)).
In these cryptographic functions, which are provided both in the UE and in the HE, a shared key K is thus used.
K is a key (usually 128-bits) which is thus shared by the USIM and the HSS/AuC, where AuC is short for Authentication Centre. The shared key must be kept secret to other parties.
As a simplifying notational convention used in the remainder of the description of cryptographic and other forms of computations, parameters other than those explicitly mentioned may be input to functions such as Key Derivation Functions (KDF), Message Authentication Codes (MAC) and all other functions in all instances described herein. The parameters may be put in a different order than explicitly mentioned. The parameters may be transformed before being input to the function. For example, a set of parameters P1, P2, . . . , Pn, for some non negative integer n, could be transformed by first being run through a second function f and the result of that, i.e., f(P1, P2, . . . , Pn), being input to the function.
An example of a key derivation when a parameter P1 is first transformed before being input to a KDF to calculate a key called “output_key” could be a derivation of form output_key=KDF(f(P1), some other parameter), where f is some arbitrary function or chain of functions. The input “some other parameter” could be 0, 1 or more other parameters, e.g., used to bind the key to a certain context. Sometimes, the notation “ . . . ” may be used as a synonym for “some other parameter”. Parameters may be input as separate parameters or may be concatenated together and then input in one single input to the KDF. Thus, one of skill in the art will understand that additional parameters may be used, parameters may be transformed or re-arranged etc. and even in the presence of variations like these, the core of the idea remains the same.
As was mentioned above, the security of AKA depends on the key K being kept secret. Recently, it was reported in media that a USIM card manufacturer's security had been breached and a set of K-keys had “leaked out” (or fallen into wrong hands), thus putting the subscribers associated with these keys at risks such as impersonation, connection hijacking, and eavesdropping (since also the ciphering keys, derived from CK(i) and/or IK(i), are thus potentially also at risk). In the article, https://firstlook.org/theintercept/2015/02/19/great-sim-heist/it was mentioned that a potential problem with the AKA protocol, leading to the aforementioned security implications, lied in that AKA lacks so called perfect forward secrecy (PFS). PFS means that even if the long term key used to establish session keys is exposed, it still does not imply that past session keys are also exposed. That is, the session key is secure in a future where the long term key has been compromised. AKA in fact has an advantageous but weaker property, often referred to as key separation: even if the session keys (CK(i), IK(i), etc.) are exposed, past/future CK(j), IK(j) (and further derived keys) are not exposed. However, when the long term key K is exposed, all such security properties provide little value.
Aspects of the invention are concerned with improving on the above described authentication function through adding perfect forwarding secrecy. It is thus concerned with enhancing communication security for both user equipment and network.
However, before a description is made about how this is done in any detail, some more details of the environment will now be given.
The first communication network 36 is thus in this example a network that is visited by the UE, while the second communication network 38 is a home network of the UE.
In different embodiments, each wireless network may comprise any number of wired or wireless networks, network nodes, base stations, controllers, wireless devices, relay stations, and/or any other components that may facilitate or participate in the communication of data and/or signals whether via wired or wireless connections.
Each wireless network may comprise one or more IP networks, public switched telephone networks (PSTNs), packet data networks, optical networks, wide area networks (WANs), local area networks (LANs), wireless local area networks (WLANs), wired networks, wireless networks, metropolitan area networks, and other networks to enable communication between devices.
As can be seen in
As was mentioned earlier the invention is directed towards introducing perfect forward secrecy in a system such as that in
One suitable scheme to use as basis is the scheme defined in the Diffie-Hellman protocol. This scheme implemented between the UE and the first wireless network WN1 is schematically indicated in
As can be seen in
(g{circumflex over ( )}x){circumflex over ( )}y or(g{circumflex over ( )}y){circumflex over ( )}x.
As can be seen the session key K′, which is a secure session key, may be generated based on the values x and y. The person of skill in the art will recognize that elliptic curves, and other cyclic groups where the discrete logarithm problem is hard, may also be used, however we for simplicity use multiplicative notation g{circumflex over ( )}x even though additive notation x*g would be more appropriate in the elliptic curve case. See Menezes et al, Handbook of Applied Cryptography, fifth printing (August 2001), CRC Press, for more details.
One way of realizing the ME 46 is schematically shown in
Processor 54 may be a combination of one or more of a microprocessor, controller, microcontroller, central processing unit, digital signal processor, application specific integrated circuit, field programmable gate array, or any other suitable computing device, resource, or combination of hardware, software and/or encoded logic operable to provide, either alone or in combination with other ME components, such as storage 56, ME functionality. Such functionality may include providing various wireless features discussed herein, including any of the features or benefits disclosed herein.
Storage 56 may be any form of volatile or non-volatile memory including, without limitation, persistent storage, solid state memory, remotely mounted memory, magnetic media, optical media, random access memory (RAM), read-only memory (ROM), removable media, or any other suitable local or remote memory component. Storage 56 may store any suitable data, instructions, or information, including software and encoded logic, utilized by ME 46. Storage 56 may be used to store any calculations made by processor 54 and/or any data received via interface 50B.
Interface 50B may be used in the wireless communication of signalling and/or data between UE and a network device, such as the base station 42. For example, interface 50B may perform any formatting, coding, or translating that may be needed to allow UE to send and receive data from base station 42 over a wireless connection. Interface 50B may also include a radio transmitter and/or receiver that may be coupled to or a part of antenna 50a. The radio may receive digital data that is to be sent out to base station 42 via a wireless connection. The radio may convert the digital data into a radio signal having the appropriate channel and bandwidth parameters. The radio signal may then be transmitted via antenna 50a to base station 42.
Antenna 50a may be any type of antenna capable of transmitting and receiving data and/or signals wirelessly.
The storage 56 may also comprise instructions for handling Perfect Forward Secrecy in relation to communication of the ME to the first wireless network.
The storage 56 may more particularly comprise computer instructions causing the processor 54 to implement the PFS-AKA module 52. The communication module 50 may in turn in essence be implemented through the combination of the interface 50B and antenna 50A.
Processor 60 may be a combination of one or more of a microprocessor, controller, microcontroller, central processing unit, digital signal processor, application specific integrated circuit, field programmable gate array, or any other suitable computing device, resource, or combination of hardware, software and/or encoded logic operable to provide, either alone or in conjunction with other network device components, such as storage 62, network device functionality. For example, processor 60 may execute instructions stored in storage 62.
Storage 62 may comprise any form of volatile or non-volatile computer readable memory including, without limitation, persistent storage, solid state memory, remotely mounted memory, magnetic media, optical media, random access memory (RAM), read-only memory (ROM), removable media, or any other suitable local or remote memory component. Storage 62 may store any suitable instructions, data or information, including software and encoded logic, utilized by network device 57. Storage 62 may be used to store any calculations made by processor 60 and/or any data received via interface 58.
Network device 57 also comprises interface 58 which may be used in the wired communication of signalling and/or data between network device 57, network WN1 or WN2, and/or UE. For example, interface 58 may perform any formatting, coding, or translating that may be needed to allow network device 57 to send and receive data from network WN1 or WN2 over a wired connection.
Aspects of the invention are concerned with adding PFS to AKA.
The following embodiments will be described in 4G/LTE context for simplicity, but it is also applicable to IMS AKA (IP Multimedia Subsystem AKA) and EAP-AKA (Extensible Authentication Protocol-AKA) and embodiments are also currently seen as applicable to the currently discussed 5G systems or any other future system based on AKA, or other settings in which identity modules with pre-shared keys are used.
As mentioned above, aspects of the invention are concerned with providing perfect forward secrecy in the communication between the communication device and the first network device, with advantage based on the Diffie-Hellman (DH) protocol.
This protocol requires, however, computational effort and additional bandwidth to carry the necessary parameters: the exchanged DH parameters are much larger than the parameters of the currently standardized AKA protocol (RAND, RES, etc.). Even if it was possible to increase the number of bits signaled over the air interface, it would be desirable to maintain the standardized USIM-ME interface in the UE, which implies a bottleneck for the size of the protocol parameters which falls below the level were DH offers strong security. (RAND is currently 128 bits and to reach a security matching the 128-bit strength of AKA, DH parameters of at least 256-bits are needed for elliptic curve variants of DH, and around 3000-bits for standard discrete logarithm DH modulo a prime, p.) Moreover, DH is sensitive to a man-in-the-middle (MITM) attack implying need of adding some mechanism to authenticate the DH parameters. The natural approach to do this would be to add another data field to AKA and lead to even more signaling overhead.
One object is therefore to raise the security level of communication between a communication device and a communication network in relation to the use of long-term shared keys. It may also be of interest to avoid sending additional messages. It is thus desirable that the existing message structure is used without adding new messages. This may be important from an energy saving perspective both regarding the communication device as well as on a general environmental level, since the sending of additional messages uses energy, which may be a limited resource especially in the communication device. Furthermore, network communication is also typically standardized and it is often much harder to agree on the introduction on new messages, than the adding of new elements in already existing messages which would be necessary to provide authentication and MITM protection if using a straight-forward approach to adding perfect forward secrecy.
Before proceeding, some observations about authentication in protocols providing PFS, exemplified by the DH protocol, is beneficial. In the specific context of AKA, one of skill in the art may be tempted to use one or more of the AKA result parameters produced by the computations in the USIM, i.e. RES, CK and or IK for this purpose. This is in general dangerous to the security. Computing e.g. the DH parameters g{circumflex over ( )}x and/or g{circumflex over ( )}y via x=F′(CK, IK) and/or y=F′(CK, IK) for some function F′ will not lead to perfect forward secrecy as these parameters can be computed from knowledge of the long term key K. Therefore, while re-use of AKA parameters and protocols data fields is beneficial, it has to be exercised with caution. Therefore x and y should be independent of AKA parameters.
On the other hand, for protection against MITM, we may use one or more of the AKA parameters and add a standard MAC. For example, an AKA response from the UE could comprise:
RES,g{circumflex over ( )}y,MAC(CK∥IK∥ . . . ,g{circumflex over ( )}y∥ . . . ).
(This is thus possibly another MAC function not to be confused with the aforementioned MAC parameter of the AKA protocol. Also note that since we are considering a fixed set of AKA parameters, we suppress the index i and write e.g. CK instead of CK(i) as above.) Note that there will generally be plural options for which key to use in the MAC, i.e. as the first parameter in the input to MAC( . . . , . . . ). So as not to obscure the description with too much detail, we therefore often suppress the key (and other less important parameters), e.g. writing MAC(g{circumflex over ( )}y) instead of MAC(CK∥IK∥ . . . , g{circumflex over ( )}y∥ . . . ) as above. Where . . . indicates possibly other variables/parameters and II denotes a way to combine the inputs to the MAC function, e.g., concatenation. However, an even more economical way would be to incorporate the MAC above in the existing information element carrying the RES when it is transmitted from the UE to the MME, e.g. computing RES'=MAC(RES, g{circumflex over ( )}y, . . . ), using RES (and optionally CK, IK) as key and thus the UE responding with RES′, g{circumflex over ( )}y only. The MAC function may be based on HMAC, one of the native AKA f-functions (as defined in 3GPP TS 33.102) or another suitable function, e.g. based on AES. As RES is computed as a MAC that is based on g{circumflex over ( )}y and a key-value (CK/IK or RES), it is clear that it in fact is a verification code for the authenticity of g{circumflex over ( )}y. Furthermore, when the MAC is also based on RES as the key, it can at the same time be used for verifying RES. It should here also be realized that a MAC is just one possible function that can be used for calculating RES′. Another example is a key derivation function or a pseudorandom function in general.
Similar considerations apply for the DH value g{circumflex over ( )}x transmitted from the network to the ME in order to save communication overhead and yet provide PFS.
Specifically, the AuC/HSS may in some embodiments generate the authentication vectors sent to the serving network accordingly, i.e. compute parameters such as RAND=g{circumflex over ( )}x, apply a hash to RAND before inputting it to the f-functions, etc. Thus, g{circumflex over ( )}x is effectively carried in the RAND AKA protocol field without adding a new information element. In some embodiments, the HSS does not need to send CK, IK (or keys derived therefrom such as Kasme) to the MME as part of Authentication Vectors (AV) since the resulting shared key will be based on g{circumflex over ( )}(xy) which is anyway not known to the HSS at time of AV generation. In other embodiments the AuC/HSS may include these CK, IK to be included in key generation. For example, in LTE keys are “bound” to the access network through inclusion of a PLMN (Public Land Mobile Network) identifier in the derivation of the Kasme key from CK, IK. Since the HSS as noted does not know g{circumflex over ( )}(xy) at the point when AVs are generated, a binding to PLMN ID could be achieved by including the PLMN ID in derivation of some further key from CK, IK and including that derived key in the AV. Also the MME may be adopted, i.e. given XRES in the AV from the HSS, it would in the embodiment above compute XRES'=MAC(XRES, g{circumflex over ( )}y) before verifying subscriber authenticity, and it may derive Kasme as F(g{circumflex over ( )}(xy)∥ . . . ) for some suitable function F, etc. The ME may compute Kasme similarly.
A first embodiment will now be described also with reference being made to
In the examples given here the communication network 36 is the first wireless network WN1 and the first network device 44 is the MME of the first wireless network.
The operation may start with the UE attaching to the first communication network 36. As a part of this, an identifier e.g. international mobile subscriber identity IMSI may be provided from the UE or rather from the USIM 48 of the UE to the first network device 44, which in turn sends a request for an authentication vector AV to the second network device 46 in the second communication network 38. The second network device 46 generates the authentication vector, which may comprise the authentication token AUTN, the random value RAND, the expected result of the verification computation XRES as well as an initial session Key Kasme. It may also comprise other keys such as the keys CK/IK. Thus, in so far, the second network node 45 may operate according to existing (3GPP) AKA specifications. In this way the first network device 44 obtains the authentication vector, step 74, which may at least comprise a random value RAND and an expected verification result XRES. Here it can be mentioned that RAND is provided for use as a challenge to the UE and AUTN comprises a challenge verification code for this challenge.
After having obtained the authentication vector, the first network device then obtains a first PFS parameter PFS1, step 76, which first PFS parameter PFS1 may be obtained through generation as a base value g raised with a random value x, i.e. as g{circumflex over ( )}x, where the random value x may be generated by the first network device 44. Alternatively, the random value x and/or the first PFS parameter PFS1 is obtained from the second network device 45, in which case the second node 45 performs additional operations besides those currently specified by AKA. Thereafter the first network device 44 obtains a first verification code, VC1, for the first PFS parameter PFS1, step 78. In one variation it obtains VC1 by generating the verification code itself and in another variation, the second network device generates the first verification code. Thus in the second variation it is also the case that the second node 45 performs additional operations besides those currently specified by AKA. The first verification code VC1 may be generated as a Message Authentication Code (MAC) over the first PFS parameter PFS1 using a known key of the authentication vector, such as XRES or the initial session key Kasme, as key. When the second network device 45 generates the first verification code, the RAND value is based on the first PFS parameter PFS1. In this case, the RAND value may be generated by the second network device 45 as the first PFS parameter PFS1 or as a hash of the first PFS parameter PFS 1, such as a cryptographic hash. Thereby it is possible, e.g. by the UE, to use the challenge verification code AUTN also as the first verification code VC1 for the first PFS parameter PFS1. Here it may also be mentioned that RAND in both these examples is in fact a challenge to the USIM 48 of the UE.
The first network device 44 then sends the challenge RAND, the first PFS parameter PFS1, possibly both encoded by the RAND information element, and the first verification code VC1 to the UE, which may with advantage be sent in an authentication request message ARQ, step 80. In case the first verification code VC1 is a separate code (i.e. different from AUTN), e.g. a dedicated MAC generated by the first network device 44, then also the authentication token AUTN may be separately provided in the message.
The challenge RAND, the first PFS parameter PFS1 (encoded in RAND or in an additional parameter) and the first verification code VC1 (encoded in AUTN or a separate code) are then received in the UE, step 64. They may more particularly be received through the authentication request message ARQ being received by the communication module 50 of the ME 46 and forwarded therefrom to the PFS-AKA module 52.
In the PFS AKA module 52 the challenge or a derivative thereof is forwarded to the USIM 48, step 65. This is done in order to forward a pure challenge to the USIM 48. The pure challenge may be obtained in one of two ways, depending on alternatives described above. If the RAND information element encodes the first PFS parameter PFS1 it may be obtained as a derivative through the PFS AKA module computing a hash of the RAND information element, i.e. a hash of g{circumflex over ( )}x. This means that if RAND is not already a hash of the first PFS parameter g{circumflex over ( )}x, then one may be computed at this stage. If the RAND information element does not encode the first PFS parameter PFS1, then the value of the RAND information element may be input directly to the USIM. Also if the challenge received by the PFS AKA module is a hash of the first PFS parameter, such as a cryptographic hash, it may be directly forwarded to the USIM. The forwarding is performed via the standardized USIM-ME interface in the UE.
As indicated earlier, the USIM 48 comprises a key K, with advantage a key K that is pre-shared with the second network device 45. It also comprises cryptographic processing means. This module 48 may then provide at least one result parameter (CK/IK) as a response to the challenge (RAND and AUTN). One result parameter may be one or more cryptographic keys such as a ciphering key CK and an integrity protection key 1K, which may be used by the PFS AKA module 52 to obtain the initial session key Kasme. Another result parameter may be a response parameter RES to the challenge, which response parameter has a response value. Such a response parameter thus has a cryptographic value computed based on the pre-shared key and said cryptographic processing means.
The mobile equipment 46 and more particularly the PFS AKA module 52 thus obtains, or rather receives the one or more result parameter, step 66, and goes on and determines the authenticity of the first PFS parameter PFS1, i.e. the authenticity of g{circumflex over ( )}x, step 68. It thus determines, based on VC1 and the one or more result parameter whether the PFS parameter PFS1 is authentic. This may be done through the key for the first verification code being based on one or more of the result parameters and using said key to verify a MAC carried in VC1. If the first verification code is a part of the challenge or rather is carried in the challenge verification code AUTN, i.e. the MAC-subfield of AUTN then it is sufficient that a result parameter is obtained in order to determine the authenticity. I.e. the USIM 49 would not even provide any of the result parameters if verification of AUTN had failed internal to the USIM, instead it will return an error status code. The first verification code may thus be provided as at least a part of the challenge verification code. Authenticity is thus determined based on the USIM 48 providing the at least one result parameter.
The at least one result parameter may comprise an error indication, indicating failure by the identity module to verify said challenge or, derivative of the challenge using the pre-shared key K and the cryptographic processing means. This may be the case when RAND=g{circumflex over ( )}x abd-AUTN verification fails internally to the USIM. If such an error signal is received by the PFS AKA module 52, it may directly determine that the first PFS parameter is not authentic.
Thereafter the ME 46 or rather the PFS AKA module 52 of the ME 46 generates a second PFS parameter PFS2 and a second verification code, VC2, step 70, which second PFS parameter PFS2 may be generated as the base value g raised with another random value y, i.e. as g{circumflex over ( )}y. The verification code VC2 may in turn be generated as a message authentication code (MAC) of the second PFS parameter PFS2 and a key, e.g. one of the result parameters, or a derivative, Kd, of a result parameter, e.g. Kasme. The second verification code may thus be computed using the second PFS parameter and a result parameter or a derivative of a result parameter. If this second verification code VC2 is generated based on the response parameter RES, VC2 may be encoded in the information element normally carrying RES. It may then be generated as a function of RES and g{circumflex over ( )}y, such as a MAC of RES and g{circumflex over ( )}y, where RES acts as a key. Thus, the PFS module either calculates VC2 as MAC(Kd, g{circumflex over ( )}y, . . . ), as MAC(Kasme, g{circumflex over ( )}y, . . . ), or as MAC(RES, g{circumflex over ( )}y, . . . ). The second PFS parameter PFS2 and the second verification code VC2 are then sent to the first network device, either together with the separate response parameter RES (if Kd was used as key), or (if RES was used as a key) by encoding VC2 in what would normally be the RES information element, step 72, and may more particularly be sent in an authentication request response message ARE.
The PFS AKA module 52 may also verify whether the first and second verification codes satisfy a specific relation. This may be the case when the first PFS parameter, i.e. g{circumflex over ( )}x, is not encoded in the challenge RAND and where the first verification code VC1 is a separate code, for instance an explicit MAC, which is verified outside the USIM. In this case the specific relation is equality.
The second PFS parameter PFS2 and the second verification code VC2 and possibly also the separate response parameter are thus received by the first network device 44, for instance in the authentication request response message ARE, step 82. The first network device 44 then determines the authenticity of the response parameter RES, step 84, which may be done through comparing the challenge result or response parameter value RES with the expected challenge result XRES. Finally the second PFS parameter PFS2 is verified based on the second verification code VC2, step 86. If the second verification code VC2 is provided separately from the response RES, the verification in step 86 may be based on a MAC of the second PFS parameter, using the initial session key Kasme or a derivative thereof, Kd, as key, for verifying the second verification code VC2. In case the second verification code VC2 was provided as a function based on the response parameter value as a key, and VC2 was encoded in the RES parameter, then the first network device may perform steps 84 and 86 simultaneously, since a correct value for the second verification code implies that the UE used the correct RES, i.e. the same values as indicated by XRES.
Thereby a scheme has been implemented that enhances the communication security. It more particularly enhances the security if the secret, pre-shared key has been compromised as it provides perfect forward secrecy.
In ensuing sessions, e.g. data or signalling exchange between the UE and the network and more particularly between the UE and the first network device 44 it is then possible that a session key is used to protect communication and that this session key is based on the first and second PFS parameters. The session key may more particularly be based on the base g raised with the value x raised with the value y according to g{circumflex over ( )}(xy). Alternatively, a derivative of a combination of Kasme and g{circumflex over ( )}(xy) may be used. Thereby it can be seen that a secure session key is obtained that is at least based on the values x and y used for generating the first and second PFS parameters. It is thus generated based on one of the PFS parameters and the exponent of the other PFS parameter. This may more particularly mean that the PFS AKA module 52 may generate the session key based on the first PFS parameter PFS1 and the exponent y of the second PFS parameter PFS2, while the first network device 44 may generate the session key based on the second PFS parameter PFS2 and the exponent x of the first PFS parameter PFS1.
Now a second embodiment will be described with reference being made to
As can be seen in
The second embodiment is based on using the RAND parameter to carry a DH value as a PFS parameter when sent from the network/a network device to the UE/communication device: RAND=g{circumflex over ( )}x or a derivative of g{circumflex over ( )}x.
Note that a PFS parameter computed in accordance with some variations of DH may be substantially larger than 128-bits which is the current standardized size of RAND. Therefore, it could pose problems with the USIM-ME interface. To address this, before inputting RAND to f-algorithms in the USIM (and in the HSS, Home Subscriber Server) the provided RAND value may be compressed, e.g. by cryptographic hashing: RAND′=H(RAND)=H(g{circumflex over ( )}x), where H is a suitable function producing the appropriate number of bits, for example, H may be based on SHA2 (where SHA stands for Secure Hash Algorithm), AES (Advanced Encryption Standard), HMAC (key-Hashed Message Authentication Code), etc. In principle H could also be a function that selects a set of 128 bits from the RAND, e.g., the 128 least significant bits. On the UE side, H may similarly be applied in the ME (e.g. in a PFS module), before inputting RAND′ to the USIM. As the RAND is a challenge directed towards the USIM, it can be seen that ME may thus generate a derivative of the challenge and forward it to the USIM. As a consequence, the AKA MAC-field (being comprised inside AUTN) will be computed in dependency of RAND′, but through the use of H, it will in effect still be computed in dependency of RAND, i.e. g{circumflex over ( )}x. Therefore, authentication from the AuC (Authentication Center)/HSS to the USIM of this DH value is obtained, preventing MITM attacks, in particular between the serving network and UE as any spoofing or modification of g{circumflex over ( )}x while in transit would be detected by the AUTN verification in the USIM in the UE.
With reference to
The larger RAND value can be computed by the AuC/HSS and sent in a modified form of the Authentication Vector (AV) to the MME (Mobile Management Entity). Another possibility is that the MME receives a regularly sized RAND in the AV and extends the RAND by appending or prepending a set of bits to the RAND before transmitting it to the UE. In this latter case, the choice of function H must match how the MME extended the received RAND, otherwise the USIM would reject the RAND/AUTN pair.
The rest of this second embodiment is identical to the first embodiment in the special case that the AUTN is to be used for providing the first verification code VC1 (corresponding to VC1A below), or, equivalently, that the first PFS parameter PFS1 is encoded into the RAND information element. The operation of the second embodiment may more particularly be the following and as showed in
In a variation of the second embodiment, the challenge used is a hash of g{circumflex over ( )}x. This means that the RAND being generated by the HSS and sent by the MME to the UE is a hash of g{circumflex over ( )}x. This would have to be accompanied also by g{circumflex over ( )}x. Thereby RAND can be directly sent from the ME to the USIM without the ME calculating a hash of it.
In a third embodiment, the second node may not need to perform any step that is not part of current AKA specifications. While some options exist below in which the second node does perform additional steps to current AKA specifications, these steps are optional and can be avoided if so desired.
In this embodiment, the RAND parameter is not used to transfer or carry information about the g{circumflex over ( )}x from the network (serving or home network) to the UE. Consequently, AUTN cannot be used to carry the first verification code either. Instead, the network transmits the RAND separately to the UE, and includes the g{circumflex over ( )}x in a new information element in the same message as the RAND. The transmission may as noted originate at the HSS, or, may originate at the MME (e.g. the MME generates a random x locally). In this case, the g{circumflex over ( )}x needs to be authenticated and the network (serving or home) includes an additional MAC computed over the g{circumflex over ( )}x in the message as well. The key for this MAC can be for example RES, or one of CK/IK or both. It may also be derivatives thereof such as Kasme. The function H would be the identity function in this embodiment. Thereby the derivative becomes identical to the challenge. One benefit with this embodiment is that the serving network (e.g. the MME) can choose the value x and there is no need for signaling this between the serving network and the AuC/HSS. In fact, the same signaling between these nodes as is used today can be re-used. A drawback is that the 128-bit RAND needs to be sent from the serving network to the UE as well as the larger g{circumflex over ( )}x value. Hence some more bandwidth is required over the air interface.
The third embodiment will now be further described with reference being made to
Thereby the UE can communicate with the first wireless network with improved security.
It should be realized that also in this third embodiment, it is possible to use RES' as second verification code e.g. if the key used to compute the second verification code VC2B is dependent on RES as in the previous embodiments.
Note that at all of the embodiments may be combined with the invention disclosed in U.S. Pat. No. 7,194,765. In this case, the HSS will not provide the MME with XRES, but rather XRES'=H(XRES). The UE may then explicitly signal RES to the MME so that MME can compute and verify XRES′. In this case, at least one of CK and IK (or some key derived therefrom) should be included in the computation of RES′.
Note again that since GBA and EAP-AKA make use of AKA, one of skill in the art will realize after this description that described embodiments can also be applied in those contexts by straight-forward modifications.
An advantage of at least one of the embodiments of the disclosure adds PFS to network authentication, e.g. mobile network authentication, at a low or even minimal cost, enabling and/or ensuring backward compatibility with SIM-ME interface for the AKA protocol. Another advantage of at least one of the embodiments of the disclosure is that it limits the effects of long term key compromises, such as hacked HSSes and hacked smart card vendor sites. Other advantages include avoiding the use of additional transmissions, which in turn saves energy.
The computer program code of a mobile equipment may be in the form of computer program product for instance in the form of a data storage medium, such as a CD ROM disc or a memory stick. In this case the data storage medium carries a computer program with the computer program code, which will implement the functionality of the above-described mobile equipment. One such data storage medium 110 with computer program code 112 is schematically shown in
The computer program code of the first network device may be in the form of computer program product for instance in the form of a data storage medium, such as a CD ROM disc or a memory stick. In this case the data storage medium carries a computer program with the computer program code, which will implement the functionality of the above-described first network device. One such data storage medium 114 with computer program code 116 is schematically shown in
As is schematically shown in
a receiving unit 118 for receiving a challenge, a first PFS parameter and a first verification code from a network device,
a forwarding unit 120 for forwarding the challenge or a derivative thereof to an identity module,
a receiving unit 122 for receiving at least one result parameter as response from the identity module,
a determining unit 124 for determining, based on the result parameter whether the first PFS parameter is authentic, and
a generating unit 126 for generating and sending a second PFS parameter to the network device if the determination is that the first PFS parameter is authentic. The units are in one embodiment corresponding to software instructions. In another embodiment the units are implemented as hardware units in one or more hardware circuits, like ASICs or FPGAs.
The communication device may further comprise a generating unit for generating a session key for communication between the communication device and the network device, where the session key is at least based on values used for generating the first and second PFS parameter.
The receiving unit 118 for receiving a challenge, a first PFS parameter and a first verification code may furthermore be a receiving unit for receiving the challenge, the first PFS parameter and the first verification code from the network device in an authentication request message, where the authentication request message also comprises a challenge verification code. The receiving unit 122 for receiving at least one result parameter may in turn be a receiving unit for receiving a response parameter as a response to the challenge and the generating unit 126 may be a generating unit for generating the second PFS parameter together with a second verification code and sending these in an authentication response message also comprising the response parameter.
The determining unit 124 may furthermore be a determining unit for determining the authenticity of the first PFS parameter using a first verification code comprised in a corresponding separate information element of the authentication request message.
If the first verification code is provided as at least part of the challenge verification code, the determining unit 124 may furthermore be a determining unit for determining the authenticity of the first PFS parameter based on the identity module providing the at least one result parameter.
The generating unit 126 may also be a generating unit for generating the second verification code based on the response parameter and sending the second verification code in an information element of the authentication response message assigned to the response parameter.
As is shown in
an obtaining unit 128 for obtaining a challenge,
an obtaining unit 130 for obtaining a first PFS parameter,
an obtaining unit 132 for obtaining a first verification code for the first PFS parameter,
a sending unit 134 for sending the challenge, the first PFS parameter and the first verification code to the communication device,
a receiving unit 136 for receiving a second PFS parameter, a second verification code and a response parameter from the communication device,
a determining unit 138 for determining the authenticity of the response parameter, and
a verifying unit 140 for verifying the second PFS parameter based on the second verification code.
The units are in one embodiment corresponding to software instructions. In another embodiment the units are implemented as hardware units in one or more hardware circuits, like ASICs or FPGAs.
The first network device 44 may furthermore comprise a computing unit for computing a session key for communication between the communication device and the first network device, where the session key is at least based on values used for generating the first and second PFS parameter.
The obtaining unit 128 for obtaining the challenge may also be an obtaining unit for obtaining a challenge verification code, the sending unit 134 may be a sending unit for sending the challenge, the first PFS parameter and the first verification code in an authentication request message together with the challenge verification code and the receiving unit 136 may be a receiving unit for receiving the second PFS parameter, the second verification code and the response parameter in an authentication response message.
The obtaining unit 132 for obtaining the first verification may comprise a generating unit for generating the first verification code using the first PFS parameter and the sending unit 134 may be a sending unit for sending the first verification code in a corresponding separate information element of the authentication request message.
The first network device may also comprise a receiving unit for receiving a value x to be used in generating the first PFS parameter. The value x, which is an exponent value, may also be termed a seed value. In this case the obtaining unit 132 for obtaining the first verification code may be an obtaining unit for obtaining the first verification code as at least part of the challenge verification code and the sending unit 134 may be a sending unit for sending the first verification code as at least part of the challenge verification code in the authentication request message.
The obtaining unit 128 for obtaining the challenge may also be an obtaining unit for obtaining an expected challenge result and the determining unit 138 may be a determining unit for determining the authenticity of the response parameter through a comparison with the expected challenge result.
The response parameter may be included in the authentication response message through the second verification code being based on the response parameter. In this case the receiving unit 136 may be a receiving unit for receiving the second verification code in an information element of the authentication response message assigned to the response parameter and the determining unit 138 and the verifying unit 140 may be a combined determining and verifying unit for simultaneously determining the authenticity of the response parameter and verifying the second PFS parameter using the second verification code.
As is schematically shown in
It may furthermore comprise a providing unit 144 for providing a value in order for the first PFS parameter to be obtained through generating it at least based on the value x, a generating unit for generating the challenge verification code using the first PFS parameter and a sending unit for sending the value to the first network device.
The units are in one embodiment corresponding to software instructions. In another embodiment the units are implemented as hardware units in one or more hardware circuits, like ASICs or FPGAs.
While the invention has been described in connection with what is presently considered to be most practical and preferred embodiments, it is to be understood that the invention is not to be limited to the disclosed embodiments, but on the contrary, is intended to cover various modifications and equivalent arrangements. Therefore the invention is only to be limited by the following claims.
This application is a continuation of U.S. patent application Ser. No. 16/043,842, filed 24 Jul. 2018, which is a continuation of U.S. patent application Ser. No. 15/096,644, filed 12 Apr. 2016 (now U.S. Pat. No. 10,057,232), which is a continuation of U.S. patent application Ser. No. 14/770,774, filed 26 Aug. 2015 (now U.S. Pat. No. 9,787,661), which itself is a 35 U.S.C. § 371 national stage application of PCT International Application No. PCT/SE2015/050822, filed 13 Jul. 2015, which itself claims priority to U.S. provisional Application No. 62/121,689, filed 27 Feb. 2015, the disclosures and contents of which each are incorporated by reference herein in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5491749 | Rogaway | Feb 1996 | A |
| 5867578 | Brickell | Feb 1999 | A |
| 7107620 | Haverinen et al. | Sep 2006 | B2 |
| 7434054 | Zick | Oct 2008 | B2 |
| 7676042 | Okamoto | Mar 2010 | B2 |
| 7715822 | Semple et al. | May 2010 | B2 |
| 7966000 | Semple et al. | Jun 2011 | B2 |
| 8412157 | Wang et al. | Apr 2013 | B2 |
| 8572385 | Papamanthou | Oct 2013 | B2 |
| 8850540 | Lin | Sep 2014 | B2 |
| 9088408 | Campagna et al. | Jul 2015 | B2 |
| 9264900 | Sun | Feb 2016 | B2 |
| 9300641 | Laitinen et al. | Mar 2016 | B2 |
| 9503438 | Choyi et al. | Nov 2016 | B2 |
| 9628237 | Kim et al. | Apr 2017 | B2 |
| 9628273 | Alshammari | Apr 2017 | B2 |
| 20030229789 | Morais et al. | Dec 2003 | A1 |
| 20050086342 | Burt et al. | Apr 2005 | A1 |
| 20060025141 | Marsh et al. | Feb 2006 | A1 |
| 20060095766 | Zhu | May 2006 | A1 |
| 20060179319 | Krawczyk | Aug 2006 | A1 |
| 20060205388 | Semple et al. | Sep 2006 | A1 |
| 20060206710 | Gehrmann | Sep 2006 | A1 |
| 20060291661 | Ramzan | Dec 2006 | A1 |
| 20070157026 | Zimmerman | Jul 2007 | A1 |
| 20070192602 | Blom et al. | Aug 2007 | A1 |
| 20070234041 | Lakshmeshwar et al. | Oct 2007 | A1 |
| 20080137848 | Kocher | Jun 2008 | A1 |
| 20090063863 | Durand | Mar 2009 | A1 |
| 20090100264 | Futa et al. | Apr 2009 | A1 |
| 20090209232 | Cha et al. | Aug 2009 | A1 |
| 20090220091 | Howard | Sep 2009 | A1 |
| 20100202455 | Sundaram et al. | Aug 2010 | A1 |
| 20110004754 | Walker et al. | Jan 2011 | A1 |
| 20110055585 | Lee | Mar 2011 | A1 |
| 20110213977 | Little | Sep 2011 | A1 |
| 20110238972 | Semple et al. | Sep 2011 | A1 |
| 20110258452 | Coulier | Oct 2011 | A1 |
| 20130080769 | Cha et al. | Mar 2013 | A1 |
| 20130268444 | Namgoong et al. | Oct 2013 | A1 |
| 20130298209 | Targali et al. | Nov 2013 | A1 |
| 20140004824 | Campagna et al. | Jan 2014 | A1 |
| 20140201809 | Choyi et al. | Jul 2014 | A1 |
| 20140281525 | Acar | Sep 2014 | A1 |
| 20150031334 | Wu | Jan 2015 | A1 |
| 20150052352 | Dolev et al. | Feb 2015 | A1 |
| 20150118995 | Aksu et al. | Apr 2015 | A1 |
| 20150244685 | Shah et al. | Aug 2015 | A1 |
| 20160226847 | Bone et al. | Aug 2016 | A1 |
| 20160227410 | Narasimha et al. | Aug 2016 | A1 |
| 20160277956 | Lindheimer et al. | Sep 2016 | A1 |
| 20170339118 | Hwang | Nov 2017 | A1 |
| Number | Date | Country |
|---|---|---|
| 2 249 593 | Nov 2010 | EP |
| 2 437 469 | May 2013 | EP |
| WO 2001063954 | Aug 2001 | WO |
| WO 2006084183 | Aug 2006 | WO |
| WO 2007042512 | Apr 2007 | WO |
| Entry |
|---|
| Indian Examination Report for Indian Application No. 201717027142 dated Feb. 20, 2020, 12 Pages. |
| Final Office Action for U.S. Appl. No. 14/770,774 (dated May 22, 2017). |
| Lai, C. et al., “SE-AKA: A secure and efficient group authentication and key agreement protocol for LTE networks,” Computer Networks No. 57 (2013), pp. 3492-3510. |
| Examiner's Pre-Review Report for Japanese Patent Application No. 2017-545344 dated Jul. 5, 2019, including English summary, 4 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20190394184 A1 | Dec 2019 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62121689 | Feb 2015 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 16043842 | Jul 2018 | US |
| Child | 16558891 | US | |
| Parent | 15096644 | Apr 2016 | US |
| Child | 16043842 | US | |
| Parent | 14770774 | US | |
| Child | 15096644 | US |
