Method and apparatus for providing authenticated challenges for broadcast-multicast communications in a communication system

Information

  • Patent Grant
  • 8724803
  • Patent Number
    8,724,803
  • Date Filed
    Wednesday, September 1, 2004
    20 years ago
  • Date Issued
    Tuesday, May 13, 2014
    10 years ago
Abstract
A method and apparatus for secure generation of a short-term key SK for viewing information content in a Multicast-broadcast-multimedia system are described. A short-term key is generated by a memory module residing in user equipment (UE) only when the source of the information used to generate the short-term key can be validated. A short-term key can be generated by a Broadcast Access Key (BAK) or a derivative of BAK and a changing value with a Message Authentication Code (MAC) appended to the changing value. A short-term key (SK) can also be generated by using a private key and a short-term key (SK) manager with a corresponding public key distributed to the memory module residing in the user equipment (UE), using a digital signature.
Description
BACKGROUND

1. Field


The present invention relates generally to communications, and, more specifically, to a method and apparatus for providing authenticated challenges for broadcast-multicast services (BCMCS) in a wireless communication system.


2. Description


In a wireless communication system that 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 to a plurality of mobile stations within the coverage area of the base station. The multimedia traffic service may include any number of information services similar to a number of channels included in a cable television service plan, for example. These information services typically rely upon security to maintain accountability, fairness, accuracy, confidentiality, and operability. Encryption, or the general field of cryptography, is used in electronic commerce, wireless communications, and broadcasting. In electronic commerce, encryption is used to prevent fraud and verify financial transactions. In data processing systems, encryption is used to verify a participant's identity. In broadcast-multicast service, security is maintained based on the broadcast-multicast service (BCMCS) key hierarchy. Content is encrypted with a short term key (SK) and is sent over the air. A long-term encryption key, often referred to as a broadcast access key (BAK), is provisioned into a memory module referred to as a user identification module (UIM) or universal integrated circuit card (UICC) of the mobile station. The user may be charged for the long-term encryption key BAK. The short-term key SK is derived from the BAK and a random number referred to as SKRAND. The UIM uses the BAK and the SKRAND to compute the short-term key SK. Once the UIM computes the SK, it is sent to the mobile station and the mobile station uses the SK to decrypt and view the information content. Typically, information content charging based on this method charges the user upon receipt of the BAK. Thus, the user is charged whether or not the user actually views the broadcast content. Unlike cable television, in a wireless communication system, it is desired that the actual view time of information services by a user be maintained. This is to ensure accurate billing for the content viewed and to ensure that unauthorized users, such as under-age users, for example, cannot access certain types of content. Methods that require the mobile station to register periodically or on demand have been proposed to maintain a record of actual view time by the user.


The registration message contains a list of channels the user is watching or is capable of watching. The list is used to charge the user for information services.


Typically, the methods requiring the user to register periodically or on demand are prone to theft-of-service because the mobile station may continue to receive the broadcast content without registering again in the system, thus obtaining free access to the content. In addition, an unauthorized user, such as an under-age user, for example, may access content that is prohibited by regulatory statute. Other proposed methods introduce additional encryption keys necessary to view the content of the information services. These methods suffer from a severe decrease in data-carrying capacity of the wireless system caused by the increase in overhead messages required for encryption key management.


The present invention is directed to overcoming, or at least reducing the effects of, one or more problems provided above.


SUMMARY

According to one aspect, in a wireless communication system providing authenticated challenges for broadcast-multicast services, a method for receiving a first value and a first message authentication code, generating a second message authentication code of the first value by running a hashing function on the first value using a second value wherein the second value is stored in a memory module as a second key, comparing the second message authentication code with the first message authentication code, and computing the short-term key using the first value and the second value when the second message authentication code is equal to the first message authentication code.


In another aspect, a method of obtaining an encryption key in a communication system using a first protocol, the method comprising: receiving a packet index value and a first message authentication code, generating a second message authentication code of the packet index value by running a hashing function on the packet index value using a second value wherein the second value is stored in a memory module, comparing the second message authentication code with the first message authentication code, and computing an encryption key using the packet index value and the second value when the second message authentication code is equal to the first message authentication code.


In another aspect, a mobile station apparatus for obtaining a short-term key comprising: a means for receiving a first value and a first message authentication code, a means for generating a second message authentication code of the first value by running a hashing function on the first value using a second value wherein the second value is stored in a memory module, a means for comparing the second message authentication code with the first message authentication code, and a means for computing a short-term key using the first value and the second value when the second message authentication code is equal to the first message authentication code.


In another aspect, A mobile station apparatus for of obtaining an encryption key using a first protocol, comprising: a means for receiving a packet index value and a first message authentication code a means for generating a second message authentication code of the packet index value by running a hashing function on the packet index value using a second value wherein the second value is stored in a memory module as, a means for comparing the second message authentication code with the first message authentication code, and a means for computing an encryption key using the packet index value and the second value when the generated message authentication code is equal to the received message authentication code.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is an exemplary block diagram illustrating a wireless communication system providing a broadcast-multicast communication service (BCMCS) according to one embodiment;



FIG. 2 is an exemplary block diagram for short-term key (SK) generation in a user equipment using a random number according to one embodiment;



FIG. 3 is an exemplary block diagram for short-term key (SK) generation in a user equipment using a seed value (SKSeed) with a message authentication code appended thereto according to one embodiment;



FIG. 4 is an exemplary flow diagram for short-term key (SK) generation using a seed value (SKSeed) with a message authentication code appended thereto according to one embodiment;



FIG. 5 is an exemplary block diagram for short-term key (SK) generation with an SK Manager having a private key for which a corresponding public key is distributed to the user equipment according to one embodiment;



FIG. 6 is an exemplary block diagram for encryption key (EK) generation in a user equipment using a packet index seed value (PISeed) with a message authentication code appended thereto according to one embodiment;



FIG. 7 is an exemplary flow diagram for encryption key (EK) generation using a packet index seed value (PISeed) with a message authentication code appended thereto according to one embodiment; and



FIG. 8 is an exemplary block diagram for encryption key (EK) generation with a PI Manager having a private key for which a corresponding public key is distributed to the user equipment according to one embodiment.





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 referred to as a 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 or, as described herein, a broadcast-multicast service (BCMCS) controller (also referred to as a multicast-broadcast-multimedia system (MBMS) controller in 3GPP). Base stations and base station controllers are parts of a network called an access network (AN). Base stations and mobile stations are parts of a network called a radio access network (RAN). The radio access network transports data packets between multiple mobile stations. The radio access network may further be connected to additional networks, such as an Authentication, Authorization, and Accounting (AAA) server or the Internet, for example, and may transport data packets between each mobile station and such outside networks through the base station controller or a BCMCS controller.


The BCMCS controller transports data through a short-term key manager (SK-manager). The SK-manager determines seed values, which may be a random number, a sequence number, time stamp, or other changing value that is convenient for implementation. Once the SK-manager determines a seed value (SKSeed), it appends a message authentication code (MAC) to the seed value. The message authentication code (MAC) is a digital identifier and works like a digital signature to validate the source of the seed value. The MAC may be created by using a well known hashing function, such as SHA-1 or MD-5, for example, or the MAC may be generated by a variation of well known hashing functions. The hashing function uses the broadcast access key (BAK) (or a derivative of BAK) as the key to compute the MAC from a seed value. Because only the broadcast network and the subscribers to the broadcast network have the broadcast access key (BAK), the BAK (or a derivative of BAK) is used as the shared secret between the network and the user.


The mobile station (user equipment (UE)) may be a mobile telephone that includes a mobile telephone handset (referred to as a mobile equipment (ME)), and a memory module, such as a physically secure integrated circuit card or smart card (referred to as a user identification module (UIM) or universal integrated circuit card (UICC)), which may be removable or permanently attached to the mobile equipment ME. In a broadcast-multicast service (BCMCS), the memory module of the user equipment is provisioned with the broadcast access key (BAK).



FIG. 1 is an exemplary block diagram illustrating a wireless communication system 100 for providing authenticated challenges in a broadcast-multicast communication service (BCMCS) according to one embodiment of the present invention. The wireless communication system 100 comprises a plurality of user equipments (UE) 102 that communicate with at least one base station (BS) 112 over a wireless communication link. Communication from the user equipment 102 to the base station 112 is performed over a reverse link and communication from the base station 112 to the user equipment 102 is performed over a forward link over the wireless communication link. Although only one base station 112 is illustrated in the figure, this is merely for simplicity sake in illustrating the present invention. Accordingly, the wireless communication system 100 may include several base stations 112 that are geographically dispersed to provide continuous communication coverage with the user equipments 102 as they traverse the wireless communication system 100. A radio access network 116, through the base station 112, transmits radio signals to and receives radio signals from the user equipment 102 over the wireless communication link. The radio access network 116 may either be owned by the wireless carrier that provides subscription service to the user equipment 102, or may be a visited network owned by another carrier that provides service to the user equipment 102 while the user equipment 102 is roaming.


The user equipment 102 may take the form of any device that is capable of receiving information from the base station 102, including a personal digital assistant (PDA), wireless telephone, laptop computer with wireless capability, wireless modem, or any other wireless-capable device. The user equipment 102 includes mobile equipment (ME) 110, which provides communication with the base station 112 over the wireless communication link among various other functions. The user equipment 102 further includes a memory module (MM) 108 (referred to as a user identification module (UIM) or Universal Integrated Circuit Card (UICC)). The MM 108 may be either a removable memory module attached to the mobile equipment 110 or a permanent part of the mobile equipment 110. The functionality of the memory module 108 will be further appreciated as the detailed description proceeds.


According to one embodiment, the wireless communication system 100 employs a Broadcast-Multicast Service (BCMCS) for point-to-multipoint transmission of data packets to a predetermined group of user equipment 102 communicating within the wireless communication system 100. In one embodiment, the data packets provide content such as, for example, news, movies, sporting events, and the like that is transmitted from the base station 112 over the wireless communication link to the user equipment 102. It will be appreciated that the specific type of content transmitted to the user equipment 102 may include a wide array of multi-media data (e.g., text, audio, picture, streaming video, etc.), and, thus, need not necessarily be limited by the aforementioned examples.


The wireless communication system 100 further comprises a home service network 114 that is owned by the wireless carrier that provides subscription service to a user of the user equipment 102, and may or may not be owned by the same carrier as that of the radio access network 116 (depending upon whether the user equipment 102 is roaming outside the service area of the carrier). The home service network 114 includes a broadcast-multicast-service (BCMCS) controller 101, a short-term key SK-manager 106, and a home subscriber server (HSS) 104. Communication link 118 provides a data path on which information-bearing signals are carried from the BCMCS controller 101 to the SK-manager 106. Communication link 120 provides a data path from the SK-manager 106 to the base station 112, which is then broadcast/multicast to the plurality of user equipments 102.


Content provider 122 provides the content that is broadcast/multicast to the user equipment 102. The content provider 122 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 104 in the home service network 114 may include a database for holding mobile telephone subscription and collecting billing data for broadcast-multicast services. In the illustrated embodiment, the home service network 114 also includes the broadcast-multicast service (BCMCS) controller 101, which schedules broadcasting/multicasting of content from content provider 122 and performs at least some security functions for the broadcast-multicast service. The radio access network 116 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.


Broadcast-multicast service (BCMCS) (or multicast-broadcast-multimedia system (MBMS)) content viewing is based on a key hierarchy. The BCMCS or MBMS may use the same key hierarchy, and the terms are used depending on the context in which they are used (e.g., MBMS is often used when referring to broadcast services in a 3GPP network). Content viewing may require monitoring for billing or for regulatory issues, such as “adult” services, for example, that require a content provider to ensure the viewer is allowed to view “adult” services. For example, a content viewer of “adult” services may be required to verify that they are of a minimum age, determined by a regulator, to view such content. A key is a value that works with a cryptographic algorithm to produce specific ciphertext. Keys are usually very large numbers and are measured in bits. To decrypt the broadcast content at a particular time, the ME 110 of the user equipment should know the current decryption key. To avoid unauthorized access or theft-of-service, the decryption key should be changed frequently, for example, once every minute. These decryption keys are referred to as short-term keys (SK), and are used to decrypt the broadcast content for a relatively short-amount of time so the SK may be assumed to have some amount of intrinsic monetary value for a user.


In one embodiment, the content of the multimedia event is encrypted and decrypted in the broadcast-multicast 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. Communication link 118 is used by the BCMCS controller 101 to transport the broadcast access key BAK to the SK-manager 106. The SK-manager 106 determines a value, SKSeed, and appends a message authentication code (MAC), formed from SKSeed and the shared secret, BAK. SKSeed can be a random number, a sequence number, time stamp or other changing value. The challenge SKSeed∥MAC is then transmitted to the user equipment 102 via the radio access network 116. The user equipment 102, upon receiving this challenge in the memory module 108, first computes XMAC from SKSeed and BAK. XMAC is the message authentication code of the seed value derived by running a hashing function, using BAK or a derivative of BAK as the key. The memory module 108 then compares XMAC with the received MAC. If the computed value of XMAC is the same value as the received MAC, then the memory module generates SK and transmits SK to the ME. Thus, if these functions are implemented in sufficiently secure hardware (such as a smart card, for example) protecting the BAK (or keys derived from the BAK) substantially prevent an unauthorized user to pre-compute the short-term SK even with the full knowledge of the stream of SKSeed.



FIG. 2 is an exemplary block diagram for short-term key SK generation at the user equipment 102 using a random number. A function, such as a hashing function, in the memory module 108 computes the short-term key SK with any random number input 201 from the ME 110. All broadcast subscribers have the broadcast access key BAK provisioned in the memory module 108. Since the short-term key SK 202 is a function of the random number 201 and the BAK, any random number input will generate the short-term key (SK) 202. Thus, in this scenario, a subscriber with the BAK provisioned in the memory module 108 may input any range of random numbers 201 to the memory module 108 and generate values of the short-term key SK 202. The subscriber may then publish or distribute these values of the short-term key SK 202, for example on the internet, and unauthorized users can use these SK values to view content.



FIG. 3 is an exemplary block diagram for short-term key SK generation at the user equipment 102 using a seed value (SKSeed) with a Message Authentication Code (MAC) 304 appended thereto. The user equipment 102 of a BCMCS subscriber has a memory module 108 provisioned with the broadcast access key BAK. In this embodiment, memory module 108 also contains a hashing function. The hashing function can be a well know hashing function such as SHA-1 or MD-5 or a variation of a well known hashing function. The memory module 108 computes XMAC, the generated message authentication code, of the seed value SKSeed by running a hashing function using the BAK (or a derivative of BAK) as the key. The memory module 108 then compares the computed XMAC with the appended MAC. If XMAC and MAC are the same value, the memory module 108 generates a short-term (SK) 202 key, and transmits SK 202 to the mobile equipment (ME) 110. The ME 110 can now view content. In this scenario SK cannot be generated without validating the source of SK. Thus, this scenario prevents unauthorized users from viewing information content. Thus, unlike the method in FIG. 2, an unauthorized user cannot retrieve the value of SK because, SK can only be generated by validating the source of SK. A method for generating the short-term key SK in accordance with one embodiment for decrypting received content at a user equipment 102 is illustrated in FIG. 4. The short-term key SK generation process 400 commences at block 402 where the memory module 108 of the user equipment 102 receives a seed value SKSeed appended with a Message Authentication Code. At block 404 the memory module 108 computes a message authentication code (XMAC) of the seed value (SKSeed) by running a hashing function using the BAK (or a derivative of BAK) as the key. Keeping in mind that BAK is provisioned in the memory module (108), and the Seed value can be generated by the SK manager or the BCMCS controller. The hashing function resides in the memory module. At block 406, the memory module 108 compares the computed XMAC with the received MAC. The memory module 108 then determines if the values of XMAC and MAC are equal at block 408. If the values are equal, the memory module 108 knows the source of the seed value, SKSeed, is trusted because it has the shared secret BAK. Once the memory module 108 determines the source of SKSeed is trusted, it generates the short-term key SK and transmits the SK to the ME 110 at block 412. The ME 108 can now use the short-term key SK to decrypt the received content to allow successful viewing of the content by the user of the user equipment 102. If, however, the computed value of XMAC and the received value of MAC are not equal at block 408, the SKSeed is discarded and the process starts again at block 402.


In another embodiment, shown in FIG. 5, The SK manager 106 determines a seed value (SKSeed) and appends a digital signature that is verified by the memory module 108. In this particular embodiment, the SK manager 106 has a private key 504 and the memory module 108 has the corresponding public key 506. This public approach could make use of well known digital signatures such as Rivest-Shamir-Adleman (RSA), The Digital Signature Algorithm, DSA, Elliptic Curve DSA, or other well known signatures. The SK manager 106 determines a seed value (SKSeed) and appends a digital signature formed from the private key 504 in the SK manager 106. The challenge SKSeed∥Digital signature is then transmitted to the memory module 108. The ME 110 receives this challenge through the base station 112 and passes the SKSeed and Digital signature 508 to the memory module 108 of the user equipment 102. The memory module 108 uses the public key, by using RSA, the Digital Signature Algorithm DSA, Elliptic Curve DSA or other well known or not known signature schemes to verify the signature transmitted from the SK manager through base station 112, through the ME 110 to the memory module 108. In the memory module 108, the public key 506 is used to verify the digital signature by using the public key 506 and the appended private key 504. If the memory module 108 determines the digital signature was created by the SK manager 106, the memory module 108 generates the short-term key SK 202 and transmits the SK 202 to the ME 110. Upon successfully generating the short-term key SK 202, the ME 110 permits the user to view the received information content. If the memory module 108 determines the digital signature may not have been created by the SK manager 106, the memory module 108 discards the signature and waits for the next digital signature, and the ME 110 cannot determine or publish the SK value corresponding to this SKSeed. This prevents pre-computation of SK and helps to protect information content from unauthorized access.


In another embodiment, the same method and apparatus is used as an enhancement in the Secure Real-time Transport Protocol (SRTP). Reference SRTP draft 09, which expires December 2003 describes this protocol. A Master Key (MK) is treated like the shared secret BAK. Each MK has an index similar to the index in the BAK. The index identifies a specific content. The MK resides in the memory module 108, and when used with the packet index generates a short-term key (SK). The packet index in the SRTP is typically a sequence number, and in this context may be considered like SKSeed, which is taken to be a random number, a sequence number, time stamp or other changing value. The MK and the packet index are used to generate a SRTP encryption key (EK). This encryption key, like SK, is used to view or access content. Thus, the packet index must be secure to prevent unauthorized access or theft of content. The packet index can be protected in the same manner as the seed value (SKSeed) with an appended Message Authentication Code (MAC) as is used to protect SK. By appending a Message Authentication Code (MAC) to the packet index, the memory module 108 will know whether or not the packet index came from the intended, trusted, source. The memory module 108 handles this process in the same manner used to generate SK. As well as generating encryption keys, SRTP specifies further keys may be generated from the master key MK in an analogous manner to perform other functions including message authentication, and the security enhancements to the encryption key, detailed above, apply equally to other keys so generated.



FIG. 6 is an exemplary block diagram of Encryption Key (EK) generation using a packet index value (PI) with a Message Authentication Code (MAC) appended thereto 602. The User Equipment (UE) 102 of any broadcast subscriber has a memory module 108 provisioned with the MK. In this embodiment, memory module 108 also contains a hashing function. The hashing function can be a well know hashing function such as SHA-1 or MD-5 or a variation of a well known hashing function. The memory module 108 computes XMAC of the packet index value PI by running a hashing function using MK or a derivative of MK as the key. The memory module 108 then compares the computed XMAC with the appended MAC. If XMAC and MAC are the same value, the memory module 108 generates an encryption key (EK) 604 key and transmits EK 604 to the mobile equipment (ME) 110. The ME 110, upon successful generation of the EK 604, may now view the content by using EK 604 to decrypt the received encrypted content. In this scenario, EK 604 cannot be generated without validating the source of EK 604. Thus, this scenario prevents unauthorized users from viewing or accessing information content.



FIG. 7 illustrates the SRTP encryption key generation process 700 wherein the memory module 108 receives an packet index value PI appended with a Message Authentication Code at block 702. At block 704 the memory module 108 computes a message authentication code (XMAC) of the packet index value (PI) by running a hashing function using MK or a derivative of MK as the key. All broadcast subscribers have MK provisioned in the memory module 108. At block 706, the memory module 108 compares the computed XMAC with the received MAC. The memory module 108 determines if the values of XMAC and MAC are equal at block 708. If the values are equal, the memory module 108 knows the source of the packet index value (PI) is trusted because it has the shared secret MK. Once the memory module 108 determines the source of PI is trusted it generates an encryption key (EK) 604 and transmits the encryption key EK 604 to the ME 110 at block 712. The ME 110 can now view content upon successful generation of the EK 604. If XMAC and MAC are not equal at block 708, the PI is discarded and the process starts again at block 702.


In another embodiment, the packet index can be protected by using the packet index appended with a digital signature. In this embodiment, shown in FIG. 8, the Packet Index (PI) manager 802 determines a packet index value (PI) and appends a digital signature which will be verified by the memory module 108. In this embodiment, the PI manager 802 has a private key 504 and the memory module 108 has the corresponding public key 506. This public approach could make use of well known digital signatures such as Rivest-Shamir-Adleman (RSA), The Digital Signature Algorithm, DSA, Elliptic Curve DSA, or other well know signatures. The PI manager 802 determines a packet index value (PI) and appends a digital signature formed from the private key 504 in the PI manager 802. The challenge PI∥Digital signature is then transmitted. The ME 110 receives this challenge through the base station 112 and passes the PI and Digital Signature 804 to the memory module 108. The memory module 108 uses the public key, by using RSA, the Digital Signature Algorithm DSA, Elliptic Curve DSA or other well known or not known signature schemes to verify the signature transmitted from the PI manager 802 through the base station 112, through the ME 110 to the memory module 108. In the memory module 108, the public key 506 is used to verify the digital signature by using the public key 506 and the appended private key 504. If the memory module 108 determines the digital signature was created by the PI manager 802, the memory module 108 generates an Encryption Key (EK) 604 and transmits EK 604 to the ME 110. The ME 110 can now view information content upon successful generation of the EK 604. If the memory module 108 determines the digital signature may not have been created by the PI manager 802, the memory module 108 discards the signature and waits for the next digital signature, and the ME 110 cannot determine or publish the EK 604 value corresponding to this PI. This prevents pre-computation of the packet index and helps to protect information content from unauthorized access.


The embodiments related to SRTP also provide the additional security of protecting against the unauthorized generation of authentication and salting keys. This is similar to protecting against pre-computation of SK in a BCMCS/MBMS. Also, in SRTP, once the service provider deploys the same Master Key (MK) to the secure memory module 108 in a plurality of end-users, the end user can masquerade as the service provider. This is because any end user who has MK provisioned in the secure memory module 108 could use the secure memory module 108 to encrypt and add authentication to data. The embodiments described above prevent this scenario because the PI manager 802, by using a MAC or digital signature, ensures encryption key generation can only take place when the source of the packet index is verified as a trusted source.


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 RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.


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 securely obtaining a short-term key for accessing content using a mobile station in a communication system for point-to-multipoint transmission of content to mobile stations, the method comprising: receiving a first value and a first digital signature from a short-term key manager of the communication system for point-to-multipoint transmission of content to mobile stations, wherein the first digital signature is formed from a private key;verifying the first digital signature using a signature scheme based on the private key and a public key, wherein the public key is stored in a first secure memory of a receiving mobile station and the signature scheme is stored in the first secure memory, and wherein the public key stored in the secure memory is not accessible to a mobile equipment of the receiving mobile station;determining that a source of the first digital signature is the short-term key manager; andcomputing the short-term key using the first value and the public key provided that the short-term key manager is determined to have been the source of the first digital signature, wherein the mobile equipment accesses the content using the short-term key.
  • 2. The method of claim 1, wherein the first value is determined by the short-term key manager.
  • 3. The method of claim 1, wherein the first value includes a time stamp.
  • 4. The method of claim 1, further comprising transmitting the computed short-term key from the secure memory to the mobile equipment.
  • 5. A method of obtaining an encryption key in a communication system for point-to-multipoint transmission of content to mobile stations, the method comprising: receiving a packet index value and a first digital signature from a short-term key manager of the communication system for point-to-multipoint transmission of content to mobile stations, wherein the first digital signature is formed from a private key;verifying the first digital signature using a signature scheme based on the private key and a public key, wherein the public key is stored in a first secure memory of a receiving mobile station and the signature scheme is stored in the first secure memory, and wherein the public key stored in the secure memory is not accessible to a mobile equipment of the receiving mobile station;determining that a source of the digital signature is the short-term key manager; andcomputing an encryption key using the packet index value and the public key provided that the short-term key manager is determined to have been the source of the first digital signature, wherein the mobile equipment accesses the content using the encryption key.
  • 6. The method of claim 5, wherein the packet index value includes a sequence number.
  • 7. The method of claim 5, further comprising transmitting the encryption key to the mobile equipment.
  • 8. An integrated circuit, comprising: means for verifying a first digital signature using a signature scheme based on a private key and a public key, wherein the public key is stored in a first secure memory of the integrated circuit and the signature scheme is stored in the first secure memory, wherein the first digital signature is provided by a short-term key manager of a communication system for point-to-multipoint transmission of content to mobile stations, wherein the digital signature is formed using the private key, and wherein the public key stored in the secure memory is not accessible to a mobile equipment of the integrated circuit;means for determining that a source of the first digital signature is the short-term key manager; andmeans for computing a short-term key using a first value and the public key provided that the short-term key manager is determined to have been the source of the first digital signature, wherein the first value is provided by the short-term key manager, and wherein the mobile equipment accesses the content using the short-term key.
  • 9. The integrated circuit of claim 8, wherein the first value is determined by the short-term key manager.
  • 10. The integrated circuit of claim 8, wherein the first value includes a time stamp.
  • 11. A mobile station, comprising: means for receiving a first value and a first digital signature from a short-term key manager of a communication system for point-to-multipoint transmission of content to mobile stations, wherein the first digital signature is formed from a private key;means for verifying the first digital signature using a signature scheme based on the private key and a public key;means for storing the public key in a first secure memory of the mobile station, wherein the public key stored in the secure memory is not accessible to a mobile equipment of the mobile station;means for storing the signature scheme in the first secure memory;means for determining that a source of the first digital signature is the short-term key manager; andmeans for computing a short-term key using the first value and the public key provided that the short-term key manager is determined to have been the source of the first digital signature, wherein the mobile equipment accesses the content using the short-term key.
  • 12. The mobile station of claim 11, wherein the first value is determined by the short-term key manager.
  • 13. The mobile station of claim 11, wherein the first value includes a time stamp.
  • 14. A non-transitory computer readable medium embodying a method for securely obtaining a short-term key for accessing content using a mobile station in a communication system for point-to-multipoint transmission of content to mobile stations, the method comprising: receiving a first value and a first digital signature from a short-term key manager of the communication system for point-to-multipoint transmission of content to mobile stations, wherein the first digital signature is formed from a private key;verifying the first digital signature using a signature scheme based on the private key and a public key, wherein the public key is stored in a first secure memory of a receiving mobile station and the signature scheme is stored in the first secure memory, and wherein the public key stored in the secure memory is not accessible to a mobile equipment of the receiving mobile station;determining that a source of the first digital signature is the short-term key manager; andcomputing the short-term key using the first value and the public key provided that the short-term key manager is determined to have been the source of the first digital signature, wherein the mobile equipment accesses the content using the short-term key.
  • 15. The non-transitory computer readable medium of claim 14, wherein the first value includes a time stamp.
  • 16. An integrated circuit, comprising: means for verifying a first digital signature using a signature scheme based on a private key and a public key, wherein the public key is stored in a first secure memory of the integrated circuit and the signature scheme is stored in a first secure memory, wherein the first digital signature is provided by a short-term key manager of a communication system for point-to-multipoint transmission of content to mobile stations, wherein the first digital signature is formed from the private key; and wherein the public key stored in the secure memory is not accessible to a mobile equipment of the integrated circuit;means for determining that a source of the digital signature is the short-term key manager; andmeans for computing an encryption key using a packet index value and the public key provided that the short-term key manager is determined to have been the source of the first digital signature, wherein the packet index value is provided by the short-term key manager, and wherein the mobile equipment accesses the content using the encryption key.
  • 17. The integrated circuit of claim 16, wherein the packet index value includes a sequence number.
  • 18. A mobile station, comprising: means for receiving a packet index value and a first digital signature from a short-term key manager of a communication system for point-to-multipoint transmission of content to mobile stations, wherein the first digital signature is formed from a private key;means for verifying the first digital signature using a signature scheme based on the private key and a public key;means for storing the public key in a first secure memory of the mobile station, wherein the public key stored in the first secure memory is not accessible to a mobile equipment of the mobile station;means for storing the signature scheme in the first secure memory;means for determining that a source of the first digital signature is the short-term key manager; andmeans for computing an encryption key using the packet index value and the public key provided that the short-term key manager is determined to have been the source of the first digital signature, wherein the mobile equipment accesses the content using the encryption key.
  • 19. The mobile station of claim 18, wherein the packet index value includes a sequence number.
  • 20. A non-transitory computer readable medium embodying a method for obtaining an encryption key in a communication system for point-to-multipoint transmission of content to mobile stations, the method comprising: receiving a packet index value and a first digital signature from a short-term key manager of the communication system for point-to-multipoint transmission of content to mobile stations, wherein the first digital signature is formed from a private key;verifying the first digital signature using a signature scheme based on the private key and a public key, wherein the public key is stored in a first secure memory of a receiving mobile station and the signature scheme is stored in the first secure memory, and wherein the public key stored in the secure memory is not accessible to a mobile equipment of the receiving mobile station;determining that a source of the digital signature is the short-term key manager; andcomputing an encryption key using the packet index value and the public key provided that the short-term key manager is determined to have been the source of the first digital signature, wherein the mobile equipment accesses the content using the encryption key.
  • 21. The non-transitory computer readable medium of claim 20, wherein the packet index value includes a sequence number.
  • 22. A mobile station, comprising: a mobile equipment configured to: receive a packet index value and a first digital signature from a short-term key manager of a communication system for point-to-multipoint transmission of content to mobile stations, wherein the first digital signature is formed from a private key, andaccess the content using an encryption key; and a memory module configured to:verify the first digital signature using a signature scheme based on the private key and a public key,store the public key, wherein the public key stored in the memory module is not accessible to the mobile equipment of the mobile station,store the signature scheme,determine that a source of the first digital signature is the short-term key manager, andcompute the encryption key using the packet index value and the public key provided that the short-term key manager is determined to have been the source of the first digital signature.
  • 23. The mobile station of claim 22, wherein the packet index value includes a sequence number.
  • 24. A mobile station, comprising: a mobile equipment configured to:receive a first value and a first digital signature from a short-term key manager of a communication system for point-to-multipoint transmission of content to mobile stations, wherein the first digital signature is formed from a private key, andaccess the content using a short-term key; and a memory module configured to:verify the first digital signature using a signature scheme based on the private key and a public key,store the public key, wherein the public key stored in the memory module is not accessible to the mobile equipment of the mobile station,store the signature scheme,determine that a source of the first digital signature is the short-term key manager, andcompute the short-term key using the first value and the public key provided that the short-term key manager is determined to have been the source of the first digital signature.
  • 25. The mobile station of claim 24, wherein the first value is determined by the short-term key manager.
  • 26. The mobile station of claim 24, wherein the first value includes a time stamp.
CLAIM OF PRIORITY UNDER 35 U.S.C. §119

The present Application for Patent claims priority to U.S. Provisional Application No. 60/499,563, filed Sep. 2, 2003, assigned to the assignee hereof and hereby expressly incorporated by reference herein, and to U.S. Provisional Application No. 60/502,866, filed Sep. 11, 2003, assigned to the assignee hereof and hereby expressly incorporated by reference herein.

US Referenced Citations (377)
Number Name Date Kind
4163255 Pires Jul 1979 A
4323921 Guillou Apr 1982 A
4336612 Inoue et al. Jun 1982 A
4750167 Meyer 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
5052000 Wang et al. Sep 1991 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 Aug 1992 A
5150412 Maru 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 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 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
5442626 Wei Aug 1995 A
5448568 Delpuch et al. Sep 1995 A
5467398 Pierce et al. Nov 1995 A
5473609 Chaney 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 May 1996 A
5537474 Brown et al. Jul 1996 A
5565909 Thibadeau et al. Oct 1996 A
5592470 Rudrapatna et al. Jan 1997 A
5659556 Denissen et al. Aug 1997 A
5673259 Quick, Jr. Sep 1997 A
5686963 Uz et al. Nov 1997 A
5708961 Hylton et al. Jan 1998 A
5729540 Wegrzyn Mar 1998 A
5740246 Saito Apr 1998 A
5748736 Mittra May 1998 A
5751707 Voit et al. May 1998 A
5751725 Chen 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 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 Mar 1999 A
5909491 Luo Jun 1999 A
5923649 Raith 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 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
5983388 Friedman et al. Nov 1999 A
5990928 Sklar et al. Nov 1999 A
5991400 Kamperman Nov 1999 A
5991407 Murto Nov 1999 A
6006073 Glauner et al. Dec 1999 A
6014765 Maeda et al. Jan 2000 A
6018360 Stewart et al. Jan 2000 A
6021124 Haartsen Feb 2000 A
6026165 Marino et al. Feb 2000 A
6032197 Birdwell et al. Feb 2000 A
6044154 Kelly Mar 2000 A
6047071 Shah Apr 2000 A
6047395 Zook 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 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 Aug 2000 A
6108706 Birdwell et al. Aug 2000 A
6111866 Kweon et al. Aug 2000 A
6122763 Pyndiah et al. Sep 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 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 May 2001 B1
6240091 Ginzboorg et al. May 2001 B1
6253069 Mankovitz 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 Oct 2001 B1
6314095 Loa Nov 2001 B1
6343280 Clark Jan 2002 B2
6345307 Booth Feb 2002 B1
6353614 Borella et al. Mar 2002 B1
6363242 Brown, Jr. et al. Mar 2002 B1
6363480 Perlman Mar 2002 B1
6366776 Wright et al. Apr 2002 B1
6373829 Vilmur 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 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 Sep 2002 B1
6460156 Laukkanen et al. Oct 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 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
6542504 Mahler 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 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 Jul 2003 B1
6600745 Chopping Jul 2003 B1
6601068 Park Jul 2003 B1
6603857 Batten-Carew et al. Aug 2003 B1
6606706 Li Aug 2003 B1
6608841 Koodli Aug 2003 B1
6614804 McFadden et al. Sep 2003 B1
6633979 Smeets Oct 2003 B1
6640094 Tabeta Oct 2003 B1
6647000 Persson et al. Nov 2003 B1
6654384 Reza et al. Nov 2003 B1
6658463 Dillon et al. Dec 2003 B1
6658605 Yoshida et al. Dec 2003 B1
6665718 Chuah et al. Dec 2003 B1
6678856 Jordan et al. Jan 2004 B1
6680920 Wan Jan 2004 B1
6690795 Richards Feb 2004 B1
6704368 Nefedov Mar 2004 B1
6704369 Kawasaki et al. Mar 2004 B1
6707801 Hsu Mar 2004 B2
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 Apr 2004 B2
6728226 Naito Apr 2004 B1
6731936 Chen et al. May 2004 B2
6735177 Suzuki May 2004 B1
6735190 Chuah et al. May 2004 B1
6738942 Sridharan 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 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 Oct 2004 B1
6804520 Johansson et al. Oct 2004 B1
6810499 Sridharan et al. Oct 2004 B2
6819930 Laroia et al. Nov 2004 B1
6826406 Vialen et al. Nov 2004 B1
6829741 Khansari et al. Dec 2004 B1
6831910 Moon et al. Dec 2004 B1
6832314 Irvin Dec 2004 B1
6856800 Henry et al. Feb 2005 B1
6862684 DiGiorgio Mar 2005 B1
6870923 Yi Mar 2005 B2
6879573 Huo Apr 2005 B1
6879690 Faccin et al. Apr 2005 B2
6882850 McConnell et al. Apr 2005 B2
6882860 Kim Apr 2005 B1
6885874 Grube et al. Apr 2005 B2
6888899 Raleigh et al. May 2005 B2
6895216 Sato et al. May 2005 B2
6895546 Ivry May 2005 B2
6898285 Hutchings et al. May 2005 B1
6898640 Kurita et al. May 2005 B1
6909702 Leung et al. Jun 2005 B2
6915272 Zilliacus et al. Jul 2005 B1
6918035 Patel Jul 2005 B1
6920119 Rinchiuso Jul 2005 B2
6925285 Kim Aug 2005 B2
6944763 Asano et al. Sep 2005 B1
6952454 Jalali et al. Oct 2005 B1
6956833 Yukie et al. Oct 2005 B1
6959384 Serret-Avila Oct 2005 B1
6963544 Balachandran et al. Nov 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 Jan 2006 B1
7016351 Farinacci et al. Mar 2006 B1
7024616 Ohira et al. Apr 2006 B2
7031666 Hsu Apr 2006 B2
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 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
7184789 Leung et al. Feb 2007 B2
7197072 Hsu et al. Mar 2007 B1
7200230 Knauft Apr 2007 B2
7203314 Kahn et al. Apr 2007 B1
7209459 Kangas Apr 2007 B2
7215775 Noguchi et al. May 2007 B2
7219291 Adde 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
7308100 Bender et al. Dec 2007 B2
7349425 Leung et al. Mar 2008 B2
7352868 Hawkes et al. Apr 2008 B2
7376963 Kato et al. May 2008 B2
7599655 Agashe et al. Oct 2009 B2
7649829 Chen et al. Jan 2010 B2
7669104 Uchida et al. Feb 2010 B2
7693508 Leung et al. Apr 2010 B2
7697523 Leung et al. Apr 2010 B2
7742781 Chen et al. Jun 2010 B2
7792074 Chen et al. Sep 2010 B2
8077679 Leung Dec 2011 B2
8098818 Grilli et al. Jan 2012 B2
8121296 Hawkes et al. Feb 2012 B2
20010004761 Zehavi Jun 2001 A1
20010034254 Ranta 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
20020002541 Williams Jan 2002 A1
20020002674 Grimes et al. Jan 2002 A1
20020010681 Hillegass et al. Jan 2002 A1
20020014159 Tatsumi et al. Feb 2002 A1
20020023165 Lahr Feb 2002 A1
20020071558 Patel Jun 2002 A1
20020076195 Nakajima et al. Jun 2002 A1
20020080887 Jeong et al. Jun 2002 A1
20020091931 Quick, Jr. et al. Jul 2002 A1
20020102964 Park Aug 2002 A1
20020114469 Faccin et al. Aug 2002 A1
20020141371 Hsu Oct 2002 A1
20020141591 Hawkes et al. Oct 2002 A1
20020169724 Moroney et al. Nov 2002 A1
20020181423 Chen et al. Dec 2002 A1
20030014685 Chong et al. Jan 2003 A1
20030018891 Hall et al. Jan 2003 A1
20030028805 Lahteenmaki Feb 2003 A1
20030030581 Roy Feb 2003 A1
20030031322 Beckmann et al. Feb 2003 A1
20030035389 Chen et al. Feb 2003 A1
20030039237 Forslow Feb 2003 A1
20030039361 Hawkes et al. Feb 2003 A1
20030054807 Hsu et al. Mar 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
20030157952 Sarkkinen et al. Aug 2003 A1
20030159029 Brown et al. Aug 2003 A1
20030217057 Kuroiwa et al. Nov 2003 A1
20040019787 Shibata Jan 2004 A1
20040022216 Shi Feb 2004 A1
20040095515 Tajima 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 Dec 2004 A1
20050008159 Grilli et al. Jan 2005 A1
20050010774 Rose 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 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 Feb 2007 A1
20070116282 Hawkes et al. May 2007 A1
20070214482 Nguyen Sep 2007 A1
20070280169 Cam Winget Dec 2007 A1
20080226073 Hawkes et al. Sep 2008 A1
20100048206 Agashe et al. Feb 2010 A1
20100107041 Chen et al. Apr 2010 A1
20100142432 Leung et al. Jun 2010 A1
20100272124 Chen et al. Oct 2010 A1
20110045864 Chen et al. Feb 2011 A1
Foreign Referenced Citations (230)
Number Date Country
2308405 Nov 2000 CA
1256599 Jun 2000 CN
1281561 Jan 2001 CN
0636963 Feb 1995 EP
0702477 Mar 1996 EP
0748058 Dec 1996 EP
0813309 Dec 1997 EP
0854618 Jul 1998 EP
0924989 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 2009 GB
1101042 Apr 1989 JP
2090840 Mar 1990 JP
03179841 May 1991 JP
05216411 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
10191459 Jul 1998 JP
10200536 Jul 1998 JP
10214233 Aug 1998 JP
10271041 Oct 1998 JP
10240826 Nov 1998 JP
10512428 Nov 1998 JP
11110401 Apr 1999 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
11345179 Dec 1999 JP
11355460 Dec 1999 JP
11355858 Dec 1999 JP
2000040064 Feb 2000 JP
2000078555 Mar 2000 JP
2000115860 Apr 2000 JP
2000134193 May 2000 JP
2000137551 May 2000 JP
2000138632 May 2000 JP
2000183968 Jun 2000 JP
2000196546 Jul 2000 JP
2000196673 Jul 2000 JP
2000224648 Aug 2000 JP
2000244603 Sep 2000 JP
2000253065 Sep 2000 JP
2000253459 Sep 2000 JP
2000261374 Sep 2000 JP
2000269959 Sep 2000 JP
2000511733 Sep 2000 JP
2000287192 Oct 2000 JP
2000295541 Oct 2000 JP
2000513519 Oct 2000 JP
2000324155 Nov 2000 JP
2001007759 Jan 2001 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
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
2001510970 Aug 2001 JP
2001512842 Aug 2001 JP
2001268535 Sep 2001 JP
2001513587 Sep 2001 JP
2001333032 Nov 2001 JP
2001522164 Nov 2001 JP
2002026835 Jan 2002 JP
2002027417 Jan 2002 JP
2002502204 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
2004507175 Mar 2004 JP
2004532554 Oct 2004 JP
2004533174 Oct 2004 JP
2004343764 Dec 2004 JP
2005509367 Apr 2005 JP
2005512471 Apr 2005 JP
2005507572 May 2005 JP
2006518975 Aug 2006 JP
2000165258 Jun 2000 KE
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
8301881 May 1983 WO
WO8608335 Dec 1986 WO
WO9611538 Apr 1996 WO
WO9715161 Apr 1997 WO
WO-9716924 May 1997 WO
WO9717790 May 1997 WO
WO9747094 Dec 1997 WO
WO9748212 Dec 1997 WO
WO9810604 Mar 1998 WO
WO9825422 Jun 1998 WO
WO9857509 Dec 1998 WO
WO9904583 Jan 1999 WO
WO9922466 May 1999 WO
WO9922478 May 1999 WO
WO9930234 Jun 1999 WO
WO9939524 Aug 1999 WO
WO9717790 Sep 1999 WO
WO9944114 Sep 1999 WO
WO9949588 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
WO0000883 Feb 2000 WO
WO0013356 Mar 2000 WO
WO0033535 Jun 2000 WO
WO0036804 Jun 2000 WO
WO0048358 Aug 2000 WO
WO0051308 Aug 2000 WO
WO0052880 Sep 2000 WO
WO0056018 Sep 2000 WO
WO0057601 Sep 2000 WO
WO0062476 Oct 2000 WO
WO0062547 Oct 2000 WO
WO0072609 Nov 2000 WO
WO0074311 Dec 2000 WO
WO0074425 Dec 2000 WO
WO0076125 Dec 2000 WO
WO0076234 Dec 2000 WO
WO0078008 Dec 2000 WO
WO0079734 Dec 2000 WO
WO0101630 Jan 2001 WO
WO0110146 Feb 2001 WO
WO0113358 Feb 2001 WO
WO0117163 Mar 2001 WO
WO0119027 Mar 2001 WO
WO0120805 Mar 2001 WO
WO0145443 Jun 2001 WO
WO0150783 Jul 2001 WO
WO0156232 Aug 2001 WO
WO0208449 Jan 2002 WO
0215578 Feb 2002 WO
WO0247356 Jun 2002 WO
WO0247407 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
03043310 May 2003 WO
03051056 Jun 2003 WO
WO03051072 Jun 2003 WO
WO03063418 Jul 2003 WO
WO2004025895 Mar 2004 WO
WO2005008393 Jan 2005 WO
WO2009130589 Oct 2009 WO
Non-Patent Literature Citations (87)
Entry
Alain Pannetrat et al, Authenticating Realtime Packet Streams and Multicasts, 2002 IEEE.
Baugher, McGrew, Carrara, Naslund, Norrman: “The Secure Real-Time Transport Protocol (draft 09)” Internet Engineering Task Force, AVT Working Group, Internet-Draft, Jul. 2003, XP002320685.
Meier J D; Mackman A; Dunner M; Vasireddy S: “Building Secure ASP.NET Applications: Authentication, Authorization, and Secure Communication: Cryptography and Certificates” Microsoft Patterns & Practices, Nov. 2002, pp. 1-5, XP002321827.
Patent Abstracts of Japan vol. 2003, No. 08, JP 2003 124927, Apr. 25, 2003.
International Search Report—PCT/US2004/028677, International Search Authority—European Patent Office, Apr. 6, 2005.
Written Opinion—PCT/US2004/028677, International Search Authority—European Patent Office, Apr. 6, 2005.
International Preliminary Report on Patentability—PCT/US2004/028677, International Search Authority—IPEA/US, Aug. 29, 2006.
Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, Handbook of Applied Cryptography, CRC Press. (Oct. 1996): p. 364 (in particular, refer to section 9.6.3), http://www.cacr.math.uwaterloo.ca/hac/about/chap9.pdf.
European Search Report—EP10005810, Search Authority—Munich Patent Office, Nov. 10, 2010.
Haverinen H: “EAP SIM Authentication”, 3GPP Draft: S3-010663—Draft-Haverinen-PPPEXT-EAP-SIM-0 2, 3rd Generation Partnership-Project (3GPP), Mobile Competence Centre; 650, Route des Lucioles; F-06921 Sophia-Antipolis Cedex; France, vol. SA WG3, No. Sophia; Nov. 28, 2001, XP050271835, [retrieved on Nov. 28, 2001].
Translation of Office Action in Japanese application 2002-577339 corresponding to U.S. Appl. No. 09/933,971, citing JP11331070, JP2090840, JP2000244603 and JP2000115860 dated Oct. 19, 2010.
3GPP TS 25.211 V4.2.0, 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Physical Channels and Mapping of Transport Channels onto Physical Channels (FDD)(Release 4)(Sep. 2001).
3GPP TS 25.212 V4.2.0, 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Multiplexing and Channel Coding (FDD)(Release 4)(Sep. 2001).
3GPP TS 25.214 v4.1.0 (Jun. 2001) Universal Mobile Telecommunications System (UMTS); Physical layer procedures (FDD), Release 4, ETSI TS 125 214 V4.1.0, Jun. 2001.
3GPP TS 25.214 V4.2.0 (Sep. 2001) 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Physical Layer Procedures (FDD)(Release 4).
3GPP2 C.S0002-0 Version 1.0 (Jul. 1999) 3rd Generation Partnership Project 2 “3GPP2” Physical Layer Standard for cdma2000 Spread Spectrum Systems.
Al-Tawil, “A New Authentication Protocol for Roaming Users in GSM”, Proceedings for IEEE international Symposium on Computers and Communication, Jul. 6, 1999, pp. 93-99.
Asaka et al., “Dynamic Multicast Routing Using Predetermined Path Search”. Technical Report of IEICE (The Institute of Electronics, Information and Communication Engineers), SSE95-56 IN99-37 CS99-78, Sep. 27, 1999.
Baccelli, F. et al: “Self Organizing Hierarchical Multicast Trees and Their Optimization,” INFOCOM 1999. IEEE, 1081-1089 (Mar. 21, 1999).
Berkovits, S. “How to Broadcast a Secret” Advances in Cryptology, Eurocrypt, International Conference on the Theory and Application of Cryptographic Techniques, Springer-Verlag, Delaware, Apr. 11, 1991, pp. 535-541.
Bormann, C., et al. “Robust Header Compression (ROHC)” Internet Draft, Dec. 2000, pp. 1-122, XP002901751 (pp. 4-5).
Brown: “The Electronic Post It Note Model for Mobile Computing Applications,” Computing Lab, The University, Canterbury, Kent, The Institution of Electrical Engineers, IEEE, Savoy Place, London, WC2R OBL, UK, 1995.
Estrin, et al., “The Protocol Independent Multicast-Sparse Mode (PIM-SM),” RFC 2362, Jun. 1998.
ETSI TR 125 925 V3.3.0: “Universal Mobile Telecommunications System (UMTS); Radio Interface for Broadcast/Multicast Services (3GPP TR 25.925 version 3.3.0 Release 1999),” XP002230388, pp. 1-35, (Dec. 2000).
ETSI TS 125 213 v4.1.0: Universal Mobile Telecommunications System (UMTS); Spreading and modulation (FDD), 3G TS 25 213 version 4.1.0 Release 4 (Jun. 2001).
ETSI: “Universal Mobile Telecommunications Systems (UMTS); Multimedia Broadcast/Multicast Service (MBMS); Stage 1, 3GPP TS 22.146 version 5.2.0 Release 5”, ETSI TS 122 146 v5.2.0, pp. 1-15, Mar. 2002.
Farinacci, D., et al., “Generic Routing Encapsulation (GRE),” Network Working Group Request for Comments 2784, 1-8, Mar. 2000. URL:http://www.globecom.net/ieft/rfc/rfc2784.html (retrieved on Feb. 14, 2003).
FOLDOC, Spread-spectrum communications, definition, dated Aug. 8, 2001, from http://foldocorg/indexcgi?query=spread+spectrum.
“Functional Model of a Conditional Access System”, EBU Review—Technical European Broadcasting Union, Bussels, BE, No. 266; Dec. 21, 1995; pp. 64-77; XP000559450.
Gong, L. et al: “Trade-Offs in Routing Private Multicast Traffic,” Global Telecommunications Conference, 1995. IEEE, 2124-2128 (Nov. 13, 1995).
Handley, M. et al., “SDP: Session Description Protocol” Network Working Group, Request for Comments: 2327, Category: Standards Track. ISI/LBNL, Apr. 1998. pp. 1-42.
Haverinen, et al., “EAP SIM Authentication” draft-haver inen-pppext-eap-sim-11 .txt, [online] <URL:http:l/www.watersprings.orglpub/id/draft-haverinen-pppext-eap-sim- 11 .txt> Jun. 2003, pp. 1-64.
IEEE. “IEEE Std. 802.11, Part 11; Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications” 1997, pp. 60-70.
Jalali, A., et al. “Data Throughput of CDMA-HDR a High Efficiency-High Data Rate 408 Personal Communication Wireless System,” IEEE VTC2000, QUALCOM inc., San Diego CA 2000 pp. 1854-1858.
JNSA, “Trend of the Latest Security Protocol IPsecH—with Demonstration Experiment 409 Report for Interconnection,” Network Magazine, vol. 6, No. 6, Japan, Jun. 2001, vol. 6, pp. 86-93.
Jou, Y.: “Developments in Third Generation (3G) CDMA Technology” Spread Spectrum Techniques and Applications, 2000 IEEE Sixth International Symposium on Sep. 6-8, 2000, Piscataway, Nj, USA, IEEE vol. 1, Sep. 6, 2000, pp. 460-464.
Kalliokulju J.: “User Plane Architecture of 3rd Generation Mobile Telecommunication Network,” IEEE International Conference on Networks, ICON, Proceedings on Networks (ICON'99), Sep. 28, 1999-Oct. 1, 1999, pp. 270-278, XP010354980.
Keeler, Robert E., “Interoperability Considerations for Digital HDTV,” IEEE Transactions on Broadcasting, vol. 37, No. 4, Dec. 1991, pp. 128-130.
Lin, et al: “A Multicast Routing Protocol for Multihop Wireless Networks,” Dept. of Computer Science and Information Engineering, Chung Cheng University, Taiwan, Global Telecommunications Conference, Globecam 99, pp. 235-239, XP010373304.
Linuxguruz,: “Free On-Line Dictionary of Computing”, Internet Protocol, Dec. 2000.
Lou H., et al., “Progressive Video Streaming Over 2G and 3G Wireless Systems, XP010520891,” Proceedings of the 11th IEEE International Symposium on Personal Indoor and Mobile Radio Communications, 2000, 2 (18-21), 1550-1554.
Macq. Benoit M. et al, “Cryptology for Digital TV Broadcasting”, 1995 IEEE, vol. 83, Issue 6, pp. 944-957.
Marchent, B.G., et al. “Intelligent Control of Mobile Multimedia Systems” Vehicular Technology Conference 1998. VTC 98, 48th IEEE Ottawa, Canada, May 18-21, 1998; New York, USA, May 18, 1998, pp. 2047-2051.
Menezes, A. et al.: “Handbook of Applied Cryptography” 1997, CRC Press LlC, USA XP002248262 pp. 497-500, 551-553.
Menezes, A. et al.: “Handbook of Applied Cryptography,” Chapter 13, pp. 543-590, CRC Press (1996).
Menezes et al.: “Key Layering and Cryptoperiods,” Passage, Handbook of Applied Cryptography, CRC Press Series on Discrete Mathematics and its Applications, Boca Raton, FL, CRC Press, US, 1997, pp. 551-553, 577-581.
Mooij, W.: “Advances in Conditional Access Technology”, IEEE, pp. 461-464 (Sep. 1997).
Moy, “Multicast Extensions to OSPF,” RFC 1584, Mar. 1994.
Okamoto “Encryption Technology for Realizing a Bright Information Society 5: Management of Encryption Key Distribution”, Bit, Japan. Kyoritsu Shuppan Co., Ltd, Nov. 1, 1991, vol. 23, No. 12, pp. 51-59.
Osamu Takahashi “Prospect of Push type Information Delivering Service/Technology”, Translation of Cited Reference 4, pp. 1-19, Nov. 1998.
Paul K et al: “A Stability-Based Distributed Routing Mechanism to Support Unicast and Multicast Routing in Ad Hoc Wireless Network” Computer Communcations, Elsevier Science Publishers BV, Amsterdam, NL, vol. 24, No. 18, Dec. 1, 2001, pp. 1828-1845, XP0043.
Pelletier, et al., “Robust Header Compression (ROHC): A Profile for TCP/IP (ROHC-TCP)” Internet Draft, Feb. 21, 2005, pp. 1-2.
Schneier, B.: “Applied Cryptography, Conference Key Distribution and Secret Broadcasting” Second Edition, pp. 520, 523-524, John Wiley & Sons, Inc. XP002248263 (1996).
Schneier, B.: “Applied Cryptography,” Second Edition, pp. 170, 171, 173, John Wiley & Sons, Inc. (1996).
Schneier, B.: “Applied Cryptography,” Second Edition, pp. 182-184, John Wiley & Sons, Inc. (1996).
Shannon, C.E., “A Mathematical Theory of Communication,” The Bell System Technical Journal, vol. 27, pp. 379-423, 623-656, July, Oct. 1948.
Simpson, W., “PPP in HDLC-Like Framing,” Network Working Group, Request for Comments: 1662 (RFC 1662), Jul. 1994. pp. 1-34.
Stallings, W.: “Cryptography and network security” 1995, Prentice-Hall, Inc., XP002248261 pp. 402-406, 413-417, 421-424.
Stallings, W.: “Cryptography and network security: Principles and Practice” Second Edition, 1999, Prentice Hall, New Jersey, pp. 400-413.
Tadaumi, “IP Technology as Communciation Infra,” The Institute of Electronics Information and Communcaition Engineers, vol. 83, No. 4, Apr. 2000, pp. 286-294.
Tanenbaum, Andrew S.: Computer Networks, Third Editon; Pub. 1996; pp. 8, and 179-190.
Tanenbaum, Andrew S.: Computer Networks Second Edition: Pub 1993, pp. 16, 199-203, XP2530414.
TIA/EIA/IS-856 Interim Standard cdma2000 High Rate Packet Data Air interface Specification (Nov. 2000).
TIA/EIA/IS-95-A, Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System (Revision of TIA/EIA/IS-95)(May 1995).
TIA/EIA/IS-95-B Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System (IS-95 Standard), Feb. 3, 1999.
Toh C-K et al: “ABAM: On-Demand Associativity-Based Multicast Routing for Ad Hoc Mobile Networks,” Vehicular Technology Conference, 2000, IEE, 987-993 (2000).
Toshiaki Miyazaki “A Stream-data Multicast Protocol Using IP Unicast Address” Technical Report of IEICE, IN2001-9, May 11, 2001.
Waitzman, et al., “The Distance Vector Multicast Routing Protocol (DVMRP),” RFC 1075, Nov. 1, 1998.
Yamaguchi, S., “Realization of Multimedia Communications”, Unix Magazine, ASCII Corporation, Jun. 1, 1996. vol. 11, No. 6, pp. 45-53.
Yang et al: “An Efficient Multicast Delivery Scheme to Support Mobile IP,” Database and Expert Systems Applications, 1999. IEEE, 638-88 (Sep. 1, 1999).
You Xiaohu, “R&D Progress on China's 3G Mobile Communications”, Telecom Science, vol. 2, 2001, p. 11-17.
Brown, D., “Techniques for Privacy and Authentication in Personal Communication Systems,” IEEE Personal Communications, vol. 2, No. 4, pp. 6-10, Aug. 1995, doi: 10.1109/98.403452.
Taiwan Search Report—TW093120523—TIPO—Jun. 14, 2011.
Bauer D., et al., “An error-control scheme for a multicast protocol based on round trip time calculations”, Local Computer Networks, 1996., Proceedings 21st IEEE Conference on Minneapolis, MN, USA Oct. 13-16, 1996, Los Alamitos, CA, USA, IEEE Comput. Soc, US, Oct. 13, 1996, pp. 212-221, XP010200690, DOI: 10.1109/LCN. 1996.558149 ISBN: 978-0-8186-7617-8 * chapters 3+3.1 *.
Mysore J. P., et al., Performance of transport protocols over a multicasting-based architecture for Internet host mobility, Communications, 1998. ICC 98. Conference Record. 1998 IEEE International Conference on Atlanta, GA, USA Jun. 7-11, 1998, New York, NY, USA, IEEE, US, vol. 3, Jun. 7, 1998, pp. 1817-1823, XP 010284635, DOI: 10.1109/ICC. 1998.683142 ISBN: 978-0-7803-4788-5 * abstract * * chapter 2 *.
Yajnik M., et al., “Packet loss correlation in the MBone multicast network”, Global Telecommunications Conference, 1996. Globecom '96. Communications: The Key to Global Prosperity London, UK Nov. 18-22, 1996, New York, NY, USA, IEEE, US, Nov. 18, 1996, pp. 94-99, XP010220159, DOI: 10.1109/GLOCOM. 1996.586133 ISBN: 978-0-7803-3336-9 * chapter 3.1 *.
“Feature Story I: Evolution of Cellular Phones,” ASCII, Dec. 1, 2000, vol. 24, No. 12, p. 204.
R. Sinnarajah, Signaling Support for Broadcast Service, 3GPP2 TSG-C Contribution, 2002, C20-20020107-022, URL http://ftp.3gpp2.org /TSGC/Working/2002/TSG-C-0201/TSG-C-0201-Vancouver/WG2/C20-20020107-020 (Signaling-Support-for-Broadcast-Service).doc.
Qualcomm Europe: “MBMS Security Framework”, 3GPP TSG SA WG3 Security—S3 #29 S3-030356, Jul. 2003, MBMS Security and 3GPP-3GPP2 joint meeting, whole document.
Romkey J., “A Nonstandard for Transmission of IP Datagrams Over Serial Lines: SLIP”, rfc1055, IETF, Jun. 1988, URL, http://www. ietf.org/rfc/rfc1055.txt, whole document.
3GPP2 C.R1001-A, “Administration of Parameter Value Assignments for cdma2000 Spread Spectrum Standards Release C” Jul. 14, 2000, Version 2.0.
Chen T., et al., “cdma2000 Broadcast Services Stage 2: System Design”, C10-20010820-008, 3GPP2, Aug. 20, 2001.
Menezes Alfred J., et al., “Handbook of Applied Cryptography,” 1997 CRC Press, pp. 169-190.
Ohnishi H., et al., “Proposed Scheme for Route Optimization on the Mobile IP Network.” Technical Report of the Institute of Electronics, Information and Communication Engineers, SSE99-123 PS99-47, Dec. 17, 1999.
Taiwan Search Report—TW093120386—TIPO—Feb. 8, 2012.
Momona, M., et al., “Technologies and Standardization Activities in Cable TV Access Networks,” IEICE Technical Report, Japan. The Institute of Electronics, Information and Communication Engineers (IEICE), Feb. 15, 1999. vol. 98, No. 589: pp. 57-64.
Haverinen, R., “GSM SIM Authentication and Key Generation for Mobile IP”; draft-haverinen-mobileip-gsmsim-01.txt; Internet Engineering Task Force, IETF, CH; Nov. 2000; XP015014135.
Related Publications (1)
Number Date Country
20050138379 A1 Jun 2005 US
Provisional Applications (2)
Number Date Country
60499563 Sep 2003 US
60502866 Sep 2003 US