Key agreement using a key derivation key
Claim Score by NHIP
Abstract
Methods, systems, and computer programs for performing key agreement operations in a communication system are described. In some aspects, a wireless network operator accesses a secret key associated with a mobile device. A key derivation function (KDF) is evaluated based on the secret key to produce a key derivation key, and the KDF is evaluated based on the key derivation key to produce an output value. A session key and a challenge value are obtained based on the output value. In some aspects, the mobile device receives the challenge value and accesses a secret key. A KDF is evaluated based on the secret key to produce a key derivation key, and the KDF is evaluated based on the key derivation key to produce an output value. A response value and a session key are obtained based on the output value. The response value is transmitted to the wireless network operator.

Term
5.8 yearsto projected expiry
Projected expiry 13 July 2032, counted from filing; an application has no term until it is granted.
- Priority and filed
- Published
- Today
- Projected expiry
25 claims: 5 independent, 20 dependent
- 1Broadest claimClaim Score 79, broad(NHIP)A method, comprising:receiving an identifier of a mobile device;accessing, based on the identifier, a secret key associated with the mobile device;evaluating a key derivation function to produce a key derivation key based on the secret key, wherein the key derivation function is based on a hash function;evaluating the key derivation function to produce an output value based on the key derivation key;and obtaining a session key based on the output value.
- 8A server, comprising:a communication interface and a processor, wherein the communication interface is configured to receive an identifier of a mobile device and the processor is configured to: access, based on the identifier, a secret key associated with the mobile device;evaluate a key derivation function to produce a key derivation key based on the secret key, wherein the key derivation function is based on a hash function;evaluate the key derivation function to produce an output value based on the key derivation key;and obtain a session key based on the output value.
- 15A method performed by a mobile device, the method comprising:accessing a secret key in response to receiving a challenge value;evaluating a key derivation function to produce a key derivation key based on the secret key, wherein the key derivation function is based on a hash function;evaluating the key derivation function to produce an output value based on the key derivation key;obtaining a response value and a session key based on the output value;and transmitting the response value.
- 20A device, comprising:a processor configured to: access a secret key in response to receiving a challenge value;evaluate a key derivation function to produce a key derivation key based on the secret key, wherein the key derivation function is based on a hash function;evaluate the key derivation function to produce an output value based on the key derivation key;obtain a response value and a session key based on the output value;transmit the response value to the wireless network operator system;access a sequence value previously stored on the device;obtain a message authentication code based on the secret key and the sequence value;and generate a device authentication token based on the message authentication code and the sequence value.
Independent claims4
154 paragraphs in 3 sections, as filed
BACKGROUND
p-0002This specification relates to performing key agreement operations in a wireless communication system. Many mobile devices are configured to communicate with a wireless network (e.g., Global System for Mobile Communication (GSM), Universal Mobile Telecommunication Services (UMTS), Long-Term Evolution (LTE), etc.). The mobile device and the wireless network can use cryptographic techniques to communicate with confidentiality and authenticity. In some instances, the mobile device and the wireless network perform a key agreement protocol to derive the keys (e.g., ciphering keys, integrity keys, etc.) that are used in cryptographic communication.
BRIEF DESCRIPTION OF THE DRAWINGS
p-0003<figref idrefs="DRAWINGS">FIG. 1</figref> is a schematic diagram of an example wireless communication system.
p-0004<figref idrefs="DRAWINGS">FIG. 2</figref> is a signaling and flow diagram of an example authenticated key agreement sequence in a communication system.
p-0005<figref idrefs="DRAWINGS">FIG. 3A</figref> is a flow diagram showing an example technique that can be used by a network operator system for authenticated key agreement.
p-0006<figref idrefs="DRAWINGS">FIG. 3B</figref> is a flow diagram showing an example technique that can be used by a mobile device for authenticated key agreement.
p-0007<figref idrefs="DRAWINGS">FIG. 4A</figref> is a flow diagram showing an example technique that can be used by a network operator system for authenticated key agreement.
p-0008<figref idrefs="DRAWINGS">FIG. 4B</figref> is a flow diagram showing an example technique that can be used by a mobile device for authenticated key agreement.
p-0009<figref idrefs="DRAWINGS">FIGS. 5A and 5B</figref> are flow diagrams showing an example technique that can be used by a network operator system for authenticated key agreement in a Universal Mobile Telecommunication Services (UMTS) system.
p-0010<figref idrefs="DRAWINGS">FIGS. 5C and 5D</figref> are flow diagrams showing example technique that can be used by a mobile device for authenticated key agreement in a UMTS system.
p-0011<figref idrefs="DRAWINGS">FIG. 5E</figref> is a schematic diagram showing aspects of the example technique shown in <figref idrefs="DRAWINGS">FIGS. 5A and 5B</figref>.
p-0012<figref idrefs="DRAWINGS">FIG. 6A</figref> is a flow diagram showing an example technique that can be used by a network operator system for authenticated key agreement in a UMTS system.
p-0013<figref idrefs="DRAWINGS">FIGS. 6B and 6C</figref> are flow diagrams showing an example technique that can be used by a mobile device for authenticated key agreement in a UMTS system.
p-0014<figref idrefs="DRAWINGS">FIG. 6D</figref> is a schematic diagram showing aspects of the example technique shown in <figref idrefs="DRAWINGS">FIG. 6A</figref>.
p-0015Like reference numbers and designations in the various drawings indicate like elements.
DETAILED DESCRIPTION
p-0016Wireless communication systems need security features. Security protocols may be executed, for example, by wireless network servers, by mobile devices accessing the wireless network, or by a combination of these and other components. Multiple factors influence security requirements. In some cases, a device may need to rely on long-term security of a single algorithm. For example, when an embedded universal integrated circuit card (UICC) is installed in a mobile device, the security algorithm may be difficult to modify or replace after installation. In some cases, available security algorithms evolve based on advances in computational capabilities. For example, the computational capability of mobile device technologies continues to generally increase over time. Given these factors, in some contexts, it may be useful to define loose requirements for alternative key agreement and authentication schemes in wireless networks.
p-0017In some aspects of what is described here, a mobile device and wireless network operator server can authenticate each other through a third-party wireless network, for example, using a previously-established symmetric key. Key derivation functions (KDFs), message authentication code (MAC) functions, or any suitable combination of them can be used in a larger construct to provide authentication and derive session keys for confidentiality and data integrity. In some instances, the constructs can be deployed within a general framework provided by existing standards (e.g., within a Universal Mobile Telecommunication Services (UMTS) system). In some instances, the solutions described here may provide greater agility between underlying security primitives, for example, by using standardized KDFs or other types of functions. The techniques and systems described here may provide additional or different advantages.
p-0018In some implementations, a security protocol utilizes a MAC function. Any suitable MAC function may be used. Generally, a MAC function receives inputs that include a key, an arbitrary-length input message, and possibly other inputs; the MAC function may produce an output of a specified length based on the inputs. The MAC function may generate the output based on any suitable operations, such as, for example, a keyed hash function, an un-keyed hash function, cipher block chaining, or other types of functions.
p-0019In some cases, a MAC function can refer to a family of functions h<sub>k </sub>parameterized by a key k. A MAC function can have the property of “ease of computation,” such that, for a known function h<sub>k</sub>, given a value k and an input x, h<sub>k</sub>(x) is easy to compute. The value h<sub>k</sub>(x) may be referred to as a MAC-value or MAC. A MAC function can have the property of “compression,” such that, h<sub>k </sub>maps an input x of arbitrary finite bit-length to an output h<sub>k</sub>(x) of fixed bit-length n. A MAC function can have the property of “computation-resistance.” For example, given a description of the function family h, for every fixed allowable value of k (unknown to an adversary), given zero or more text-MAC pairs (x<sub>i</sub>, h<sub>k</sub>(x<sub>i</sub>)), it may be computationally infeasible for the adversary to compute any text-MAC pair (x, h<sub>k</sub>(x)) for any new input x≠x<sub>i </sub>(including possibly for h<sub>k</sub>(x)=h<sub>k</sub>(x<sub>i</sub>) for some i). In some cases, a MAC function is included within a larger function. For example, a MAC function may be included in a key derivation function (KDF) or another type of function.
p-0020In some implementations, a security protocol utilizes a KDF. Any suitable KDF may be used. Some example KDFs are the American National Standard Institute (ANSI) X9.63 hash-based KDF using SHA256 defined in ANSI X9.63-2011, the National Institute of Standards and Technology (NIST) counter-mode KDF defined in NIST SP800-108 with CMAC-AES128 from NIST SP800-38B, the NIST counter-mode KDF defined in NIST SP800-108 with keyed-HMAC-SHA256 from FIPS 198-1, and others. These examples can be used, for example, at the 128-bit security level, the 256-bit security level, or at any other suitable level.
p-0021KDFs can derive cryptographic keys from input data. The inputs may include, for example, a secret key, a random seed, a constant, or any suitable combination of these or other inputs. The input can include a user password, a random seed value from an entropy source, or a value from a hash function or a cryptographic operation. In some instances, a KDF derives an output from an input key and other inputs by applying a function such as a hash, a keyed hash, or block cipher for one or more iterations. In some cases, an output length is provided as an input to the KDF. The output length variable can specify the bit-length of the output produced by the KDF.
p-0022A KDF can include one or more iterated functions. The number of iterations may depend on, for example, the specified length of the output to be produced by the KDF, a security parameter, or other factors. Some types of functions can be iterated, for example, in a counter mode, a feedback mode, a double-pipeline mode, or in another iteration mode. In a counter mode, a KDF can iterate a function n times and concatenate the outputs until L bits of keying material are generated. In this example, n=┌L/h┐, where h is an integer that indicates the length of the output of the iterated function.
p-0023<figref idrefs="DRAWINGS">FIG. 1</figref> is a schematic diagram of an example wireless communication system <b>100</b>. The example wireless communication system <b>100</b> includes a mobile device <b>102</b> and a wireless network system <b>103</b>. The wireless communication system <b>100</b> can include additional or different features and components. For example, the wireless communication system <b>100</b> can include one or more servers, computing systems, additional or different networks, wireless terminals, or any suitable combination of these other components. The wireless network system <b>103</b> includes a wireless station <b>104</b> and a core network system <b>106</b>. The wireless network system <b>103</b> can include additional or different features and components. The components of the wireless communication system <b>100</b> can be configured as shown in <figref idrefs="DRAWINGS">FIG. 1</figref>, or the wireless communication system <b>100</b> can be configured in another manner, as appropriate.
p-0024In the example shown in <figref idrefs="DRAWINGS">FIG. 1</figref>, the mobile device <b>102</b> can communicate with the wireless network system <b>103</b>. In some instances, the wireless network system <b>103</b> can provide the mobile device <b>102</b> access to a wide area network (e.g., the Internet, etc.), and the mobile device <b>102</b> can communicate with other devices or subsystems over the wide area network. In some instances, the wireless network system <b>103</b> can provide the mobile device <b>102</b> access to a telephone network (e.g., Integrated Services Digital Network (ISDN), Public Switched Telephone Network (PSTN), etc.), and the mobile device <b>102</b> can communicate with other devices or subsystems over the telephone network. The mobile device <b>102</b> may communicate over additional or different types of networks and may have other ways of accessing the other networks. Mobile devices can be configured to communicate over wireless Local Area Networks (WLANs), Personal Area Networks (PANs) (e.g., Bluetooth and other short-range communication systems), metropolitan area networks, public land mobile networks using cellular technology (e.g., Global System for Mobile Communication (GSM), Universal Mobile Telecommunication Services (UMTS), Long-Term Evolution (LTE), etc.), and other types of wireless networks.
p-0025The mobile device <b>102</b> includes a wireless interface <b>110</b>, a processor <b>112</b>, and a memory <b>114</b>. The mobile device <b>102</b> can include additional or different features. In some instances, the mobile device <b>102</b> may include one or more user interfaces. For example, the user interface can include a touchscreen, a keyboard, a microphone, a pointing device (e.g., a mouse, a trackball, a stylus, etc.), or another type of user interface. Moreover, the features and components of the mobile device <b>102</b> can be configured as shown and described with respect to <figref idrefs="DRAWINGS">FIG. 1</figref> or in a different manner. Generally, the mobile device <b>102</b> can include any appropriate types of subsystems, modules, devices, components, and combinations thereof. Examples of mobile devices include various types of mobile telecommunication devices, electronic readers, media players, smartphones, laptop systems, tablet devices, etc.
p-0026The wireless interface <b>110</b> of the mobile device <b>102</b> can include any suitable hardware, software, firmware, or combinations thereof. In some implementations, the wireless interface <b>110</b> can be included in a wireless communication subsystem of the mobile device <b>102</b>. The wireless interface <b>110</b> may include additional or different features or components. In some implementations, the wireless interface <b>110</b> may include or have access to programs, codes, scripts, functions, or other types of instructions that can be executed by data processing apparatus. In some implementations, the wireless interface <b>110</b> may include or have access to pre-programmed or re-programmable logic circuits, logic gates, or other types of hardware or firmware components. The wireless interface <b>110</b> handles wireless communications between the mobile device <b>102</b> and the wireless station <b>104</b>.
p-0027The processor <b>112</b> can execute instructions, for example, to generate output data based on data inputs. The instructions can include programs, codes, scripts or other types of data stored in memory. Additionally or alternatively, the instructions can be encoded as pre-programmed or re-programmable logic circuits, logic gates, or other types of hardware or firmware components. In some instances, the processor <b>112</b> can generate output data by executing or interpreting software, scripts, programs, functions, executable, or other modules stored in the memory <b>114</b>.
p-0028The memory <b>114</b> can include any suitable computer-readable media. The memory <b>114</b> can include a volatile memory device, a non-volatile memory device, or both. The memory <b>114</b> can include one or more read-only memory devices, random-access memory devices, buffer memory devices, or a combination of these and other types of memory devices. In some instances, one or more components of the memory can be integrated or otherwise associated with another component of the mobile device <b>102</b>. The memory <b>114</b> can store data, such as, for example, applications, files, etc. in a computer-readable format.
p-0029In some implementations, the mobile device <b>102</b> includes a universal integrated circuit card (UICC) and mobile equipment. The mobile equipment may be identified, for example, by an International Mobile Equipment Identity (IMEI). The UICC can be, for example, a SIM card that includes an International Mobile Subscriber Identity (IMSI), identifying the subscriber, a secret key for authentication, and other user information. The IMEI and the IMSI can be independent, thereby providing personal mobility. The SIM card may be protected against unauthorized use by a password, personal identity number, or otherwise.
p-0030The example wireless network system <b>103</b> shown in <figref idrefs="DRAWINGS">FIG. 1</figref> can include one or more wireless telecommunication networks, wireless data networks, combined voice and data networks, or any suitable combination of these and other types of wireless networks. The wireless network system <b>103</b> can be a public land mobile network that uses cellular technology (e.g., Global System for Mobile Communication (GSM), Universal Mobile Telecommunication Services (UMTS), Long-Term Evolution (LTE), etc.). The wireless network system <b>103</b> can communicate with the mobile device <b>102</b>, for example, by radio frequency signals or another mode of communication. The wireless network system <b>103</b> may include devices, systems, or components distributed across an area or region. The wireless network system <b>103</b> can include one or more local, regional, national, or global networks.
p-0031The wireless network system <b>103</b> can include one or more cellular networks. The wireless network system <b>103</b> may utilize one or more communication protocol standards, for example, 3G, 4G, GSM, LTE, CDMA, GPRS, EDGE, LTE, or others. In some cases, the wireless network system <b>103</b> is implemented as a UMTS system that uses wideband code division multiple access (WCDMA) as the air interface. Some example UMTS systems include a base station subsystem (BSS), a universal terrestrial radio access network (UTRN), and a core network for circuit switched and packet switched (e.g. e-mail) applications.
p-0032The wireless station <b>104</b> can include any suitable structures or systems. In some cases, the wireless station <b>104</b> can be implemented as a base station, or a as part of a base station, in a cellular network. The wireless station <b>104</b> can communicate wirelessly with the mobile device <b>102</b>. For example, the wireless station <b>104</b> may include one or more antennae that communicate directly with the mobile device <b>102</b> by radio frequency signals. The wireless station <b>104</b> may include any suitable communication components (e.g., antennas, antenna controller systems, transceivers, computing systems, processors, memory and associated hardware components). In some instances, all or part of the wireless station <b>104</b> can be implemented as a base station subsystem (BSS), a base transceiver station (BTS), a base station controller (BSC), a radio base station (RBS), a node B, an evolved node B, a Universal Terrestrial Radio Access Network (UTRAN), or any suitable combination of one or more of these. For example, a BSS may provide allocation, release and management of specific radio resources to establish connections between a mobile device <b>102</b> and a radio access network (e.g., a GSM/EDGE radio access network); a UTRAN may include, for example, radio network controllers (RNCs) and NodeBs, and the UTRAN may allow connectivity between the mobile device <b>102</b> and the core network system <b>106</b>. The wireless station <b>104</b> may include additional or different features.
p-0033The wireless station <b>104</b> can communicate with the core network system <b>106</b>, for example, by wired connections, wireless connections, or any suitable combination of communication links. The wireless station <b>104</b> may include features (e.g., hardware, software, data, etc.) adapted for communicating with the core network system <b>106</b>. For example, the wireless station <b>104</b> may be adapted for encrypting, decrypting, and authenticating communications with the core network system <b>106</b>.
p-0034The core network system <b>106</b> can include any suitable structures or systems. In some instances, the core network system <b>106</b> communicates with the wireless station <b>104</b> to control or facilitate communication between the wireless station <b>104</b> and the mobile device <b>102</b>. In some instances, all or part of the core network system <b>106</b> can be implemented as a UMTS core network or another type of core network system. The core network system <b>106</b> may include any suitable server systems, communication interfaces, or other features. In some instances, the core network system <b>106</b> can communicate over a private data network (e.g., an enterprise network, a virtual private network, etc.), a wide area network (e.g., the Internet, etc.), a telephone network, and possibly additional or different types of networks.
p-0035In some implementations based on UMTS, the core network system <b>106</b> may include, for example, a mobile switching center (MSC), a visitor location register (VLR), a gateway MSC (GMSC), a signaling transfer point (STP), a service control point (SCP), an authentication center (AuC), home location register (HLR), a serving GPRS support node (SGSN), a gateway GPRS support node (GGSN), a short message service center SMS-SC, or a combination of these and other systems. The MSC can provide an interface between the radio system and fixed networks. For example the MSC may perform functions to handle circuit switched services to and from the mobile stations. The VLR can provide a database that stores information about mobile devices under the jurisdiction of an MSC that it serves. The HLR can support packet switched (PS) domain entities such as the SGSN, a mobile management entity (MME) and GGSN. The HLR can also support the circuit switched (CS) domain entities such as the MSC. In some instances, the HLR enables subscriber access to services and supports roaming to legacy GSM/UMTS networks. The AuC can store an identity key for each mobile subscriber registered with a home location register (HLR). This key can be used to generate security data. The core network system <b>106</b> may include additional or different features.
p-0036In some implementations based on UMTS, the HLR and VLR together with the MSC provide call routing and (possibly international) roaming capabilities for mobile devices. The HLR can contain administrative information of each subscriber registered in the UMTS network, along with the current location of mobile devices. A UMTS network may include a single HLR, and the HLR may be implemented as a distributed database. The VLR can contain selected administrative information from the HLR for call control and provision of the subscribed services, for each mobile currently located in the geographical area controlled by the VLR. Each functional entity can be implemented as an independent unit. Some manufacturers of switching equipment implement one VLR together with one MSC, so that the geographical area controlled by the MSC corresponds to that controlled by the VLR.
p-0037<figref idrefs="DRAWINGS">FIG. 2</figref> is a signaling and flow diagram of an example process <b>200</b> for authenticated key agreement in a communication system. The example process <b>200</b> shown in <figref idrefs="DRAWINGS">FIG. 2</figref> can be modified or reconfigured to include additional, fewer, or different operations, which can be performed in the order shown or in a different order. In some instances, one or more of the operations can be repeated or iterated, for example, until a terminating condition is reached. In some implementations, one or more of the individual operations shown in <figref idrefs="DRAWINGS">FIG. 2</figref> can be executed as multiple separate operations, or one or more subsets of the operations shown in <figref idrefs="DRAWINGS">FIG. 2</figref> can be combined and executed as a single operation.
p-0038The process <b>200</b> can be implemented in a communication system. For example, the process <b>200</b> can be implemented by one or more components of the wireless communication system <b>100</b> shown in <figref idrefs="DRAWINGS">FIG. 1</figref> or by a different type of system. <figref idrefs="DRAWINGS">FIG. 2</figref> shows certain operations being performed by a mobile device <b>202</b>, a network server <b>204</b>, and another network server <b>206</b>. In some implementations of the process <b>200</b>, one or more of the operations shown in <figref idrefs="DRAWINGS">FIG. 2</figref> can be performed by additional or different components, devices, or subsystems, or by combinations of them, as appropriate.
p-0039The mobile device <b>202</b> can be any suitable device capable of wireless communication. In some aspects, the mobile device <b>202</b> can be the mobile device <b>102</b> shown in <figref idrefs="DRAWINGS">FIG. 1</figref> For example, the mobile device <b>202</b> can be a mobile unit that allows a user to access network services through network servers <b>204</b> or <b>206</b>. The network servers <b>204</b> and <b>206</b> can be associated with a wireless network system, such as the wireless network system <b>103</b> shown in <figref idrefs="DRAWINGS">FIG. 1</figref>. For example, one or both of the network servers <b>204</b> and <b>206</b> can be part of the wireless station <b>104</b>, the core network system <b>106</b>, or the network servers <b>204</b> and <b>206</b> may be associated with other features of a wireless network system.
p-0040The network server <b>204</b> can be any suitable computing system that is capable of communicating (e.g., directly, indirectly, wirelessly, etc.) with the mobile device <b>202</b> and the network server <b>206</b>. In some implementations, the network server <b>204</b> can be a visitor location register (VLR), which can be part of a core network. For example, the network server <b>204</b> may be configured to perform the functions of detailed location information update, location information registration, paging, security for the mobile device, and can maintain a copy of the subscriber information. In some implementations, the network server <b>204</b> can assign a temporary mobile subscriber identity (TMSI) which can have local significance in the area handled by the VLR. For example, the TMSI may be assigned randomly by the AuC. The network server <b>204</b> can be implemented in another manner, and it may be configured to perform additional or different operations.
p-0041The network server <b>206</b> can be any suitable computing system that is capable of communicating (e.g., directly, indirectly, wirelessly, etc.) with the network server <b>204</b> and the mobile device <b>202</b>. In some implementations, the network server <b>206</b> can be a home location register (HLR), which can be part of a core network. The network server <b>206</b> can be implemented in another manner, and it may be configured to perform additional or different operations. In some implementations, the mobile device <b>202</b> has a subscription to the wireless network system and can be registered with the network server <b>204</b>. In some implementations, the mobile device <b>202</b> can be a visiting mobile device with a subscription to another wireless network system, and the visiting mobile device can temporarily register with its HLR (e.g., the network server <b>206</b>) through a VLR (e.g., the network server <b>204</b>).
p-0042The process <b>200</b> can be executed at any suitable time or upon any suitable condition. The process <b>200</b> may be performed, for example, when the mobile device <b>202</b> enters the jurisdiction of a particular wireless station, when the mobile device <b>202</b> initiates communication with a wireless station, when a wireless station initiates communication with the mobile device <b>202</b>, or upon other events. In some cases, the process <b>200</b> can be performed periodically, for example, at specified times or at specified time intervals. In some cases, the process <b>200</b> can be performed when the mobile device <b>202</b> or the wireless network refreshes communication parameters, or at other specified instances.
p-0043At <b>210</b><i>a</i>, the mobile device <b>202</b> sends an identifier to the network server <b>204</b>. The mobile device <b>202</b> can transmit the identifier over the wireless network or by additional or different communication systems or links. In some implementation, the identifier can be a temporary mobile subscriber identity (TMSI). The TMSI can be a unique identifier assigned to the mobile device <b>202</b> by a network server to identify the mobile device <b>202</b>, while supporting subscriber identity. At <b>210</b><i>b</i>, the network server <b>204</b> sends the identifier to the network server <b>206</b>. In certain instances, the identifier can be the identifier received from the mobile device <b>202</b> at <b>210</b><i>a</i>. One of the possible reasons for sending the identifier is to request verification of the identifier from the network server <b>206</b>.
p-0044At <b>212</b>, the network server <b>206</b> generates a challenge and session keys. In some instances, the example processes shown in <figref idrefs="DRAWINGS">FIGS. 3A</figref>, <b>4</b>A, <b>5</b>A, <b>5</b>B, and <b>6</b>A can be used to generate the challenge and the sessions keys. Other suitable techniques may be used to generate a challenge and session keys. In some implementations, the network server <b>206</b> participates in the authentication and key agreement process to generate an authentication vector AV. The authentication vector can include, for example, a random value RAND, expected response XRES, cipher key CK, integrity key IK and authentication token AUTN. Each authentication vector may be valid for only one authentication and key agreement between the network server <b>206</b> and the mobile device <b>202</b> and can be ordered based on a sequence number. Additional or different types of data may be generated by the network server <b>206</b>.
p-0045At <b>216</b>, the network server <b>206</b> sends data to the network server <b>204</b>. The data can include, for example, an authentication vector or any suitable information. In some instances, the data include a random value RAND, an expected response XRES, a cipher key CK, an integrity key IK, an authentication token AUTN, or any suitable combination of values produced by the network server <b>206</b> in response to receiving the identifier.
p-0046At <b>217</b>, the network server <b>204</b> sends a challenge to the mobile device <b>202</b>. In some implementations, the network server <b>204</b> can facilitates an authenticated key agreement process by parsing the data and sending it to the mobile device <b>202</b>. The challenge sent to the mobile device <b>202</b> can include the random value RAND, the authentication token AUTN, or a combination of these and other data.
p-0047At <b>218</b>, the mobile device <b>202</b>, generates a response and session keys. In some instances, the example processes shown in <figref idrefs="DRAWINGS">FIGS. 3B</figref>, <b>4</b>B, <b>5</b>C, <b>5</b>D, <b>6</b>B and <b>6</b>C can be used to generate the response and the sessions keys. Other suitable techniques may be used to generate a challenge and session keys. On receiving the challenge, if the authentication token AUTN is accepted by the mobile device <b>202</b>, the mobile device <b>202</b> can generate the response RES, the cipher key CK, the integrity key IK and a mobile device authentication token AUTN<sub>MS</sub>. Additional or different types of data may be generated by the mobile device <b>202</b>.
p-0048At <b>220</b>, the mobile device <b>202</b> sends the response to the network server <b>204</b>. The response can include the response RES generated by the mobile device <b>202</b>. The response may include additional or different data, as appropriate.
p-0049At <b>222</b>, the network server <b>204</b> compares the expected response XRES provided by the network server <b>204</b> and the response RES provided by the mobile device <b>202</b>. If the response and the expected response match, the network server <b>204</b> can consider the authentication and key agreement to be successfully completed between the mobile device <b>202</b> and the network server <b>206</b>. If the response and the expected response do not match, the network server <b>204</b> can consider the authentication and key agreement to have failed. In such instances, one or more of the prior operations can be repeated, the process can be terminated, or other options may be available.
p-0050At <b>224</b>, the network server <b>206</b> sends an identifier to the mobile device <b>202</b>. The identifier can be sent through the network server <b>204</b> or through another communication link or intermediate system. The identifier can be the TMSI or another identifier. In some cases, the identifier may be encrypted, or the identifier may be unencrypted. In some instances, the identifier is sent to the mobile device before the other operations shown in <figref idrefs="DRAWINGS">FIG. 2</figref>.
p-0051At <b>226</b>, a secure communication channel is utilized between the mobile device one or more of the network servers <b>204</b>, <b>206</b>. The channel can be made secure, for example, using the session keys generated at <b>212</b> and <b>218</b>. In some implementations, the mobile device <b>202</b> or the network server uses the session keys to communicate with each other or with other entities. In some instances, the mobile device <b>202</b> or the network server encrypts or decrypts communications using the ciphering key CK. In some instances, the mobile device <b>202</b> or the network server generates an authentication tag or verify authenticity of an authentication tag using the integrity key IK. Additional or different security procedures may be used. In some instances, an anonymity key AK* may be used to protect information, for example, to send a resynchronized sequence value SQN to the AuC. In some instances, the anonymity key is used to mask the sequence value SQN, as the sequence value SQN can be used for tracking. The anonymity key AK may computed, for example, from the key K and the value RAND or in any other suitable manner.
p-0052<figref idrefs="DRAWINGS">FIG. 3A</figref> is a flow diagram showing an example process <b>300</b> that can be used by a network operator system for authenticated key agreement. The process <b>300</b> may be implemented, for example, by a server system of a wireless network or by any other suitable system. In some implementations, one or more operations of the process <b>300</b> are performed by a home location register (HLR) or by any other component of the wireless network. The process <b>300</b> can include additional or different operations, and the operations can be performed in the order shown in <figref idrefs="DRAWINGS">FIG. 3A</figref> or any suitable order. In some cases, one or more of the operations can be iterated or repeated, for example, until a specified condition is reached.
p-0053At <b>302</b>, an identifier of a mobile device is received. For instance, the identifier can be a temporary mobile subscriber identity (TMSI) or any other suitable identifier associated with a mobile device. In some implementations, the identifier may be affiliated with an identity in a layer of the Open Systems Interconnection (OSI) model (e.g., an email address, a telephone number, a Session Initiation Protocol (SIP), Uniform Resource Identifier (URI), a media access control identifier, etc.). The identifier can be received directly or indirectly from the mobile device. For example, the mobile device may wirelessly transmit the identifier to the wireless network, and the identifier may be forwarded through one or more communication links in the core network system.
p-0054At <b>304</b>, a secret key is accessed. For example, the secret key can be stored in any suitable database or network server of the core network. The identifier received at <b>302</b> can be used to locate the secret key, for example, in a secure database. In some instances, the secret key is a long-term, symmetric key held by both the mobile device and the network operator. Additional or different types of secret keys may be used.
p-0055At <b>306</b>, a challenge is obtained. For instance, the challenge can be a random challenge value. The random value can be a previously-generated random value, or the random value can be generated in response to receiving the identifier. Random values can be generated, for example, by a pseudorandom generator or another suitable system. In some cases, the challenge can be updated by XORing the random challenge with an operator constant.
p-0056At <b>308</b>, a message authentication code (MAC) function is evaluated based on the secret key and the challenge. The MAC function can include any suitable function or family of functions. For example, the MAC function can be a hashed-MAC (HMAC), a cipher-MAC (CMAC), or any other suitable MAC function. The MAC function can be evaluated as a stand-alone function, or the MAC function can be evaluated as part of a larger function (e.g., as part of a key derivation function). Some key derivation functions (KDFs) include MAC functions, and evaluating such KDFs causes a MAC function to be evaluated. Examples of KDFs that include MAC functions include the hash-based KDF using SHA256 defined in ANSI X9.63-2011, the counter-mode KDF defined in NIST SP800-108 with CMAC-AES128 from NIST SP800-38B, the NIST counter-mode KDF defined in NIST SP800-108 with keyed-HMAC-SHA256 from FIPS 198-1, and others. The MAC function may operate on any suitable inputs. In some examples, the inputs to the MAC function may include the secret key and the challenge value. Additional or different inputs may be used, as appropriate.
p-0057At <b>310</b>, session key(s) and an expected response are obtained based on the output of the MAC function. For instance, the session keys can include one or both of the ciphering key (CK) and the integrity key (IK). Additional or different session keys can be generated. The expected response can be the response that the mobile device is expected to generate in response to the challenge value obtained at <b>306</b>. As such, the challenge and the expected response can be used to authenticate the mobile device.
p-0058At <b>312</b>, a message is generated based on the challenge, the expected response and the session key(s). For instance, the message can include the challenge, the expected response, the session keys (e.g., CK, IK, or other session keys), an authentication token (AUTN), or any suitable combination of these and other data. The message can have any suitable structure or format. The message can be structured as an ordered array or an authentication vector, which can be sent from an HLR to a VLR. In some cases, AUTN can be assembled by concatenating a sequence number SQN, an authentication management function (AMF), and a message authentication code. In addition, an anonymity key can also be part of the AUTN. In some cases, the anonymity key AK can be masked with SQN. For example, SQN<sup>AK </sup>may be sent as part of AUTN.
p-0059<figref idrefs="DRAWINGS">FIG. 3B</figref> is a flow diagram showing an example process <b>350</b> that can be used by a mobile device for authenticated key agreement. The process <b>350</b> may be implemented, for example, by a mobile device in a wireless communication system or by any other suitable system. In some implementations, the example process <b>350</b> shown in <figref idrefs="DRAWINGS">FIG. 3B</figref> is performed by a mobile device in coordination with a wireless network server performing the example process <b>300</b> shown in <figref idrefs="DRAWINGS">FIG. 3A</figref>. The process <b>350</b> can include additional or different operations, and the operations can be performed in the order shown in <figref idrefs="DRAWINGS">FIG. 3B</figref> or any suitable order. In some cases, one or more of the operations can be iterated or repeated, for example, until a specified condition is reached.
p-0060At <b>352</b>, a challenge is received. The challenge can be received from the wireless network system. For example, the VLR or another component of the wireless network system may send the challenge to the mobile device to initiate an authenticated key agreement protocol. The challenge can include a random value, an authentication token, or any suitable combination of these and other data. In some instances, the challenge can include the challenge value produced by the network operator at <b>306</b> in <figref idrefs="DRAWINGS">FIG. 3A</figref>. For example, the challenge can include data from the message generated by a network operator at <b>312</b> in <figref idrefs="DRAWINGS">FIG. 3A</figref>.
p-0061At <b>354</b>, a secret key is accessed. The secret key can be accessed by any suitable technique. The secret key can be accessed locally on the mobile device in response to receiving the challenge from the wireless network. The secret key can be a previously-computed key held by the mobile device and a network operator. For instance, the secret key can be a long-term symmetric key stored on a USIM of a mobile device. In some cases, other types of keys may be used.
p-0062At <b>356</b>, a MAC function is evaluated based on the secret key and the challenge. The MAC function evaluated by a mobile device at <b>356</b> can be the same MAC function evaluated by a network server at <b>308</b>. For example, the MAC function can be a hashed-MAC (HMAC), a cipher-MAC (CMAC), or any other suitable MAC function. The MAC function can be evaluated as a stand-alone function, or the MAC function can be evaluated as part of a larger function (e.g., as part of a key derivation function). Some key derivation functions (KDFs) include MAC functions, and evaluating such KDFs causes a MAC function to be evaluated.
p-0063At <b>358</b>, a response and session key(s) are obtained based on the output of the MAC function. For instance, the session keys can include one or both of the ciphering key (CK) and the integrity key (IK). Additional or different session keys can be generated. The response can include information that the mobile device will proffer in response to the challenge value received at <b>352</b>. For example, the mobile device can send the response to the network, and the network can use the response to authenticate the mobile device.
p-0064At <b>360</b>, the response is transmitted. The response may be wirelessly transmitted from the mobile device to the wireless network system. For example, the response may be sent to the network system that provided the challenge at <b>352</b>. In some cases, the response may be sent to the VLR or another component of the wireless network system. In some cases, the response can be sent with an authentication token and other data, as appropriate.
p-0065<figref idrefs="DRAWINGS">FIG. 4A</figref> is a flow diagram showing an example process <b>400</b> that can be used by a network operator system for authenticated key agreement. The process <b>400</b> may be implemented, for example, by a server system of a wireless network or by any other suitable system. In some implementations, one or more operations of the process <b>400</b> are performed by a home location register (HLR) or by another component of the wireless network. The process <b>400</b> can include additional or different operations, and the operations can be performed in the order shown in <figref idrefs="DRAWINGS">FIG. 4A</figref> or any suitable order. In some cases, one or more of the operations can be iterated or repeated, for example, until a specified condition is reached.
p-0066At <b>402</b>, an identifier of a mobile device is received. For instance, the identifier can be a temporary mobile subscriber identity (TMSI) or any other suitable identifier associated with a mobile device. In some implementations, the identifier may be affiliated with an identity in a layer of the Open Systems Interconnection (OSI) model (e.g., an email address, a telephone number, a Session Initiation Protocol (SIP), Uniform Resource Identifier (URI), a media access control identifier, etc.). The identifier can be received directly or indirectly from the mobile device. For example, the mobile device may wirelessly transmit the identifier to the wireless network, and the identifier may be forwarded through one or more communication links in the core network system.
p-0067At <b>404</b>, a secret key is accessed. For example, the secret key can be stored in any suitable database or server of the core network. The identifier received at <b>302</b> can be used to locate the secret key, for example, in a secure database. In some instances, the secret key is a long-term, symmetric key held by both the mobile device and the network operator. Additional or different types of secret keys may be used.
p-0068At <b>406</b>, a challenge is obtained. For instance, the challenge can be a random challenge value. The random value can be a previously-generated random value, or the random value can be generated in response to receiving the identifier. Random values can be generated, for example, by a pseudorandom generator or another suitable system. In some cases, the challenge can be updated by XORing the random challenge with an operator constant.
p-0069At <b>408</b>, a key derivation function KDF is evaluated based on the secret key and the challenge. The KDF can include any suitable function or family of functions. The KDF can include a MAC function, a hash function or another type of one-way function, an encryption function, or any suitable combination of these and other functions. Example KDFs include the hash-based KDF using SHA256 defined in ANSI X9.63-2011, the counter-mode KDF defined in NIST SP800-108 with CMAC-AES128 from NIST SP800-38B, and the NIST counter-mode KDF defined in NIST SP800-108 with keyed-HMAC-SHA256 from FIPS 198-1. Additional or different KDFs may be used.
p-0070The KDF evaluated at <b>408</b> may operate on any suitable inputs. In some examples, the inputs to the KDF include the secret key and the challenge value. Additional or different inputs may be used, as appropriate. The KDF may operate on an input that specifies the length of the keying material to be derived by the KDF. Evaluating the KDF at <b>408</b> can produce a key derivation key as output.
p-0071At <b>410</b>, the key derivation function is evaluated based on the key derivation key. As such, a tiered approach to key derivation can be used. For instance, the key derivation key produced at <b>408</b> can be used as one of the inputs to the KDF to generate another KDF output at <b>410</b>. The KDF evaluated at <b>410</b> can be the same KDF that was evaluated at <b>408</b>, or a different KDF can be used. In either case, the bit-length of the output produced by the KDF at <b>408</b> can be greater than, equal to, or less than the bit-length of the output produced by the KDF at <b>410</b>. For example, different output length variables may be used with the same KDF. The KDF evaluated at <b>410</b> may operate on any suitable inputs. In some examples, the inputs to the KDF include the key derivation key and a constant. Additional or different inputs may be used, as appropriate.
p-0072At <b>412</b>, session key(s) and an expected response are obtained based on the output produced by the KDF at <b>410</b>. For instance, the session keys can include one or both of the ciphering key (CK) and the integrity key (IK). Additional or different session keys can be generated. The expected response can be the response that the mobile device is expected to generate in response to the challenge value obtained at <b>406</b>. As such, the challenge and the expected response can be used to authenticate the mobile device.
p-0073At <b>414</b>, a message is generated based on the challenge, the expected response and the session key(s). For instance, the message can include the challenge, the expected response, the session keys (e.g., CK, IK, or other session keys), an authentication token (AUTN), or any suitable combination of these and other data. The message can have any suitable structure or format. The message can be structured as an ordered array or an authentication vector, which can be sent from an HLR to a VLR. In some cases, AUTN can be assembled by concatenating a sequence number SQN, an authentication management function (AMF), and a message authentication code. In addition, an anonymity key can also be part of the AUTN.
p-0074<figref idrefs="DRAWINGS">FIG. 4B</figref> is a flow diagram showing an example process <b>450</b> that can be used by a mobile device for authenticated key agreement. The process <b>450</b> may be implemented, for example, by a mobile device in a wireless communication system or by any other suitable system. In some implementations, the example process <b>450</b> shown in <figref idrefs="DRAWINGS">FIG. 4B</figref> is performed by a mobile device in coordination with a wireless network server performing the example process <b>400</b> shown in <figref idrefs="DRAWINGS">FIG. 4A</figref>. The process <b>450</b> can include additional or different operations, and the operations can be performed in the order shown in <figref idrefs="DRAWINGS">FIG. 4B</figref> or any suitable order. In some cases, one or more of the operations can be iterated or repeated, for example, until a specified condition is reached.
p-0075At <b>452</b>, a challenge is received. The challenge can be received from the wireless network system. For example, the VLR or another component of the wireless network system may send the challenge to the mobile device to facilitate an authenticated key agreement protocol. The challenge can include a random value, an authentication token, or any suitable combination of these and other data. In some instances, the challenge can include the challenge value produced by the network operator at <b>406</b> in <figref idrefs="DRAWINGS">FIG. 4A</figref>. For example, the challenge can include data from the message generated by a network operator at <b>414</b> in <figref idrefs="DRAWINGS">FIG. 4A</figref>.
p-0076At <b>454</b>, a secret key is accessed. The secret key can be accessed by any suitable technique. The secret key can be accessed locally on the mobile device in response to receiving the challenge from the wireless network. The secret key can be a previously-computed key held by the mobile device and a network operator. For instance, the secret key can be a long-term symmetric key stored on a USIM of a mobile device. In some cases, other types of keys may be used.
p-0077At <b>456</b>, a key derivation function (KDF) is evaluated based on the secret key and the challenge. Evaluating the KDF at <b>456</b> produces a key derivation key. At <b>458</b>, a KDF is evaluated based on the key derivation key. The KDFs evaluated by a mobile device at <b>456</b> and <b>458</b> can be the same KDFs evaluated by a network server at <b>408</b> and <b>410</b>, respectively. For example, the KDF evaluated at <b>456</b> and <b>458</b> can be the hash-based KDF using SHA256 defined in ANSI X9.63-2011, the counter-mode KDF defined in NIST SP800-108 with CMAC-AES128 from NIST SP800-38B, the NIST counter-mode KDF defined in NIST SP800-108 with keyed-HMAC-SHA256 from FIPS 198-1, or any other suitable KDF.
p-0078At <b>460</b>, a response and session key(s) are obtained based on the output of the KDF evaluated at <b>458</b>. For instance, the session keys can include one or both of the ciphering key (CK) and the integrity key (IK). Additional or different session keys can be generated. The response can include information that the mobile device will proffer in response to the challenge value received at <b>452</b>. For example, the mobile device can send the response to the network, and the network can use the response to authenticate the mobile device.
p-0079At <b>462</b>, the response is transmitted. The response may be wirelessly transmitted from the mobile device to the wireless network system. For example, the response may be sent to the network system that provided the challenge at <b>452</b>. In some cases, the response may be sent to the VLR or another component of the wireless network system. In some cases, the response can be sent with an authentication token and other data, as appropriate.
p-0080<figref idrefs="DRAWINGS">FIGS. 5A and 5B</figref> are flow diagrams showing an example process <b>500</b> that can be used by a network operator system for authenticated key agreement in a UMTS system. The process <b>500</b> may be implemented, for example, by a server system of a wireless network or by any other suitable system. In some implementations, one or more operations of the process <b>500</b> are performed by a home location register (HLR) or by another component of the wireless network. The process <b>500</b> can include additional or different operations, and the operations can be performed in the order shown in <figref idrefs="DRAWINGS">FIGS. 5A and 5B</figref> or any suitable order. In some cases, one or more of the operations can be iterated or repeated, for example, until a specified condition is reached.
p-0081At <b>502</b>, a temporary mobile subscriber identity (TMSI) is received. The TMSI is associated with a mobile device. The TMSI can be received from the mobile device or from an entity in the wireless network system. For example, the HLR may receive the TMSI from a visitor location register (VLR) or from another component of the wireless network system. In some implementations, the mobile device wirelessly transmits the TMSI to the network, and the VLR forwards the TMSI to the HLR to authenticate the mobile device.
p-0082At <b>504</b>, a key K and a sequence value SQN are accessed. The key K and the sequence value SQN are associated with the TMSI received at <b>502</b>, and they may be accessed based on the TMSI. The key K and the sequence value SQN corresponding to the TMSI may be accessed in any suitable manner. For example, the HLR may access the key K and the sequence value SQN by searching a database for a record corresponding to the TMSI.
p-0083At <b>506</b>, a random value RAND is generated. The random value RAND can be generated by any suitable technique. In some cases, the HLR can access a database of previously-generated random values, or the HLR may include a pseudorandom generator that generates random values as needed. The random value can be any suitable size or data format (e.g., binary, etc.).
p-0084At <b>508</b>, the random value RAND may be updated. If the operator is using an operator constant OP, then OP<sub>c </sub>is computed. The value OP<sub>c </sub>can be used to update RAND, for example, by computing RAND=RAND⊕OP<sub>c</sub>. The value OP<sub>c </sub>may be computed by evaluating OP<sub>c</sub>=KDF(K, OP, klength), where KDF represents a key derivation function. The inputs to KDF include OP (a 128-bit operator variant algorithm configuration field), K (a long-term secret key) and klength (a key length variable). In addition, OP<sub>c </sub>can be a 128-bit value derived from OP and K. The value OP<sub>c </sub>can be used within the computations of f1, f1*, f2, f3, f4, f5 and f5*. The value f1 can represent an output of a message authentication code function. The value f2 can represent an output of a message authentication code function used to compute a response (RES) and an expected response (XRES). The value f3 can represent an output of a key generating function used to compute a cipher key (CK). The value f4 can represent an output of a key generating function used to compute an integrity key (IK). The value f5 can represent an output of a key generating function used to compute the anonymity key AK.
p-0085At <b>510</b>, a value Z is computed. The value Z can be computed by evaluating Z=KDF(K, RAND, outlen). Here, the inputs to KDF can include the key K, the random value RAND and outlen, where outlen represents the sum of bit-lengths needed for f2, f3, f5 and f5*. The function KDF can be any key derivation function that accepts an input key and other input data to derive keying material. Example KDFs include the hash-based KDF using SHA256 defined in ANSI X9.63-2011, the counter-mode KDF defined in NIST SP800-108 with CMAC-AES128 from NIST SP800-38B, and the NIST counter-mode KDF defined in NIST SP800-108 with keyed-HMAC-SHA256 from FIPS 198-1. Additional or different KDFs may be used.
p-0086At <b>512</b>, f2, f3, f5 and optionally f5* are extracted from Z. For instance, the extraction process can include parsing Z or any other suitable technique.
p-0087At <b>514</b>, temp=SQN∥AMF∥SQN∥AMF is formed. For instance, temp can be assembled by concatenating SQN and AMF. In some instances, the concatenation is done twice. Here, SQN is a sequence number that can be kept synchronized by the mobile device and the HLR. In addition, AMF represents the Authentication Management Field. Example uses of AMF may include support for multiple authentication algorithms and keys, changing list parameter and setting threshold values to restrict the lifetime of cipher and integrity keys.
p-0088At <b>516</b>, a new value of Z is computed. The new value can be computed by evaluating Z=KDF(K, RAND⊕temp, outlen′). Here, the inputs to the KDF can include the key K, the random value RAND XORed with temp, and outlen. The value outlen can represent the sum of bit-lengths for f1, f1* and f4. The value temp can be the concatenation of SQN and AMF produced at <b>514</b>.
p-0089At <b>518</b>, f1, f1* and f4 are extracted from Z. For instance, the extraction process can include parsing Z or any other suitable technique.
p-0090At <b>520</b>, if masking is used, the sequence value SQN can be masked. For example, the sequence value can be masked by computing SQN=SQN⊕f5. For each mobile device, the authentication center (AuC) can keep track of the sequence value SQN, which can facilitate re-synchronization. Sequence masking can be done, for example, while provisioning non-production environments so that copies created to support test and development processes are not exposing sensitive information and thus avoiding risks of leaking. Masking algorithms can be designed to be repeatable so referential integrity is maintained.
p-0091At <b>522</b>, the authentication token AUTN is assembled. Here, the authentication token AUTN can be assembled by forming AUTN=SQN∥AMF∥f1 (=MAC<sub>A</sub>). For instance, AUTN can be assembled by the concatenation of the sequence number SQN, authentication management field AMF and the value f1. The value of f1 can be the message authentication code MAC<sub>A</sub>.
p-0092At <b>524</b>, an output quintet Q is generated. Here, the output quintet can be generated by forming Q=(RAND, XRES=f2, CK=f3, IK=f4, AUTN). For instance, Q can be an ordered array of authentication vector that can include a random number RAND, an expected response XRES, a cipher key CK, an integrity key IK and authentication token AUTN. In some cases, the quintet Q is valid for an authentication and key agreement between the VLR and the mobile device.
p-0093At <b>526</b>, the output quintet Q is sent. The output quintet Q can be sent, for example, by the HLR to the VLR. The output quintet Q can be sent in any suitable form or format, using any suitable transmission technique. Subsequently, the VLR can extract RAND and AUTH and may forward these variables to the mobile device.
p-0094<figref idrefs="DRAWINGS">FIGS. 5C and 5D</figref> are flow diagrams showing an example process <b>550</b> that can be used by a mobile device for authenticated key agreement in a UMTS system. The process <b>550</b> may be implemented, for example, by a mobile device in a wireless communication system or by any other suitable system. In some implementations, the example process <b>550</b> shown in <figref idrefs="DRAWINGS">FIGS. 5C and 5D</figref> is performed by a mobile device in coordination with a wireless network server performing the example process <b>500</b> shown in <figref idrefs="DRAWINGS">FIGS. 5A and 5B</figref>. The process <b>550</b> can include additional or different operations, and the operations can be performed in the order shown in <figref idrefs="DRAWINGS">FIGS. 5C and 5D</figref> or any suitable order. In some cases, one or more of the operations can be iterated or repeated, for example, until a specified condition is reached.
p-0095At <b>552</b>, a random value RAND and an authentication token AUTN are received. The values may be received wirelessly by the mobile device from the wireless network. In some cases, RAND and AUTN can be sent to the mobile device by a VLR or another component of the wireless network system. In some cases, the random value RAND and the authentication token AUTN are the values generated by a network operator in the process <b>500</b> (e.g., at <b>506</b> or <b>508</b>, <b>522</b>) shown in <figref idrefs="DRAWINGS">FIGS. 5A and 5B</figref>. For example, the VLR may parse the random value RAND and authentication token AUTN from the authentication vector AV sent to the VLR from the HLR, and the VLR may forward the parsed values to the mobile device for authentication.
p-0096At <b>554</b>, the key K and the stored sequence value SQN<sub>MS </sub>are accessed. For instance, the key K and the sequence value SQN<sub>MS </sub>can be accessed in a local memory of the mobile device. In the mobile device, the SQN<sub>MS </sub>can be stored in a USIM or another suitable computer-readable medium. The sequence value SQN<sub>MS </sub>can be a counter stored locally at the mobile device. The key K can be a long-term symmetric key stored by the mobile device and the network operator system. Additional or different types of keys may be used.
p-0097At <b>556</b>, if the operator is using an operator constant, the random value RAND can be updated. The random value RAND can be updated in the same manner as in the process <b>500</b> at <b>508</b>. For instance, RAND can be updated by computing RAND=RAND⊕OP<sub>C </sub>(where OP<sub>C </sub>is computed as described with respect to operation <b>508</b> in <figref idrefs="DRAWINGS">FIG. 5A</figref>).
p-0098At <b>558</b>, the value Z is computed. Here, the value Z is computed by evaluating Z=KDF(K, RAND, outlen). The value Z can be computed by the mobile device using the same KDF and the same inputs that were used by the network operator system in the process <b>500</b> at <b>510</b>.
p-0099At <b>560</b>, f2, f3, f5 and optionally f5* are extracted from Z. For instance, the extraction process can include parsing Z or any other suitable technique.
p-0100At <b>562</b>, the authentication token AUTN is parsed. For instance, parsing the authentication token (AUTN=SQN∥AMF∥MAC<sub>A</sub>) can be done to retrieve the sequence number SQN, the authentication management field AMF, the message authentication code MAC<sub>A</sub>, or any combination of them.
p-0101At <b>564</b>, if masking is used, the sequence value SQN is masked. The sequence number SQN can be masked according to the technique used in the process <b>500</b> at <b>520</b>. For instance, the sequence number can be masked by XORing the extracted sequence number SQN with f5 (SQN=SQN⊕f5).
p-0102At <b>566</b>, temp is formed. The value temp can be formed by the same technique used in the process <b>500</b> at <b>514</b>. For instance, the value temp can be formed by setting temp=SQN∥AMF∥SQN∥AMF, a concatenation of the extracted sequence number SQN and AMF.
p-0103At <b>568</b>, a new value Z is computed. The new value Z can be computed by the same technique used to compute the new value Z in the process <b>500</b> at <b>516</b>. For example, the new value Z can be computed by evaluating Z=KDF(K, RAND⊕temp, outlen′).
p-0104At <b>570</b>, f1, f1* and f4 are extracted from Z. For instance, the extraction process can include parsing Z or any other suitable technique.
p-0105At <b>572</b>, MAC<sub>A </sub>is compared to f1. If they are not equal (i.e., if MAC<sub>A</sub>≠f1), the process can be halted. In the event that the process is halted, at <b>573</b> an error code is returned. Otherwise (i.e., if MAC<sub>A</sub>=f1), the process can proceed to <b>574</b>.
p-0106At <b>574</b>, the validity of SQN is checked against SQN<sub>MS</sub>. This check can be performed to determine if re-synchronization is needed. If SQN is not valid, resynchronization is performed at <b>575</b>. Resynchronization can be performed by: (1) updating the sequence value SQN<sub>MS</sub>, (2) computing Z=KDF(K, RAND⊕(SQN<sub>MS</sub>∥AMF*∥SQN<sub>MS</sub>∥AMF*), outlen′), where AMF* is a default value, (3) extracting f1*=MAC<sub>S </sub>from Z, (4) if masking is used, applying the masking operation SQN<sub>MS</sub>=SQN<sub>MS</sub>⊕f5*, and (5) forming AUTN<sub>MS</sub>=SQN<sub>MS</sub>∥MAC<sub>S</sub>. When SQN is valid, the process can proceed to <b>576</b>.
p-0107At <b>576</b>, a response RES, a cipher key CK and an integrity key IK are generated. For instance, the response RES and the session keys can be generated by the mobile device. Here the response RES=f2, the cipher key CK=f3, the integrity key IK=f4, and if required the mobile device authentication token AUTN<sub>MS </sub>may be generated as well.
p-0108At <b>578</b>, the response RES is sent, and the mobile device authentication token AUTN<sub>MS </sub>may also be sent. For instance, RES and AUTN<sub>MS </sub>can be sent by the mobile device to the VLR. On receiving RES and AUTH<sub>MS </sub>from the mobile device, the VLR can verify that the response value RES is equal to the expected response value XRES. If RES=XRES, the verification is successful and the communication between the VLR and the mobile device is secured by the cipher and integrity keys CK and IK. If provided, the value AUTN<sub>MS </sub>can be sent to the HLR. Upon receipt of AUTN<sub>MS</sub>, the HLR can verify the value MAC<sub>S </sub>and update the sequence value indicated by SQN<sub>MS</sub>.
p-0109<figref idrefs="DRAWINGS">FIG. 5E</figref> is a schematic diagram <b>590</b> showing aspects of the example technique shown in <figref idrefs="DRAWINGS">FIGS. 5A and 5B</figref>. The operations shown in diagram <b>590</b> correspond to the operations in the example process <b>500</b> shown in <figref idrefs="DRAWINGS">FIGS. 5A and 5B</figref>. The diagram <b>590</b> is provided for illustration purposes. The process <b>500</b> may be implemented in another manner.
p-0110<figref idrefs="DRAWINGS">FIG. 6A</figref> is a flow diagram showing an example process <b>600</b> that can be used by a network operator system for authenticated key agreement in a UMTS system. The process <b>600</b> may be implemented, for example, by a server system of a wireless network or by any other suitable system. In some implementations, one or more operations of the process <b>600</b> are performed by a home location register (HLR) or by another component of the wireless network. The process <b>600</b> can include additional or different operations, and the operations can be performed in the order shown in <figref idrefs="DRAWINGS">FIG. 6A</figref> or any suitable order. In some cases, one or more of the operations can be iterated or repeated, for example, until a specified condition is reached.
p-0111At <b>602</b>, a temporary mobile subscriber identity (TMSI) is received. The TMSI is associated with a mobile device. The TMSI can be received from the mobile device or from an entity in the wireless network system. For example, the HLR may receive the TMSI from a visitor location register (VLR) or from another component of the wireless network system. In some implementations, the mobile device wirelessly transmits the TMSI to the network, and the VLR forwards the TMSI to the HLR to authenticate the mobile device.
p-0112At <b>604</b>, a key K and a sequence value SQN are accessed. The key K and the sequence value SQN are associated with the TMSI received at <b>602</b>, and they may be accessed based on the TMSI. The key K and the sequence value SQN corresponding to the TMSI may be accessed in any suitable manner. For example, the HLR may access the key K and the sequence value SQN by searching a database for a record corresponding to the TMSI.
p-0113At <b>606</b>, a random value RAND is generated. The random value RAND can be generated by any suitable technique. In some cases, the HLR can access a database of previously-generated random values, or the HLR may include a pseudorandom generator that generates random values as needed. The random value can be any suitable size or data format (e.g., binary, etc.).
p-0114At <b>608</b>, the random value RAND may be updated. If the operator is using an operator constant OP, then OP<sub>c </sub>is computed. The value OP<sub>c </sub>can be used to update RAND, for example, by computing RAND=RAND⊕OP<sub>c</sub>. The value OP<sub>c </sub>may be computed by evaluating OP<sub>c</sub>=KDF(K, OP, klength), where KDF represents a key derivation function. The inputs to KDF include OP (a 128-bit operator variant algorithm configuration field), K (a long-term secret key) and klength (a key length variable). In addition, OP<sub>c </sub>can be a 128-bit value derived from OP and K.
p-0115At <b>610</b>, a key derivation key K′ is computed. Here, the key derivation key can be computed by evaluating K′=KDF(K, RAND, klength). The inputs to KDF can include the key K, the random value RAND and klength, where klength represents the bit-length of the key derivation key K′. KDF can be any suitable key derivation function that accepts an input key and other input data to derive keying material. Example KDFs include the hash-based KDF using SHA256 defined in ANSI X9.63-2011, the counter-mode KDF defined in NIST SP800-108 with CMAC-AES128 from NIST SP800-38B, and the NIST counter-mode KDF defined in NIST SP 800-108 with keyed-HMAC-SHA256 from FIP S 198-1. Additional or different KDFs may be used.
p-0116At <b>612</b>, a new value Z is computed. Here, the new value Z can be computed by evaluating Z=KDF(K, “STRING”, outlen). The inputs to this KDF can include key K, an input string “STRING” and outlen, which represents the sum of bit-lengths needed for f2, f3, f4, f5 and f5*. The input string “STRING” can be any constant that is known to both the mobile device and the network operator system.
p-0117At <b>614</b>, f2, f3, f4, f5 and f5* are extracted from Z. For instance, the extraction process can include parsing Z or any other suitable technique.
p-0118At <b>616</b>, the value f1 is computed. For instance, the value f1 can be computed by evaluating f1=KDF(K′, SQN∥AMF, outlen′). Here, the inputs to KDF include the key derivation key K′, the sequence number SQN concatenated with AMF and outlen′, which represents the bit-length of f1.
p-0119At <b>618</b>, if masking is used, the sequence value SQN can be masked. For example, the sequence value can be masked by computing SQN=SQN⊕f5. For each mobile device, the authentication center (AuC) can keep track of the sequence value SQN, which can facilitate re-synchronization.
p-0120At <b>620</b>, the authentication token AUTN is assembled. Here, the authentication token AUTN can be assembled by forming AUTN=SQN∥AMF∥f1 (=MAC<sub>A</sub>). For instance, AUTN can be assembled by the concatenation of the sequence number SQN, authentication management field AMF and the value f1.
p-0121At <b>622</b>, an output quintet Q is generated. Here, the output quintet can be generated by forming Q=(RAND, XRES=f2, CK=f3, IK=f4, AUTN). For instance, Q can be an ordered array of authentication vector that can include a random number RAND, an expected response XRES, a cipher key CK, an integrity key IK and authentication token AUTN. In some cases, the quintet Q is valid for an authentication and key agreement between the VLR and the mobile device.
p-0122At <b>624</b>, the output quintet Q is sent. The output quintet Q can be sent, for example, by the HLR to the VLR. The output quintet Q can be sent in any suitable form or format, using any suitable transmission technique. Subsequently, the VLR can extract RAND and AUTH and may forward these variables to the mobile device.
p-0123<figref idrefs="DRAWINGS">FIGS. 6B and 6C</figref> are flow diagrams showing an example process <b>650</b> that can be used by a mobile device for authenticated key agreement in a UMTS system. The process <b>650</b> may be implemented, for example, by a mobile device in a wireless communication system or by any other suitable system. In some implementations, the example process <b>650</b> shown in <figref idrefs="DRAWINGS">FIGS. 6B and 6C</figref> is performed by a mobile device in coordination with a wireless network server performing the example process <b>600</b> shown in <figref idrefs="DRAWINGS">FIG. 6A</figref>. The process <b>650</b> can include additional or different operations, and the operations can be performed in the order shown in <figref idrefs="DRAWINGS">FIGS. 6B and 6C</figref> or any suitable order. In some cases, one or more of the operations can be iterated or repeated, for example, until a specified condition is reached.
p-0124At <b>652</b>, a random value RAND and an authentication token AUTN are received. The values may be received wirelessly by the mobile device from the wireless network. In some cases, RAND and AUTN can be sent to the mobile device by a VLR or another component of the wireless network system. In some cases, the random value RAND and the authentication token AUTN are the values generated by the network operator in the process <b>600</b> (e.g., at <b>606</b> or <b>608</b>, <b>620</b>) shown in <figref idrefs="DRAWINGS">FIG. 6A</figref>. For example, the VLR may parse the random value RAND and authentication token AUTN from the authentication vector AV sent to the VLR from the HLR, and the VLR may forward the parsed values to the mobile device for authentication.
p-0125At <b>654</b>, the key K and the stored sequence value SQN<sub>MS </sub>are accessed. For instance, the key K and the sequence value SQN<sub>MS </sub>can be accessed in a local memory of the mobile device. In the mobile device, the SQN<sub>MS </sub>can be stored in an ISIM or another suitable computer-readable medium. The sequence value SQN<sub>MS </sub>can be a counter stored locally at the mobile device. The key K can be a long-term symmetric key stored by the mobile device and the network operator system. Additional or different types of keys may be used.
p-0126At <b>656</b>, if the operator is using an operator constant, the random value RAND can be updated. The random value RAND can be updated in the same manner as in the process <b>600</b> at <b>608</b>. For instance, RAND can be updated by computing RAND=RAND⊕OP<sub>C </sub>(where OP<sub>C </sub>is computed as described with respect to operation <b>608</b> in <figref idrefs="DRAWINGS">FIG. 6A</figref>).
p-0127At <b>658</b>, the key derivation key K′ is computed. The key derivation key K′ can be computed by evaluating K′=KDF(K, RAND, klength). The key derivation key K′ can be computed by the mobile device using the same KDF and the same inputs that were used by the network operator system in the process <b>600</b> at <b>610</b>.
p-0128At <b>660</b>, the value Z is computed. The value Z can be computed by evaluating Z=KDF(K, RAND, outlen). The value Z can be computed by the mobile device using the same KDF and the same inputs that were used by the network operator system in the process <b>600</b> at <b>612</b>.
p-0129At <b>662</b>, the values f2, f3, f4, f5 and f5* are extracted from Z. For instance, the extraction process can include parsing Z or any other suitable technique.
p-0130At <b>664</b>, the authentication token AUTN is parsed. For instance, parsing the authentication token (AUTN=SQN∥AMF∥MAC<sub>A</sub>) can be done to retrieve the sequence number SQN, the authentication management field AMF, the message authentication code MAC<sub>A</sub>, or any combination of them.
p-0131At <b>666</b>, if masking is used, the sequence value SQN is masked. The sequence number SQN can be masked according to the technique used in the process <b>600</b> at <b>618</b>. For instance, the sequence number can be masked by XORing the extracted sequence number SQN with f5 (SQN=SQN⊕f5).
p-0132At <b>668</b>, the value f1 is computed. For instance, the value f1 can be computed by evaluating f1=KDF(K′, SQN∥AMF, outlen′). Here, the KDF and the input values can be the same as those used by the network operator in the process <b>600</b> at <b>616</b> to compute the value f1.
p-0133At <b>670</b>, MAC<sub>A </sub>is compared to f1. If they are not equal (i.e., if MAC<sub>A</sub>≠f1), the process can be halted. In the event that the process is halted, at <b>669</b> an error code is returned. Otherwise (i.e., if MAC<sub>A</sub>=f1), the process can proceed to <b>672</b>.
p-0134At <b>672</b>, the validity of SQN is checked against SQN<sub>MS</sub>. This check can be performed to determine if re-synchronization is needed. If SQN is not valid, resynchronization is performed at <b>675</b>. Resynchronization can be performed by: (1) updating the sequence value SQN<sub>MS</sub>, (2) computing f1*=KDF(K′, SQN<sub>MS</sub>∥AMF*, outlen′), where AMF* is a default value, (3) if masking is used, applying the masking operation SQN<sub>MS</sub>=SQN<sub>MS</sub>⊕f5*, and (4) forming AUTN<sub>MS</sub>=SQN<sub>MS</sub>∥MAC<sub>S</sub>. When SQN is valid, the process can proceed to <b>674</b>.
p-0135At <b>674</b>, a response RES, a cipher key CK and an integrity key IK are generated. For instance, the response RES and the session keys can be generated by the mobile device. Here the response RES=f2, the cipher key CK=f3, the integrity key IK=f4, and if required the mobile device authentication token AUTN<sub>MS </sub>may be generated as well.
p-0136At <b>676</b>, the response RES is sent, and the mobile device authentication token AUTN<sub>MS </sub>may also be sent. For instance, RES and AUTN<sub>MS </sub>can be sent by the mobile device to the VLR. On receiving RES and AUTH<sub>MS </sub>from the mobile device, the VLR can verify that the response value RES is equal to the expected response value XRES. If RES=XRES, the verification is successful and the communication between the VLR and the mobile device is secured by the cipher and integrity keys CK and IK. If provided, the value AUTN<sub>MS </sub>can be sent to the HLR. Upon receipt of AUTN<sub>MS</sub>, the HLR can verify the value MAC<sub>S </sub>and update the sequence value indicated by SQN<sub>MS</sub>.
p-0137<figref idrefs="DRAWINGS">FIG. 6D</figref> is a schematic diagram showing aspects of the example technique shown in <figref idrefs="DRAWINGS">FIG. 6A</figref>. The operations shown in diagram <b>690</b> correspond to the operations in the example process <b>600</b> shown in <figref idrefs="DRAWINGS">FIG. 6A</figref>. The diagram <b>690</b> is provided for illustration purposes. The process <b>600</b> may be implemented in another manner.
p-0138Operations described in this specification can be implemented as operations performed by a data processing apparatus on data stored on one or more computer-readable storage devices or received from other sources. The term “data processing apparatus” encompasses all kinds of apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, a system on a chip, or multiple ones, or combinations, of the foregoing. The apparatus can include special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit). The apparatus can also include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, a cross-platform runtime environment, a virtual machine, or a combination of one or more of them. The apparatus and execution environment can realize various different computing model infrastructures, such as web services, distributed computing and grid computing infrastructures.
p-0139A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, declarative or procedural languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, object, or other unit suitable for use in a computing environment. A computer program may, but need not, correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub-programs, or portions of code). A computer program can be deployed to be executed on one computing device or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.
p-0140The processes and logic flows described in this specification can be performed by one or more programmable processors executing one or more computer programs to perform actions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).
p-0141Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computing device. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computing device are a processor for performing actions in accordance with instructions and one or more memory devices for storing instructions and data. Generally, a computing device will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more storage devices for storing data. However, a computing device need not have such devices. Moreover, a computer can be embedded in another device, e.g., a mobile telephone, a personal digital assistant (PDA), a mobile audio or video player, a game console, a Global Positioning System (GPS) receiver, or a portable storage device (e.g., a universal serial bus (USB) flash drive), to name just a few. Devices suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.
p-0142To provide for interaction with a user, subject matter described in this specification can be implemented on a computer having a display device, e.g., an LCD (liquid crystal display) screen for displaying information to the user and a keyboard and a pointing device, e.g., touch screen, stylus, mouse, etc. by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input. In addition, a computing device can interact with a user by sending documents to and receiving documents from a device that is used by the user; for example, by sending web pages to a web browser on a user's client device in response to requests received from the web browser.
p-0143Some of the subject matter described in this specification can be implemented in a computing system that includes a back-end component, e.g., as a data server, or that includes a middleware component, e.g., an application server, or that includes a front-end component, e.g., a client computing device having a graphical user interface or a Web browser through which a user can interact with an implementation of the subject matter described in this specification, or any combination of one or more such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication, e.g., a data network.
p-0144The computing system can include clients and servers. A client and server are generally remote from each other and typically interact through a data network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. In some implementations, a server transmits data to a client device. Data generated at the client device can be received from the client device at the server.
p-0145While this specification contains many specific implementation details, these should not be construed as limitations on the scope of what may be claimed, but rather as descriptions of features specific to particular implementations. Certain features that are described in this specification in the context of separate implementations can also be implemented in combination in a single implementation. Conversely, various features that are described in the context of a single implementation can also be implemented in multiple implementations separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
p-0146Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the implementations described above should not be understood as requiring such separation in all implementations, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.
p-0147In a general aspect, one or more session keys are generated in a communication system. A session key may be generated, for example, by a mobile device, a network operator system, another type of system, or by any suitable combination of these.
p-0148In some aspects, a computer system of a wireless network operator receives an identifier of a mobile device. Based on the identifier, a secret key associated with the mobile device is accessed. A key derivation function is evaluated to produce a key derivation key based on the secret key. The key derivation function is evaluated to produce an output value based on the key derivation key. A session key is obtained based on the second output value.
p-0149Implementations of these and other aspects may include one or more of the following features. A random challenge value is obtained before evaluating the key derivation function to produce the key derivation key. An expected response value, a ciphering key, and an integrity key are obtained based on the output value. A message that includes the ciphering key, the integrity key, the random challenge value, and the expected response value is generated. The message is transmitted to a wireless station of a wireless network.
p-0150Additionally or alternatively, implementations of these and other aspects may include one or more of the following features. The key derivation key is produced by evaluating the key derivation function on the secret key, a random challenge value obtained after receiving the identifier, and a first output length that specifies a bit-length of the key derivation key. The output value is produced by evaluating the key derivation function on the key derivation key, a pre-defined constant value, and a second output length that specifies a bit-length of the output value.
p-0151Additionally or alternatively, implementations of these and other aspects may include one or more of the following features. The key derivation function includes a message authentication code function. A message authentication code is obtained based on the key derivation key. A sequence value associated with the mobile device is accessed. A server authentication token is generated based on the message authentication code and the sequence value.
p-0152In some aspects, a mobile device receives a challenge value from a wireless network operator system. The mobile device accesses a secret key in response to receiving the challenge value. A key derivation function is evaluated to produce a key derivation key based on the secret key. The key derivation function is evaluated to produce an output value based on the key derivation key. A response value and a session key are obtained based on the output value. The response value is transmitted to the wireless network operator system.
p-0153Implementations of these and other aspects may include one or more of the following features. Obtaining the session key includes obtaining a ciphering key and an integrity key. The key derivation key is produced by evaluating the key derivation function on the secret key, the challenge value, and a first output length that specifies a bit-length of the key derivation key. The output value is produced by evaluating the key derivation function on the key derivation key, a pre-defined constant value, and a second output length that specifies a bit-length of the output value.
p-0154Additionally or alternatively, implementations of these and other aspects may include one or more of the following features. A sequence value previously stored on the mobile device is accessed. A message authentication code is obtained based on the secret key and the sequence value. A mobile device authentication token is generated based on the message authentication code and the sequence value.
p-0155Thus, some implementations of the subject matter have been described. Other implementations are within the scope of the following claims.
Contents3
16 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US10586057B2 | Cited by | United States of America | Search report |
| US2019147170A1 | Cited by | United States of America | Search report |
| WO2022067654A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US10218496B2 | Cited by | United States of America | Applicant |
| US2012300925A1 | Cited by | United States of America | Pre-grant |
| CN109845181A | Cited by | China | Search report |
| US10880675B2 | Cited by | United States of America | Applicant |
| US10602304B2 | Cited by | United States of America | Applicant |
| US12166869B2 | Cited by | United States of America | Search report |
| US12581446B2 | Cited by | United States of America | Search report |
| US9736229B2 | Cited by | United States of America | Applicant |
| US11871295B2 | Cited by | United States of America | Applicant |
| US12452657B2 | Cited by | United States of America | Applicant |
| US11811908B2 | Cited by | United States of America | Applicant |
| US2024259801A1 | Cited by | United States of America | Search report |
| US10560260B2 | Cited by | United States of America | Applicant |
| WO2023070433A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US11146910B2 | Cited by | United States of America | Applicant |
| US12302189B2 | Cited by | United States of America | Applicant |
| US9288049B1 | Cited by | United States of America | Search report |
| US10237681B2 | Cited by | United States of America | Search report |
| USRE49946E | Cited by | United States of America | Applicant |
| US9325642B2 | Cited by | United States of America | Search report |
| US2023379148A1 | Cited by | United States of America | Search report |
| US2010293379A1 | Cites | United States of America | Pre-grant |
| US2012039312A1 | Cites | United States of America | Pre-grant |
| US2012077501A1 | Cites | United States of America | Pre-grant |
| US2014003604A1 | Cites | United States of America | Pre-grant |
| US7856102B2 | Cites | United States of America | Pre-grant |
| 3GPP TS 33.102 v10.0.0: "Universal Mobile Telecommunications System (UMTS); 3G Security; Security Architecture," 2011,73 pages. | Non-patent | – | Pre-grant |
5 members in 3 offices
Members5
| Document | Office | Kind | |
|---|---|---|---|
| CA2820502A1 | Canada | A1 | |
| EP2680531A1 | European Patent Office (EPO) | A1 | |
| US2014006786A1 | United States of America | A1 | |
| US9088408B2 | United States of America | B2 | |
| CA2820502C | Canada | C |
77 transactions on the USPTO file
Allowed after 1 non-final rejection, 1 final rejection and 1 RCE.
- Non-final rejections
- 1
- Final rejections
- 1
- RCEs
- 1
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Email NotificationEML_NTR | EML_NTR | |
| Change in Power of Attorney (May Include Associate POA)PA.. | PA.. | |
| Payment of Maintenance Fee, 8th Year, Large EntityM1552 | M1552 | |
| Payment of Maintenance Fee, 4th Year, Large EntityM1551 | M1551 | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Email NotificationEML_NTR | EML_NTR | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Email NotificationEML_NTR | EML_NTR | |
| Printer Rush- No mailingTCPB | TCPB | |
| Mail Miscellaneous Communication to ApplicantMM327 | MM327 | |
| Miscellaneous Communication to Applicant - No Action CountM327 | M327 | |
| Pubs Case Remand to TCPUBTC | PUBTC | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Reasons for AllowanceEX.R | EX.R | |
| Correspondence Address ChangeC.ADB | C.ADB | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Reference capture on IDSRCAP | RCAP | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Reference capture on IDSRCAP | RCAP | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Mail Post CardPST_CRD | PST_CRD | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Email NotificationEML_NTR | EML_NTR | |
| PG-Pub Issue NotificationPG-ISSUE | PG-ISSUE | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Reference capture on IDSRCAP | RCAP | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Response after Non-Final ActionA... | A... | |
| Reference capture on IDSRCAP | RCAP | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Email NotificationEML_NTR | EML_NTR | |
| Change in Power of Attorney (May Include Associate POA)PA.. | PA.. | |
| Correspondence Address ChangeC.AD | C.AD | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Application Is Now CompleteCOMP | COMP | |
| Sent to Classification ContractorPGPC | PGPC | |
| Filing Receipt - UpdatedFLRCPT.U | FLRCPT.U | |
| Additional Application Filing FeesADDFLFEE | ADDFLFEE | |
| Applicants have given acceptable permission for participating foreignAPPERMS | APPERMS | |
| A statement by one or more inventors satisfying the requirement under 35 USC 115, Oath of the ApplicOATHDECL | OATHDECL | |
| Filing ReceiptFLRCPT.O | FLRCPT.O | |
| Notice Mailed--Application Incomplete--Filing Date AssignedINCD | INCD | |
| Cleared by OIPE CSRL194 | L194 | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Reference capture on IDSRCAP | RCAP | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Initial Exam Team nnIEXX | IEXX |
10 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| Maintenance fee paymentMAFP | MAFP | |
| AssignmentAS | AS | |
| Maintenance fee paymentMAFP | MAFP | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS |
Numbers
- Publication
- 20140006786
- Application
- 13536686
Titles
- English
- KEY AGREEMENT USING A KEY DERIVATION KEY
Patent term adjustment
- A delay
- +218 daysthe office missed an examination deadline
- Applicant delay
- −203 days
- Net adjustment
- 15 days
Classification
- CPC, 7
- H04L9/0869
- H04L63/06
- H04L9/3271
- H04L2209/80
- H04W12/06
- H04W12/0431
- H04W12/04
- IPC, 1
- H04W12 00