Secure registration for a multicast-broadcast-multimedia system (MBMS)

Information

  • Patent Grant
  • 8098818
  • Patent Number
    8,098,818
  • Date Filed
    Monday, July 7, 2003
    21 years ago
  • Date Issued
    Tuesday, January 17, 2012
    12 years ago
Abstract
A method and an apparatus for secure registration for a multicast-broadcast-multimedia system (MBMS) are disclosed. A random number is generated by a broadcast-multicast-service center (BM-SC) and broadcast to user equipment in the coverage area of a radio access network (RAN). A memory module or smart card (UICC) in the user equipment generates a radio access network key (RAK) which is a function of the random number and a key selected from the group consisting of a public land mobile network key (PK) and a broadcast access key (BAK), and then generates a temporary registration key (RGK) as a function of the RAK, a service identification number and a user identification number, for example, P-TMSI, which may be extracted by the RAN to authenticate the registration as legitimate.
Description
BACKGROUND

1. Field of the Invention


The present invention relates generally to telecommunications, and more specifically, to security in communication systems.


2. Background


In a wireless communication system which carries non-voice traffic, such as video, data, multimedia, or other types of traffic in addition to voice traffic, a typical cellular base station may broadcast a multimedia traffic service if the number of users demanding the service exceeds a predetermined threshold number within the coverage area of the base station. The multimedia traffic service may be a video stream of an event such as a sporting event or a highlighted portion of a sporting event, for example. If there are not enough users demanding the service in the coverage area, the base station may transmit the service only to the specific users who have demanded the service through dedicated channels instead of broadcasting the service to all users in the coverage area.


Sometimes a rogue or illegitimate user may attempt to force the base station to broadcast the service to all users in the coverage area by registering multiple times in an idle mode, for example, by assuming a number of different identities. If one or more rogue users use mobile telephones in the idle mode to register multiple times in a coverage area to receive the contents of an event, the base station may count the number of registrations as legitimate user registrations for the event and broadcast the event to all users in the coverage area.


Therefore, there is a need in the art for a network operator or content provider to have reliable means to verify that only legitimate registrations for a multimedia event be counted in a coverage area and not be forced to broadcast the event to all users in the coverage area due to fake registrations.


SUMMARY

Embodiments disclosed herein address the above stated needs by a method and an apparatus of obtaining secure registration in a multicast-broadcast-multimedia system (MBMS) using a temporary registration key (RGK).





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is an exemplary block diagram illustrating a multicast-broadcast-multimedia system (MBMS) communication link;



FIG. 2 is a diagram illustrating an embodiment of secure registration in the MBMS; and



FIG. 3 is a diagram illustrating another embodiment of secure registration in the MBMS.





DETAILED DESCRIPTION

The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any embodiment described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments. All of the embodiments described in this Detailed Description are exemplary embodiments provided to enable persons skilled in the art to make or use the invention and not to limit the scope of the invention which is defined by the claims.


A mobile station, also called user equipment (UE), may communicate with one or more base stations. A mobile station transmits and receives data packets through one or more base stations to a base station controller. Base stations and base station controllers are parts of a network called an access network. An access network transports data packets between multiple mobile stations. The access network may be further connected to additional networks outside the access network, such as a corporate intranet or the Internet, and may transport data packets between each mobile station and such outside networks. A mobile station that has established an active traffic channel connection with one or more base stations is called an active mobile station, and is said to be in a traffic state. A mobile station that is in the process of establishing an active traffic channel connection with one or more base stations is said to be in a connection setup state. A mobile station that is powered on and capable of receiving signals from a base station but is not in a traffic state or in a connection setup state is said to be in an idle state.


A communication link through which a mobile station sends signals to a base station is called a reverse link. A communication link through which a base station sends signals to a mobile station is called a forward link. A mobile station or user equipment (UE) may be a mobile telephone which includes a mobile telephone handset, also called mobile equipment (ME), and a memory module, such as a physically secure integrated circuit card or smart card called UICC, which may be removable or permanently attached to the ME. In a Global System for Mobile communication (GSM) telephone, the UICC is typically a subscriber identity module (SIM). In a code division multiple access (CDMA) telephone, the UICC is typically a removable user identity module (RUIM).



FIG. 1 is an exemplary block diagram illustrating a communication link between user equipment (UE) 2, a serving network 4, a home network 6 and a content provider (CP) 8 in a multicast-broadcast-multimedia system (MBMS). The user equipment 2 may be a mobile station which includes mobile equipment (ME) 10 and a memory module or UICC 12. The UICC 12 may be either a removable memory module attached to the mobile equipment 10 or a permanent part of the mobile equipment 10. The physical implementation of the UICC 12 in the user equipment 2 is not critical to the present invention.


The serving network 4 may either be owned by the wireless carrier which provides subscription service to the user equipment 2, or be a visited network owned by another carrier which provides service to the user equipment 2 while the user equipment 2 is roaming. The serving network 4 typically includes a radio access network (RAN) 14 and a serving general packet radio service (GPRS) support node (SGSN) 16. The radio access network 14, also known as a base station (BS), a base transceiver station (BTS), or an access point (AP), transmits radio signals to and receives radio signals from the user equipment 2. The SGSN 16 is a core network node which may be part of a public land mobile network (PLMN), for example.


The home network 6 is the network owned by the wireless carrier which provides subscription service to the user equipment 2, and may or may not be owned by the same carrier as that of the serving network 4 depending upon whether the user equipment 2 is roaming outside the service area of the carrier. The home network 6 typically includes a gateway GPRS support node (GGSN) 18, a broadcast-multicast-service center (BM-SC) 20 and a home subscriber server (HSS) 22. The solid line 22 in FIG. 1 represents a bearer path on which information-bearing signals are carried from the content provider 8 through the home network 6 and the serving network 4 to the mobile equipment 10. The dashed line 24 in FIG. 1 represents a key/authorization path on which encryption and decryption keys are passed between the UICC 12, the serving network 4


The content provider 8 may be a third-party content source that is owned by neither the home network carrier nor the serving network carrier. The home subscriber server 22 in the home network 6 may include a database for holding mobile telephone subscription and collecting billing data for multicast services. In the embodiment shown in FIG. 1, the home network 6 also includes the broadcast-multicast-service center (BM-SC) 20 which schedules multicasting of the multimedia event and performs at least some security functions for the MBMS. The serving network 4 is the network that transmits the content to a single user through a dedicated channel, multicasts the content to a plurality of users through dedicated channels if the number of users demanding the service does not justify broadcasting the service to all users in the coverage area, or broadcasts the content to all users in the coverage area if the number of users demanding the service exceeds a predetermined threshold.


In an embodiment, the content of the multimedia event is encrypted and decrypted in the multicast-broadcast-multimedia system through several levels of encryption and decryption to provide at least some level of assurance that unauthorized users will not be able to decrypt the data and watch the multimedia event. For example, a permanent, user-specific registration key (RK) may be provided to generate temporary key (TK) values and to authenticate the UICC in the user's mobile telephone. The TK is a single use, user-specific key used to encrypt broadcast access key (BAK) values. The TK is also used by the UICC to decrypt the BAK values. The BAK is a medium-term, shared key which is used for deriving multiple short-term keys (SK) and distributed to UICCs of subscribed users on a per-user basis. The SK is a frequently changing, shared key which is used to encrypt and decrypt the content. The SK may be generated using a random number (SK_RAND) which is sent in the clear with the encrypted content and the BAK. The UICC 12 regenerates the SK from the BAK and SK_RAND, and passes the SK to the mobile equipment 10. Examples of schemes for encryption and decryption of data contents in a multicast-broadcast-multimedia system are described in U.S. patent application Ser. No. 09/933,972, entitled “Method and Apparatus for Security in a Data Processing System,” filed Aug. 20, 2001, incorporated herein by reference. Various other embodiments of using public keys or shared-secret keys for encryption and decryption may also be implemented within the scope of the invention. For example, in an alternate embodiment, secure delivery or provisioning of BAK to the UICC may be provided by using public key mechanisms such as RSA or ElGamal, which are known to persons skilled in the art.



FIG. 2 illustrates an embodiment of secure registration in a multicast-broadcast-multimedia system. In this embodiment, the broadcast-multicast-service center (BM-SC) 20 transmits a provisioning message, which is a function of a public land mobile network (PLMN) key referred to as PK, and the permanent, user-specific registration key referred to as RK. The PK is a temporary, home PLMN specific key used to generate a radio access network (RAN) key referred to as RAK, and to authenticate the UICC 12. The provisioning message is transmitted from the BM-SC 20 to the UICC 12 along a path 26 as illustrated in FIG. 2. The provisioning message, which is a function with arguments PK and RK, may be represented as c1(PK, RK). Upon receiving the provisioning message, the UICC 12 extracts the PK from the provisioning message and stores the PK value. Other embodiments for implementing the secure delivery or provisioning of PK to the UICC may be provided within the scope of the invention by using public key mechanisms including but not limited to RSA and ElGamal.


The radio access network (RAN) 14 transmits a request for the RAK and a random number (RAND) along a path 28 to the BM-SC 20, which in response generates the RAK which is a function with arguments PK and RAND. The RAK, which may be represented as c2(PK, RAND), is transmitted by the BM-SC 20 to the RAN 14 along a path 30. The RAK is a temporary, RAN specific key used to generate temporary, user-specific registration key (RGK) values and to hide the PK from the RAN 14 which is visited by the UE 2. The RAK is also used to cipher the MBMS service identification number (Serv_ID) and a user identification number such as P-TMSI, IMSI, electronic serial number (ESN), MIN, or any permanent or temporary user identification number used in the system in which an embodiment of the present invention is implemented. In the embodiments shown in FIGS. 2 and 3, P-TMSI is used as an exemplary user identification number known to a person skilled in the art.


The RAN may store the RAK and broadcast the RAND to all users including UE 2 within the coverage area of the RAN along a path 32. The UE 2, upon receiving the RAND, sends the RAND as well as the P-TMSI and the Serv_ID to the UICC 12 along a path 34. The UICC 12 generates the RAK which is an exact copy of the RAK generated by the BM-SC 20. After receiving the Serv_ID and the P-TMSI, the UICC 12 concatenates the Serv_ID and the P-TMSI to obtain a concatenated result denoted as [Serv_ID||P-TMSI], and computes a cyclic redundancy code (CRC) based on the Serv_ID and P-TMSI. The CRC is appended to [Serv_ID||P-TMSI] to generate [Serv_ID||P-TMSI||CRC]. The UICC 12 then generates the RGK which is a function of the Serv_ID, P-TMSI, CRC and RAK represented as c3([Serv_ID||P-TMSI||CRC], RAK). The RGK is a temporary, user-specific key used to authenticate registration messages.


After the RGK is generated, the UICC 12 sends the RGK along a path 36 to the UE 2, which in turn transmits a registration/connection request including the RGK to the RAN 14 along a path 38. The RAN 14, upon receiving the registration/connection request, extracts the [Serv_ID||P-TMSI], verifies the CRC, and counts the user identified by the P-TMSI as a legitimate user who has sent a valid registration message to request the multimedia service. If the registration/connection message transmitted by the user is not verified by the RAN 14, then the RAN may regard the user as a rogue or illegitimate user and does not count the request as legitimate.



FIG. 3 illustrates another embodiment of secure registration in a multicast-broadcast-multimedia system. In this embodiment, no provisioning message is transmitted by the broadcast-multicast-service center (BM-SC) 20. Instead, the radio access network (RAN) 14 transmits a request for the RAK and a random number (RAND) along a path 40 to the BM-SC 20, which in response generates the RAK and the RAND. The RAK is a function with arguments BAK and RAND represented as c2(BAK, RAND). The BAK is the same broadcast access key used as part of the encryption scheme to encrypt the data contents described above. The RAND and RAK are transmitted by the BM-SC 20 to the RAN 14 along a path 42. The RAK is a temporary, RAN specific key used to generate temporary, user-specific registration key (RGK) values. The RAK is also used to cipher the MBMS service identification number (Serv_ID) and a user identification number referred to as P-TMSI.


The RAN may store the RAK and broadcast the RAND to all users including UE 2 within the coverage area of the RAN along a path 44. The UE 2, upon receiving the RAND, sends the RAND as well as the P-TMSI and the Serv_ID to the UICC 12 along a path 46. The UICC 12 generates the RAK which is an exact copy of the RAK generated by the BM-SC 20. After receiving the Serv_ID and the P-TMSI, the UICC 12 concatenates the Serv_ID and the P-TMSI to obtain a concatenated result denoted as [Serv_ID||P-TMSI], and computes a cyclic redundancy code (CRC) based on the Serv_ID and P-TMSI. The CRC is appended to [Serv_ID||P-TMSI] to generate [Serv_ID||P-TMSI||CRC]. The UICC 12 then generates the RGK which is a function of the Serv_ID, P-TMSI, CRC and RAK, represented as c3([Serv_ID||P-TMSI||CRC], RAK). The RGK is a temporary, user-specific key used to authenticate registration messages.


After the RGK is generated, the UICC 12 sends the RGK along a path 48 to the UE 2, which in turn transmits a registration/connection request including the RGK to the RAN 14 along a path 50. The RAN 14, upon receiving the registration/connection request, extracts the [Serv_ID||P-TMSI], verifies the CRC, and counts the user identified by the P-TMSI as a legitimate user who has sent a valid registration message to request the multimedia service. If the registration/connection message transmitted by the user is not verified by the RAN 14, then the RAN may regard the user as a rogue or illegitimate user and does not count the request as legitimate.


The RAN 14 may receive a plurality of registration/connection requests from a plurality of users within the coverage area and decide which requests are valid ones transmitted by legitimate users by verifying the CRC computed from the Serv_ID and P-TMSI of each user. The RAN may ignore those requests with RGKs which include unverifiable CRCs. In this manner, the RAN has a highly reliable means of determining how many registration requests for a certain multimedia event are valid, and would not be forced to broadcast the event if the number of legitimate users is not enough to justify broadcasting the event.


Various other features may also be added to the temporary registration message (RGK) within the scope of the present invention. For example, a time stamp for system time may be added to the RGK. The RAN 14 may use the P-TMSI extracted from the RGK to determine whether the user who is attempting to register is actually a subscriber, if the RAN has the P-TMSIs of all subscribed users in the coverage area. In a typical GSM system, the P-TMSI may be allocated at the logical link control (LLC) level in the GSM/GPRS, that is, in the core network (CN). In another embodiment, a public key may be used in forming the RGK to avoid replay attacks by rogue users. For example, if each UICC has a private key used for provisioning PK or BAK, the RGK may include a reference to the public key or certificate and a signature of the BAK-hash or PK-hash. Replay attacks by rogue users may be prevented or at least limited by using techniques such as sequence numbers or digital signatures based on public key cryptography.


The sequence of the text in any of the claims does not imply that process steps must be performed in a temporal or logical order according to such sequence unless it is specifically defined by the language of the claim. The process steps may be interchanged in any order without departing from the scope of the invention as long as such an interchange does not contradict the claim language and is not logically nonsensical. Furthermore, numerical ordinals such as “first,” “second,” “third,” etc. simply denote different singles of a plurality and do not imply any order or sequence unless specifically defined by the claim language.


Furthermore, words such as “connect,” “connected to” and “connection” used in describing a relationship between different elements do not imply that a direct physical connection must be made between these elements. For example, two elements may be connected to each other physically, electronically, logically, or in any other manner, through one or more additional elements, without departing from the scope of the invention.


Those of skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.


Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.


The various illustrative logical blocks, modules, and circuits described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.


The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in random access memory (RAM), flash memory, read only memory (ROM), erasable programmable read only memory (EPROM), electrically erasable programmable read only memory (EEPROM), registers, a hard disk, a removable disk, a compact disc-read only memory (CD-ROM), or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. Alternatively, the storage medium may be integral to the processor. The processor and the storage medium may reside in a single ASIC or as separate components in a base station, for example.


The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims
  • 1. A method of obtaining secure registration by a memory module (UICC) in a multicast-broadcast-multimedia system (MBMS), the method comprising: receiving a random number;generating a radio access network key (RAK) as a function of the random number and a key selected from the group consisting of a public land mobile network key (PK) and a broadcast access key (BAK);generating temporary registration key (RGK) as a function of the RAK and a user identification number; andauthenticating at least one registration message in the MBMS based on the RGK, wherein the RGK is a function of the RAK, a service identification number and the user identification number.
  • 2. The method of claim 1, further comprising transmitting the RGK to a mobile telephone.
  • 3. The method of claim 1, further comprising receiving a provisioning message from a broadcast-multicast service center.
  • 4. The method of claim 3, wherein the provisioning message is a fraction of the PK and a permanent registration key (RK).
  • 5. The method of claim 3, further comprising extracting the PK from the provisioning message.
  • 6. The method of claim 1, wherein the RGK is a function of the RAK and a cyclic redundancy code (CRC) computed from the service identification number and the user identification number.
  • 7. The method of claim 1, wherein the UICC comprises a subscriber identity module (SIM) in a Global System for Mobile communication (GSM).
  • 8. The method of claim 1, wherein the UICC comprises a removable user identity module (RUIM) in a code division multiple access (CDMA) system.
  • 9. The method of claim 1, wherein the PK is provisioned by using a public key.
  • 10. The method of claim 1, wherein the BAK is provisioned by using a public key.
  • 11. A method of obtaining secure registration by a mobile station in a multicast-broadcast-multimedia system (MBMS), the method comprising: receiving a random number from a radio access network;transmitting the random number to a memory module (UICC);receiving from the UICC a temporary registration key (RGK) based on the random number and a user identification number; andauthenticating at least one registration message in the MBMS based on the RGK, wherein the RGK is a function of a radio access network key (RAK), a service identification number and a user identification number, and wherein the RAK is a function of the random number and a key selected from the group consisting of a public land mobile network key (PK) and a broadcast access key (BAK).
  • 12. The method of claim 11 wherein the PK is extracted from a provisioning message received from a broadcast-multicast service center.
  • 13. The method of claim 12, wherein the provisioning message is a function of the PK and a permanent registration key (RK).
  • 14. The method of claim 11, wherein the RGK is a function of the RAK and a cyclic redundancy code (CRC) computed from the service identification number and the user identification number.
  • 15. The method of claim 11, wherein the UICC comprises a subscriber identity module (SIM) in a Global System for Mobile communication (GSM) system.
  • 16. The method of claim 11, wherein the UICC comprises a removable user identity module (RUIM) in a code division multiple access (CDMA) system.
  • 17. The method of claim 11, wherein the PK is provisioned by using a public key.
  • 18. The method of claim 11, wherein the BAR is provisioned by using a public key.
  • 19. A memory module stored on a computer readable storage medium, comprising: receiving logic configured for receiving a random number;means for generating a radio access network key (RAK) as a function of the random number and a key selected from the group consisting of a public land mobile network key (PK) and a broadcast access key (BAK);means for generating a temporary registration key (RGK) as a function of the RAK and a user identification number; andmeans for authenticating at least one registration message in the MBMS based on the RGK, wherein the RGK is a function of the RGK, service identification number and the user identification number.
  • 20. The memory module of claim 19, further comprising means for transmitting the RGK to a mobile telephone.
  • 21. The memory module of claim 19, further comprising means for receiving a provisioning message from a broadcast-multicast service center.
  • 22. The memory module of claim 21, wherein the provisioning message is a function of the PK and a permanent registration key (RK).
  • 23. The memory module of claim 21, further comprising means for extracting the PK from the provisioning message.
  • 24. The memory module of claim 19, wherein the RGK is a function of the RAK and a cyclic redundancy code (CRC) computed from the service identification number and the user identification number.
  • 25. The memory module of claim 19, wherein the PK is provisioned by using a public key.
  • 26. The memory module of claim 19, wherein the BAK is provisioned by using a public key.
  • 27. A mobile station apparatus, comprising: receiving logic configured for receiving a random number from a radio access network;means for transmitting the random number to a memory module (UICC);means for receiving from the UICC a temporary registration key (RGK) based on the random number and a user identification number; andmeans for authenticating at least one registration message in the MBMS based on the RGK, wherein the RGK is a function of a radio access network key (RAK), a service identification number and a user identification number, and wherein the RAK is a function of the random number and a key selected from the group consisting of a public land mobile network key (PK) and a broadcast access key (BAK).
  • 28. The apparatus of claim 27, wherein the PK is extracted from a provisioning message received from a broadcast-multicast service center.
  • 29. The apparatus of claim 28, wherein the provisioning message is a function of the PK and a permanent registration key (RK).
  • 30. The apparatus of claim 27 wherein the RGK is a function of the RAK and a cyclic redundancy code (CRC) computed from the service identification number and the user identification number.
  • 31. The apparatus of claim 27, wherein the UICC comprises a subscriber identity module (SIM) in a Global System for Mobile communication (GSM) system.
  • 32. The apparatus of claim 27, wherein the UICC comprises a removable user identity module (RUIM) in a code division multiple access (CDMA) system.
  • 33. The apparatus of claim 27, wherein the PK is provisioned by using a public key.
  • 34. The apparatus of claim 27, wherein the BAK is provisioned by using a public key.
  • 35. A computer readable storage medium storing instructions for obtaining secure registration by a memory module (UICC) in a multicast-broadcast-multimedia system (MBMS), the method comprising: receiving a random number;generating a radio access network key (RAK) as a function of the random number and a key selected from the group consisting of a public land mobile network key (PK) and a broadcast access key (BAK);generating a temporary registration key (RGK) as a function of the RAK and a user identification number; andauthenticating at least one registration message in the MBMS based on the RGK, wherein the RGK is a function of the RAK, a service identification number and a user identification number.
  • 36. The computer readable storage device of claim 35, wherein the method further comprises transmitting the RGK to a mobile telephone.
  • 37. The computer readable storage device of claim 35, wherein the method further comprises receiving a provisioning message from a broadcast-multicast service center.
  • 38. The computer readable storage device of claim 37, wherein the provisioning message is a function of the PK and a permanent registration key (RK).
  • 39. The computer readable storage device of claim 37, wherein the meted further comprises extracting the PK flora the provisioning message.
  • 40. The computer readable storage device of claim 35, wherein the RGK is a function of the RAK and a cyclic redundancy code (CRC) computed from the service identification number and the user identification number.
  • 41. The computer readable storage device of claim 35, wherein the UICC comprises a subscriber identity module (SIM) in a Global System for Mobile communication (GSM) system.
  • 42. The computer readable storage device of claim 35, wherein the UICC comprises a removable user identity module (RUIM) in a code division multiple access (CDMA) system.
  • 43. The computer readable storage device of claim 35, wherein the PK is provisioned by using a public key.
  • 44. The computer readable storage device of claim 35, wherein the BAK is provisioned by using a public key.
  • 45. A computer readable storage device storing instructions for obtaining secure registration by a mobile station in a multicast-broadcast-multimedia system (MBMS), the method comprising: receiving a random number from a radio access network;transmitting the random number to a memory module (UICC);receiving from the UICC a temporary registration key (RGK) based on the random number and a user identification number; andauthenticating at least one registration message in the MBMS based on the RGK, wherein the RGK is a function of a radio access network key (RAK), a service identification number and a user identification number, and wherein the RAK is a function of the random number and a key selected from the group consisting of a public land mobile network key (PK) and a broadcast access key (BAK).
  • 46. The computer readable storage device of claim 45, wherein the PK is extracted from a provisioning message received from a broadcast-multicast service center.
  • 47. The computer readable storage device of claim 46, wherein the provisioning message is a function of the PK and a permanent registration key (RK).
  • 48. The computer readable storage device of claim 45, wherein the RGK is a function of the RAK and a cyclic redundancy code (CRC) computed from the service identification number and the user identification number.
  • 49. The computer readable storage device of claim 45, wherein the UICC comprises a subscriber identity module (SIM) in a Global System for Mobile communication (GSM) system.
  • 50. The computer readable storage device of claim 45, wherein the UICC comprises a removable user identity module (RUIM) in a code division multiple access (CDMA) system.
  • 51. The computer readable storage device of claim 45, wherein the PK is provisioned by using a public key.
  • 52. The computer readable storage device of claim 45, wherein the BAK is provisioned by using a public key.
US Referenced Citations (339)
Number Name Date Kind
4163255 Pires et al. Jul 1979 A
4323921 Guillou et al. Apr 1982 A
4750167 Meyer et al. Jun 1988 A
4870408 Zdunek et al. Sep 1989 A
4881263 Herbison et al. Nov 1989 A
4901307 Gilhousen et al. Feb 1990 A
RE33189 Lee et al. Mar 1990 E
4924513 Herbison et al. May 1990 A
5056109 Gilhousen et al. Oct 1991 A
5101501 Gilhousen et al. Mar 1992 A
5103459 Gilhousen et al. Apr 1992 A
5117457 Comerford et al. May 1992 A
5136586 Greenblatt et al. Aug 1992 A
5150412 Maru et al. Sep 1992 A
5159447 Haskell et al. Oct 1992 A
5164988 Matyas et al. Nov 1992 A
5235631 Grube et al. Aug 1993 A
5237612 Raith Aug 1993 A
5241598 Raith Aug 1993 A
5253294 Maurer et al. Oct 1993 A
5257396 Auld, Jr. et al. Oct 1993 A
5325357 Kimoto et al. Jun 1994 A
5351087 Christopher et al. Sep 1994 A
5353332 Raith et al. Oct 1994 A
5363379 Eckenrode et al. Nov 1994 A
5365572 Saegusa et al. Nov 1994 A
5369784 Nelson et al. Nov 1994 A
5371794 Diffie et al. Dec 1994 A
5404563 Green et al. Apr 1995 A
5410602 Finkelstein et al. Apr 1995 A
5412655 Yamada et al. May 1995 A
5421006 Jablon et al. May 1995 A
5448568 Delpuch et al. Sep 1995 A
5467398 Pierce et al. Nov 1995 A
5473609 Chaney et al. Dec 1995 A
5473642 Osawa et al. Dec 1995 A
5481613 Ford et al. Jan 1996 A
5485577 Eyer et al. Jan 1996 A
5504773 Padovani et al. Apr 1996 A
5513245 Mizikovsky et al. Apr 1996 A
5515441 Faucher et al. May 1996 A
5537474 Brown et al. Jul 1996 A
5565909 Thibadeau et al. Oct 1996 A
5592470 Rudrapatna et al. Jan 1997 A
5673259 Quick, Jr. et al. Sep 1997 A
5686963 Uz et al. Nov 1997 A
5708961 Hylton et al. Jan 1998 A
5729540 Wegrzyn et al. Mar 1998 A
5740246 Saito Apr 1998 A
5748736 Mittra May 1998 A
5751707 Voit et al. May 1998 A
5751725 Chen et al. May 1998 A
5758068 Brandt et al. May 1998 A
5758291 Grube et al. May 1998 A
5768276 Diachina et al. Jun 1998 A
5774496 Butler et al. Jun 1998 A
5778059 Loghmani et al. Jul 1998 A
5778069 Thomlinson et al. Jul 1998 A
5778187 Monteiro et al. Jul 1998 A
5787347 Yu et al. Jul 1998 A
5796829 Newby et al. Aug 1998 A
5835730 Grossman et al. Nov 1998 A
5850444 Rune et al. Dec 1998 A
5850445 Chan et al. Dec 1998 A
5870474 Wasilewski et al. Feb 1999 A
5878141 Daly et al. Mar 1999 A
5881368 Grob et al. Mar 1999 A
5884196 Lekven et al. Mar 1999 A
5887252 Noneman et al. Mar 1999 A
5909491 Luo et al. Jun 1999 A
5923649 Raith et al. Jul 1999 A
5936965 Doshi et al. Aug 1999 A
5940507 Cane et al. Aug 1999 A
5946316 Chen et al. Aug 1999 A
5956404 Schneier et al. Sep 1999 A
5956681 Yamakita et al. Sep 1999 A
5970072 Gammenthaler, Jr. et al. Oct 1999 A
5970417 Toyryla et al. Oct 1999 A
5978386 Hamalainen et al. Nov 1999 A
5983099 Yao et al. Nov 1999 A
5990928 Sklar et al. Nov 1999 A
5991400 Kamperman et al. Nov 1999 A
5991407 Murto et al. Nov 1999 A
6006073 Glauner et al. Dec 1999 A
6018360 Stewart et al. Jan 2000 A
6021124 Haartsen et al. Feb 2000 A
6026165 Marino et al. Feb 2000 A
6032197 Birdwell et al. Feb 2000 A
6044154 Kelly et al. Mar 2000 A
6047071 Shah et al. Apr 2000 A
6047395 Zook et al. Apr 2000 A
6052812 Chen et al. Apr 2000 A
6055236 Nessett et al. Apr 2000 A
6055314 Spies et al. Apr 2000 A
6058289 Gardner et al. May 2000 A
6065061 Blahut et al. May 2000 A
6067290 Paulraj et al. May 2000 A
6073122 Wool et al. Jun 2000 A
6081907 Witty et al. Jun 2000 A
6097817 Bilgic et al. Aug 2000 A
6098878 Dent et al. Aug 2000 A
6108424 Pitiot et al. Aug 2000 A
6108706 Birdwell et al. Aug 2000 A
6111866 Kweon et al. Aug 2000 A
6128389 Chan et al. Oct 2000 A
6128490 Shaheen et al. Oct 2000 A
6148010 Sutton et al. Nov 2000 A
6157719 Wasilewski et al. Dec 2000 A
6172972 Birdwell et al. Jan 2001 B1
6185430 Yee et al. Feb 2001 B1
6195546 Leung et al. Feb 2001 B1
6199161 Ahvenainen et al. Mar 2001 B1
6201961 Schindall et al. Mar 2001 B1
6208634 Boulos et al. Mar 2001 B1
6230024 Wang et al. May 2001 B1
6233234 Curry et al. May 2001 B1
6233341 Riggins et al. May 2001 B1
6240091 Ginzboorg et al. May 2001 B1
6253069 Mankovitz et al. Jun 2001 B1
6253326 Lincke et al. Jun 2001 B1
6256509 Tanaka et al. Jul 2001 B1
6266420 Langford et al. Jul 2001 B1
6272632 Carman et al. Aug 2001 B1
6295361 Kadansky et al. Sep 2001 B1
6310661 Arsenault et al. Oct 2001 B1
6314095 Loa et al. Nov 2001 B1
6343280 Clark et al. Jan 2002 B2
6345307 Booth et al. Feb 2002 B1
6353614 Borella et al. Mar 2002 B1
6363242 Brown, Jr. et al. Mar 2002 B1
6363480 Perlman et al. Mar 2002 B1
6373829 Vilmur et al. Apr 2002 B1
6374103 Kamel et al. Apr 2002 B1
6377810 Geiger et al. Apr 2002 B1
6385200 Erami et al. May 2002 B1
6385461 Raith et al. May 2002 B1
6415312 Boivie Jul 2002 B1
6424717 Pinder et al. Jul 2002 B1
6424947 Tsuria et al. Jul 2002 B1
6434367 Kumar et al. Aug 2002 B1
6438612 Ylonen et al. Aug 2002 B1
6449491 Dailey et al. Sep 2002 B1
6463155 Akiyama et al. Oct 2002 B1
6473419 Gray et al. Oct 2002 B1
6473858 Shimomura et al. Oct 2002 B1
6477377 Backstrom et al. Nov 2002 B2
6490259 Agrawal et al. Dec 2002 B1
6502140 Boivie Dec 2002 B1
6507590 Terho et al. Jan 2003 B1
6510515 Raith et al. Jan 2003 B1
RE38007 Tsukamoto et al. Feb 2003 E
6519266 Manning et al. Feb 2003 B1
6523069 Luczycki et al. Feb 2003 B1
6529740 Ganucheau, Jr. et al. Mar 2003 B1
6536041 Knudson et al. Mar 2003 B1
6538996 West et al. Mar 2003 B1
6539242 Bayley Mar 2003 B1
6542490 Ahmadvand et al. Apr 2003 B1
6549771 Chang et al. Apr 2003 B2
6560206 Naden et al. May 2003 B1
6564211 Andreev et al. May 2003 B1
6567914 Just et al. May 2003 B1
6571109 Kim et al. May 2003 B1
6574211 Padovani et al. Jun 2003 B2
6577734 Etzel et al. Jun 2003 B1
6577848 Gregg et al. Jun 2003 B1
6580756 Matsui et al. Jun 2003 B1
6598203 Tang et al. Jul 2003 B1
6600745 Chopping et al. Jul 2003 B1
6601068 Park et al. Jul 2003 B1
6603857 Batten-Carew et al. Aug 2003 B1
6606706 Li et al. Aug 2003 B1
6608841 Koodli et al. Aug 2003 B1
6614804 McFadden et al. Sep 2003 B1
6633979 Smeets et al. Oct 2003 B1
6647000 Persson et al. Nov 2003 B1
6654384 Reza et al. Nov 2003 B1
6658463 Dillon et al. Dec 2003 B1
6665718 Chuah et al. Dec 2003 B1
6680920 Wan et al. Jan 2004 B1
6690795 Richards et al. Feb 2004 B1
6704368 Nefedov et al. Mar 2004 B1
6704369 Kawasaki et al. Mar 2004 B1
6711182 Gibbs et al. Mar 2004 B1
6714650 Maillard et al. Mar 2004 B1
6714784 Forssell et al. Mar 2004 B1
6721805 Bhagwat et al. Apr 2004 B1
6725459 Bacon et al. Apr 2004 B2
6728226 Naito Apr 2004 B1
6731936 Butler et al. May 2004 B2
6735177 Suzuki et al. May 2004 B1
6751218 Hagirahim et al. Jun 2004 B1
6760602 Tangorra et al. Jul 2004 B2
6760752 Liu et al. Jul 2004 B1
6763025 Leatherbury et al. Jul 2004 B2
6765909 Sen et al. Jul 2004 B1
6766024 Rix et al. Jul 2004 B1
6775303 Rustad et al. Aug 2004 B1
6781999 Eyuboglu et al. Aug 2004 B2
6788681 Hurren et al. Sep 2004 B1
6792048 Lee et al. Sep 2004 B1
6798791 Riazi et al. Sep 2004 B1
6801508 Lim et al. Oct 2004 B1
6804520 Johansson et al. Oct 2004 B1
6819930 Laroia et al. Nov 2004 B1
6826406 Vialen et al. Nov 2004 B1
6831910 Moon et al. Dec 2004 B1
6832314 Irvin et al. Dec 2004 B1
6862684 DiGiorgio Mar 2005 B1
6870923 Yi et al. Mar 2005 B2
6879573 Huo et al. Apr 2005 B1
6879690 Faccin et al. Apr 2005 B2
6882850 McConnell et al. Apr 2005 B2
6882860 Kim et al. Apr 2005 B1
6885874 Grube et al. Apr 2005 B2
6895216 Sato et al. May 2005 B2
6898285 Hutchings et al. May 2005 B1
6898640 Kurita et al. May 2005 B1
6915272 Zilliacus et al. Jul 2005 B1
6918035 Patel Jul 2005 B1
6920119 Rinchiuso Jul 2005 B2
6925285 Kim et al. Aug 2005 B2
6944763 Asano et al. Sep 2005 B1
6956833 Yukie et al. Oct 2005 B1
6959384 Serret-Avila Oct 2005 B1
6970689 Khorram Nov 2005 B2
6978143 Vialen Dec 2005 B1
6983410 Chen et al. Jan 2006 B2
6987982 Willenegger et al. Jan 2006 B2
6990680 Wugofski et al. Jan 2006 B1
7016351 Farinacci et al. Mar 2006 B1
7036023 Fries et al. Apr 2006 B2
7039180 Issaa et al. May 2006 B1
7046672 Liao et al. May 2006 B2
7058809 White et al. Jun 2006 B2
7069436 Akachi Jun 2006 B1
7072865 Akiyama et al. Jul 2006 B2
7079502 Yamano et al. Jul 2006 B2
7079523 Nelson, Jr. et al. Jul 2006 B2
7096355 Marvit et al. Aug 2006 B1
7114175 Lahteenmaki Sep 2006 B2
7116892 Wajs Oct 2006 B2
7133353 Sourour et al. Nov 2006 B2
7134019 Shelest et al. Nov 2006 B2
7177424 Furuya et al. Feb 2007 B1
7181620 Hur Feb 2007 B1
7185362 Hawkes et al. Feb 2007 B2
7197072 Hsu et al. Mar 2007 B1
7200230 Knauft et al. Apr 2007 B2
7203314 Kahn et al. Apr 2007 B1
7209459 Kangas et al. Apr 2007 B2
7215775 Noguchi et al. May 2007 B2
7237108 Medvinsky et al. Jun 2007 B2
7239704 Maillard et al. Jul 2007 B1
7266687 Sowa et al. Sep 2007 B2
7278164 Raiz et al. Oct 2007 B2
7280660 Salo et al. Oct 2007 B2
7290063 Kalliokulju et al. Oct 2007 B2
7301968 Haran et al. Nov 2007 B2
7352868 Hawkes et al. Apr 2008 B2
7376963 Kato et al. May 2008 B2
20010004761 Zehavi et al. Jun 2001 A1
20010029581 Knauft et al. Oct 2001 A1
20010036200 Nelson et al. Nov 2001 A1
20010036834 Das et al. Nov 2001 A1
20010055298 Baker et al. Dec 2001 A1
20020001386 Akiyama et al. Jan 2002 A1
20020002541 Williams et al. Jan 2002 A1
20020010681 Hillegass et al. Jan 2002 A1
20020014159 Tatsumi et al. Feb 2002 A1
20020021809 Salo et al. Feb 2002 A1
20020023165 Lahr et al. Feb 2002 A1
20020071558 Patel Jun 2002 A1
20020076195 Nakajima et al. Jun 2002 A1
20020080887 Jeong et al. Jun 2002 A1
20020091860 Kalliokulju et al. Jul 2002 A1
20020091931 Quick, Jr. et al. Jul 2002 A1
20020097722 Liao et al. Jul 2002 A1
20020099949 Fries et al. Jul 2002 A1
20020102964 Park Aug 2002 A1
20020112234 Bacon et al. Aug 2002 A1
20020141591 Hawkes et al. Oct 2002 A1
20020152384 Shelest et al. Oct 2002 A1
20020154781 Sowa et al. Oct 2002 A1
20020164025 Raiz et al. Nov 2002 A1
20020169724 Moroney et al. Nov 2002 A1
20020176408 Kangas et al. Nov 2002 A1
20020181423 Chen et al. Dec 2002 A1
20030009669 White et al. Jan 2003 A1
20030018891 Hall et al. Jan 2003 A1
20030030581 Roy Feb 2003 A1
20030031322 Beckmann et al. Feb 2003 A1
20030035389 Chen et al. Feb 2003 A1
20030039237 Forslow et al. Feb 2003 A1
20030039361 Hawkes et al. Feb 2003 A1
20030054807 Hsu et al. Mar 2003 A1
20030064679 Kim et al. Apr 2003 A1
20030070092 Hawkes et al. Apr 2003 A1
20030072384 Chen et al. Apr 2003 A1
20030087653 Leung et al. May 2003 A1
20030101401 Salvi et al. May 2003 A1
20030123669 Koukoulidis et al. Jul 2003 A1
20030126440 Go et al. Jul 2003 A1
20030134655 Chen et al. Jul 2003 A1
20030135748 Yamada et al. Jul 2003 A1
20030159029 Brown et al. Aug 2003 A1
20030217057 Kuroiwa et al. Nov 2003 A1
20040005860 Kato et al. Jan 2004 A1
20040019787 Shibata Jan 2004 A1
20040022216 Shi Feb 2004 A1
20040095515 Tajima et al. May 2004 A1
20040101138 Revital et al. May 2004 A1
20040107350 Wasilewski et al. Jun 2004 A1
20040120527 Hawkes et al. Jun 2004 A1
20040131185 Kakumer Jul 2004 A1
20040132402 Agashe et al. Jul 2004 A1
20040151317 Hyyppa et al. Aug 2004 A1
20040199474 Ritter Oct 2004 A1
20040202329 Jung et al. Oct 2004 A1
20040243808 Ishiguro et al. Dec 2004 A1
20040266391 Hafren et al. Dec 2004 A1
20050008159 Grilli et al. Jan 2005 A1
20050048963 Kubler et al. Mar 2005 A1
20050055551 Becker et al. Mar 2005 A1
20050063544 Uusitalo et al. Mar 2005 A1
20050108563 Becker et al. May 2005 A1
20050144550 Jeon et al. Jun 2005 A1
20050165711 Hamatsu Jul 2005 A1
20050216731 Saito et al. Sep 2005 A1
20050238315 Kataoka Oct 2005 A1
20050271210 Soppera et al. Dec 2005 A1
20060078000 Rinne et al. Apr 2006 A1
20060168446 Ahonen et al. Jul 2006 A1
20060171540 Lee et al. Aug 2006 A1
20060242412 Jung et al. Oct 2006 A1
20070038610 Omoigui et al. Feb 2007 A1
20070116282 Hawkes et al. May 2007 A1
20070214482 Nguyen et al. Sep 2007 A1
20070280169 Cam Winget Dec 2007 A1
Foreign Referenced Citations (203)
Number Date Country
1281561 Jan 2001 CN
0636963 Feb 1995 EP
0702477 Mar 1996 EP
0748058 Dec 1996 EP
0813309 Dec 1997 EP
0854618 Jul 1998 EP
0924898 Jun 1999 EP
0928084 Jul 1999 EP
0951198 Oct 1999 EP
0993128 Apr 2000 EP
0999656 May 2000 EP
1001570 May 2000 EP
1024661 Aug 2000 EP
1030484 Aug 2000 EP
1032150 Aug 2000 EP
1071296 Jan 2001 EP
1075118 Feb 2001 EP
1075123 Feb 2001 EP
1098446 May 2001 EP
1117204 Jul 2001 EP
1134951 Sep 2001 EP
1143635 Oct 2001 EP
1185125 Mar 2002 EP
1190526 Mar 2002 EP
1213943 Jun 2002 EP
1248188 Oct 2002 EP
1374477 Jan 2004 EP
2204940 Jul 2010 EP
2346512 Aug 2000 GB
1101042 Apr 1989 JP
02090840 Mar 1990 JP
03179841 May 1991 JP
5216411 Aug 1993 JP
06125554 May 1994 JP
7115414 May 1995 JP
7193569 Jul 1995 JP
7288798 Oct 1995 JP
9135478 May 1997 JP
10023529 Jan 1998 JP
10051380 Feb 1998 JP
10063598 Mar 1998 JP
10093547 Apr 1998 JP
10093547 Apr 1998 JP
10191459 Jul 1998 JP
10200536 Jul 1998 JP
10214233 Aug 1998 JP
10240826 Nov 1998 JP
10512428 Nov 1998 JP
11127468 May 1999 JP
11136669 May 1999 JP
11161167 Jun 1999 JP
11243569 Sep 1999 JP
11510668 Sep 1999 JP
11313059 Nov 1999 JP
11331070 Nov 1999 JP
11331150 Nov 1999 JP
11513853 Nov 1999 JP
11355460 Dec 1999 JP
11355858 Dec 1999 JP
2000078555 Mar 2000 JP
2000115860 Apr 2000 JP
2000134193 May 2000 JP
2000137551 May 2000 JP
2000165258 Jun 2000 JP
2000196546 Jul 2000 JP
2000196673 Jul 2000 JP
2000244603 Sep 2000 JP
2000253459 Sep 2000 JP
2000261374 Sep 2000 JP
2000269959 Sep 2000 JP
2000511733 Sep 2000 JP
000513519 Oct 2000 JP
2000287192 Oct 2000 JP
2000295541 Oct 2000 JP
2000324155 Nov 2000 JP
2001007800 Jan 2001 JP
2001016253 Jan 2001 JP
2001500327 Jan 2001 JP
200136941 Feb 2001 JP
2001036466 Feb 2001 JP
2001045100 Feb 2001 JP
2001053675 Feb 2001 JP
2001077859 Mar 2001 JP
2001119340 Apr 2001 JP
2001134193 May 2001 JP
2001136507 May 2001 JP
2001177513 Jun 2001 JP
2001177523 Jun 2001 JP
2001177564 Jun 2001 JP
2001512842 Aug 2001 JP
2001513587 Sep 2001 JP
2001333032 Nov 2001 JP
2001522164 Nov 2001 JP
2002026835 Jan 2002 JP
2002027417 Jan 2002 JP
2002064785 Feb 2002 JP
2002505458 Feb 2002 JP
2002506296 Feb 2002 JP
2002084470 Mar 2002 JP
2002152194 May 2002 JP
2002514024 May 2002 JP
2002175505 Jun 2002 JP
2002521879 Jul 2002 JP
2002216040 Aug 2002 JP
2002217894 Aug 2002 JP
2002232418 Aug 2002 JP
2002232962 Aug 2002 JP
2002300152 Oct 2002 JP
2002319936 Oct 2002 JP
2002541685 Dec 2002 JP
2003503896 Jan 2003 JP
200352029 Feb 2003 JP
2003099327 Apr 2003 JP
2003115832 Apr 2003 JP
2003124927 Apr 2003 JP
2003521843 Jul 2003 JP
2003259284 Sep 2003 JP
2003297015 Oct 2003 JP
2003529963 Oct 2003 JP
2003339000 Nov 2003 JP
2004048718 Feb 2004 JP
200480663 Mar 2004 JP
2004532554 Oct 2004 JP
2004533174 Oct 2004 JP
2004343764 Dec 2004 JP
2005509367 Apr 2005 JP
2005512471 Apr 2005 JP
20000062153 Oct 2000 KR
200130725 Apr 2001 KR
20010030696 Apr 2001 KR
2073913 Feb 1997 RU
2077113 Apr 1997 RU
2091983 Sep 1997 RU
2115249 Jul 1998 RU
2147792 Apr 2000 RU
2187205 Aug 2002 RU
353841 Mar 1999 TW
373372 Nov 1999 TW
388158 Apr 2000 TW
420910 Feb 2001 TW
448658 Aug 2001 TW
502190 Sep 2002 TW
508958 Nov 2002 TW
WO8607224 Dec 1986 WO
WO9611538 Apr 1996 WO
WO9715161 Apr 1997 WO
WO9716890 May 1997 WO
WO9717790 May 1997 WO
WO9748212 Dec 1997 WO
WO97047094 Dec 1997 WO
WO9810604 Mar 1998 WO
WO9825422 Jun 1998 WO
WO9857509 Dec 1998 WO
WO9922478 May 1999 WO
WO99022466 May 1999 WO
WO9930234 Jun 1999 WO
WO9944114 Sep 1999 WO
WO9949595 Sep 1999 WO
WO9959355 Nov 1999 WO
WO9962231 Dec 1999 WO
WO9966657 Dec 1999 WO
WO0002406 Jan 2000 WO
WO0004718 Jan 2000 WO
WO0008883 Feb 2000 WO
WO0013356 Mar 2000 WO
WO0033535 Jun 2000 WO
WO0036804 Jun 2000 WO
WO0051308 Aug 2000 WO
WO2000048358 Aug 2000 WO
WO0052880 Sep 2000 WO
WO0056018 Sep 2000 WO
WO0057601 Sep 2000 WO
WO0062476 Oct 2000 WO
WO0062547 Oct 2000 WO
WO00072609 Nov 2000 WO
WO00074311 Dec 2000 WO
WO0074425 Dec 2000 WO
WO0076125 Dec 2000 WO
WO0078008 Dec 2000 WO
WO0079734 Dec 2000 WO
WO0101630 Jan 2001 WO
WO0110146 Feb 2001 WO
WO2001013358 Feb 2001 WO
WO0117163 Mar 2001 WO
WO0119027 Mar 2001 WO
WO01020805 Mar 2001 WO
WO0145443 Jun 2001 WO
WO01050783 Jul 2001 WO
WO01056232 Aug 2001 WO
WO2002008449 Jan 2002 WO
WO0247407 Jun 2002 WO
WO2002047356 Jun 2002 WO
WO02054663 Jul 2002 WO
WO02061572 Aug 2002 WO
WO02080449 Oct 2002 WO
WO02080454 Oct 2002 WO
WO02096150 Nov 2002 WO
WO03001772 Mar 2003 WO
WO03032573 Apr 2003 WO
WO03051072 Jun 2003 WO
WO03063418 Jul 2003 WO
WO2004025895 Mar 2004 WO
WO2005008393 Jan 2005 WO
Related Publications (1)
Number Date Country
20050008159 A1 Jan 2005 US