Apparatus and method for a secure broadcast system

Information

  • Patent Grant
  • 8718279
  • Patent Number
    8,718,279
  • Date Filed
    Wednesday, June 16, 2004
    20 years ago
  • Date Issued
    Tuesday, May 6, 2014
    10 years ago
Abstract
Apparatus and method for provisioning an access key used for a controlled access broadcast service is disclosed. In one aspect, a method for secure processing in a device that securely stores a secret key comprises receiving a plurality of challenges from a network, generating a plurality of ciphering keys based on the secret key and the plurality of challenges, and generating an access key based on the plurality of ciphering keys.
Description
BACKGROUND

I. Field of Invention


The invention generally relates to secure communication systems and more particularly, to access key management for multimedia broadcasting service in a mobile environment.


II. Description of the Related Art


Wireless communication systems are widely deployed to provide various types of communication such as voice, data, and so on. These systems may be based on code division multiple access (CDMA), time division multiple access (TDMA), or other modulation techniques.


A system may be designed to support one or more standards such as the “TIA/EIA-95-B Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System” (the IS-95 standard); the “Global System for Mobile” (GSM) communication standard based on TDMA; the “Universal Mobile Telecommunications Service” (UMTS) standard which is a third generation wireless service based on GSM communication standard; the General Packet Radio System (GPRS) communication standard which is an evolutionary step from GSM toward UMTS; the standard offered by a consortium named “3rd Generation Partnership Project” (3GPP) which is embodied in a set of documents including Document Nos. 3G TS 25.211, 3G TS 25.212, 3G TS 25.213, and 3G TS 25.214, 3G TS 25.302 (the W-CDMA standard); the standard offered by a consortium named “3rd Generation Partnership Project 2” (3GPP2) which is embodied in “TR-45.5 Physical Layer Standard for cdma2000 Spread Spectrum Systems” (the IS-2000 standard). Each standard defines the processing of data for wireless communication between an infrastructure element, such as a base station, and a user end device, such as a mobile device.


Increasing demand for wireless data transmission and the expansion of services available via wireless communication technology have led to the development of specific data services. In one embodiment, a system may be configured to support multimedia broadcasting services (hereinafter “broadcast service”). Similar to television and/or radio broadcasting, broadcast service may be used for wireless transmission of multimedia content stream from a content provider to user end devices. Here, a content stream can be considered as equivalent to a television channel or radio station. Examples of multimedia content streams include audio and/or video data such as movies, sports events, news and various other programs and/or files. Typically, a service provider indicates the availability of such broadcast service to users. Users desiring broadcast service may receive broadcast service related parameters in overhead messages transmitted by infrastructure elements. When a user desires to receive certain content stream, the user end device reads the overhead messages and learns the appropriate configurations. The user end device then tunes to the channel or frequency containing the content stream, and receives broadcast service.


There are several possible subscription/revenue models for broadcast service, including free access, controlled access, and partially controlled access. For free access, no subscription is needed by the users to receive the service. Content is broadcasted without encryption such that user end devices of interested users can receive and view the content. The revenue for the service provider can be generated through advertisements that may also be transmitted in the broadcast channel. For example, upcoming movie-clips can be transmitted for which the studios will pay the service provider.


In controlled access, users are required to subscribe and become authorized to receive the broadcast service by paying a fee. This controlled access can be achieved by encrypting the broadcast service transmission or content with cryptographic access keys such that only subscribed users can decrypt and view the content. Here, the encryption of the broadcast content may be based on symmetric or asymmetric cryptosystems. In symmetric cryptosystems, the same keys are used for encryption/decryption and in asymmetric cryptosystems, different keys are used for encryption/decryption.


Cryptography is well known to those skilled in art and will not be further described in detail. A hybrid access scheme or partial controlled access provides broadcast service as a subscription-based service that is encrypted with intermittent unencrypted advertisement transmissions. These advertisements may be intended to encourage subscriptions to the encrypted broadcast service.


For controlled or partially controlled broadcast service, a problem exists in the secure provision of the access key from a content provider to one or more recipients. Therefore, there is a need for a secure way to provision an access key to end user devices. More particularly, the provisioning of the access key needs to conform with existing standards and corresponding infrastructures as well as evolving standards and corresponding infrastructures.


SUMMARY

Embodiments disclosed herein address the above stated needs by enabling a secure provision of access key to end user devices.


In one embodiment, a method for secure processing in a device that securely stores a secret key comprises receiving a plurality of challenges from a network; generate a plurality of ciphering keys based on the secret key and the plurality of challenges; and generating an access key based on the plurality of ciphering keys. The method may further comprise using the plurality of challenges and the secret key to generate a plurality of authentication responses; and sending at least one authentication response to the network. Generation of the access key may comprise generating a broadcast access key; and wherein the method further comprises: receiving encrypted broadcast content; and decrypting the broadcast content based on the broadcast access key. Decryption of the content may comprises: generating a temporary decryption key based on each challenge and the broadcast access key; and decrypting the broadcast content using the temporary decryption key.


In another embodiment, apparatus for secure processing in a device having means for securely storing a secret key comprises means for generating a plurality of ciphering keys based on a plurality of challenges received from a network and the secret key; and means for generating an access key based on the plurality of ciphering keys.


In still another embodiment, a machine readable medium for use in a device that securely stores a secret key and receives a plurality of challenges from a network is disclosed. The machine readable medium comprises codes for generating a plurality of ciphering keys based on the plurality of challenges and the secret key; and codes for generating an access key based on the plurality of ciphering keys.


In the above embodiments, a 128 bit subscriber authentication key may be stored as the secret key in a subscriber identity module of a mobile phone using Global System for Mobile communication standard. A 128 bit subscriber authentication key may also be stored as the secret key in a universal subscriber identity module of a mobile phone using Universal Mobile Telecommunications System standard. Moreover, 64 bit ciphering keys may be generated and a 128 bit broadcast access key may be generated using two ciphering keys.


In a further embodiment, an apparatus for use in a mobile phone comprising: an integrated circuit card (ICC) configured to securely store a secret key and to generate a plurality of ciphering key based on the secret key and a plurality of challenges received from a network; and a processor coupled to the ICC and configured to generate an access key based on the plurality of ciphering keys. The ICC may be a subscriber identity module (SIM) of a mobile phone using Global System for Mobile communication standard. SIM may store a 128 bit subscriber authentication key as the secret key and generate 64-bit ciphering keys. The ICC may also be a universal subscriber identity module (USIM) of a mobile phone using Universal Mobile Telecommunications System standard. USIM may store a 128 bit subscriber authentication key as the secret key and generate 64-bit ciphering keys in a mode that is backward compatible with the SIM. The processor may generate a 128 bit broadcast access key using two ciphering keys.





BRIEF DESCRIPTION OF THE DRAWINGS

Various embodiments will be described in detail with reference to the following drawings in which like reference numerals refer to like elements, wherein:



FIG. 1 is an example wireless communication capable of supporting broadcast service;



FIG. 2 shows a simplified network for implementing MBMS;



FIG. 3 shows a terminal capable of subscribing to MBMS to receive multimedia content;



FIG. 4 a simplified example of a GSM system;



FIG. 5 is an example system with a network that performs authentication and a terminal for broadcast service; and



FIG. 6 shows a method for secure processing in a device that securely stores a secret key.





DETAILED DESCRIPTION

In the following description, specific details are given to provide a thorough understanding of the embodiments. However, it will be understood by one of ordinary skill in the art that the embodiments may be practiced without these specific detail. For example, circuits may be shown in block diagrams in order not to obscure the embodiments in unnecessary detail. In other instances, well-known circuits, structures and techniques may be shown in detail in order not to obscure the embodiments.


Also, it is noted that the embodiments may be described as a process which is depicted as a flowchart, a flow diagram, a structure diagram, or a block diagram. Although a flowchart may describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. In addition, the order of the operations may be re-arranged. A process is terminated when its operations are completed. A process may correspond to a method, a function, a procedure, a subroutine, a subprogram, etc. When a process corresponds to a function, its termination corresponds to a return of the function to the calling function or the main function.


Moreover, as disclosed herein, a storage medium may represent one or more devices for storing data, including read only memory (ROM), random access memory (RAM), magnetic disk storage mediums, optical storage mediums, flash memory devices and/or other machine readable mediums for storing information. The term “machine readable medium” includes, but is not limited to portable or fixed storage devices, optical storage devices, wireless channels and various other mediums capable of storing, containing or carrying instruction(s) and/or data.



FIG. 1 shows an example of a wireless communications network 100 capable of supporting broadcast service. Network 100 may comprise one or more communication systems supporting different standards. More particularly, network 100 comprises a plurality of service areas 102A-102G, each of which is serviced by a corresponding infrastructure element 104A-104G, respectively. Infrastructure elements 104A-104G communicate with user end devices (hereinafter “terminal”) 106A-106J that are within service areas 102A-102G of infrastructure elements 104A-104G, respectively. Depending on the type of communication system, infrastructure elements 104A-104G may include base stations, base transceiver station, gateways or other devices that communicates with terminals 106A-106J. Terminals 106A-106J may be, but is not limited to, a mobile (including cellular and personal communications service) phone, wired phone, a wireless handset, a personal data assistant (PDA), various computer devices (including laptop and desktop) or other data transceiver. As shown in FIG. 1, terminals 106A-106J can be hand-held, mobile, portable as in vehicle mounted (including cars, trucks, boats, trains, and planes) or fixed (stationary).


In one embodiment, network 100 supports a broadcast service referred to as Multimedia Broadcast/Multicast Service (MBMS), or sometimes referred to as Broadcast/Multimedia Service (BCMCS). Generally, MBMS is a packet data service based on the Internet Protocol (IP). A service provider may indicate the availability of such MBMS to users. The users desiring MBMS may receive the service and discover the broadcast service schedule through broadcasts such as advertisements, Short Message System (SMS), and Wireless Application Protocol (WAP). Infrastructure elements transmit MBMS related parameters in overhead messages. When a user desires to receive a broadcast session, a terminal 106 reads the overhead messages and learns the appropriate configurations. Terminal 106 then tunes to the frequency containing the MBMS channel, and receives the broadcast service content.



FIG. 2 shows a simplified network 200 for implementing MBMS. In network 200, video and/or audio information is provided to Packetized Data Service Network (PDSN) 230 by a Content Source (CS) 210. The video and audio information may be from televised programs or radio transmissions. The information is provided as packetized data, such as in IP packets. PDSN 230 processes the IP packets for distribution within an Access Network (AN). As illustrated, AN is defined as the portions of network 200 including an infrastructure element 240 in communication with a plurality of terminals 250.


For MBMS, CS 210 provides unencrypted content. Infrastructure element 240 receives the stream of information from PDSN 230 and provides the information on a designated channel to subscriber terminals within network 200. To control access, the content from CS 210 is encrypted by a content encryptor (not shown) using an encryption key before being provided to PDSN 220. While content encryptor may be implemented together or separately from CS 210, content encryptor and CS 210 will hereinafter be referred to as a content provider. The subscribed users are provided with the decryption key so that the IP packets can be decrypted.


More particularly, FIG. 3 shows a terminal 300 capable of subscribing to MBMS to receive multimedia content. Terminal 300 comprises an antenna 310 coupled to a receive circuitry 320. Terminal 300 receives transmissions from a content provider (not shown) through an infrastructure element (not shown). Terminal 300 includes a Mobile Equipment 340 and a Universal Integrated Circuit Card (UICC) 330 coupled to receive circuitry 320. It is to be noted that in some terminals, UICC 330 and ME 340 may be implemented together in one secure processing unit. Also, although the embodiment will be described using UICC, other integrated circuits and/r secure processing units, such as User Identification Module (UIM), Subscriber Identity Module (SIM) or universal SIM, may be implemented in a terminal.


Generally, UICC 330 applies verification procedures for security of the MBMS transmission and provides various keys to ME 340. ME 340 performs substantial processing, including, but not limited to, decryption of MBMS content streams using the keys provided by UICC 330. UICC 330 is trusted to securely store and process secret information (such as encryption keys) that should remain secret for a long time. As UICC 330 is a secure unit, the secrets stored therein do not necessarily require the system to change the secret information often. UICC 330 may include a processing unit referred to as a Secure UICC Processing Unit (SUPU) 324 and a secure memory storage unit referred to as a Secure UICC Memory Unit (SUMU) 322. Within UICC 330, SUMU 322 stores secret information in a way that discourages unauthorized access to the information. If the secret information is obtained from UICC 330, the access will require significantly large amount of resources. Also within UICC 330, SUPU 324 performs computations on values that may be external to and/or internal to UICC 330. The results of the computation may be stored in SUMU 322 or passed to ME 340.


In one embodiment, UICC 330 is a stationary unit or integrated within terminal 300. Note that UICC 330 may also include non-secure memory and processing (not shown) for storing information including telephone numbers, e-mail address information, web page or URL address information, and/or scheduling functions, etc. Alternative embodiments may provide a removable and/or reprogrammable UICC. Typically, SUPU 332 does not have significant processing power for functions beyond security and key procedures, such as to allow encryption of the broadcast content of MBMS. However, alternative embodiments may implement a UICC having stronger processing power.


While UICC 330 is a secure unit, data in ME 340 may be accessed by a non-subscriber and is said to be insecure. Any information passed to ME 340 or processed by the ME 340 remains securely secret for only a short amount of time. It is therefore desired that any secret information, such as key(s), shared with ME 340 be changed often.


More particularly, MBMS content is encrypted using a unique and frequently changing temporary encryption keys referred to as short-term key (SK). In order to decrypt the broadcast content at a particular time, ME 340 must know the current SK. The SK is used to decrypt the broadcast content for a short-amount of time such that SK can be assumed to have some amount of intrinsic monetary value for a user. For example, this intrinsic monetary value may be a portion of the registration costs. Here, different content types may have different intrinsic monetary value. Assuming that the cost of a non-subscriber obtaining SK from ME 340 of a subscriber exceeds the intrinsic monetary value of SK, the cost of obtaining SK illegitimately exceeds the reward and there is no benefit. Consequently, there is no need to protect SK in ME 340. However, if a broadcast has an intrinsic value greater than the cost of illegitimately obtaining this secret key, there is a benefit to the non-subscriber in obtaining such a key from ME 340. Hence, ME 340 ideally will not store secrets with a lifetime longer than that of an SK.


In addition, the channels used by a content provider (not shown) for transmission of data are considered insecure. Therefore, SK is not transmitted over the air. It is derived either by UICC 330 or ME 340 from an access key called a broadcast access key (BAK) and SK information (SKI) broadcasted along with the encrypted content. BAK may be used for a certain amount of time, for example one day, one week or a month, and is updated. Within each period for updating the BAK, a shorter interval is provided during which SK is changed. The content provider may use a cryptographic function to determine two values SK and SKI such that SK can be determined from BAK and SKI. In one embodiment, SKI may contain SK that is encrypted using BAK as the key. Alternatively, SK may be a result of applying a cryptographic hash function to the concatenation of SKI and BAK. Here, SKI may be some random value.


To obtain access to MBMS, a user registers and subscribes to the service. In one embodiment of the registration process, a content provider and UICC 330 agree on a Registration Key or root key (RK) that serves as a security association between the user and the content provider. The registration may occur when a user subscribes to a broadcast channel offered by the content provider or may occur prior to subscription. A single content provider may offer multiple broadcast channels. The content provider may choose to associate users with the same RK for all channels or require users to register for each channel and associate the same user with different RKs on different channels. Multiple content providers may choose to use the same registration keys or require the user to register and obtain a different RK.


If possible, RK is then kept as a secret in UICC 330. RK is unique to a given UICC, i.e., each user is assigned a different RK. However, if a user has multiple UICCs, then these UICCs may be configured to share the same RK depending on the policies of the content provider. The content provider may then send UICC 330 further secret information such as BAK encrypted with RK. UICC 330 is able to recover the value of the original BAK from the encrypted BAK using the RK. Since ME 340 is not a secret unit, UICC 330 does not provide BAK to ME 340.


The content provider also broadcasts SKI that is combined with the BAK in UICC 330 to derive SK. UICC 330 then passes SK to ME 340 and ME 340 uses the SK to decrypt encrypted broadcast transmissions received from a content provider. In this way, the content provider can efficiently distribute new values of SK to subscribed users.


As described, controlled access may be achieved by provisioning an agreed upon RK in SUMU 334 of UICC 330. However, in the existing infrastructure of some systems, an appropriate value of RK cannot be kept in a secure unit such as UICC 330, because of the cost and/or inconvenience of replacing existing UICCs, SIMs, UIMs or other Integrated Circuit Cards.


For example, in GSM systems, a Subscriber Identity Module (SIM) is the secure unit and contains subscriber identifying data about a user that can be used to gain access to a network. For purposes of explanation, FIG. 4 shows a simplified example of a GSM system 400 for authenticating a subscriber to allow access to a network. System 400 comprises a Home Location Register (HLR) 410, a Visitor Location Register (VLR) 420 and a terminal such as a mobile device 430. Note that system 400 comprise of additional elements, but GSM systems are well known to those skilled in the art and will not be described in detail.


HLR 410 is a subscriber database for a mobile system. HLR 410 is maintained by a terminal's home carrier and contains important user information for billing and for authentication to a network. VLR 420 is also a database and contains temporary user information, such as the current location of a terminal, to manage requests from subscribers who are out of the area covered by their home system. When a user initiates a call and the terminal of the user is our of the home area, VLR 420 communicates with HLR 410 to obtain information required to process a call, including information required to authenticate the subscriber.


Terminal 430 comprises a SIM module 432 that securely contains a subscriber authentication key (K) used to authenticate a subscriber. Here, a challenge-handshake authentication protocol known as Authenticated Key Agreement (AKA) is typically used for GSM authentication. In AKA, a network sends a challenge message to a subscriber terminal, which responds with a value obtained using a one-way hash function. Here, the challenge message may be a random value. The network checks the response by comparing it with its own expected hash value. If the values match, the authentication is acknowledged. While generating this response, a key that can be used to secure subsequent communications is also generated.


More particularly, in GSM system, VLR 420 requests authentication parameters from HLR 410. HLR 410 sends to VLR a 128 bit random number RAND, a signed response (RES) and a ciphering key (Kc). The RES and Kc are both generated from the subscriber authentication key K and RAND, by using different algorithms. Using this Authentication Triplet (RAND, RES, Kc), a challenge message is issued by sending the random number RAND to Terminal 430. The received RAND is passed to SIM 432 which generates RES and Kc using RAND and K. The generated RES is returned to VLR 420 which checks that the two values of RES match. If they match, the subscriber is authenticated and both terminal and network begin to encrypt/decrypt using Kc.


While GSM SIM securely contains a subscriber authentication key (K) used to authenticate a subscriber, it does not allow provisioning of an additional key such as RK. Namely, existing GSM SIMs cannot be changed. Therefore, one way to deliver BAK for broadcast service may be to use Kc rather than RK to encrypt BAK. A content provider would send a message containing RAND and BAK encrypted with Kc. A terminal receives the message and forwards the RAND to the SIM as if it was a normal GSM authentication. Accordingly, RES and Kc is generated by SIM using RAND and K. Here, the RES generated by SIM may be discarded. This protects against an attacker that might send the same RAND and record the returned RES for unauthorized access. The Kc may be used to decrypt the encrypted BAK.


However, Kc is typically a 64 bit key while some broadcast service such as MBMS is designed to give 128 bit security. Therefore, it is necessary to use a key as longer than 64 bits to encrypt BAK. As a result, a plurality of triplets is used for encryption of BAK.



FIG. 5 shows an example system 500 with a network 510 that performs authentication and terminal 520 for broadcast service. Network 510 comprises one or more content providers and other infrastructure elements necessary for broadcast service. Terminal 520 comprises ICC 522 coupled to a processor 524. In GSM system, network 510 may comprise a VLR and HLR, and ICC 522 would be a SIM module as described in FIG. 4. Generally, network 510 sends challenge messages for performing authentication. The challenge messages are used by terminal 520 to generate BAK for controlled access. Namely, ICC 522 of terminal 510 securely stores a secret key used in the generation of BAK. The operation of system 500 will be explained with reference to FIG. 6 below.



FIG. 6 shows a method 600 for secure processing in a device such as terminal 620, that securely stores a secret key such as a subscriber authentication key in a secure unit such as ICC 622. In method 600, the device receives a plurality of challenges from a network (610). The plurality of challenges may be in one message or a plurality of messages. A plurality of ciphering keys are generated based on the secret key and the plurality of challenges (620). The access key is then generated based on the plurality of ciphering keys (630). In system 500, for example, ICC 522 is configured to generate the ciphering keys as the secret key should be kept within ICC 522. Processor 524 is configured to generate the access key based on the ciphering keys.


The access key is generated using a plurality of ciphering keys because the access key is typically longer than a ciphering key. For example, in GSM for MBMS, the ciphering key is 64 bits while the access key is 128 bits. In such case, the access key can be generated using two ciphering keys. Any known technique may be used to generate an access key from the plurality of ciphering keys. In one embodiment, the access key is generated by concatenating the plurality of ciphering keys. In an alternative embodiment, the access key is generated using a hash function on the plurality of ciphering keys. The hash function may comprise SHA-1 to mix the plurality of ciphering keys.


For authentication, method 600 may further comprise using the plurality of challenge messages and the secret key to generate a plurality of authentication responses as described with reference to FIG. 4. Thereafter, at least one of the authentication response is returned to the network using a transmitter (not shown) implemented in terminal 520 and any authentication responses not sent to the network may be discarded.


Therefore, after generating the access key, method 600 may further comprise receiving encrypted broadcast content and decrypting the broadcast content based on the access key. For example in MBMS, the access key would be the BAK and SKI would be used to generate SK. In such case, method 600 may further comprise generating a temporary encryption/decryption key such as SK based on each challenge message and current BAK. The current SK can then be used to decrypt and view/process encrypted content.


Accordingly, embodiments described allow a secure provisioning of an access key for broadcast service. It is to be noted here that although the embodiments have been described with reference to MBMS, the scope of the invention applies to broadcast services other than MBMS and to various systems requiring controlled access. Similarly, the access key may be shorter or longer than 128 bits. Moreover, the embodiments may apply to systems other than GSM system. For example, UMTS systems have a USIM which is analogous to GSM SIM and has a backward compatibility mode allowing it to act as a GSM SIM.


Furthermore, embodiments may be implemented by hardware, software, firmware, middleware, microcode, or any combination thereof. When implemented in software, firmware, middleware or microcode, the program code or code segments to perform the necessary tasks may be stored in a machine readable medium (not shown). A processor may perform the necessary tasks. A code segment may represent a procedure, a function, a subprogram, a program, a routine, a subroutine, a module, a software package, a class, or any combination of instructions, data structures, or program statements. A code segment may be coupled to another code segment or a hardware circuit by passing and/or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, etc. may be passed, forwarded, or transmitted via any suitable means including memory sharing, message passing, token passing, network transmission, etc. Also, the machine readable medium may be implemented in an article of manufacture for use in a computer system and may have machine readable code means embodied therein


Finally, it should be noted that the foregoing embodiments are merely examples and are not to be construed as limiting the invention. The description of the embodiments is intended to be illustrative, and not to limit the scope of the claims. As such, the present teachings can be readily applied to other types of apparatuses and many alternatives, modifications, and variations will be apparent to those skilled in the art.

Claims
  • 1. A method operational on a user terminal for secure processing in a device that securely stores a secret key, the user terminal in communication with a network that broadcasts to a plurality of user terminals, the method operational on the user terminal comprising: receiving a plurality of random challenges from the network;generating a plurality of ciphering keys based on the secret key and the plurality of random challenges;generating an access key based on the plurality of ciphering keys;generating a plurality of authentication responses using the plurality of random challenges and the secret key;sending at least one authentication response, from the plurality of authentication responses, to the network; anddiscarding any authentication responses, from the plurality of authentication responses, not sent to the network.
  • 2. The method of claim 1, wherein receiving a plurality of challenges comprises: receiving a plurality of random values.
  • 3. The method of claim 1, wherein the access key is longer than a ciphering key.
  • 4. The method of claim 3, wherein generating the access key comprises: concatenating the plurality of ciphering keys.
  • 5. The method of claim 3, wherein generating the access key comprises: using a hash function on the plurality of ciphering keys.
  • 6. The method of claim 5, wherein the hash function comprises SHA-1 to mix the plurality of ciphering keys.
  • 7. The method of claim 1, wherein storing the secret key comprises: storing a 128 bit subscriber authentication key as the secret key in a subscriber identity module of a mobile phone using Global System for Mobile communication standard.
  • 8. The method of claim 7, wherein generating the plurality of ciphering keys comprises generating 64-bit ciphering keys; and wherein generating the access key comprises generating a 128 bit broadcast access key using two ciphering keys.
  • 9. The method of claim 1, wherein storing the secret key comprises: storing a 128 bit subscriber authentication key as the secret key in a universal subscriber identity module of a mobile phone using Universal Mobile Telecommunications System standard.
  • 10. The method of claim 9, wherein generating the plurality of ciphering keys comprises generating 64-bit ciphering keys; and wherein generating the access key comprises generating a 128 bit broadcast access key using two ciphering keys.
  • 11. The method of claim 1, wherein generating the access key comprises generating a broadcast access key; and wherein the method further comprises: receiving encrypted broadcast content; anddecrypting the broadcast content based on the broadcast access key.
  • 12. The method of claim 11, wherein the decrypting the content comprises: generating a temporary decryption key based on each random challenge and the broadcast access key; anddecrypting the broadcast content using the temporary decryption key.
  • 13. Apparatus for use in a mobile phone, the apparatus in communication with a network that broadcasts to a plurality of user terminals, the apparatus comprising: an integrated circuit card (ICC) configured to securely store a secret key and to generate a plurality of ciphering key based on the secret key and a plurality of random challenges received from the network;a processor coupled to the ICC and configured to generate an access key based on the plurality of ciphering keys; anda transmitter coupled to the ICC,wherein the ICC uses the plurality of challenges and the secret key to generate a plurality of authentication responses, the transmitter is configured to send at least one authentication response, from the plurality of authentication responses, to the network, and the transmitter is configured to discard any authentication responses, from the plurality of authentication responses, not sent to the network.
  • 14. The apparatus of claim 13, wherein the plurality of random challenges comprises a plurality of random values.
  • 15. The apparatus of claim 13, wherein the ICC is a subscriber identity module (SIM) of a mobile phone using Global System for Mobile communication standard.
  • 16. The apparatus of claim 15, wherein the SIM stores a 128 bit subscriber authentication key as the secret key and generates 64-bit ciphering keys; and wherein the processor generates a 128 bit broadcast access key using two ciphering keys.
  • 17. The apparatus of claim 13, wherein the ICC is a universal subscriber identity module (USIM) of a mobile phone using Universal Mobile Telecommunications System standard.
  • 18. The apparatus of claim 17, wherein the USIM stores a 128 bit subscriber authentication key as the secret key and generates 64-bit ciphering keys; and wherein the processor generates a 128 bit broadcast access key using two ciphering keys.
  • 19. The apparatus of claim 13, wherein the receiver receives encrypted broadcast content; and wherein the processor generates a broadcast access key to decrypt the broadcast content.
  • 20. Apparatus for use in a mobile phone, the apparatus in communication with a network that broadcasts to a plurality of user terminals, the apparatus comprising: means for receiving a plurality of random challenges from the network;means for generating a plurality of ciphering keys based on the plurality of random challenges and the secret key;means for generating an access key based on the plurality of ciphering keys;means for generating a plurality of authentication responses using the plurality of challenges and the secret key;means for sending at least one authentication response, from the plurality of authentication responses, to the network; andmeans for discarding any authentication responses, from the plurality of authentication responses, not sent to the network.
  • 21. The apparatus of claim 20, wherein the means for generating the access key comprises: means for concatenating the plurality of ciphering keys.
  • 22. The apparatus of claim 20, wherein the means for generating the access key comprises: means for using a hash function on the plurality of ciphering keys.
  • 23. The apparatus of claim 20, wherein the means for securely storing the secret key is a subscriber identity module (SIM) of a mobile phone using Global System for Mobile communication standard, and wherein the secret key is a subscriber authentication key.
  • 24. The apparatus of claim 23, wherein the SIM stores a 128 bit subscriber authentication key and comprises means for generating 64-bit ciphering keys; and wherein the means for generating the access key comprises means for generating a 128 bit broadcast access key using two ciphering keys.
  • 25. The apparatus of claim 20, wherein the means for securely storing the secret key is a universal subscriber identity module (USIM) of a mobile phone using Universal Mobile Telecommunications System standard, and wherein the secret key is a subscriber authentication key.
  • 26. The apparatus of claim 25, wherein the USIM stores a 128 bit subscriber authentication key and comprises means for generating 64-bit ciphering keys; and wherein the means for generating the access key comprises means for generating a 128 bit broadcast access key using two ciphering keys.
  • 27. The apparatus of claim 20, wherein the means for generating the access key generates a broadcast access key; and wherein the apparatus further comprises: means for receiving encrypted broadcast content; andmeans for decrypting the broadcast content based on the broadcast access key.
  • 28. A non-transitory machine readable medium for use in a device that securely stores a secret key, the device in communication with a network that broadcasts to a plurality of user terminals, the machine readable medium comprising: codes for receiving a plurality of random challenges from the network;codes for generating a plurality of ciphering keys based on the plurality of random challenges and the secret key;codes for generating an access key based on the plurality of ciphering keys;codes for generating a plurality of authentication responses using the plurality of challenges and the secret key;codes for sending at least one authentication response, from the plurality of authentication responses, to the network; andcodes for discarding any authentication responses, from the plurality of authentication responses, not sent to the network.
  • 29. The non-transitory machine readable medium of claim 28, wherein the codes for generating the access key comprises: codes for concatenating the plurality of ciphering keys.
  • 30. The non-transitory machine readable medium of claim 28, wherein the codes for generating the access key comprises: codes for using a hash function on the plurality of ciphering keys.
  • 31. The non-transitory machine readable medium of claim 28, wherein the device receives encrypted broadcast content, wherein the codes for generating the access key generates a broadcast access key; and wherein the machine readable medium further comprises: codes for decrypting the broadcast content based on the broadcast access key.
  • 32. The method of claim 1, wherein the network includes one or more content providers.
  • 33. The method of claim 1, wherein the network broadcasts the plurality of random challenges to the plurality of user terminals in addition to the user terminal.
  • 34. The method of claim 1, wherein the at least one authentication response sent to the network is a subset of the plurality of authentication responses.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present Application for Patent claims priority to Provisional Application No. 60/485,791 entitled “Apparatus and Method for a Secure Broadcast System” filed Jul. 8, 2003, and assigned to the assignee hereof and hereby expressly incorporated by reference herein. The present invention is related to the following applications, all of which are assigned to the assignee hereof. Co-pending U.S. application Ser. No. 10/233,188 filed Aug. 28, 2002 and entitled “Method and Apparatus for Security in a Data Processing System,” which is a continuation in part of U.S. application Ser. No. 09/933,972 filed Aug. 20, 2001 and entitled “Method and Apparatus for Security in a Data Processing System.” Co-pending U.S. Application Ser. No. 09/973,301 filed Oct. 9, 2001 and entitled “Method and Apparatus for Security in a Data Processing System.”

US Referenced Citations (394)
Number Name Date Kind
4163255 Pires et al. Jul 1979 A
4323921 Guillou et al. Apr 1982 A
4336612 Inoue et al. Jun 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
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 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
5442626 Wei Aug 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
5659556 Denissen et al. Aug 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 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 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 et al. 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 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
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 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
6366776 Wright et al. Apr 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
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 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
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 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 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 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
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 et al. Apr 2004 B2
6728226 Naito Apr 2004 B1
6731936 Chen et al. May 2004 B2
6735177 Suzuki et al. 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 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
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 et al. Dec 2004 B1
6856800 Henry et al. Feb 2005 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
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 et al. Jul 2005 B1
6920119 Rinchiuso Jul 2005 B2
6925285 Kim et al. 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 et al. 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 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 et al. 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
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
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
7599497 Soppera Oct 2009 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 et al. Jun 2001 A1
20010029581 Knauft et al. Oct 2001 A1
20010034254 Ranta 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
20020002674 Grimes 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 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
20020114469 Faccin et al. Aug 2002 A1
20020141371 Hsu Oct 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
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 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
20030157952 Sarkkinen et al. Aug 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 et al. Jan 2004 A1
20040022216 Shi et al. 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 et al. 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
20050138379 Semple et al. Jun 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
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 (231)
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
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
9331314 Dec 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
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
2000165258 Jun 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
000513519 Oct 2000 JP
2000287192 Oct 2000 JP
2000295541 Oct 2000 JP
2000324155 Nov 2000 JP
2000349755 Dec 2000 JP
2001007759 Jan 2001 JP
2001007800 Jan 2001 JP
2001016179 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
2001510970 Aug 2001 JP
2001512842 Aug 2001 JP
2001268535 Sep 2001 JP
2001513587 Sep 2001 JP
200152164 Nov 2001 JP
2001333032 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
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
WO8607224 Dec 1986 WO
WO9611538 Apr 1996 WO
WO9715161 Apr 1997 WO
WO9716890 May 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
WO-9904583 Jan 1999 WO
WO9922466 May 1999 WO
WO9922478 May 1999 WO
WO9930234 Jun 1999 WO
WO-9939524 Aug 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
WO004718 Jan 2000 WO
WO0008883 Feb 2000 WO
WO0013356 Mar 2000 WO
WO0033535 Jun 2000 WO
WO0036804 Jun 2000 WO
WO0041364 Jul 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
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
WO01020805 Mar 2001 WO
WO0145443 Jun 2001 WO
WO01050783 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
WO-03043310 May 2003 WO
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 (86)
Entry
Pannetrat et al., Authenticating Real-Time Packet Streams And Multicasts, 2002 IEEE. Computers and Communications, 2002. Proceedings. ISCC 2002. Seventh International Symposium on, pp. 490-495.
Baugher et al: “The Secure Real Time Transport Protocol (Draft 09)” Internet Engineering Task Force, AVT Working Froup, Internet -Draft, Jul. 2003, XP002320685.
Meier J D et al: “Building Secure ASP.NET Applications: Authentication, Authorization, and Secure Communication: Cryptography and Certificates” Microsoft Patterns & Practices, Nov. 2002, pp. 1-5, XP002321827.
William Stallings: “Cryptography and network security: Principles and Practice” Second Edition, 1999, Prentice Hall, New Jersey.
“Functional Model of a Conditional Access System”, EBU Review—Technical European Broadcasting Union, Bussels, BE, No. 266; Dec. 21, 1995; pp. 64-77; XP000559450.
3G TS 25.213 V4.1.0 (Jun. 2001) 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Spreading and Modulation (FDD)(Release 4).
3GPP TS 25.211 V4.2.0 (Sep. 2001) 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Physical Channels and Mapping of Transport Channels Onto Physical Channels (FDD)(Release 4).
3GPP TS 25.212 V4.2.0 (Sep. 2001) 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Multiplexing and Channel Coding (FDD)(Release 4).
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.
B.G. Marchent 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.
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).
Bormann, et al., “Robust Header Compression (ROHC),” Internet Engineering Task Force IETF Draft, 1-145, Feb. 26, 2001.
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.
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:“Universal Mobile Telecommunications Systems (UMTS); Multimedia Broadcast/Multicast Service (MBMS); Stage 1, 3GPP TS 22.146 version 5.2.0 Release 5”, ETSI TS 22.146 v5.2.0, pp. 1-15, Mar. 2002.
Farinacci, D., et al., “Generic Routing Encapsulation (GRE),” Network Working Group Request for Comments 2784, Mar. 1-8, 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://foldoc.org/index.cgi?query=spread+spectrum.
Gong, L. et al: “Trade-Offs in Routing Private Multicast Traffic,” Global Telecommunications Conference, 1995. IEEE, 2124-2128 (Nov. 13, 1995).
Greg Rose et al., “The Secure Real Time Transport Protocol,” Internet Draft, Feb. 2001, pp. 1-26.
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.
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 Personal Communication Wireless System,” 2000 IEEE, pp. 1854-1858.
Jou, Y. “Developments in Third Generation (3G) CDMA Technology,” 2000 IEEE, 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, XP010373304.
Linuxguruz,: “Free On-Line Dictionary of Computing”, § Internet Protocol, Dec. 2000.
Lou et al., “Progressive Video Streaming Over 2G and 3G Wireless Systems,” Proceedings of the 11th IEEE International Symposium on Personal Indoor and Mobile Radio Communications, vol. 2, Sep. 18-21, 2000, London, pp. 1550-1554.
Macq. Benoit M. et al. “Cryptology for Digital TV Broadcasting”, 1995 IEEE.
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 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, 557-581.
Menezes, A. et al.: “Handbook of Applied Cryptography” 1997, CRC Press LIC, USA XP002248262 pp. 497-500, 551-552.
Menezes, A. et al.: “Handbook of Applied Cryptography,” Chapter 13, pp. 543-590, CRC Press (1996).
Miyazaki: “A Stream-data Multicast Protocol Using IP Unicast Address” Technical Report of IEICE, IN2001-9, May 11, 2001.
Mooij, W.: “Advances in Conditional Access Technology”, IEEE, pp. 461-464 (Sep. 1997).
Moy, “Multicast Extensions to OSPF,” RFC 1584, Mar. 1994.
Paul K et al: “A Stability-Based Distributed Routing Mechanism to Support Unicast and Multicast Routing in Ad Hoc Wireless Network” Computer Communications, Elsevier Science Publishers BV, Amsterdam, NL, vol. 24, No. 18, Dec. 1, 2001, pp. 1828-1845, XP0043.
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-17.
Stallings, W.: “Cryptography and network security” 1995, Prentice-Hall, Inc., XP002248261 pp. 402-406, 413-417, 421-424.
Takahashi: “Prospect of Push type Information Providing Service/Technology,” Information Processing, vol. 39, No. 11, Nov. 15, 1998, p. 1124-1131.
Tanenbaum, Andrew S.: Computer Networks, Third Edition; Pub. 1996; pp. 8, and 179-190.
Tanenbaum, Andrew S.: Computer Networks; Second Edition; PUB 1993 XP2530414.
TIA/EIA/IS-856 Interim Standard cdma2000 High Rate Packet Data Air Interface Specification (Nov. 2000).
TIA/EIA/IS-95-A (Revision of TIA/EIA/IS-95) Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System (May 1995).
Toh C-K et al: “ABAM: On-Demand Associativity-Based Multicast Routing for AD HOC Mobile Networks,” Vehicular Technology Conference, 2000. IEEE, 987-993 (2000).
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, “D&R Progress on China's 3G Mobile Communications”, Telecom Science, vol. 2, 2001, pp. 11-17.
030400 International Search Report and Written Opinion—PCT/US2004/021850, International Search Authority—ISA/US—Alexandria, Virginia—Dec. 9, 2004.
International Search Report and Written Opinion—PCT/US2004/021850, International search authority—ISA/US—Alexandria, Virginia—Dec. 9, 2004.
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.
Tadaumi, “IP Technology as Communication Infra,” The Institute of Electronics Information and Communication Engineers, col. 83, No. 4, Apr. 2000, pp. 286-294.
Haverinen, et al., “EAP SIM Authentication” draft-haver inen-pppext-eap-sim-11 .txt, [online] <URL:http:I/www.watersprings.orglpub/id/draft-haverinen-pppext-eap-sim- 11 .txt> Jun. 2003, pp. 1-64.
JNSA, “Trend of the Latest Security Protocol IPsecH-with Demonstration Experiment Report for Interconnection,” Network Magazine, vol. 6, No. 6, Japan, Jun. 2001, vol. 6, pp. 86-93.
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.
Pelletier, et al., “Robust Header Compression (ROHC): A Profile for TCP/IP (ROHC-TCP)”, Internet Draft, Feb. 21, 2005, pp. 1-2.
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.
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.
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 *.
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.
“Feature Story I: Evolution of Cellular Phones,” ASCII, Dec. 1, 2000, vol. 24, No. 12, p. 204.
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; 20011128, Nov. 28, 2001, XP050271835, [retrieved on Nov. 28, 2001].
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, XP010284635, DOI : 10.1109/ICC. 1998.683142 ISBN: 978-0-7803-4788-5 * abstract * * chapter 2 *.
Supplementary European Search Report—EP04777745, Search Authority—Berlin Patent Office: Dec. 14, 2010.
Taiwan Search Report—TW093120527—TIPO-2 011-08-07.
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, pp. 94-99, XP010220159, DOI: 10.1109/GLOCOM. 1996.586133 ISBN: 978-0-7803-3336-9 * chapter 3.1 *.
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.
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.
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.
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.
Haverinen, H., “GSM SIm Authentication and Key Generation for Mobile IP”; draft-haverinenmobileip-gsmsim-01.txt; Internet Engineering Task Force, IETF, CH; Nov. 2000; XP015014135.
Menezes Alfred J., et al.,“Handbook of Applied Cryptography,” 1997 CRC Press, pp. 169-190.
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.
Related Publications (1)
Number Date Country
20050010774 A1 Jan 2005 US
Provisional Applications (1)
Number Date Country
60485791 Jul 2003 US