Linked account system using personal digital key (PDK-LAS)

Information

  • Patent Grant
  • 11258791
  • Patent Number
    11,258,791
  • Date Filed
    Monday, March 23, 2015
    9 years ago
  • Date Issued
    Tuesday, February 22, 2022
    2 years ago
  • Inventors
  • Original Assignees
  • Examiners
    • Coppola; Jacob C.
    • Castilho; Eduardo
    Agents
    • Patent Law Works LLP
Abstract
One embodiment of the invention includes a system comprising: a personal digital key and a computer readable medium that is accessible when authenticated by the personal digital key.
Description
BACKGROUND
Field of the Invention

The present invention relates generally to embodiments of a linked account system using personal digital key (PDK-LAS).


Background of the Invention

The market for downloading digital content online is rapidly climbing because distribution of such content is inexpensive, fast, and easy and the quality of the content itself is acceptable. The market, however, remains disorganized due to competing standards, competing companies, discontented artists and producers, and outright theft of digital content.


Digital rights management (DRM) companies seek to solve the foregoing problems by delivering the digital content from the real producers to the right customers and ensuring that everyone who should be paid in fact is paid. DRM seeks to get everyone paid by managing the multiple steps for distributing digital content (music, video, software) online: watermarking, encryption, transaction management, and rights management. Some DRM companies perform all these steps, while other DRM companies specialize in one or two steps of the process.


First, watermarking stamps each piece of digital content with a digital mark so it can be tracked wherever it goes. Digital watermarks are just like paper watermarks, except they cannot be seen or heard. Special software is required to read a digital watermark.


Second, encryption scrambles watermarked digital content and stores it inside a digital safe for shipment around the Internet. The safe protects the content during shipping by allowing only those with the right software key to the safe to decrypt and use the content. Third, transaction management handles actual payments for the digital content using credit card techniques found elsewhere in e-commerce. An order is placed, a credit card number is taken, account status is checked, and the exchange is authorized.


Finally, rights management manages the information about the digital content itself: what it is, who gets it, how it is delivered, how many times it may be used, how long the rights last, who gets paid, how much they get paid, and how. This information travels with the digital content in something called a digital permit. The permits rests on top of the digital content as it travels the Internet and allows legal users to enjoy the digital content for as long as the rights last.


The primary objective of DRM companies is to deploy technologies that protect digital content as it is distributed online. Some of these proposed technologies and DRM in general are discussed in the article “Digital Rights Management May Solve the Napster ‘Problem’,” Technology Investor, October 2000, pp. 24-27. Although such technologies should reduce the amount of digital theft, they generally favor the content provider at the expense of the consumer or favor the consumer at the expense of the content provider. That is, the rights of either the content provider or the consumer are compromised. For example, some technologies severely limit the consumer's ability to make extra copies of digital content even when the digital content is solely for personal use. Other technologies facilitate the making of copies of digital content which can be used by different consumers without the content provider being compensated by each consumer. The present inventor has discovered an improved DRM system and method that effectively balances and protects the rights of both the consumer and the content provider. In addition, the present inventor has discovered an associated digital content security system for protecting computers and other storage devices from unauthorized use and protecting the digital content stored on computers and other storage devices from being wrongfully accessed, copied, and/or distributed.


With the advent of the Internet, and online shopping, banking and so forth, the Internet has enabled the incidence of credit card, bank account information, and similar data being stolen has risen dramatically. The cost to providers of transactions performed with these stolen items is enormous and results in higher transaction fees and product pricing to consumers, as it is the providers who are typically responsible for charges applied to stolen account information.


Additionally, the inconvenience and tangential problems that victims, consumers, suffer as a result of such crimes are often traumatic, but are minimally troublesome. The insufficient technologies and procedures currently utilized to secure account-based transaction processing do little to prevent these crimes. The problem is most notable in the case of the largest growing segment for such transactions, the on-line environment.


SUMMARY OF THE INVENTION

One embodiment of the invention includes a system comprising: a personal digital key and a computer readable medium that is accessible when authenticated by the personal digital key.





BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing and other advantages of the invention will become apparent upon reading the following detailed description and upon reference to the drawings in which:



FIG. 1 is a flow chart of a method of managing digital rights in accordance with the present invention;



FIGS. 2,3, and 4 are block diagrams of portions of a DRM system for implementing the method in FIG. 1;



FIG. 5 is a conceptual model of core options for acquiring digital content that can be encoded to produce key-secured content and core options for playing back the key-secured content;



FIG. 6 is a block diagram for implementing a core acquisition option of downloaded content;



FIG. 7 is a block diagram for implementing a core acquisition option of store-bought content;



FIG. 8 is a block diagram for implementing a core acquisition option of broadcast content;



FIGS. 9a and 9b are block diagrams for implementing a core playback option of stand-alone devices;



FIG. 10 is a block diagram for implementing a core playback option of networked devices;



FIG. 11 is a block diagram of a standard computer hard drive incorporating an integrated PDK-RDC (receiver/decoder circuit) for the purpose of enabling multiple methods of securing digital content;



FIG. 12 is a block diagram for implementing Drive-Level protection and Sector-Level protection in connection with the computer hard drive;



FIG. 13 is a flow chart of the logic executed by the PDK-RDC for implementing Drive-Level protection and Sector-Level protection;



FIG. 14 is a block diagram for implementing File-Level protection in connection with the computer hard drive; and



FIG. 15 is a block diagram for implementing Network-Level protection by expanding File-Level protection to a network environment.



FIG. 16 is a schematic view of a PDK key system embodiment of the invention.



FIG. 17 is a schematic view of a PDK key system embodiment of the invention.





While the invention is susceptible to various modifications and alternative forms, specific embodiments have been shown by way of example in the drawings and will be described in detail herein. However, it should be understood that the invention is not intended to be limited to the particular forms disclosed. Rather, the invention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the invention as defined by the appended claims.


DESCRIPTION OF SPECIFIC EMBODIMENTS
Definitions

As used herein, “PDK Key or Key” refers to a PDK-compliant wireless key providing access to PDK-protected objects. The acronym “PDK” refers to “personal digital key.”


A “PDK-hard drive” refers to a physical or “electronic” hard drive containing an integrated RDC.


A “PDK-protected product/object” refers to a hard drive or accounts or content protected via PDK technology.


An “assigned key” is a PDK key assigned to one or more protected objects.


An “RDC” refers to a Reader/Decoder circuit installed in a user's computer, or built into computer hard drive, or point-of-sale (POS) credit card swipe unit which communicates with PDK keys and decodes PDK data.


A “POS RCD” refers to a reader/decoder circuit integrated in a standard point-of-sale (POS) credit-card swipe unit.


A “manufacturer” as used herein refers to a manufacturer of PDK-keys.


A “provider” as used herein refers to an entity issuing a PDK-linked account, PDK hard drives and so forth.


A “customer” or “user” refers to an individual possessing or utilizing a PDK-key.


A “master” or “master key” refers to a PDK key initially assigned to a PDK protected object, and which is required to be present for configuration transactions.


Description

One system embodiment of the invention, illustrated at 1000 in FIG. 16 includes a personal digital key, PDK, 1010, a point-of-sale reader decoder circuit, POS RDC, 1012, a PDK reader decoder circuit, 1014 that is connected to a provider 1016 having a database 1018. For some embodiments, the PDK reader decoder circuit and POS RDC 1014 are in a single unit 1020, which for some embodiments, is a standard credit card swipe unit integrated with RDC. For some embodiments, a standard credit card 1022 is readable in the reader 1020. The provider 1016 may be a credit card processor, bank or other similar entity. The account database 1018 maintains the account number, PDK key number and other identifiers of the user.


In another embodiment, illustrated at 2000 in FIG. 17, the PDK 1010 interfaces with a computer 2002 through a secure RF link 2004. The computer 2002 is a standard personal computer, with integrated RDC, PDK hard drive or RDC adaptor card. The computer 2002 communicates with the provider 1016 through a standard Internet connection 2006. The provider 1016 communicates with the database 1018 in a manner as described in the embodiment described above.


Once in possession of a PDK key, a user optionally registers the key with the key manufacturer or a central key database. No usage data, credit or bank account numbers, hard drive IDs, etc. is maintained in the manufacturer's database, only user verification information. This information includes a customer account number, indicating for some embodiments, a customer's record within the manufacturer's database, customer name, address and phone, key number, and status of key, in-use, stolen, lost and so forth. This information is used primarily for verification purposes during lost key replacement procedures.


The data fields stored in PDK keys include a user label which includes user text label in an unprotected field. The data fields also include an account number, which is a user's manufacturer account number, which is in a protected field. The data fields also include a key number which is a unique key identification and is a protected field.


The PDK key communicates with one of three basic implementations of a PDK-RDC which include POS RDC, a standard credit card swipe type device with an integrated RDC. A second implementation is an RDC adaptor, which is an add-on PC board RDC, interfacing via USB, firewall, PC card, expansion slot and so forth. A third implementation is a PDK hard drive which is a standard hard drive with an integrated RDC.


POS RDC devices are used in stores at checkout lanes, purchase counters, hand-held swipes, and so forth. RDC adaptors or PDK hard drives are intended for PC based use.


Physical cards such as credit/debit card accounts, bank accounts, membership accounts, or similar types of accounts, intended for use with the PDK LAS technology are conventional cards. No changes are required to such cards in order to ready them for use with the PDK LAS technology. From a consumer standpoint, this feature, along with an ability for a PDK-key to be purchased and assigned to an object at any point, enables easy acceptance of the technology.


Additionally, the PDK-LAS technology offers great flexibility in how PDK-keys are distributed, assigned, and used. For example, providers may optionally allow dynamic key assignment, assigning keys at a later date, assigning multiple keys to the same account and so forth, and users may elect to use one PDK key for all their PDK based security needs, i.e. one PDK key can be assigned to multiple accounts, PDK hard drives, and other PDK based products.


Specific examples illustrating uses of the PDK linked account embodiments are described as follows. These examples are presented to show particular applications of the PDK linked accounts and are not intended to limit embodiments of the invention.


In a first example, a user wishes to assign a key to a new PDK linked account. The user logs onto a provider's site over the Internet via the user's personal computer, in one embodiment. The user inputs whatever validation the provider typically requires. Sufficient data is requested by the provider during this transaction to authenticate the user. An RDC reads the user's PDK key data and transmits the data to the provider. The provider confirms the user's request to linl e the PDK key to the account. Once confirmed, the PDK key data is permanently stored in the provider's database as a master PDK key and can only be changed by directly contacting the provider.


In one other embodiment, users phone providers directly and verbally relay all required information, including master PDK key data, printed on a card included with the PDK key at purchase. For users with Internet access but no RDC, this information is hand entered on the provider's website.


In a second example, a user wishes to assign additional keys to a PDK linked account. The user logs onto a provider site and inputs whatever validation the provider typically requires. The user ensures that the assigned master PDK key is within the vicinity of RDC. The RDC reads the master and additional PDK key data and transmits the data to the provider. The provider confirms a user's request to link additional PDK keys to the account number, or change PDK keys or remove PDK keys. Once confirmed, the updated PDK key data is stored in the provider's database along with master PDK key data.


In an alternate embodiment, to facilitate users without an RCD equipped personal computer and Internet access, users may phone providers directly and verbally relay all required information, including both master and additional PDK key data, printed on cards (or similar) included with PDK keys at purchase. For users with Internet access but no RDC, this information may be hand entered on the provider's website.


In a third example, the user wishes to utilize a PDK linked account to purchase a product at a store. The user ensures that an assigned PDK key is within the vicinity of POS RDC at a checkout counter. The RDC reads the user's PDK key and transmits data, along with the user's account number, acquired using currently accepted procedures, to the provider for verification. If more than one PDK key is read at the counter, either data from all of the PDK keys may be transmitted to the provider or User Labels may be displayed on POS RDC to enable the user or clerk to select the appropriate PDK key. The provider looks up the account record in its database using the transmitted account number and compares the transmitted PDK key data to information stored in the record. If a match is confirmed, the sales transaction is completed normally. If not confirmed, the transaction cannot be completed.


A fourth example is one where a user desires to utilize a PDK linked account to purchase a product on-line or the user wishes to access account information on line. The user must ensure that an assigned PDK key is within the vicinity of RDC. The RDC reads the user's PDK key and transmits data, along with the user's account number, acquired using conventional techniques, to the provider for verification. If more than one PDK key is read at RDC, either data from all PDK keys is transmitted to the provider or User Labels are displayed on a computer screen to enable the user to select the appropriate PDK key. The provider looks up the account record in its database using the transmitted account number and compares the transmitted PDK key data to information stored in the record. If a match is confirmed, the transaction/session is completed normally. If not confirmed, the transaction/session cannot be completed.


A fifth example is one where the user loses a PDK key. After an initial master PDK key setup, users are encouraged to immediately assign an additional PDK key, which serves as a day-to-day key, and store the master PDK key in a safe location. If the day-to-day key is lost, the master is usable to assign the new day-to-day key. As a last resort, for users losing all PDK keys, the key manufacturer may be contacted and, after authentication is performed, instructed to ship a replacement PDK key.


Turning now to the drawings and referring initially to FIG. 1, there is depicted a method of managing digital rights in accordance with the present invention. First, a new user requests a physical electronic key or data unit from a key provider (step 10). The key provider may offer a web site on the Internet, a toll free telephone number, and/or retail outlet where the key may be acquired. In addition, the key provider may allow a key to be requested in writing, preferably using a form designed by the key provider. In one model the user may acquire as many keys as desired, while in another model each user is only entitled to a single key.


Second, in response to the user's request for a physical key, the key provider establishes a new secure account for that new user in a secure user account database (step 12). The new account may include the following data fields: account number, password, software encryption key, user label, number of users (linked to account), address, telephone number, e-mail address, and custom fields. The custom fields may, for example, include demographic information such as the user's age, gender, marital status, income level, interests, hobbies, etc. The physical key may include the following data fields: user label, account number, software decryption key, and a custom storage area. The user label and the account number serve as a first activation code (or key code) for the acquired physical key. All data fields on the physical key, except for the user label, are preferably encrypted. To allow the user to view his or her account in the future, the user is preferably assigned a login name and the above-noted password.


Third, the key provider ships the physical electronic key to the new user via a package courier such as the U.S. Postal Service, United Parcel Service, or Federal Express (step 14). In one pricing model the physical key is sent to the user at no charge, while in another pricing model the physical key must be purchased by the user. If the physical key must be purchased by the user, either the user must provide credit/debit card information to the key provider in step 10 to pay with a credit/debit card, or the key provider includes an invoice with the shipped key in step 14.



FIG. 2 is a block diagram of a system for implementing steps 10, 12, and 14 of the method of managing digital rights. The system includes the new user 100, the key provider's web site 102, and the user account database 104.


Referring back to FIG. 1, fourth, the user transmits his or her activation code in the physical key to a digital content provider, who may have a cooperative relationship with the key provider, and requests to purchase digital content (music, video, or software) from that content provider (step 16). The content provider may offer a web site on the Internet containing a listing of digital content available for purchase. To transmit the activation code to the content provider via the web site, the user may manually enter the activation code onto a secure page of the web site. Alternatively, the transmission of the activation code may be automatically implemented with wireless technology. Specifically, the user's computer may be outfitted with a detector that detects the activation code in the user's physical key and then relays the activation code to the content provider via the web site. The content provider may be affiliated with the key provider or may be separate from the key provider but have an arrangement therewith.


Fifth, the content provider requests the key provider to verify the activation code transmitted by the user (step 18). The content provider may send this request to the key provider's web site.


Sixth, the key provider in turn accesses the user's account in the user account database and determines whether the activation code is in fact valid (step 20). The key provider may also determine whether the activation code is associated with the user that transmitted the activation code to the content provider. If the activation code is rejected as being invalid, the content provider is so informed and the content provider in turn will not honor any request by the user to purchase digital content. If, however, the activation code is accepted as being valid, the content provider is so informed and the purchase transaction proceeds. As used herein, the term “key provider” generically refers to the entity or entities that manufacture, distribute, and validate the physical keys. These functions may actually be performed by multiple entities at different locations or by a single entity at a single location.


Seventh, after securing validation of the first activation code in the physical key, the content provider pulls the requested digital content from a digital content database/library, marks the digital content with a second activation code (or unlock code) associated with the first activation code in the physical key, and encrypts the marked digital content (step 22). The second activation code in the digital content may simply be the same as the first activation code in the physical key, but at least partially encrypted for security. In one embodiment, the “key-secured” content file includes the following data fields: user label, account number, and digital content. The user label and the account number serve as the second activation code for the digital content. If the content is merely for sampling (described in connection with FIG. 6), the file may include such additional data fields as a receiver/decoder circuit identification number, hour stamp, and life hours. All data fields on the content file, except for the user label, are preferably encrypted.


Eighth, the content provider delivers the encrypted digital content to the user (step 24). The encrypted digital content may be delivered by downloading the encrypted digital content to the user's computer while the user is online at the content provider's web site, by attaching the digital content to an e-mail addressed to the user, or by shipping a disk containing the encrypted digital content to the user via a package courier. The user may pay for the digital content either by providing credit/debit card information to the content provider in step 16 or by paying off of an invoice included with delivered digital content. If the digital content is delivered online, the user is preferably required to provide the credit/debit card information and have such information approved as a prerequisite to delivery of the digital content. If the user possesses more than one physical electronic key and would like the acquired digital content to function with each of the user's keys, all of the activation codes are applied to the digital content. The content provider charges the user based on the number of keys with which the user would like the digital content to function. For example, the user may be charged the same amount for each activation code, or may be charged a larger amount for one activation code and lesser amounts (e.g., surcharges) for additional activation codes.



FIG. 3 is a block diagram of a system for implementing steps 16, 18, 20, 22, and 24 of the method of managing digital rights. The system includes the new user 100, the content provider 106, the key provider's web site 102, the digital content database 108, and the acquired digital content 110.


Returning to FIG. 1, ninth, the user enters the encrypted digital content into a playing device of a type suitable for playing the digital content (step 26). The device may, for example, be an MP3 player, a personal computer, a DVD player, a CD player, a cellular phone, or other portable device. In one embodiment, the device contains a wireless transceiver adapted to receive a radio frequency signal transmitted by a corresponding wireless transceiver in the user's physical electronic key. The wireless transceiver in the device is optionally tracked and “secured” for audit purposes by permanently including a unique identifier assigned by the device manufacturer in the transceiver.


Tenth, with the user's physical electronic key within a short range (e.g., few meters) of the playing device, the playing device reads (1) the first activation code carried in a secure radio frequency signal transmitted by the transceiver in the physical key to the transceiver in the device and (2) the second activation code marked on the encrypted digital content (step 28). The device contains decryption software or hardware for decrypting the encrypted digital content to the extent necessary to read any encrypted portion of the second activation code.


Eleventh, the playing device compares the first activation code and the second activation code and determines whether the first activation code is associated with the second activation code (step 30). Steps 29 and 30 may be performed, for example, when the user presses a “play” button on the playing device or when the user first enters the encrypted digital content into the playing device. If the first activation code is associated with the second activation code, the device decrypts and plays the digital content. If the first activation code is not associated with the second activation code, the device does not play the digital content. If the second activation code is simply the same as the first activation code, then the foregoing comparison determines whether there is a match between the first activation code and the second activation code. In a preferred embodiment, the device continues to play the digital content only while the physical key is sufficiently close to the device to communicate the first activation code to the device and allow the device to compare the first activation code to the second activation code at least partially encrypted with the digital content even while the digital content is being played. If the physical key is moved out of range, the device is no longer enabled to decrypt and play the digital content. In an alternative embodiment, once the device is initially enabled to decrypt and play the digital content, the device remains enabled until either the “play” function is stopped, a play track/song ends, or the digital content is removed from the device, even if the physical key is moved out of range such that the key can no longer communicate the first activation code to the device.



FIG. 4 is a block diagram of a system for implementing steps 26, 28, and 30 of the method of managing digital rights. The system includes the encrypted digital content 110, the key-enabled playing devices 112, and the user's physical electronic key 114.


As stated above, the user's physical electronic key and the key-enabled playing device contain respective wireless transceivers to communicate the activation code in the key to the device. In a preferred embodiment, the transceivers are small, inexpensive Bluetooth radio chips that operate in the unlicensed ISM band at 2.4 GHz and avoid interference from other signals by hopping to a new frequency after transmitting or receiving a packet. The radio chips are plugged into electronic devices, which can then communicate over short distances and through obstacles by means of radio waves. Bluetooth is a term used to describe the protocol of a short range (e.g., about 10 meters) frequency-hopping radio link between devices containing the radio chips. These devices are then termed “Bluetooth-enabled.” The secure radio link replaces a cable that would otherwise be used to connect the devices. Further details concerning Bluetooth wireless technology may be obtained from www.bluetooth.com.


Wireless technologies other than Bluetooth may be used to communicate the activation code from the user's physical electronic key to the playing device. One example of an alternative wireless technology is known by a trade term “Wi-Fi,” which is short for wireless fidelity and is another name for IEEE 802.11 b. Products certified as Wi-Fi by the Wireless Ethernet Compatibility Alliance (WECA) are interoperable with each other even if they are from different manufacturers. A user with a Wi-Fi product can use any brand of access point with any other brand of client hardware that is built to the Wi-Fi standard.


In other alternative embodiments, the communication between the user's physical electronic key and the playing device is not wireless. Rather, in one alternative embodiment, the user's physical electronic key communicates the activation code to the playing device via a transmission line such as a serial cable that plugs into the key at one end and the playing device at the other end. In another alternative embodiment, the key is a smart card or magnetic card into which the activation code is encoded, and the key is configured to physically fit into a card reader slot on the playing device.


The above-described DRM method and system for implementing the method are advantageous in that they afford the key holder with tremendous versatility in copying and using encrypted digital content for personal use. At the same time, the rights of the content provider are protected because only the key holder with a key-enabled device can use the encrypted digital content. The key holder can copy the encrypted digital content as many times as desired, but can only play the encrypted digital content on a key-enabled device that is enabled with the physical electronic key coded to decrypt the encrypted digital content. Thus, the digital content, even when copied, remains personal to the key holder. Individuals other than the key holder cannot use the encrypted digital content, even if they copy it, because both the original and copies of the encrypted digital content are still encrypted and the individuals do not hold the physical electronic key coded to decrypt the digital content.


A core element of the present invention is the concept of a portable, physical electronic key that is personal to a particular user. The physical key represents a DRM solution that fully addresses the needs of both consumers and publishers of digital content. The physical key is permanently associated with a user's digital content library. At the time of content acquisition, the physical key becomes permanently associated with the newly acquired content. The user is now “linked” to that acquired content. A user (e.g., individual or family) may own as many physical keys as desired, but every piece of encrypted digital content purchased is tied to one specific key. The user may duplicate or transfer the acquired content to any media or device for playback as many times as desired, as long as the associated physical key is present. Thus, the present invention guarantees that the acquired content is played only by the user who has legitimately paid for it. The present invention gives consumers unprecedented freedoms and conveniences to use legitimately purchased content while still fully protecting content providers' rights.


Referring to FIG. 5, the present invention fully supports the use of “keysecured” digital content 125 with all core content acquisition options and all core playback options. The key-secured digital content 125 is encoded with a second activation code associated with a first activation code stored on the user's physical electronic key. The core acquisition options include downloaded content 120, store-bought content 122, and broadcast content 124. The core playback options include stand-alone devices 126 and networked devices 128. Each of these options are described in further detail below.


Referring to FIG. 6 generally, as already noted in FIGS. 1 through 4, a primary application of the present invention is its use in the downloading of digital content from the Internet. A consumer shops a content distributor's website and selects a piece of content they wish to purchase (music, movies, software, E-books, etc.). The consumer then provides the web site with standard on-line purchase information including the selection's title and method of payment, as well as their physical electronic key information. Transparent to the consumer, the distributor's web site links to the key provider's web site and transmits the physical key information for validation. The key provider's web site then provides the distributor's web site with the information required to prepare the acquired content for secure shipment to the consumer (or notification that the physical key was invalid). The key provider's web site records the transaction for later billing. Finally, the distributor's web site retrieves a copy of the digital content from its library, permanently links it to the consumer's physical key (by using the key's information to encrypt it), and transmits the secured content to the consumer. The consumer is now free to duplicate the content as often as desired, and to play the content on any key-enabled playback device.


Referring to the specifics of FIG. 6, the process of implementing the core acquisition option of downloaded digital content 120 (see FIG. 5) proceeds as follows. At step 130, a receiver/decoder circuit 140 retrieves an account number from a consumer's physical key (transponder) 142 over a secure RF line. At step 131, the consumer enters such data as a password, purchase selection, and method of payment via the consumer's personal computer 144. The data is transmitted to a content distributor's web site 146 from the consumer's personal computer 144. At step 132, the content distributor's web site 146 transmits the account number and password to a key provider's web site 148. At step 133, the key provider's web site 148 authenticates all data against its database 150 and, if authentic, returns such information as the account number, user label, number of users, and software encryption key to the distributor's web site 146. If the data is not valid, the key provider's web site 148 sends a message to the distributor's web site 146 indicating the same. A counter, used for the key provider's billing purposes, is incremented. At step 134, the distributor's web site 146 pulls the purchased content file from its database 152, encrypts it with the software encryption key it received in step 133, and builds a final key-secured content file that is then transmitted to the consumer's personal computer 144. Charges are assessed based on the number of users, etc. and billed to the consumer according to the method of payment. At step 135, invoices 154 are generated and sent to content distributors by the key provider's web site 148 on a regular cycle.


Optionally, to enable content providers to offer sample content (e.g., limiting playback to the device on which the content was originally downloaded, for a specified period of time) a special “enhanced” version of a receiver/decoder circuit 140 can be produced. These enhanced receiver/decoder circuits (primarily for PC's) would each include a unique identification number and additional functionality enabling them to “talk” to a key provider's web site 148 to acquire secured timing information. Sample content files may include the following information (in their encrypted header section):

    • identification number of enhanced receiver/decoder circuit used for downloading and transmitted by the receiver/decoder circuit to the key provider's web site at the time of content purchase;
    • hour stamp (i.e., the hour in which the content was downloaded; and
    • life hours (i.e., number of hours content remains valid, such as perpetual, one hour, 24 hours, 48 hours, etc.).


      The above information is used by an “enhanced” receiver/decoder circuit during playback to determine whether a content file has “expired” or is attempting to play on an unauthorized device (i.e., any device except the device on which the content was originally downloaded). This capability allows content distributor web sites to distribute limited-use samples with associated tiered-pricing models.


Referring to FIG. 7 generally, the present invention can be extended to store-bought content. To fully integrate store-bought content into the present invention, traditional store-bought content is modified in two ways. First, the content is distributed in a copy protected format (e.g., using any valid copy protection technology). Second, the content contains a unique content serial code. The content serial code may be contained either directly in the digital content or as a physical label. Each content serial code is designated by a content distributor during manufacturing and stored in the key provider's database. This database is later used to validate that each content serial code is unique and used only a prescribed number of times. To a consumer, a content serial code on their newly purchased store-bought content represents a download of a key-secured version of that content for free or a prescribed price. This key-secured copy provides the consumer with exactly the same advantages and freedoms as any other key-secured content. From the consumer's standpoint, the download process occurs exactly as any other standard key-secured content download with the exception of how the payment is handled. The “payment” is the content serial code. By providing all of the advantages of the present invention to consumers of legacy-capable store-bought content (by way of “content serial code downloads”), the scheme provides the industry with the first complete DRM solution.


Referring to the specifics of FIG. 7, the process of implementing the core acquisition option of store-bought digital content 122 (see FIG. 5) proceeds as follows. At step 160, a receiver/decoder circuit 170 retrieves an account number from a consumer's physical key (transponder) 172 over a secure RF link, and the consumer's personal computer 174 reads a content serial code from the store bought content 122. The store-bought content 122 contains the content serial code that uniquely identifies the content. The format of the content serial code may, for example, be PPPP.FFF.0123456789 where PPPP is a provider identification, FFF is a facility identification, and the numbers represent a sequence number. The store-bought content 122 incorporates a copy protection scheme such as Macrovision™, key2audio™, or SafeAudio™. Disc “copy flags” (specified in SDMI standards) may also be set to further inhibit duplication efforts.


At step 161, the consumer enters such data as a password and purchase selection via the consumer's personal computer 174. The previously-read content serial code specifies that the method of payment is to a “content serial code-credit” (i.e., there is typically no charge for this download because the content serial code confirms that the download in process is of content that the consumer has already legitimately purchased). The data is transmitted to a content distributor's web site 176 from the consumer's personal computer 174. At step 162, the distributor's web site 176 transmits the content serial code, account number, and password to a key provider's web site 178. At step 163, the key provider's web site 178 authenticates all data against its databases 180 and 182 and, if authentic, returns such information as the account number, user label, number of users, software encryption key, and paid-flag (indicating the content serial code has been validated) to the distributor's web site 176. The key provider's web site 178 now sets the paid-flag to disable any further downloads and records the account number field in the content serial code database 182 for auditing purposes. If the data is not valid, the key provider's web site 178 sends a message to the distributor's web site 176 indicating the same. A counter, used for the key provider's billing purposes, is incremented. Each entry in the content serial code database 182 may include the following data fields: CDC #, paid-flag, and account number. At step 164, the distributor's web site 176 pulls the content file from its database 184, encrypts it with the software encryption key it received in step 163, and builds a final key-secured file that is then transmitted to the consumer's personal computer 174. No charge is typically assessed because a valid content serial code serves as “payment” for the download. At step 165, invoices 186 are generated and sent to content distributors by the key provider's web site 178 on a regular cycle.


Referring to FIG. 8 generally, the present invention can be extended to broadcast content. To fully integrate broadcast content into the present invention, traditional broadcast content is only minimally modified. The modification is that the broadcast content is transmitted in a copy protected format (such as the DVD standard known as Content Scramble System (CSS)). The remainder of the process is described below. A key-enabled recording device, incorporating a unique identifier, receives copy-protected broadcast content. If only playback of the broadcast content is desired, basic decoding (e.g., CSS) is performed and the broadcast content is sent on for playback. If the consumer wishes to record the broadcast content, however, the recording device performs additional steps prior to sending the broadcast content on for playback. The recording device connects to the key provider's web site to validate the recording device's internal identifier and the consumer's physical key. If both are valid, the recording device translates the broadcast content into a key-secured format by encoding it with the consumer's activation code, and then stores the key-secured content file, with its identifier permanently embedded within, for later use. The end result is key-secured broadcast content that provides the owner of the associated physical key all the freedoms and advantages of the present invention. Although the content was originally broadcast, it cannot be illegally copied or distributed. The present invention can be applied to pay per view offerings, as well as standard broadcast material.


Referring to the specifics of FIG. 8, the process of implementing the core acquisition option of broadcast digital content 124 (see FIG. 5) proceeds as follows. At step 180, a receiver/translator/recording device 190 receives digitally broadcast content in copy-protected format from a source 192 such as satellite, cable, Internet, or over-air. The broadcast content may be copy protected using a copy-protection technology such as an enhanced CSS scheme. If a consumer wishes to only play (not record) the broadcast content, basic decoding (e.g., CSS decoding) is performed and the broadcast content is passed through to presentation device 194 for playback. The remaining steps below may be skipped.


If, however, the consumer wishes to record the broadcast content, the following additional steps are performed prior to sending the broadcast content on for playback. At step 181, the receiver/translator/recording device 190 retrieves an account number from the consumer's physical key (transponder) 196 over a secure RF link. At step 182, the receiver/translator/recording device 190 transmits the account number and its recorder serial code to a key provider's web site 198. Each device 190 contains a recorder serial code that uniquely identifies the device. The format of the recorder serial code may, for example, be MMMM.FFF.0123456789 where MMMM is a manufacturer identification, FFF is a facility identification, and the numbers represent a sequence number. At step 183, the key provider's web site 198 authenticates the data against its databases 200 and 202 and returns an “approved” or “rejected” response. A counter, used for the key provider's billing purposes, is incremented. At step 184, if a “rejected” response is received, the broadcast content cannot be recorded. If an “approved” response is received, the receiver/translator/recording device 190 translates the decoded content into a key-secured format by encoding it with the consumer's activation code, and records the key-secured content, with the recorder serial code permanently embedded within, to a storage device (that can optionally be an external device). The broadcast content can now be copied to and played back on any key-enabled playback device. At step 185, invoices 199 are generated and sent to content distributors by the key provider's web site 198 on a regular cycle. While providing excellent additional security and protections, steps 182 and 183 are not mandatory for the present invention to function with broadcast content. It may be desirable, for cost purposes, to produce receiver/translator/recording devices 190 not capable of communicating with the key provider's web site 198.


Referring to FIGS. 9a and 9b generally, having acquired key-secured digital content and produced copies for playback on various devices such as a portable CD player, personal computer, home theater, etc., a consumer is now ready to use the digital content. Playback of key-secured content occurs as follows. A key-enabled playback device transparently reads information from a consumer's physical key and from the content file the consumer has requested to play. The pieces of information are then compared to validate that the physical key “matches” the content to be played. If the elements match, the device begins playback of the content. If the elements do not match, the device will not play the content and, depending upon the device's capabilities, may display an “invalid content” message. From a consumer's point of view, when used with legitimately-acquired content, the process is entirely transparent, effortless, and non-intrusive. The consumer is free to use their content on any key-enabled playback device, with the only restriction being that the content can be played only when the associated physical key is present. As noted above, the present invention gives consumers unprecedented freedoms and conveniences to use legitimately purchased content while still fully protecting content providers' rights.


Referring to the specifics of FIGS. 9a and 9b, the process of implementing the core playback option of stand-alone devices 126 (see FIG. 5) proceeds as follows. At step 210, a consumer requests playback of a key-secured content file via a playback device 220. The playback device 220 may, for example, be the consumer's personal computer (FIG. 9a) or a stereo amplifier (FIG. 9b) with integrated compact disc reader/player. At step 211, a receiver/decoder circuit 222 searches for a physical key (transponder) 224. The circuit 222 may be a separate component from the playback device 220 as in FIG. 9a or integrated into the playback device 220 as in FIG. 9b. If the physical key is not found, the playback device 220 displays an “invalid content” message. If the physical key is found, the receiver/decoder circuit 222 retrieves all available information from the physical key 224 over a secure RF link. At step 212, the user labels in the physical key 224 and the key-secured content file are compared. If the user labels do not match, the playback device 220 displays an “invalid” message. If the user labels do match, the receiver/decoder circuit 222 retrieves the software decryption key from the physical key 224 over the secure RF link between the physical key 224 and the playback device 220 and begins decryption of the encrypted portion of key-secured file. When the account number is decrypted, it is matched against the account number retrieved from the physical key 224. If the account numbers do not match, the playback device 220 displays an “invalid content” message. If the account numbers do match, the software decryption key is used by the playback device 220 to decrypt remaining data in the key-secured file for playback. The user label and the account number in the physical key serve as a first activation code, and the user label and the account number in the content file serve as a second activation code. These activation codes must match (or have some other predetermined association) in order for playback to proceed.


Referring to FIG. 10 generally, while stand-alone playback devices (e.g., CD players, pes, DVD players, etc.) are currently the norm, the convergence of these devices and the Internet will lead to an environment where centralized digital distribution systems proliferate. Security of content in these environments is critical yet challenging to accomplish without imposing great restrictions. The present invention can provide security to a centralized digital distribution system and, in addition, offers many important enhancements that greatly increase the convenience and usability of such a system. These enhancements include integration of the physical key into a portable handheld computer which then doubles as the system remote. In addition to controlling all networked components, the remote is used for tasks such as purchasing content from the Internet, and tracking the movement of a user throughout a facility to provide automatic “content following” (i.e., where content playback follows the user from room to room). The centralized nature of the digital content distribution system means that only one storage device is required to maintain a consumer's entire digital content library (e.g., music, movies, software, E-books, etc.) and to feed that content to any networked playback device.


Referring to the specifics of FIG. 10, there is shown a centralized digital content distribution system for implementing the core playback option of networked devices 128 (see FIG. 5). The system is used in an establishment such as a residence or entertainment facility. The system includes a digital content server 310, a distribution hub 312, a plurality of remote clients 314, and a portable remote control 316. The digital content server 310 stores digital content acquired from a source 318 such as satellite, cable, Internet, or over-air. In addition, the digital content server 310 may store digital content uploaded from a standard component 324. The plurality of remote clients 314 are located in different rooms of the establishment and linked to the digital content server 310 via the distribution hub 312 or switch. The remote clients 314 are linked to the distribution hub 312 by a backbone transmission network 315. The backbone transmission network 315 may be wireless or wired with fiber optic cables, coaxial cables, or twisted pair cables, may employ a networking protocol such as Ethernet, Wi-Fi, Arcnet, or ATM (Asynchronous Transfer Mode), and may employ a communications protocol such as TCP/IP. Each remote client 314 includes a network interface card (NIC) for interfacing with the backbone transmission network 315.


The remote control 316 is adapted to communicate with each of the remote clients 314 and select the digital content stored in the digital content server 310. The remote control 316 is essentially a personal digital assistant (i.e., hand-held computer) including a display and added remote control circuitry. The display may, for example, be a liquid crystal display (LCD). The added remote control circuitry includes “system remote” circuitry and “universal remote” circuitry.


The “system remote” circuitry in the remote control 316 is for establishing a first wireless transmission link 320 with each of the remote clients 314. The first wireless transmission link 320 may be a secure radio link (RF) as shown or an infrared link (IR). Upon establishing the first wireless transmission link 320 with one of the remote clients 314, the remote control 316 serves as a system remote capable of (1) displaying, scanning, and selecting the digital content available on the digital content server 310 and downloading the selected digital content from the digital content server 310 to the linked remote client 314 and (2) controlling the digital content server 310 to acquire or download digital content from a source 318 such as satellite, cable, Internet, or over-air. As used herein, the term “download” and similar variations thereof (e.g., downloaded, downloading, etc.) is intended to cover the transfer of content from one device to a receiving device whether the content is stored on the receiving device or merely “streamed” to the receiving device for immediate playback. The remote control 316 preferably includes a display for displaying the digital content. The display may, for example, be a liquid crystal display (LCD). As a user holding the remote control 316 moves from room to room of the establishment, the remote control 316 successively establishes wireless transmission links 320 with the remote clients 314 in the respective rooms. In this way, the digital content available on the digital content server 310 follows the user's movement from room to room.


In a preferred embodiment, the first wireless transmission link 320 is a secure radio link established by matching transceivers in the remote control 316 and each remote client 314. The matching transceivers are preferably small, inexpensive Bluetooth™ radio chips that operate in the unlicensed ISM band at 2.4 GHz and avoid interference from other signals by hopping to a new frequency after transmitting or receiving a packet. The radio chips are integrated into the respective remote control 316 and each remote client 314, which can then communicate over short distances and through obstacles by means of radio waves. Wireless technologies other than Bluetooth, such as Wi-Fi, may be used to communicate remote control signals between the remote control 316 and each remote client 314.


The “universal remote” circuitry in the remote control 316 is for establishing a second wireless transmission link 322 with standard components 324 connected to the remote clients 314. The second wireless transmission link 322 is preferably an infrared link (IR) as shown. Upon establishing the second wireless transmission link 322 with one of the standard components 324, the remote control 316 series as a universal remote capable of operating the standard component 324. The standard component 324 may, for example, be an audio receiver (stereo amplifier), an audiovisual receiver, a video monitor (television), etc. The standard components 324 may be physically separate from, but linked to, the respective remote clients 314 or may be physically integrated into the respective remote clients 314 like integrated device 324c.


The digital content stored on the digital content server 310 may be formatted as a compact disc (CD), digital video disc (DVD), MP3, electronic book, software, etc. When the remote control 316 is linked to one of the remote clients 314, a user may scan and select digital content to be downloaded from the digital content server 310 to the remote client 314 and converted by the remote client 314 to a standard playable format (e.g., analog format) that can be played on the associated standard component 324. The selected digital content is downloaded from the digital content server 310 to the remote client 314 as raw digital data packets. The remote client 314, in turn, converts the downloaded digital content to a standard component output(s) compatible with a standard component 324 connected to the remote client 314, and the standard component 324 plays the digital content. Ports may, for example, include S-Video, RCA jacks, serial ports, Universal Serial Bus, Ethernet, Wi-Fi, Firewire™, Bluetooth, RF, or other similar outputs. The standard component 324 incorporates, or is linked to, audio speakers for broadcasting any audio signals received from the remote client 314 and a video monitor for displaying any video signals received from the remote client 314.


All content is stored on the digital content server 310 digitally, and is key-secured if obtained via the download or broadcast acquisition options of FIGS. 6 and 8. If the digital content is key-secured, the plurality of remote clients 314 include decryption circuitry (i.e., receiver/decoder circuit) for unlocking the digital content. The digital content selected for download from the digital content server 310 to a remote client 314 preferably remains encrypted until converted to a standard component output(s) in the remote client 314. The remote client 314 acts as a converter between key-secured digital content from the digital content server 310 and the standard component output(s). To decrypt the selected digital content, the remote control 316 contains a physical key initially acquired from a key provider in accordance with the present invention. The digital content is initially acquired from a content provider 326 that marks the digital content with an activation code associated with the physical key. The decryption circuitry in the remote client 314 receives an activation code from the IS remote control 316 via the wireless transmission link 320 and is enabled to unlock and convert the digital content to a playable format if the activation code in the remote control 316 is associated with the activation code in the digital content. If the activation code in the remote control 316 is not associated with the activation code in the digital content, the remote client 314 will not unlock and convert the digital content.


In an alternative embodiment, the remote clients 314 are eliminated and the standard components 324 are linked directly to standard component outputs of the distribution hub 312 by the backbone transmission network 315. In this case, the distribution hub 312 serves as a switch, and the digital content server 310 contains the decryption circuitry for unlocking the digital content. As the digital content is decrypted, it is converted to a playable format and fed to the distribution switch 312 for delivery to the appropriate standard component 324. The decryption circuitry in the digital content server 310 receives the activation code from the remote control 316 and is only enabled to unlock and convert the digital content to a playable format if the activation code in the remote control 316 is associated with the activation code in the digital content.


Instead of decrypting the digital content so that it can be played, the digital content may be downloaded (or “passed through”) in its encrypted format to a storage device such as a media burner 324a or computer hard disk 324b for storage thereon. When a user ultimately desires to play the stored digital content on a media player, the media player must contain the decryption circuitry for unlocking the digital content. After unlocking the digital content, the media player converts the unlocked digital content to a playable format and plays the digital content. The decryption circuitry in the media player receives the activation code from the remote control 316 or physical key with the same activation code. The media player is only enabled to unlock and convert the digital content to a playable format if the activation code in the remote control 316 or physical key is associated with the activation code in the digital content.


In addition to downloading selected digital content from the digital content server 310 to the remote clients 314, data (e.g., MP3, CD, DVD, software, etc.) from the standard components 324 can be uploaded to the digital content server 310 and stored digitally thereon. This allows for storage of legacy content on the digital content server 310.


Referring to FIG. 11 generally, a digital content security system and method protects computers from unauthorized use and protects the digital content stored on computers from being wrongfully accessed, copying, and/or distributed. The basic components of the Personal Digital Key Digital Content Security System (PDK-DCSS) are (1) a standard hard drive device 330, with the addition of a PDK Receiver/Decoder Circuit (PDK-RDC) 332 integrated into the controller 334, and (2) a PDK-Key 336 associated with the PDK-RDC as described above. The standard computer hard drive 330 incorporates the integrated PDK-RDC 332 for the purpose of enabling multiple methods of securing digital content. Hard drives 330 incorporating a PDK-RDC 332 are referred to herein as PDK hard drives. While the PDK-DCSS diagrams show the PDK-RDC 332 as being integrated with the hard drive's controller 334, all OS-level protections described below can be implemented using externally-based PDK-RDCs.


A PDK hard drive 330 is similar to any standard, currently available hard drive with the exception of the PDK-RDC 332 (which is integrated into the drive's controller circuit 334). A PDK-RDC 332 is an integrated circuit able to process PDK-Key information, as well as encrypt/decrypt PDK-compliant digital content. Additionally, this circuit 332 is able to secure the hard drive 330 itself. This is implemented by the circuit 332 enabling or disabling the hard drive's controller 334 depending on whether an associated PDK-Key 336 (one which is uniquely and permanently associated with the PDK hard drive 330) is present. Each POK hard drive 330 would typically be delivered with its own POK-Key 336.


Secure RF communications between a PDK-Key 336 and its associated hard drive 330 occurs in the same manner as described above. It should be noted that software drivers can optionally be designed to allow for dynamic key assignment (assigning of keys after purchase to enable key swapping, or assigning of individual keys to multiple devices).


The PDK-Key and RDC technology is utilized to provide two categories of protection:


1) Hard drive access control—where an entire drive 330 is either completely accessible (unlocked) or inaccessible (locked), and/or individual data sectors or clusters of data sectors are optionally encrypted/decrypted, depending on whether the specific PDK-Key 336 associated (and shipped) with the drive 330 is within range. This category of protection can be accomplished transparently to the operating system (OS) responsible for managing the drive.


2) OS-level independent file protection—where the drive's RDC 332 functions independently of the drive 330 to protect individual files (typically copyrighted material) from wrongful copying. In this role, the RDC 332 works with any PDK-Key 336 (not just the one delivered with the drive 330) and any PDK-compliant file (they do not have to be stored on or associated with the hard drive 330). This category of protection requires an OS-level software driver be run under the OS responsible for managing the drive.


By utilizing these two categories of protection in various ways, four unique levels of content protection are enabled. Two of the levels (Drive-Level and Sector-Level) do not require external software support, while the remaining two (File-Level and Network-Level) require software drivers, as well as a stand-S alone application for Network-Level implementations. Each of the four levels is defined below.


Referring to FIGS. 12 and 13 for Drive-Level protection, when implemented, a PDK hard drive 330 will only function when the associated PDK-Key 336 is within range. The drive's controller 334 is disabled whenever the PDK-Key 336 is not present. The contents of files stored on the drive 330 are not encrypted. The Drive-Level protection feature is designed to protect the hard drive's owner by locking access to the PDK hard drive 330 whenever the associated PDK-Key 336 is not present (i.e. when the owner momentarily steps away from the computer, if the computer is stolen, etc.).


Referring to FIGS. 12 and 13 for Sector-Level protection, when enabled, every sector (or cluster of sectors) read or written is encrypted/decrypted by the RDC 332 using the drive's associated PDK-Key 336. Because the encryption is performed at Sector-Level as opposed to File-Level, the encoding can be accomplished without requiring any changes, involvement, or acknowledgement of the OS responsible for managing the drive. The Sector-Level protection feature is designed to further protect the hard drive's owner (beyond Drive-Level protection) by encrypting the contents of the files stored on the drive, without requiring any software modifications (OS, application, etc.). The security advantage is that if the drive access is in some way defeated, the contents of files on the drive are still protected. It should be noted that if users retrieve files from drive and purposely transfer them anywhere else (via email, memory sticks, etc.), the data will no longer be protected. Drive-Level protection and Sector-Level protection may be used individually or in combination. Also, as noted above, it should be understood that Sector-Level protection may be applied to individual data sectors or clusters of data sectors.



FIG. 13 illustrates the logic executed by the RDC 332 for implementing Drive-Level protection and Sector-Level protection. The logic ensures OS-level commands (save entire file, read entire file, etc.) are given adequate time to complete. This enables implementation of logic without requiring OS changes, involvement, or acknowledgement.


Referring to FIG. 14 for File-Level protection, implemented as an OS-level software driver utilizing the PDK-RDC 332 integrated in the PDK hard drive 330, File-Level protection provides standard PDK digital rights management services and functionality as described above. As needed, the driver instructs the RDC 332 to acquire PDK-Key information, validate the key-to-file match, and use the key's information to perform actual encryption/decryption of the file (as a whole, not at the sector level). In the illustrated example, the file ABC 338 (which can reside on any storage device, in memory, etc.) is compared to any PDK-Key 336 within range of the PDK-RDC 332. If a match is found, the PDK-RDC 332 will decrypt the file 338 for use with whatever playback mechanism placed the request. Any PDK-Key 336 can be utilized, not just the key 336 associated with the PDK hard drive 330. When employed for File-Level protection (and Network-Level protection as described below), the PDK-RDC 332 functions independently of the hard drive 330 in which it resides. While PDK-compliant files it encrypts or decrypts may reside on the resident hard drive 330 and may be associated with the drive's PDK-Key 336, they do not have to be. The PDK-RDC 332 can work with other PDK-Keys and files residing on other mediums. When used in this manner, the PDK-RDC 332 can be thought of as just coincidently residing within the hard drive 330. For File-Level and Network-Level protection, the RDC 332 may be implemented as a separate circuit board (not integrated within the hard drive 330) and still provide identical functionality.


The primary use of File-Level protection is to secure and protect private or copyrighted material from wrongful copying and distribution. Because copies of any PDK-compliant files can only be accessed when the associated PDK-Key is present, File-Level protection enables copies (intended for use by the holder of the associated key) to be produced effortlessly and securely. In addition to the distribution of copyrighted content such as music and movies as described above, software developers can distribute their software products via the Internet with the same ease and security. Software distributed in this manner would allow the legal recipient to make unlimited copies (for backup purposes, use on a home computer, etc.), yet the copies would only function when the associated key is present, preventing unauthorized copies from being wrongfully distributed and used.


The File-Level protection feature is designed to protect publishers of private or copyrighted material. Users can protect any file by converting it to PDK-compliant format; however, security of document files can be compromised by key holders not wishing to maintain the file's integrity. Because, while a Microsoft Word document (as an example) may be stored in the PDK-compliant protected format, once opened the contents could be cut and pasted into another application (e.g., an email program) thereby defeating the protection. Therefore the use of File-Level protection for use with documents is only applicable for entrusted recipients (individuals desiring to protect the content of which they are in possession). Non-document files, however, are not subject to these limitations.


Referring to FIG. 15 for Network-Level protection, File-Level Protection can be expanded to a network environment by employing a centralized software application/database called a PDK Document Controller (DC) 340 running on a server 342. A DC 340 enables the creation of Groups 342 that list which PDK-Keys 344 are allowed access to files in specific directories. All files stored in directories controlled by the DC 340 are automatically encrypted using the DC administrator's PDK-Key and thereby become PDK-compliant files. This process places all files stored in the DC 340 in a uniformly encrypted format.


Each user request for a file residing in a directory listed in a DC Group 342 results in the following steps. An RDC located in the requester's workstation 346 acquires information from the user's PDK-Key 344 and relays that information to the DC 340. The DC then enables appropriate access as defined by the DC's Group database information. Specifically, the DC 340 performing a lookup of the requester's PDK-Key 344 in the appropriate Group's tables. If the DC 340 determines that the PDK-Key 344 is listed in a Group 342 that also lists the directory containing the file the user wishes to access, the DC 340 knows that a valid PDK-Key 344 was used in the file request and grants access. The requested file is first decrypted with the administrator's PDK-Key, re-encrypted with the requester's PDK-Key 344, and then downloaded to the user's workstation 346. The foregoing process mirrors the process employed when using PDK to download digital media files from the Internet.


The Network-Level protection feature is designed to protect publishers of private or copyrighted material. Users can protect any file by converting it to PDK-compliant format; however, security of document files can be compromised by key holders not wishing to maintain the file's integrity. Because, while a Microsoft Word document (as an example) may be stored in the PDK-compliant protected format, once opened the contents could be cut and paste into another application (e.g., an email program) thereby defeating the protection. Therefore, the use of File-Level protection for use with documents is only applicable for entrusted recipients (individuals desiring to protect the content of which they are in possession). Non-document files, however, are not subject to these limitations. The system is well suited for establishing centralized databases of secure documents intended for distribution to entrusted recipients such as personnel in a law firm or medical facility.


While the present invention has been described with reference to one or more particular embodiments, those skilled in the art will recognize that many changes may be made thereto without departing from the spirit and scope of the present invention. A number of enhancements and variations can be implemented/utilized that effectively broaden the PDK technology's scope and utility. These enhancements and alternative embodiments are summarized below.


Integration of RDCs into Alternative Storage Devices. This embodiment involves integrating RDCs into alternative storage mechanisms beyond those of basic hard drives. These storage mechanisms include pure RAM/ROM-based storage commonly included/used in devices such as PDAs, cell phones, printer, copiers, faxes, scanners, MP3 players, GPS systems, digital cameras, computer motherboards, and DVR players, as well as portable storage devices such as Memory Sticks, Secure Digital memory cards, or any similar such product, in which case the RDC is either directly installed on the device, or integrated into the device in which the memory cards/sticks are inserted.


When an RDC is utilized in this manner, File-Level and Network-Level security function in the same manner as that described above for PDK hard drives. Drive-Level and Sector-Level security function in the same logical manner as that described for hard drives, but the physical implementation varies so as to control the bus structure that provides the communications path between the storage mechanisms and their hosting devices. As with PDK hard drives, access to the storage is enabled/disabled by interrupting the communications path, signaling to the hosting device that the storage is either “ready” or “busy,” effectively enabling/disabling the device itself. To save batteries, RDCs used in this manner may only check for the presence of the associated PDK-Key on some periodic basis (versus every read or write sequence). And similar to PDK hard drives, Sector-Level security can be optionally utilized to encrypt/decrypt data traveling over the bus prior to writes and after reads to provide PDK's standard Sector-Level data encoding functionality.


As when utilized in PDK hard drives, the PDK's security features provide the same convenient, non-intrusive, wireless security mechanism for the above-defined devices. This security mechanism protects any data stored on such devices in the event they are ever stolen, left unattended, or even purposely “disabled” to prevent access to sensitive content (i.e. preventing minors from accessing adult files, websites, etc.). When the associated PDK-Key(s) is not present, these devices and their storage means are locked and disabled.


Dynamic PDK-Key Management. Utilizing dynamic PDK-Key management, PDK-Keys can be assigned to an RDC (whether integrated into a PDK hard drive or some other hosting device, or implemented independently) by a user (versus requiring such assignment at time of production). This capability is accomplished by including the required logic within the RDC's internal firmware (versus using an externally-based software driver to supply such capability).


Using this capability, a user can optionally assign any PDK-Key to act as the RDC's master key (the first key assigned to the device). Then by involving this master key (to prove the original “owner's” validation of the process), the user can assign (or remove) additional keys to the PDK-device. The general benefits of this feature include:

    • The ability for the individual possessing the master key to create backup keys (to be stored and later retrieved in the event the master is ever lost), and to allow other users (those possessing additional keys) to also access their PDK device(s).
    • The option to ship PDK-RDCs (in any configuration, host devices, etc.) without any PDK-Keys. And to allow such devices containing these RDCs (such as PDK hard drives) to optionally function with all or part of the PDK-technology never enabled or utilized. For instance, a user may elect to not enable Drive-Level and Sector-Level security features, but still utilize the functionalities of File-Level and Network-Level security.
    • Giving users the option to purchase and associate a PDK-Key at a later time, or importantly, assign a PDK-Key they already utilize for another PDK-based device. This allows a user to utilize a single PDK-Key to provide access to all their PDK-based devices. This built-in (firmware-based) PDK-Key configuration/management capability greatly enhances PDK's overall flexibility and ease of setup/use.


Independent RDC configuration. While integrating an RDC into a hard drive offers numerous benefits, RDCs may exist separately from hard drive mechanisms. In this configuration (as previously defined) an RDC's physical circuitry may exist in the form of a PC Card, a PC expansion board that plugs into a standard PC expansion slot, a USB-based plug-in board, or any other similar design able to interface with a hosting device. Used in this manner, RDCs provide all previously defined functionalities with the exception of basic hard drive access-control.


Buffer Flush & Notification Software Driver. This enhancement involves using a simple software device driver to recognize when a PDK-Key is out of range (by “watching” for signals from the RDC), and when such a condition is detected to flush (empty) the host system's “read” buffer (effectively clearing any data the system may have been cached in internal memory in order to speed data access), and display a simple message indicating the PDK-Key is IO in/out of range. This optional mechanism can be utilized with any RDC configuration and on any PDK-protected device.


Each of these embodiments and obvious variations thereof is contemplated as falling within the spirit and scope of the claimed invention, which is set forth in the following claims.

Claims
  • 1. A system comprising: a tangible personal digital key storing a decryption key and an activation code with a user label and an account number, the tangible personal digital key including a first wireless transceiver to wirelessly transmit the activation code and the decryption key, anda computing device comprising: a processor; anda memory including instructions, that when executed by the processor, cause the processor to: receive digital content marked with an unlock code and encrypted with an encryption key, the unlock code associated with the activation code, the computing device including a second wireless transceiver with a wireless coverage range;receive the activation code wirelessly transmitted from the tangible personal digital key within the wireless coverage range;receive a request to access the digital content;in response to the request to access the digital content, determine whether the user label in the activation code matches with that of the digital content;in response to the user label in the activation code matching with that of the digital content, receive the decryption key from the tangible personal digital key within the wireless coverage range, partially decrypt the digital content using the decryption key, and determine whether the account number in the activation code matches with that of the partially decrypted digital content; andin response to the account number in the activation code matching with that of the partially decrypted digital content, decrypt a remainder of the digital content for access.
  • 2. The system of claim 1, wherein to receive the digital content marked with the unlock code and encrypted with the encryption key, the instructions when executed by the processor, further cause the processor to: transmit the activation code to a content provider device, the content provider device further transmitting the activation code to a key provider device for authentication; andresponsive to the key provider device authenticating the activation code, receive the digital content marked with the unlock code associated with the activation code and encrypted with the encryption key from the content provider device.
  • 3. The system of claim 2, wherein the activation code is transmitted to the content provider device and the digital content is received from the content provider device through an Internet connection.
  • 4. The system of claim 1, wherein the activation code is the unlock code.
  • 5. The system of claim 1, wherein the digital content is decrypted while the tangible digital personal key is in proximity to the computing device to communicate the activation code to the computing device.
  • 6. The system of claim 1, wherein the user label is unencrypted and the account number is encrypted.
  • 7. The system of claim 1, wherein the user label is used to select the tangible personal digital key from a plurality of tangible personal digital keys.
  • 8. The system of claim 1, wherein the instructions when executed by the processor, further cause the processor to: in response to the user label in the activation code not matching with that of the digital content, display a message notification indicating that the tangible personal digital key is invalid.
  • 9. The system of claim 1, wherein the digital content is permanently linked to the tangible digital personal key at a time of its acquisition by the computing device.
  • 10. The system of claim 1, wherein the digital content fails to be decrypted when the tangible digital personal key is no longer in proximity to the computing device to communicate the activation code to the computing device.
  • 11. The system of claim 1, wherein the unlock code is distinct from the activation code but determined based on the activation code.
  • 12. A method comprising: wirelessly receiving, from a tangible personal digital key, an activation code with a user label and an account number;receiving, by a computing device, digital content marked with an unlock code and encrypted with an encryption key, the unlock code associated with the activation code;receiving a request to access the digital content;in response to receiving the request to access the digital content, determining whether the user label in the activation code matches with that of the digital content;in response to the user label in the activation code matching with that of the digital content, wirelessly receiving a decryption key from the tangible personal digital key, partially decrypting the digital content using the decryption key, and determining whether the account number in the activation code matches with that of the partially decrypted digital content; andin response to the account number in the activation code matching with that of the partially decrypted digital content, decrypting a remainder of the digital content for access.
  • 13. The method of claim 12, further comprising: transmitting the activation code received from the tangible personal digital key to a content provider device, the content provider device further transmitting the activation code to a key provider device for authentication; andreceiving the digital content marked with the unlock code associated with the activation code and encrypted with the encryption key from the content provider device responsive to successful authentication of the activation code.
  • 14. The method of claim 12, wherein the activation code is the unlock code.
  • 15. The method of claim 12, further comprising decrypting the digital content while the tangible digital personal key is in proximity to wirelessly communicate the activation code, and wherein decryption is unavailable when the tangible digital personal key is no longer in proximity to wirelessly communicate the activation code to the computing device.
  • 16. The method of claim 12, further comprising selecting the tangible personal digital key from a plurality of tangible personal digital keys within range using the user label.
  • 17. The method of claim 12, further comprising: responsive to the user label in the activation code not matching with that of the digital content, displaying a message notification indicating that the tangible personal digital key is invalid.
  • 18. The method of claim 12, wherein the digital content is permanently linked to the tangible digital personal key at a time of its acquisition by the computing device.
  • 19. The method of claim 12, wherein the unlock code is distinct from the activation code but determined based on the activation code.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 10/598,735, entitled “Linked Account System Using Personal Digital Key (PDK-LAS)” filed Jul. 31, 2007, which is a National Stage of International Application No. PCT/US2005/007535, entitled “Linked Account System Using Personal Digital Key (PDK-LAS)”, filed Mar. 8, 2005, published in English under PCT Article 21(2), which claims priority under 35 U.S.C. § 119(e) to U.S. Provisional Patent Application Ser. No. 60/551,320, “Linked Account System Using Personal Digital Key (PDK-LAS),” filed Mar. 8, 2004. The subject matter of all of the foregoing is incorporated herein by reference in their entirety. This application is also a continuation of U.S. application Ser. No. 11/292,330, entitled “Personal Digital Key and Reader/Decoder Circuit System and Method,” filed Nov. 30, 2005, which is a continuation-in-part of U.S. application Ser. No. 09/750,487, filed Dec. 27, 2000; U.S. application Ser. No. 10/016,857, filed Dec. 14, 2001; U.S. application Ser. No. 10/153,979, filed on May 23, 2002; U.S. application Ser. No. 10/715,035, filed on Nov. 17, 2003; and U.S. application Ser. No. 10/847,135, filed on May 17,2004, and which also claims the benefit of U.S. Provisional Application Ser. No. 60/632,067, filed on Dec. 1, 2004, and U.S. Provisional Application Ser. No. 60/652,765, filed on Feb. 14, 2005, the entireties of each of the foregoing are incorporated herein by reference. Applicants hereby notify the USPTO that the claims of the present application are different from those of the aforementioned related applications. Therefore, Applicant rescinds any disclaimer of claim scope made in the parent application, grandparent application or any other predecessor application in relation to the present application. The Examiner is therefore advised that any such disclaimer and the cited reference that it was made to avoid may need to be revisited at this time. Furthermore, the Examiner is also reminded that any disclaimer made in the present application should not be read into or against the parent application, the grandparent application or any other related application.

US Referenced Citations (1094)
Number Name Date Kind
3665313 Trent May 1972 A
3739329 Lester Jun 1973 A
3761883 Alvarez et al. Sep 1973 A
3906166 Cooper et al. Sep 1975 A
4101873 Anderson et al. Jul 1978 A
4430705 Cannavino et al. Feb 1984 A
4476469 Lander Oct 1984 A
4598272 Cox Jul 1986 A
4661821 Smith Apr 1987 A
4759060 Hayashi et al. Jul 1988 A
4814742 Morita et al. Mar 1989 A
4871997 Adriaenssens et al. Oct 1989 A
4993068 Piosenka et al. Feb 1991 A
5043702 Kuo Aug 1991 A
5187352 Blair et al. Feb 1993 A
5224164 Elsner Jun 1993 A
5296641 Stelzel Mar 1994 A
5307349 Shloss et al. Apr 1994 A
5317572 Satoh May 1994 A
5325285 Araki Jun 1994 A
5392287 Tiedemann, Jr. et al. Feb 1995 A
5392433 Hammersley et al. Feb 1995 A
5410588 Ito Apr 1995 A
5416780 Patel May 1995 A
5422632 Bucholtz et al. Jun 1995 A
5428684 Akiyama et al. Jun 1995 A
5450489 Ostrover et al. Sep 1995 A
5473690 Grimonprez et al. Dec 1995 A
5481265 Russell Jan 1996 A
5506863 Meidan et al. Apr 1996 A
5517502 Bestler et al. May 1996 A
5541583 Mandelbaum Jul 1996 A
5544321 Theimer et al. Aug 1996 A
5552776 Wade et al. Sep 1996 A
5563947 Kikinis Oct 1996 A
5589838 McEwan Dec 1996 A
5594227 Deo Jan 1997 A
5598474 Johnson Jan 1997 A
5611050 Theimer et al. Mar 1997 A
5619251 Kuroiwa et al. Apr 1997 A
5623552 Lane Apr 1997 A
5629980 Stefik et al. May 1997 A
5644354 Thompson et al. Jul 1997 A
5666412 Handelman et al. Sep 1997 A
5689529 Johnson Nov 1997 A
5692049 Johnson et al. Nov 1997 A
5719387 Fujioka Feb 1998 A
5729237 Webb Mar 1998 A
5760705 Glessner et al. Jun 1998 A
5760744 Sauer Jun 1998 A
5773954 VanHorn Jun 1998 A
5784464 Akiyama et al. Jul 1998 A
5799085 Shona Aug 1998 A
5821854 Dorinski et al. Oct 1998 A
5825876 Peterson, Jr. Oct 1998 A
5835595 Fraser Nov 1998 A
5838306 O'Connor et al. Nov 1998 A
5854891 Postlewaite et al. Dec 1998 A
5857020 Peterson, Jr. Jan 1999 A
5886634 Muhme Mar 1999 A
5892825 Mages et al. Apr 1999 A
5892900 Ginter et al. Apr 1999 A
5894551 Huggins et al. Apr 1999 A
5898880 Ryu Apr 1999 A
5910776 Black Jun 1999 A
5917913 Wang Jun 1999 A
5923757 Hocker et al. Jul 1999 A
5928327 Wang et al. Jul 1999 A
5942985 Chin Aug 1999 A
5991399 Graunke et al. Nov 1999 A
5991749 Morrill, Jr. Nov 1999 A
6016476 Maes et al. Jan 2000 A
6018739 McCoy Jan 2000 A
6025780 Bowers Feb 2000 A
6035038 Campinos et al. Mar 2000 A
6035329 Mages et al. Mar 2000 A
6038334 Hamid Mar 2000 A
6038666 Hsu et al. Mar 2000 A
6040786 Fujioka Mar 2000 A
6041410 Hsu et al. Mar 2000 A
6042006 Van Tilburg et al. Mar 2000 A
6055314 Spies et al. Apr 2000 A
6068184 Barnett May 2000 A
6069647 Sullivan May 2000 A
6070796 Sirbu Jun 2000 A
6076164 Tanaka et al. Jun 2000 A
6088450 Davis et al. Jul 2000 A
6088730 Kato et al. Jul 2000 A
6104290 Naguleswaran Aug 2000 A
6104334 Allport Aug 2000 A
6110041 Walker et al. Aug 2000 A
6121544 Petsinger Sep 2000 A
6134283 Sands et al. Oct 2000 A
6137480 Shintani Oct 2000 A
6138010 Rabe et al. Oct 2000 A
6148142 Anderson Nov 2000 A
6148210 Elwin et al. Nov 2000 A
6161179 Seidel Dec 2000 A
6175921 Rosen Jan 2001 B1
6177887 Jerome Jan 2001 B1
6185316 Buffam Feb 2001 B1
6189105 Lopes Feb 2001 B1
6209089 Selitrennikoff et al. Mar 2001 B1
6219109 Raynesford et al. Apr 2001 B1
6219439 Burger Apr 2001 B1
6219553 Panasik Apr 2001 B1
6237848 Everett May 2001 B1
6240076 Kanerva et al. May 2001 B1
6247130 Fritsch Jun 2001 B1
6249869 Drupsteen et al. Jun 2001 B1
6256737 Bianco Jul 2001 B1
6266415 Campinos et al. Jul 2001 B1
6270011 Gottfried Aug 2001 B1
6279111 Jensenworth et al. Aug 2001 B1
6279146 Evans et al. Aug 2001 B1
6295057 Rosin et al. Sep 2001 B1
6307471 Xydis Oct 2001 B1
6325285 Baratelli Dec 2001 B1
6336121 Lyson et al. Jan 2002 B1
6336142 Kato et al. Jan 2002 B1
6343280 Clark Jan 2002 B2
6345347 Biran Feb 2002 B1
6363485 Adams et al. Mar 2002 B1
6367019 Ansell et al. Apr 2002 B1
6369693 Gibson Apr 2002 B1
6370376 Sheath Apr 2002 B1
6381029 Tipirneni Apr 2002 B1
6381747 Wonfor et al. Apr 2002 B1
6385596 Wiser May 2002 B1
6392664 White et al. May 2002 B1
6397387 Rosin et al. May 2002 B1
6401059 Shen et al. Jun 2002 B1
6411307 Rosin et al. Jun 2002 B1
6424249 Houvener Jul 2002 B1
6424715 Saito Jul 2002 B1
6425084 Rallis et al. Jul 2002 B1
6434403 Ausems et al. Aug 2002 B1
6434535 Kupka et al. Aug 2002 B1
6446004 Cao et al. Sep 2002 B1
6446130 Grapes Sep 2002 B1
6463534 Geiger et al. Oct 2002 B1
6480101 Kelly et al. Nov 2002 B1
6480188 Horsley Nov 2002 B1
6484182 Dunphy et al. Nov 2002 B1
6484260 Scott et al. Nov 2002 B1
6484946 Matsumoto et al. Nov 2002 B2
6487663 Jaisimha Nov 2002 B1
6490443 Freeny, Jr. Dec 2002 B1
6510350 Steen, III et al. Jan 2003 B1
6522253 Saltus Feb 2003 B1
6523113 Wehrenberg Feb 2003 B1
6529949 Getsin et al. Mar 2003 B1
6546418 Schena et al. Apr 2003 B2
6550011 Sims, III Apr 2003 B1
6563465 Frecska May 2003 B2
6563805 Ma et al. May 2003 B1
6564380 Murphy May 2003 B1
6577238 Whitesmith et al. Jun 2003 B1
6593887 Luk et al. Jul 2003 B2
6597680 Lindskog et al. Jul 2003 B1
6607136 Atsmon et al. Aug 2003 B1
6624752 Klitsgaard et al. Sep 2003 B2
6628302 White et al. Sep 2003 B2
6632992 Hasegawa Oct 2003 B2
6633981 Davis Oct 2003 B1
6645077 Rowe Nov 2003 B2
6647417 Hunter et al. Nov 2003 B1
6657538 Ritter Dec 2003 B1
6658566 Hazard Dec 2003 B1
6667684 Waggamon et al. Dec 2003 B1
6669096 Saphar et al. Dec 2003 B1
6671808 Abbott et al. Dec 2003 B1
6683954 Searle Jan 2004 B1
6697944 Jones et al. Feb 2004 B1
6709333 Bradford et al. Mar 2004 B1
6711464 Yap et al. Mar 2004 B1
6714168 Berenbaum Mar 2004 B2
6715246 Frecska et al. Apr 2004 B1
6728397 McNeal Apr 2004 B2
6737955 Ghabra et al. May 2004 B2
6758394 Maskatiya et al. Jul 2004 B2
6771969 Chinoy et al. Aug 2004 B1
6775655 Peinado et al. Aug 2004 B1
6785474 Hirt et al. Aug 2004 B2
6788640 Celeste Sep 2004 B2
6788924 Knutson et al. Sep 2004 B1
6795425 Raith Sep 2004 B1
6804825 White et al. Oct 2004 B1
6806887 Chernock et al. Oct 2004 B2
6839542 Sibecas et al. Jan 2005 B2
6850147 Prokoski et al. Feb 2005 B2
6853988 Dickinson Feb 2005 B1
6859812 Poynor Feb 2005 B1
6861980 Rowitch et al. Mar 2005 B1
6873975 Hatakeyama et al. Mar 2005 B1
6879567 Callaway et al. Apr 2005 B2
6879966 Lapsley et al. Apr 2005 B1
6886741 Salveson May 2005 B1
6889067 Willey May 2005 B2
6891822 Gubbi et al. May 2005 B1
6892307 Wood et al. May 2005 B1
6930643 Byrne et al. Aug 2005 B2
6947003 Huor Sep 2005 B2
6950941 Lee et al. Sep 2005 B1
6957086 Bahl et al. Oct 2005 B2
6961858 Fransdonk Nov 2005 B2
6963270 Gallagher, III et al. Nov 2005 B1
6963971 Bush et al. Nov 2005 B1
6973576 Giobbi Dec 2005 B2
6975202 Rodriguez et al. Dec 2005 B1
6980087 Zukowski Dec 2005 B2
6983882 Cassone Jan 2006 B2
6999032 Pakray et al. Feb 2006 B2
7012503 Nielsen Mar 2006 B2
7020635 Hamilton et al. Mar 2006 B2
7031945 Donner Apr 2006 B1
7049963 Waterhouse et al. May 2006 B2
7055171 Martin et al. May 2006 B1
7058806 Smeets et al. Jun 2006 B2
7061380 Orlando et al. Jun 2006 B1
7068623 Barany et al. Jun 2006 B1
7072900 Sweitzer et al. Jul 2006 B2
7079079 Jo et al. Jul 2006 B2
7080049 Truitt et al. Jul 2006 B2
7082415 Robinson et al. Jul 2006 B1
7090126 Kelly et al. Aug 2006 B2
7090128 Farley et al. Aug 2006 B2
7100053 Brown et al. Aug 2006 B1
7107455 Merkin Sep 2006 B1
7107462 Fransdonk Sep 2006 B2
7111789 Rajasekaran et al. Sep 2006 B2
7112138 Hedrick et al. Sep 2006 B2
7119659 Bonalle et al. Oct 2006 B2
7123149 Nowak et al. Oct 2006 B2
7130668 Chang et al. Oct 2006 B2
7131139 Meier Oct 2006 B1
7137008 Hamid Nov 2006 B1
7137012 Kamibayashi et al. Nov 2006 B1
7139914 Arnouse Nov 2006 B2
7150045 Koelle et al. Dec 2006 B2
7155416 Shatford Dec 2006 B2
7159114 Zajkowski et al. Jan 2007 B1
7159765 Frerking Jan 2007 B2
7167987 Angelo Jan 2007 B2
7168089 Nguyen et al. Jan 2007 B2
7176797 Zai et al. Feb 2007 B2
7185363 Narin Feb 2007 B1
7191466 Hamid et al. Mar 2007 B1
7194438 Sovio et al. Mar 2007 B2
7209955 Major et al. Apr 2007 B1
7218944 Cromer et al. May 2007 B2
7225161 Lam et al. May 2007 B2
7230908 Vanderaar et al. Jun 2007 B2
7231068 Tibor Jun 2007 B2
7231451 Law et al. Jun 2007 B2
7239226 Berardi et al. Jul 2007 B2
7242923 Perera et al. Jul 2007 B2
7249177 Miller Jul 2007 B1
7272723 Abbott et al. Sep 2007 B1
7277737 Vollmer et al. Oct 2007 B1
7278025 Saito Oct 2007 B2
7283650 Sharma et al. Oct 2007 B1
7295119 Rappaport et al. Nov 2007 B2
7305560 Giobbi Dec 2007 B2
7310042 Seifert Dec 2007 B2
7314164 Bonalle Jan 2008 B2
7317799 Hammersmith et al. Jan 2008 B2
7319395 Puzio et al. Jan 2008 B2
7330108 Thomas Feb 2008 B2
7333002 Bixler et al. Feb 2008 B2
7333615 Jarboe et al. Feb 2008 B1
7336181 Nowak et al. Feb 2008 B2
7336182 Baranowski et al. Feb 2008 B1
7337326 Palmer et al. Feb 2008 B2
7341181 Bonalle Mar 2008 B2
7342503 Light et al. Mar 2008 B1
7349557 Tibor Mar 2008 B2
7356393 Schlatre et al. Apr 2008 B1
7356706 Scheurich Apr 2008 B2
7361919 Setlak Apr 2008 B2
7363494 Brainard et al. Apr 2008 B2
7370366 Lacan et al. May 2008 B2
7378939 Sengupta et al. May 2008 B2
7380202 Lindhorst et al. May 2008 B1
7382799 Young et al. Jun 2008 B1
7387235 Gilbert et al. Jun 2008 B2
7401731 Pletz et al. Jul 2008 B1
7404088 Giobbi Jul 2008 B2
7424134 Chou Sep 2008 B2
7437330 Robinson et al. Oct 2008 B1
7447911 Chou et al. Nov 2008 B2
7448087 Ohmori et al. Nov 2008 B2
7458510 Zhou Dec 2008 B1
7460836 Smith et al. Dec 2008 B2
7461444 Deaett et al. Dec 2008 B2
7464053 Pylant Dec 2008 B1
7464059 Robinson et al. Dec 2008 B1
7466232 Neuwirth Dec 2008 B2
7472280 Giobbi Dec 2008 B2
7512806 Lemke Mar 2009 B2
7525413 Jung et al. Apr 2009 B2
7529944 Hamid May 2009 B2
7533809 Robinson et al. May 2009 B1
7545312 Kiang et al. Jun 2009 B2
7565329 Lapsley et al. Jul 2009 B2
7573382 Choubey et al. Aug 2009 B2
7573841 Lee et al. Aug 2009 B2
7574734 Fedronic et al. Aug 2009 B2
7583238 Cassen et al. Sep 2009 B2
7583643 Smith et al. Sep 2009 B2
7587502 Crawford et al. Sep 2009 B2
7587611 Johnson et al. Sep 2009 B2
7594611 Arrington, III Sep 2009 B1
7595765 Hirsch et al. Sep 2009 B1
7603564 Adachi Oct 2009 B2
7606733 Shmueli et al. Oct 2009 B2
7617523 Das et al. Nov 2009 B2
7620184 Marque Pucheu Nov 2009 B2
7624073 Robinson et al. Nov 2009 B1
7624417 Dua Nov 2009 B2
7640273 Wallmeier et al. Dec 2009 B2
7644443 Matsuyama et al. Jan 2010 B2
7646307 Plocher et al. Jan 2010 B2
7652892 Shiu et al. Jan 2010 B2
7676380 Graves et al. Mar 2010 B2
7689005 Wang et al. Mar 2010 B2
7701858 Werb et al. Apr 2010 B2
7706896 Music et al. Apr 2010 B2
7711152 Davida et al. May 2010 B1
7711586 Aggarwal et al. May 2010 B2
7715593 Adams et al. May 2010 B1
7724713 Del Prado Pavon et al. May 2010 B2
7724717 Porras et al. May 2010 B2
7724720 Korpela et al. May 2010 B2
7764236 Hill et al. Jul 2010 B2
7765164 Robinson et al. Jul 2010 B1
7765181 Thomas et al. Jul 2010 B2
7773754 Buer et al. Aug 2010 B2
7774613 Lemke Aug 2010 B2
7780082 Handa et al. Aug 2010 B2
7796551 Machiraju et al. Sep 2010 B1
7813822 Hoffberg Oct 2010 B1
7865448 Pizarro Jan 2011 B2
7865937 White et al. Jan 2011 B1
7883003 Giobbi et al. Feb 2011 B2
7883417 Bruzzese et al. Feb 2011 B2
7904718 Giobbi et al. Mar 2011 B2
7943868 Anders et al. May 2011 B2
7957536 Nolte Jun 2011 B2
7961078 Reynolds et al. Jun 2011 B1
7984064 Fusari Jul 2011 B2
7996514 Baumert et al. Aug 2011 B2
8026821 Reeder et al. Sep 2011 B2
8036152 Brown et al. Oct 2011 B2
8077041 Stern et al. Dec 2011 B2
8081215 Kuo et al. Dec 2011 B2
8082160 Collins, Jr. et al. Dec 2011 B2
8089354 Perkins Jan 2012 B2
8112066 Ben Ayed Feb 2012 B2
8125624 Jones et al. Feb 2012 B2
8135624 Ramalingam et al. Mar 2012 B1
8171528 Brown May 2012 B1
8193923 Rork et al. Jun 2012 B2
8200980 Robinson et al. Jun 2012 B1
8215552 Rambadt Jul 2012 B1
8219129 Brown et al. Jul 2012 B2
8248263 Shervey et al. Aug 2012 B2
8258942 Lanzone et al. Sep 2012 B1
8294554 Shoarinejad et al. Oct 2012 B2
8296573 Bolle et al. Oct 2012 B2
8307414 Zerfos et al. Nov 2012 B2
8325011 Butler et al. Dec 2012 B2
8340672 Brown et al. Dec 2012 B2
8352730 Giobbi Jan 2013 B2
8373562 Heinze et al. Feb 2013 B1
8387124 Smetters et al. Feb 2013 B2
8390456 Puleston et al. Mar 2013 B2
8395484 Fullerton Mar 2013 B2
8410906 Dacus et al. Apr 2013 B1
8412949 Giobbi et al. Apr 2013 B2
8421606 Collins, Jr. et al. Apr 2013 B2
8424079 Adams et al. Apr 2013 B2
8432262 Talty et al. Apr 2013 B2
8433919 Giobbi et al. Apr 2013 B2
8448858 Kundu et al. May 2013 B1
8457672 Brown et al. Jun 2013 B2
8473748 Sampas Jun 2013 B2
8484696 Gatto et al. Jul 2013 B2
8494576 Bye et al. Jul 2013 B1
8508336 Giobbi et al. Aug 2013 B2
8511555 Babcock et al. Aug 2013 B2
8519823 Rinkes Aug 2013 B2
8522019 Michaelis Aug 2013 B2
8559699 Butler et al. Oct 2013 B2
8572391 Golan et al. Oct 2013 B2
8577091 Ivanov et al. Nov 2013 B2
8646042 Brown Feb 2014 B1
8659427 Brown et al. Feb 2014 B2
8678273 McNeal Mar 2014 B2
8717346 Claessen May 2014 B2
8738925 Park et al. May 2014 B1
8799574 Corda Aug 2014 B2
8838993 Giobbi et al. Sep 2014 B2
8856539 Weiss Oct 2014 B2
8857716 Giobbi et al. Oct 2014 B1
8886954 Giobbi Nov 2014 B1
8907861 Hirt Dec 2014 B2
8914477 Gammon Dec 2014 B2
8918854 Giobbi Dec 2014 B1
8931698 Ishikawa et al. Jan 2015 B2
8979646 Moser et al. Mar 2015 B2
9020854 Giobbi Apr 2015 B2
9037140 Brown May 2015 B1
9042819 Dua May 2015 B2
9049188 Brown Jun 2015 B1
9113464 Brown et al. Aug 2015 B2
9165233 Testanero Oct 2015 B2
9189788 Robinson et al. Nov 2015 B1
9230399 Yacenda Jan 2016 B2
9235700 Brown Jan 2016 B1
9251326 Giobbi et al. Feb 2016 B2
9251332 Giobbi Feb 2016 B2
9265043 Brown et al. Feb 2016 B2
9265450 Giobbi Feb 2016 B1
9269221 Brown et al. Feb 2016 B2
9276914 Woodward et al. Mar 2016 B2
9298905 Giobbi Mar 2016 B1
9305312 Kountotsis et al. Apr 2016 B2
9322974 Giobbi Apr 2016 B1
9405898 Giobbi Aug 2016 B2
9418205 Giobbi Aug 2016 B2
9450956 Giobbi Sep 2016 B1
9542542 Giobbi et al. Jan 2017 B2
9613483 Giobbi Apr 2017 B2
9679289 Brown Jun 2017 B1
9728080 Giobbi et al. Aug 2017 B1
9807091 Giobbi Oct 2017 B2
9830504 Masood et al. Nov 2017 B2
9892250 Giobbi Feb 2018 B2
9904816 Giobbi et al. Feb 2018 B1
9990628 Giobbi Jun 2018 B2
10026253 Giobbi Jul 2018 B2
10073960 Brown Sep 2018 B1
10110385 Rush et al. Oct 2018 B1
10171460 Giobbi Jan 2019 B2
10217339 Giobbi Feb 2019 B1
10229294 Giobbi et al. Mar 2019 B1
10313336 Giobbi Jun 2019 B2
10334541 Brown Jun 2019 B1
10374795 Giobbi et al. Aug 2019 B1
10383112 Brown et al. Aug 2019 B2
10403128 Giobbi et al. Sep 2019 B2
10437976 Giobbi Oct 2019 B2
10455533 Brown Oct 2019 B2
10469456 Giobbi Nov 2019 B1
10698989 Giobbi Jun 2020 B2
10764044 Giobbi et al. Sep 2020 B1
10769939 Brown et al. Sep 2020 B2
10817964 Guillama et al. Oct 2020 B2
10909229 Giobbi Feb 2021 B2
10943471 Giobbi et al. Mar 2021 B1
20010000535 Lapsley et al. Apr 2001 A1
20010026619 Howard, Jr. et al. Apr 2001 A1
20010021950 Hawley et al. Sep 2001 A1
20010024428 Onouchi Sep 2001 A1
20010027121 Boesen Oct 2001 A1
20010027439 Holtzman et al. Oct 2001 A1
20010044337 Rowe et al. Nov 2001 A1
20020004783 Paltenghe et al. Jan 2002 A1
20020007456 Peinado et al. Jan 2002 A1
20020010679 Felsher Jan 2002 A1
20020013772 Peinado Jan 2002 A1
20020014954 Fitzgibbon et al. Feb 2002 A1
20020015494 Nagai et al. Feb 2002 A1
20020019811 Lapsley et al. Feb 2002 A1
20020022455 Salokannel et al. Feb 2002 A1
20020023032 Pearson Feb 2002 A1
20020023217 Wheeler et al. Feb 2002 A1
20020026424 Akashi Feb 2002 A1
20020037732 Gous et al. Mar 2002 A1
20020052193 Chetty May 2002 A1
20020055908 Di Giorgio et al. May 2002 A1
20020056043 Glass May 2002 A1
20020059114 Cockrill et al. May 2002 A1
20020062249 Iannacci May 2002 A1
20020068605 Stanley Jun 2002 A1
20020069364 Dosch Jun 2002 A1
20020071559 Christensen Jun 2002 A1
20020073042 Maritzen et al. Jun 2002 A1
20020076051 Nii Jun 2002 A1
20020080969 Giobbi Jun 2002 A1
20020083178 Brothers Jun 2002 A1
20020083318 Larose Jun 2002 A1
20020086690 Takahashi et al. Jul 2002 A1
20020089890 Fibranz et al. Jul 2002 A1
20020091646 Lake et al. Jul 2002 A1
20020095586 Doyle et al. Jul 2002 A1
20020095587 Doyle et al. Jul 2002 A1
20020097876 Harrison Jul 2002 A1
20020098888 Rowe et al. Jul 2002 A1
20020100798 Farrugia et al. Aug 2002 A1
20020103027 Rowe et al. Aug 2002 A1
20020103881 Granade et al. Aug 2002 A1
20020104006 Boate et al. Aug 2002 A1
20020104019 Chatani Aug 2002 A1
20020105918 Yamada et al. Aug 2002 A1
20020108049 Xu et al. Aug 2002 A1
20020109580 Shreve et al. Aug 2002 A1
20020111919 Weller et al. Aug 2002 A1
20020112183 Baird et al. Aug 2002 A1
20020116615 Nguyen et al. Aug 2002 A1
20020124251 Hunter et al. Sep 2002 A1
20020128017 Virtanen Sep 2002 A1
20020129262 Kutaragi Sep 2002 A1
20020138438 Bardwell Sep 2002 A1
20020138767 Hamid et al. Sep 2002 A1
20020140542 Prokoski et al. Oct 2002 A1
20020141586 Margalit et al. Oct 2002 A1
20020143623 Dayley Oct 2002 A1
20020143655 Elston et al. Oct 2002 A1
20020144116 Giobbi Oct 2002 A1
20020144117 Faigle Oct 2002 A1
20020147653 Shmueli et al. Oct 2002 A1
20020148892 Bardwell Oct 2002 A1
20020150282 Kinsella Oct 2002 A1
20020152391 Willins et al. Oct 2002 A1
20020153996 Chan et al. Oct 2002 A1
20020158121 Stanford-Clark Oct 2002 A1
20020158750 Almalik Oct 2002 A1
20020158765 Pape et al. Oct 2002 A1
20020160820 Winkler Oct 2002 A1
20020174348 Ting Nov 2002 A1
20020177460 Beasley et al. Nov 2002 A1
20020178063 Gravelle et al. Nov 2002 A1
20020184208 Kato Dec 2002 A1
20020187746 Cheng et al. Dec 2002 A1
20020191816 Maritzen et al. Dec 2002 A1
20020196963 Bardwell Dec 2002 A1
20020199120 Schmidt Dec 2002 A1
20030022701 Gupta Jan 2003 A1
20030034877 Miller et al. Feb 2003 A1
20030036416 Pattabiraman et al. Feb 2003 A1
20030036425 Kaminkow et al. Feb 2003 A1
20030046228 Bemey Mar 2003 A1
20030046237 Uberti Mar 2003 A1
20030046552 Hamid Mar 2003 A1
20030048174 Stevens et al. Mar 2003 A1
20030051173 Krueger Mar 2003 A1
20030054868 Paulsen et al. Mar 2003 A1
20030054881 Hedrick et al. Mar 2003 A1
20030055689 Block et al. Mar 2003 A1
20030055792 Kinoshita et al. Mar 2003 A1
20030061172 Robinson Mar 2003 A1
20030063619 Montano et al. Apr 2003 A1
20030079133 Breiter et al. Apr 2003 A1
20030087601 Agam et al. May 2003 A1
20030088441 McNerney May 2003 A1
20030105719 Berger et al. Jun 2003 A1
20030109274 Budka et al. Jun 2003 A1
20030115351 Giobbi Jun 2003 A1
20030115474 Khan Jun 2003 A1
20030117969 Koo et al. Jun 2003 A1
20030117980 Kim et al. Jun 2003 A1
20030120934 Ortiz Jun 2003 A1
20030127511 Kelly et al. Jul 2003 A1
20030128866 McNeal Jul 2003 A1
20030137404 Bonneau, Jr. et al. Jul 2003 A1
20030139190 Steelberg et al. Jul 2003 A1
20030146835 Carter Aug 2003 A1
20030149744 Bierre Aug 2003 A1
20030156742 Witt et al. Aug 2003 A1
20030159040 Hashimoto et al. Aug 2003 A1
20030163388 Beane Aug 2003 A1
20030167207 Berardi et al. Sep 2003 A1
20030169697 Suzuki et al. Sep 2003 A1
20030172028 Abell et al. Sep 2003 A1
20030172037 Jung Sep 2003 A1
20030174839 Yamagata et al. Sep 2003 A1
20030176218 LeMay et al. Sep 2003 A1
20030177102 Robinson Sep 2003 A1
20030186739 Paulsen et al. Oct 2003 A1
20030195842 Reece Oct 2003 A1
20030199267 Iwasa et al. Oct 2003 A1
20030204526 Salehi-Had Oct 2003 A1
20030204721 Barrus Oct 2003 A1
20030213840 Livingston et al. Nov 2003 A1
20030223394 Parantainen et al. Dec 2003 A1
20030225703 Angel Dec 2003 A1
20030226031 Proudler et al. Dec 2003 A1
20030233458 Kwon et al. Dec 2003 A1
20040002347 Hoctor et al. Jan 2004 A1
20040015403 Moskowitz et al. Jan 2004 A1
20040022384 Flores et al. Feb 2004 A1
20040029620 Karaoguz Feb 2004 A1
20040029635 Giobbi Feb 2004 A1
20040030764 Birk et al. Feb 2004 A1
20040030894 Labrou et al. Feb 2004 A1
20040035644 Ford et al. Feb 2004 A1
20040039909 Cheng Feb 2004 A1
20040044627 Russell et al. Mar 2004 A1
20040048570 Oba et al. Mar 2004 A1
20040048609 Kosaka Mar 2004 A1
20040059682 Hasumi et al. Mar 2004 A1
20040059912 Zizzi Mar 2004 A1
20040064728 Scheurich Apr 2004 A1
20040068656 Lu Apr 2004 A1
20040073792 Noble Apr 2004 A1
20040081127 Gardner et al. Apr 2004 A1
20040082385 Silva et al. Apr 2004 A1
20040088558 Candelore May 2004 A1
20040090345 Hitt May 2004 A1
20040098597 Giobbi May 2004 A1
20040114563 Shvodian Jun 2004 A1
20040117644 Colvin Jun 2004 A1
20040123106 D'Angelo et al. Jun 2004 A1
20040123127 Teicher Jun 2004 A1
20040127277 Walker et al. Jul 2004 A1
20040128162 Schlotterbeck et al. Jul 2004 A1
20040128389 Kopchik Jul 2004 A1
20040128500 Cihula et al. Jul 2004 A1
20040128508 Wheeler et al. Jul 2004 A1
20040128519 Klinger et al. Jul 2004 A1
20040129787 Saito et al. Jul 2004 A1
20040132432 Moores et al. Jul 2004 A1
20040137912 Lin Jul 2004 A1
20040153649 Rhoads et al. Aug 2004 A1
20040158746 Hu et al. Aug 2004 A1
20040166875 Jenkins et al. Aug 2004 A1
20040167465 Mihai et al. Aug 2004 A1
20040181695 Walker Sep 2004 A1
20040193925 Safriel Sep 2004 A1
20040194133 Ikeda et al. Sep 2004 A1
20040203566 Leung Oct 2004 A1
20040203923 Mullen Oct 2004 A1
20040208139 Iwamura Oct 2004 A1
20040209690 Bruzzese et al. Oct 2004 A1
20040209692 Schober et al. Oct 2004 A1
20040214582 Lan et al. Oct 2004 A1
20040215615 Larsson et al. Oct 2004 A1
20040217859 Pucci et al. Nov 2004 A1
20040218581 Cattaneo Nov 2004 A1
20040222877 Teramura et al. Nov 2004 A1
20040230488 Beenau et al. Nov 2004 A1
20040230809 Lowensohn et al. Nov 2004 A1
20040234117 Tibor Nov 2004 A1
20040243519 Perttila et al. Dec 2004 A1
20040246103 Zukowski Dec 2004 A1
20040246950 Parker et al. Dec 2004 A1
20040250074 Kilian-Kehr Dec 2004 A1
20040252012 Beenau et al. Dec 2004 A1
20040252659 Yun et al. Dec 2004 A1
20040253996 Chen et al. Dec 2004 A1
20040254837 Roshkoff Dec 2004 A1
20040255139 Giobbi Dec 2004 A1
20040255145 Chow Dec 2004 A1
20050001028 Zuili Jan 2005 A1
20050002028 Kasapi et al. Jan 2005 A1
20050005136 Chen et al. Jan 2005 A1
20050006452 Aupperle Jan 2005 A1
20050009517 Maes Jan 2005 A1
20050020322 Ruuska et al. Jan 2005 A1
20050021561 Noonan Jan 2005 A1
20050025093 Yun et al. Feb 2005 A1
20050028168 Marcjan Feb 2005 A1
20050035897 Perl et al. Feb 2005 A1
20050039027 Shapiro Feb 2005 A1
20050040961 Tuttle Feb 2005 A1
20050044372 Aull et al. Feb 2005 A1
20050044387 Ozolins Feb 2005 A1
20050047386 Yi Mar 2005 A1
20050049013 Chang et al. Mar 2005 A1
20050050208 Chatani Mar 2005 A1
20050050324 Corbett et al. Mar 2005 A1
20050054431 Walker et al. Mar 2005 A1
20050055242 Bello et al. Mar 2005 A1
20050055244 Mullan et al. Mar 2005 A1
20050058292 Diorio et al. Mar 2005 A1
20050074126 Stanko Apr 2005 A1
20050076242 Breuer Apr 2005 A1
20050081040 Johnson et al. Apr 2005 A1
20050084137 Kim et al. Apr 2005 A1
20050086115 Pearson Apr 2005 A1
20050086501 Woo Apr 2005 A1
20050086515 Paris Apr 2005 A1
20050089000 Bae et al. Apr 2005 A1
20050090200 Karaoguz et al. Apr 2005 A1
20050091338 de la Huerga Apr 2005 A1
20050091553 Chien et al. Apr 2005 A1
20050094657 Sung et al. May 2005 A1
20050097037 Tibor May 2005 A1
20050105600 Culum et al. May 2005 A1
20050105734 Buer May 2005 A1
20050108164 Salafia et al. May 2005 A1
20050109836 Ben-Aissa May 2005 A1
20050109841 Ryan et al. May 2005 A1
20050113070 Okabe May 2005 A1
20050114149 Rodriguez et al. May 2005 A1
20050114150 Franklin May 2005 A1
20050116020 Smolucha et al. Jun 2005 A1
20050117530 Abraham et al. Jun 2005 A1
20050119979 Murashita et al. Jun 2005 A1
20050124294 Wentink Jun 2005 A1
20050125258 Yellin et al. Jun 2005 A1
20050137827 Takamiya Jun 2005 A1
20050137977 Wankmueller Jun 2005 A1
20050138390 Adams et al. Jun 2005 A1
20050138576 Baumert et al. Jun 2005 A1
20050139656 Arnouse Jun 2005 A1
20050141451 Yoon et al. Jun 2005 A1
20050152394 Cho Jul 2005 A1
20050154897 Holloway et al. Jul 2005 A1
20050161503 Remery et al. Jul 2005 A1
20050165684 Jensen et al. Jul 2005 A1
20050166063 Huang Jul 2005 A1
20050167482 Ramachandran et al. Aug 2005 A1
20050169292 Young Aug 2005 A1
20050177716 Ginter et al. Aug 2005 A1
20050180385 Jeong et al. Aug 2005 A1
20050182661 Allard et al. Aug 2005 A1
20050182975 Guo et al. Aug 2005 A1
20050187792 Harper Aug 2005 A1
20050192748 Andric et al. Sep 2005 A1
20050195975 Kawakita Sep 2005 A1
20050200453 Turner et al. Sep 2005 A1
20050201389 Shimanuki et al. Sep 2005 A1
20050203682 Omino et al. Sep 2005 A1
20050203844 Ferguson et al. Sep 2005 A1
20050210270 Rohatgi et al. Sep 2005 A1
20050212657 Simon Sep 2005 A1
20050215233 Perera et al. Sep 2005 A1
20050216313 Claud et al. Sep 2005 A1
20050216639 Sparer et al. Sep 2005 A1
20050218215 Lauden Oct 2005 A1
20050220046 Falck et al. Oct 2005 A1
20050221869 Liu et al. Oct 2005 A1
20050229007 Bolle et al. Oct 2005 A1
20050229240 Nanba Oct 2005 A1
20050242921 Zimmerman et al. Nov 2005 A1
20050243787 Hong et al. Nov 2005 A1
20050249385 Kondo et al. Nov 2005 A1
20050251688 Nanavati et al. Nov 2005 A1
20050253683 Lowe Nov 2005 A1
20050257102 Moyer et al. Nov 2005 A1
20050264416 Maurer Dec 2005 A1
20050268111 Markham Dec 2005 A1
20050269401 Spitzer et al. Dec 2005 A1
20050272403 Ryu et al. Dec 2005 A1
20050277385 Daum Dec 2005 A1
20050281215 Budampati et al. Dec 2005 A1
20050281320 Neugebauer Dec 2005 A1
20050282558 Choi et al. Dec 2005 A1
20050284932 Sukeda et al. Dec 2005 A1
20050287985 Balfanz et al. Dec 2005 A1
20050288069 Arunan et al. Dec 2005 A1
20050289473 Gustafson et al. Dec 2005 A1
20060001525 Nitzan et al. Jan 2006 A1
20060014430 Liang et al. Jan 2006 A1
20060022042 Smets et al. Feb 2006 A1
20060022046 Iwamura Feb 2006 A1
20060022800 Krishna et al. Feb 2006 A1
20060025180 Rajkotia et al. Feb 2006 A1
20060026673 Tsuchida Feb 2006 A1
20060030279 Leabman Feb 2006 A1
20060030353 Jun Feb 2006 A1
20060034250 Kim et al. Feb 2006 A1
20060041746 Kirkup et al. Feb 2006 A1
20060046664 Paradiso et al. Mar 2006 A1
20060058102 Nguyen et al. Mar 2006 A1
20060063575 Gatto et al. Mar 2006 A1
20060064605 Giobbi Mar 2006 A1
20060069814 Abraham et al. Mar 2006 A1
20060072586 Callaway, Jr. et al. Apr 2006 A1
20060074713 Conry et al. Apr 2006 A1
20060076401 Frerking Apr 2006 A1
20060078176 Abiko et al. Apr 2006 A1
20060087407 Stewart et al. Apr 2006 A1
20060089138 Smith et al. Apr 2006 A1
20060097949 Luebke et al. May 2006 A1
20060110012 Ritter May 2006 A1
20060111955 Winter et al. May 2006 A1
20060113381 Hochstein et al. Jun 2006 A1
20060116935 Evans Jun 2006 A1
20060117013 Wada Jun 2006 A1
20060120287 Foti et al. Jun 2006 A1
20060129838 Chen et al. Jun 2006 A1
20060136728 Gentry et al. Jun 2006 A1
20060136742 Giobbi Jun 2006 A1
20060143441 Giobbi Jun 2006 A1
20060144943 Kim Jul 2006 A1
20060156027 Blake Jul 2006 A1
20060158308 McMullen et al. Jul 2006 A1
20060163349 Neugebauer Jul 2006 A1
20060165060 Dua Jul 2006 A1
20060169771 Brookner Aug 2006 A1
20060170530 Nwosu et al. Aug 2006 A1
20060170565 Husak et al. Aug 2006 A1
20060172700 Wu Aug 2006 A1
20060173846 Omae et al. Aug 2006 A1
20060173991 Piikivi Aug 2006 A1
20060183426 Graves et al. Aug 2006 A1
20060183462 Kolehmainen Aug 2006 A1
20060184795 Doradla et al. Aug 2006 A1
20060185005 Graves et al. Aug 2006 A1
20060187029 Thomas Aug 2006 A1
20060190348 Ofer et al. Aug 2006 A1
20060190413 Harper Aug 2006 A1
20060194598 Kim et al. Aug 2006 A1
20060195576 Rinne et al. Aug 2006 A1
20060198337 Hoang et al. Sep 2006 A1
20060200467 Ohmori et al. Sep 2006 A1
20060205408 Nakagawa et al. Sep 2006 A1
20060208066 Finn et al. Sep 2006 A1
20060208853 Kung et al. Sep 2006 A1
20060222042 Teramura et al. Oct 2006 A1
20060226950 Kanou et al. Oct 2006 A1
20060229909 Kaila et al. Oct 2006 A1
20060236373 Graves et al. Oct 2006 A1
20060237528 Bishop et al. Oct 2006 A1
20060238305 Loving et al. Oct 2006 A1
20060268891 Heidari-Bateni et al. Nov 2006 A1
20060273176 Audebert et al. Dec 2006 A1
20060274711 Nelson, Jr. et al. Dec 2006 A1
20060279412 Holland et al. Dec 2006 A1
20060286969 Talmor et al. Dec 2006 A1
20060288095 Torok et al. Dec 2006 A1
20060288233 Kozlay Dec 2006 A1
20060290580 Noro et al. Dec 2006 A1
20060293925 Flom Dec 2006 A1
20060294388 Abraham et al. Dec 2006 A1
20070003111 Awatsu et al. Jan 2007 A1
20070005403 Kennedy et al. Jan 2007 A1
20070007331 Jasper et al. Jan 2007 A1
20070008070 Friedrich Jan 2007 A1
20070008916 Haugli et al. Jan 2007 A1
20070011724 Gonzalez et al. Jan 2007 A1
20070016800 Spottswood et al. Jan 2007 A1
20070019845 Kato Jan 2007 A1
20070029381 Braiman Feb 2007 A1
20070032225 Konicek et al. Feb 2007 A1
20070032288 Nelson et al. Feb 2007 A1
20070033072 Bildirici Feb 2007 A1
20070033150 Nwosu Feb 2007 A1
20070036396 Sugita et al. Feb 2007 A1
20070038751 Jorgensen Feb 2007 A1
20070043594 Lavergne Feb 2007 A1
20070050259 Wesley Mar 2007 A1
20070050398 Mochizuki Mar 2007 A1
20070051794 Glanz et al. Mar 2007 A1
20070051798 Kawai et al. Mar 2007 A1
20070055630 Gauthier et al. Mar 2007 A1
20070060095 Subrahmanya et al. Mar 2007 A1
20070060319 Block et al. Mar 2007 A1
20070064742 Shvodian Mar 2007 A1
20070069852 Mo et al. Mar 2007 A1
20070070040 Chen et al. Mar 2007 A1
20070072636 Worfolk et al. Mar 2007 A1
20070073553 Flinn et al. Mar 2007 A1
20070084523 McLean Apr 2007 A1
20070084913 Weston Apr 2007 A1
20070087682 DaCosta Apr 2007 A1
20070087834 Moser et al. Apr 2007 A1
20070100507 Simon May 2007 A1
20070100939 Bagley et al. May 2007 A1
20070109117 Heitzmann et al. May 2007 A1
20070112676 Kontio et al. May 2007 A1
20070118891 Buer May 2007 A1
20070120643 Lee May 2007 A1
20070132586 Plocher et al. Jun 2007 A1
20070133478 Armbruster et al. Jun 2007 A1
20070136407 Rudelic Jun 2007 A1
20070142032 Balsillie Jun 2007 A1
20070147332 Lappetelainen et al. Jun 2007 A1
20070152826 August et al. Jul 2007 A1
20070156850 Corrion Jul 2007 A1
20070157249 Cordray et al. Jul 2007 A1
20070158411 Krieg, Jr. Jul 2007 A1
20070159301 Hirt et al. Jul 2007 A1
20070159994 Brown et al. Jul 2007 A1
20070164847 Crawford et al. Jul 2007 A1
20070169121 Hunt et al. Jul 2007 A1
20070174809 Brown et al. Jul 2007 A1
20070176756 Friedrich Aug 2007 A1
20070176778 Ando et al. Aug 2007 A1
20070180047 Dong et al. Aug 2007 A1
20070187266 Porter et al. Aug 2007 A1
20070192601 Spain et al. Aug 2007 A1
20070194882 Yokota et al. Aug 2007 A1
20070198436 Weiss Aug 2007 A1
20070204078 Boccon-Gibod et al. Aug 2007 A1
20070205860 Jones et al. Sep 2007 A1
20070205861 Nair et al. Sep 2007 A1
20070207750 Brown et al. Sep 2007 A1
20070213048 Trauberg Sep 2007 A1
20070214492 Gopi et al. Sep 2007 A1
20070218921 Lee et al. Sep 2007 A1
20070219926 Kom Sep 2007 A1
20070220272 Campisi et al. Sep 2007 A1
20070229268 Swan et al. Oct 2007 A1
20070245157 Giobbi et al. Oct 2007 A1
20070245158 Giobbi et al. Oct 2007 A1
20070247366 Smith et al. Oct 2007 A1
20070258626 Reiner Nov 2007 A1
20070260883 Giobbi et al. Nov 2007 A1
20070260888 Giobbi et al. Nov 2007 A1
20070266257 Camaisa et al. Nov 2007 A1
20070268862 Singh et al. Nov 2007 A1
20070271194 Walker et al. Nov 2007 A1
20070271433 Takemura Nov 2007 A1
20070277044 Graf et al. Nov 2007 A1
20070280509 Owen et al. Dec 2007 A1
20070285212 Rotzoll Dec 2007 A1
20070285238 Batra Dec 2007 A1
20070288263 Rodgers Dec 2007 A1
20070288752 Chan Dec 2007 A1
20070293155 Liao et al. Dec 2007 A1
20070294755 Dadhia et al. Dec 2007 A1
20070296544 Beenau et al. Dec 2007 A1
20080001783 Cargonja et al. Jan 2008 A1
20080005432 Kagawa Jan 2008 A1
20080008359 Beenau et al. Jan 2008 A1
20080011842 Curry et al. Jan 2008 A1
20080012685 Friedrich et al. Jan 2008 A1
20080012767 Caliri et al. Jan 2008 A1
20080016004 Kurasaki et al. Jan 2008 A1
20080019578 Saito et al. Jan 2008 A1
20080028227 Satoshi Jan 2008 A1
20080028453 Nguyen et al. Jan 2008 A1
20080040609 Giobbi Feb 2008 A1
20080046366 Bemmel et al. Feb 2008 A1
20080046715 Balazs et al. Feb 2008 A1
20080049700 Shah et al. Feb 2008 A1
20080061941 Fischer et al. Mar 2008 A1
20080071577 Highley Mar 2008 A1
20080072063 Takahashi et al. Mar 2008 A1
20080088475 Martin Apr 2008 A1
20080090548 Ramalingam Apr 2008 A1
20080095359 Schreyer et al. Apr 2008 A1
20080107089 Larsson et al. May 2008 A1
20080109895 Janevski May 2008 A1
20080111752 Lindackers et al. May 2008 A1
20080127176 Lee et al. May 2008 A1
20080129450 Riegebauer Jun 2008 A1
20080148351 Bhatia et al. Jun 2008 A1
20080149705 Giobbi et al. Jun 2008 A1
20080150678 Giobbi et al. Jun 2008 A1
20080156866 McNeal Jul 2008 A1
20080164997 Aritsuka et al. Jul 2008 A1
20080169909 Park et al. Jul 2008 A1
20080186166 Zhou et al. Aug 2008 A1
20080188308 Shepherd et al. Aug 2008 A1
20080195863 Kennedy Aug 2008 A1
20080201768 Koo et al. Aug 2008 A1
20080203107 Conley et al. Aug 2008 A1
20080209571 Bhaskar et al. Aug 2008 A1
20080218416 Handy et al. Sep 2008 A1
20080222701 Saaranen et al. Sep 2008 A1
20080223918 Williams et al. Sep 2008 A1
20080228524 Brown Sep 2008 A1
20080235144 Phillips Sep 2008 A1
20080238625 Rofougaran et al. Oct 2008 A1
20080250388 Meyer et al. Oct 2008 A1
20080251579 Larsen Oct 2008 A1
20080278325 Zimman et al. Nov 2008 A1
20080289030 Poplett Nov 2008 A1
20080289032 Aoki et al. Nov 2008 A1
20080303637 Gelbman et al. Dec 2008 A1
20080313728 Pandrangi et al. Dec 2008 A1
20080314971 Faith et al. Dec 2008 A1
20080316045 Sriharto et al. Dec 2008 A1
20090002134 McAllister Jan 2009 A1
20090013191 Popowski Jan 2009 A1
20090016573 McAfee, II et al. Jan 2009 A1
20090024584 Dharap et al. Jan 2009 A1
20090033464 Friedrich Feb 2009 A1
20090033485 Naeve et al. Feb 2009 A1
20090036164 Rowley Feb 2009 A1
20090041309 Kim et al. Feb 2009 A1
20090045916 Nitzan et al. Feb 2009 A1
20090052389 Qin et al. Feb 2009 A1
20090070146 Haider et al. Mar 2009 A1
20090076849 Diller Mar 2009 A1
20090081996 Duggal et al. Mar 2009 A1
20090096580 Paananen Apr 2009 A1
20090121890 Brown et al. May 2009 A1
20090125401 Beenau et al. May 2009 A1
20090140045 Evans Jun 2009 A1
20090157512 King Jun 2009 A1
20090165123 Giobbi Jun 2009 A1
20090176566 Kelly Jul 2009 A1
20090177495 Abousy et al. Jul 2009 A1
20090195461 Hirt Aug 2009 A1
20090199206 Finkenzeller et al. Aug 2009 A1
20090206992 Giobbi et al. Aug 2009 A1
20090237245 Brinton et al. Sep 2009 A1
20090237253 Neuwirth Sep 2009 A1
20090239667 Rowe et al. Sep 2009 A1
20090253516 Hartmann et al. Oct 2009 A1
20090254448 Giobbi Oct 2009 A1
20090254971 Herz et al. Oct 2009 A1
20090264712 Baldus et al. Oct 2009 A1
20090310514 Jeon et al. Dec 2009 A1
20090313689 Nystrom et al. Dec 2009 A1
20090319788 Zick et al. Dec 2009 A1
20090320118 Muller et al. Dec 2009 A1
20090322510 Berger et al. Dec 2009 A1
20090328182 Malakapalli et al. Dec 2009 A1
20100005526 Tsuji et al. Jan 2010 A1
20100007498 Jackson Jan 2010 A1
20100022308 Hartmann et al. Jan 2010 A1
20100023074 Powers et al. Jan 2010 A1
20100037255 Sheehan et al. Feb 2010 A1
20100062743 Jonsson Mar 2010 A1
20100077214 Jogand-Coulomb et al. Mar 2010 A1
20100117794 Adams et al. May 2010 A1
20100134257 Puleston et al. Jun 2010 A1
20100169442 Liu et al. Jul 2010 A1
20100169964 Liu et al. Jul 2010 A1
20100172567 Prokoski Jul 2010 A1
20100174911 Isshiki Jul 2010 A1
20100188226 Seder et al. Jul 2010 A1
20100214100 Page Aug 2010 A1
20100277283 Burkart et al. Nov 2010 A1
20100277286 Burkart et al. Nov 2010 A1
20100291896 Corda Nov 2010 A1
20100305843 Yan et al. Dec 2010 A1
20100328033 Kamei Dec 2010 A1
20110072034 Sly et al. Mar 2011 A1
20110072132 Shafer et al. Mar 2011 A1
20110082735 Kannan et al. Apr 2011 A1
20110085287 Ebrom et al. Apr 2011 A1
20110091136 Danch et al. Apr 2011 A1
20110116358 Li et al. May 2011 A9
20110126188 Bernstein et al. May 2011 A1
20110221568 Giobbi Sep 2011 A1
20110227740 Wohltjen Sep 2011 A1
20110238517 Ramalingam et al. Sep 2011 A1
20110246790 Koh et al. Oct 2011 A1
20110266348 Denniston, Jr. Nov 2011 A1
20110307599 Saretto et al. Dec 2011 A1
20120028609 Hruska Feb 2012 A1
20120030006 Yoder et al. Feb 2012 A1
20120069776 Caldwell et al. Mar 2012 A1
20120086571 Scalisi et al. Apr 2012 A1
20120182123 Butler et al. Jul 2012 A1
20120212322 Idsoe Aug 2012 A1
20120226451 Bacot et al. Sep 2012 A1
20120226565 Drozd Sep 2012 A1
20120226907 Hohberger Sep 2012 A1
20120238287 Scherzer Sep 2012 A1
20120278188 Attar et al. Nov 2012 A1
20120300753 Brown et al. Nov 2012 A1
20120310720 Balsan et al. Dec 2012 A1
20130019295 Park Jan 2013 A1
20130019323 Arvidsson et al. Jan 2013 A1
20130044111 VanGilder et al. Feb 2013 A1
20130111543 Brown May 2013 A1
20130135082 Xian et al. May 2013 A1
20130179201 Fuerstenberg et al. Jul 2013 A1
20130219186 Giobbi et al. Aug 2013 A1
20130276140 Coffing Oct 2013 A1
20130297514 Giobbi Nov 2013 A1
20130315210 Brown et al. Nov 2013 A1
20130331063 Cormier Dec 2013 A1
20140074696 Glaser Mar 2014 A1
20140147018 Argue et al. May 2014 A1
20140266604 Masood et al. Sep 2014 A1
20140266713 Sehgal et al. Sep 2014 A1
20140337920 Giobbi Nov 2014 A1
20150026480 Giobbi et al. Jan 2015 A1
20150039451 Bonfiglio Feb 2015 A1
20150294293 Signarsson Oct 2015 A1
20150310385 King et al. Oct 2015 A1
20150310440 Hynes et al. Oct 2015 A1
20160133123 Giobbi et al. May 2016 A1
20160171200 Giobbi Jun 2016 A1
20160203349 Giobbi Jul 2016 A1
20160205682 Brown et al. Jul 2016 A1
20160210614 Hall Jul 2016 A1
20160300236 Wiley et al. Oct 2016 A1
20160306956 Giobbi Oct 2016 A1
20170041315 Giobbi Feb 2017 A1
20170085564 Giobbi et al. Mar 2017 A1
20170091548 Agrawal et al. Mar 2017 A1
20170270738 Giobbi Sep 2017 A1
20170309165 Brown et al. Oct 2017 A1
20180019998 Giobbi Jan 2018 A1
20180129799 Giobbi May 2018 A1
20180322718 Qian et al. Nov 2018 A1
20180357475 Honda et al. Dec 2018 A1
20190065721 Giobbi Feb 2019 A1
20190172281 Einberg et al. Jun 2019 A1
20190260724 Hefetz et al. Aug 2019 A1
20190289562 Brown Sep 2019 A1
20200351873 Brown et al. Nov 2020 A1
Foreign Referenced Citations (14)
Number Date Country
1536306 Jun 2005 EP
H10-49604 Feb 1998 JP
9956429 Nov 1999 WO
0062505 Oct 2000 WO
0122724 Mar 2001 WO
0135334 May 2001 WO
0175876 Oct 2001 WO
0177790 Oct 2001 WO
05050450 Oct 2001 WO
05086802 Oct 2001 WO
2004010774 Feb 2004 WO
2004038563 May 2004 WO
2005031663 Apr 2005 WO
2007087558 Aug 2007 WO
Non-Patent Literature Citations (145)
Entry
W. Jonker and J. -. Linnartz, “Digital rights management in consumer electronics products,” in IEEE Signal Processing Magazine, vol. 21, No. 2, pp. 82-91, Mar. 2004, doi: 10.1109/MSP.2004.1276116. (Year: 2004).
A. Beaufour and P. Bonnet, “Personal servers as digital keys,” Second IEEE Annual Conference on Pervasive Computing and Communications, 2004. Proceedings of the, 2004, pp. 319-328, doi: 10.1109/PERCOM.2004.1276869. (Year: 2004).
Vainio, Juha., “Bluetooth Security”, dated 2000, Helskinki University of Technology, p. 1-20.
Katz et al., “Smart Cards and Biometrics in Privacy-Sensitive Secure Personal Identification System”, dated 2002, Smart Card Alliance, p. 1-29.
Chen, et al. “On Enhancing Biometric Authentication with Data Protection.” KES2000. Fourth International Conference on Knowledge-Based Intelligent Engineering Systems and Allied Technologies. Proceedings (Cat. No. 00TH8516), vol. 1, 2000, pp. 249-252 vol. 1.
Govindan, G, et al. “Real Time Security Management Using RFID, Biometric and Smart Messages.” 2009 3rd International Conference on Anti-Counterfeiting, Security, and Identification in Communication, 2009, pp. 282-285.
Jeyaprakash, R, et al. “Secured Smart Card Using Palm Vein Biometric On-Card-Process.” 2008 International Conference on Convergence and Hybrid Information Technology, 2008, pp. 548-551.
Noore, A. “Highly Robust Biometric Smart Card Design.” IEEE Transactions on Consumer Electronics, vol. 46, No. 4, 2000, pp. 1059-1063.
Singh, Sweta, et al. “A Constraint-Based Biometric Scheme on ATM and Swiping Machine.” 2016 International Conference on Computational Techniques in Information and Communication Technologies (ICCTICT), 2016, pp. 74-79.
IEEE Computer Society, “IEEE Std 802.15.4™—Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low-Rate Wireless Personal Area Networks (LR-WPANs),” The Institute of Electrical and Electronics Engineers, Inc., New York, NY, Oct. 1, 2003, 679 pgs.
Anonymous, “IEEE 802.15.4-2006—Wikipedia, the free encyclopedia,” Wikipedia, last modified Mar. 21, 2009, retrieved from http://en.wikipedia.org/wiki/IEEE_802.15.4-2006 on Apr. 30, 2009, 5 pgs.
Apple et al., “Smart Card Setup Guide,” 2006, downloaded from http://manuals.info.apple.com/en_US/Smart_Card_Setup_Guide.pdf on or before May 3, 2012, 16 pgs.
Balanis, “Antenna Theory: A Review,” Jan. 1992, Proceedings of the IEEE, vol. 80, No. 1, p. 13.
Beaufour, “Personal Servers as Digital Keys,” Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications (PERCOM'04), Mar. 14-17, 2004, pp. 319-328.
Blueproximity, “BlueProximity—Leave it—it's locked, come back, it's back too . . . ” Aug. 26, 2007, retrieved from http://blueproximity.sourceforge.net/ via http://www.archive.org/ on or before Oct. 11, 2011, 1 pg.
Bohrsatom et al., “Automatically unlock PC when entering proximity,” Dec. 7, 2005, retrieved from http://salling.com/forums/viewtopic.php?t-3190 on or before Oct. 11, 2011, 3 pgs.
Brown, “Techniques for Privacy and Authentication in Personal Communication Systems,” Personal Communications, IEEE, Aug. 1995, vol. 2, No. 4, pp. 6-10.
Cisco Systems, Inc., “Antenna Patterns and Their Meaning,” 1992-2007, p. 10.
Costa, “Imation USB 2.0 Micro Hard Drive,” Nov. 22, 2005, retrieved from http://www.pcmag.com/article2/0,2817,1892209,00 asp on or before Oct. 11, 2011, 2 pgs.
Dagan, “Power over Ethernet (PoE) Midspan—The Smart Path to Providign Power for IP Telephony,” Product Manager, Systems, Aug. 2005, Power Dsine Inc., 28 pgs.
Derfler, “How Networks Work,” Bestseller Edition, 1996, Ziff-Davis Press, Emeryville, CA, all pages.
Giobbi, Specification of U.S. Appl. No. 60/824,758, filed Sep. 6, 2006, all pages.
Gralla, “Howthe Internet Works,” Millennium Edition, 1999, Que Corporation, Indianapolis, IN, all pages.
Hendron, “File Security, Keychains, Encryptioin, and More with Mac OS X (10.3+)” Apr. 4, 2005, downloaded from http://www.johnhendron.net/documents/OSX_Security.pdf on or before May 3, 2012, 30 pgs.
International Search Report and Written Opinion for International Application No. PCT/US07/00349, dated Mar. 19, 2008, 10 pgs.
International Search Report and Written Opinion for International Application No. PCT/US08/83060, dated Dec. 29, 2008, 9 pgs.
International Search Report and Written Opinion for International Application No. PCT/US08/87835, dated Feb. 11, 2009, 8 pgs.
International Search Report and Written Opinion for International Application No. PCT/US09/34095, dated Mar. 25, 2009, 11 pgs.
International Search Report and Written Opinion for International Application No. PCT/US2009/039943, dated Jun. 1, 2009, 9 pgs.
International Search Report and Written Opinion for International Application No. PCT/US2014/037609, dated Dec. 9, 2014, 13 pgs.
Lee et al., “Effects of dielectric superstrates on a two-layer electromagnetically coupled patch antenna,” Antennas and Propagation Society International Symposium, Jun. 1989, AP-S. Digest, vol. 2, pp. 26-30, found at http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1347.
Muller, “Desktop Encyclopedia of the Internet,” 1999, Artech House Inc., Norwood, MA, all pages.
National Criminal Justice Reference Service, “Antenna Types,” Dec. 11, 2006, online at http://ncjrs.gov/pdfffiles1/nij/185030b.pdf, retrieved from http://web.archive.org/web/*/http://www.ncjrs.gov/pdffiles1/nij/185030b.pdf on Jan. 12, 2011, 1 pg.
Nel et al., “Generation of Keys for use with the Digital Signature Standard (DSS),” Communications and Signal Processing, Proceedings of the 1993 IEEE South African Symposium, Aug. 6, 1993, pp. 6-11.
Nerd Vittles, “magicJack: Could It be the Asterisk Killer?” Aug. 1, 2007, retrieved from http://nerdvittles.com/index.php?p=187 on or before Oct. 11, 2011, 2 pgs.
Pash, “Automate proximity and location-based computer actions,” Jun. 5, 2007, retrieved from http://lifehacker.com/265822/automate-proximity-and-location+based-computer-actions on or before Oct. 11, 2011, 3 pgs.
Smart Card Alliance, “Contactless Technology for Secure Physical Access: Technology and Standards Choices,” Smart Card Alliance, Oct. 2002, pp. 1-48.
SplashID, “SplashID—Secure Password Manager for PDAs and Smartphones,” Mar. 8, 2007, retrieved from http://www.splashdata.com/splashid/ via http://www.archive.org/ on or before Oct. 11, 2011, 2 pgs.
Srivastava, “Is internet security a major issue with respect to the slow acceptance rate of digital signatures,” Jan. 2, 2005, Computer Law & Security Report, pp. 392-404.
White, “How computers Work,” Millennium Edition, 1999, Que Corporation, Indianapolis, IN, all pages.
Thongthammachart et al., “Bluetooth Enables In-door Mobile Location Services,” Proceedings of the 57th IEEE Semiannual Vehicular Technology Conference, Apr. 22-25, 2003, 5 pgs.
University of Birmingham, “PRISM: Probabilistic Symbolic Model Checker,” at least as early as Aug. 3, 2004, 3 pgs., archived at https://web.archive.org/web/20040803193058/http://www.cs.bham.ac.uk/˜dxp/prism/casestudies/index.html.
Weissman, “Indoor Location,” Tadlys Ltd. white paper, at least as early as Oct. 31, 2004, 15 pgs., archived at https://web.archive.org/web/20041031125859/http:/www.tadlys.com/media/downloads/Indoors_Location_Systems.pdf.
ZigBee Alliance, “Welcome to the ZigBeeTM Alliance,” exemplary web page, at least as early as Sep. 24, 2004, 2 pgs., archived at https://web.archive.org/web/20040924045517/http://zigbee.org/.
ZigBee Alliance, “ZigBee Specification,” ZigBee Document 053474r06, Version 1.0, Dec. 14, 2004, 378 pgs.
ZigBee Alliance, “The ZigBeeTM Buzz Is Growing: New Low-Power Wireless Standard Opens Powerful Possibilities,” Electronic Design, Jan. 12, 2004, 12 pgs., archived at https://web.archive.org/web/20040411172015/http:/www.elecdesign.com/Files/29/7186/7186_01.pdf.
ZigBee Alliance, “ZigBeeTM Positioned to Drive Wireless Networking in Building Automation, Industrial and Residential Control and Sensors Markets in 2004,” press release, Feb. 17, 2004, 3 pgs., archived at https://web.archive.org/web/20040423220244/http:/www.zigbee.org/documents/04036r5ZB_MWG-Momentum-Release_FINAL.pdf.
Schneier, Applied Cryptography, Second Edition: Protocols, Algorithms, and Source Doe in C, Jan. 1, 1996, John Wiley & Sons, Inc., 1027 pgs.
Adams, “Designing with 802.15.4 and Zigbee,” presented at Industrial Wireless Applications Summit, San Diego, California, Mar. 9, 2004, 22 pgs.
Adams, “Meet the ZigBee Standard,” Sensors Online, Jun. 2003, 7 pgs., archived at https://web.archive.org/web/20031008191032/http:/sensorsmag.com/articles/0603/14/pf_main.shtml.
Adams, “Zigbee vital in industrial applications,” EE Times, Jul. 29, 2003, 3 pgs , archived at https://web.archive.org/web/20031013062940/http:/www.eetimes.com/story/OEG20030727S0002.
Blip Systems, “Mar. 8, 2004—Bluetooth at the office?” at least as early as Oct. 11, 2004, archived at https://web.archive.org/web/20041011094320/http:/www.blipsystems.com/Default.asp?ID=16&M=News&PID=25&NewsID=9.
Blip Systems, “BlipManager,” at least as early as May 17, 2004, 1 pg., archived at https://web.archive.org/web/20040517050728/http:/www.blipsystems.com/Default.asp?ID=11.
Blip Systems, “BlipMobility,” at least as early as Apr. 7, 2004, archived at https://web.archive.org/web/20040407212934/http:/www.blipsystems.com/Default.asp?ID=118.
Blip Systems, “BlipNet API,” at least as early as May 18, 2004, 1 pg., archived at https://web.archive.org/web/20040518060132/http:/www.blipsystems.com/Default.asp?ID=92.
Blip Systems, “BlipNet Explore a wireless world . . . of great opportunities,” brochure available Sep. 2002, 6 pgs., availabe online at https://web.archive.org/web/20031012184406/http:/www.blipsystems.com/products_blipnet.shtml.
Blip Systems, “BlipNet Technical Overview,” Mar. 2003, 30 pgs., archived at https://web.archive.org/web/20031012184406/http:/www.blipsystems.com/products_blipnet.shtml.
Blip Systems, “BlipNode,” at least as early as May 16, 2004, 1 pg., archived at https://web.archive.org/web/20040516001554/http:/www.blipsystems.com/Default.asp?ID=10.
Blip Systems, “BlipServer,” at least as early as May 17, 2004, 1 pg., archived at https://web.archive.org/web/20040517044955/http:/www.blipsystems.com/Default.asp?ID=9.
Blip Systems, “Bluetooth Networks: Products: Bluetooth infracture,” product description, at least as early as Oct. 2003, archived at https://web.archive.org/web/20031012184406/http:/www.blipsystems.com/products_blipnet.shtml.
Blip Systems, “Product Information—BlipNet—Presentation of BlipNet 1.0—A Bluetooth Access System,” Aug. 2002, 2 pgs., archived at https://web.archive.org/web/20031012184406/http:/www.blipsystems.com/products_blipnet.shtml.
Bluetooth Sig, Inc. “Specification of the Bluetooth System,” Version 12, Nov. 5, 2003, 82 pgs., archived at https://web.archive.org/web/20031119092849/http:/www.bluetooth.com/dev/spec.v12.asp.
Callaway, “Wireless Sensor Networks: Architectures and Protocols,” book description, Motorola Labs, Auerbach Publications, Aug. 26, 2003, 3 pgs., archived at https://web.archive.org/web/20031023101953/http:/www.crcpress.com/shopping cart/products/product detail.asp?sku=AU1823.
Chi et al., “Industrial Wireless Sensor Networking: A Market Dynamics Study,” ON World, Jun. 28, 2004, 5 pgs., archived at https://web.archive.org/web/20040710182216/http:/onworld.com:80/html/industrialwirelesssensor.htm.
Disclosed Anonymously (Method and Apparatus for Mobile Identity Authentication)., An IP.com Prior Art Database Technical IP.com No. IPCOM000194545D., IP.com Electronic Publication Date: Mar. 29, 2010 (Year: 2010).
Duflot et al., “A Formal Analysis of Bluetooth Device Discovery,” presented at the 1st International Symposium on Leveraging Applications of Formal Methods (ISOLA'04), Oct. 30-Nov. 2, 2004, Paphos, Cyprus, and published in the International Journal on Software Tools for Technology Transfer 8, pp. 621-632, 16 pgs., https://doi.org/10.1007/s10009-006-0014-x.
Eshed, “Bluetooth Wireless Technology Application for the Retail Market,” published at www.tadlys.com on May 2001, 8 pgs.
Freescale Semicondcutor, Inc., “Freescale Events,” see ZigBee Open House Event, Aug. 18, 2004, 6 pgs., archived at https://web.archive.org/web/20040909082726/https://www.freescale.com/webapp/sps/site/overview.jsp?nodeId=02XPgQ7JgbBqJQ#zigbee_openhouse_04.
Freescale Semiconductor, Inc., “Overview,” ZigBee General Information, at least as early as Aug. 17, 2004, 1 pg., archived at https://web.archive.org/web/20040817210006/http:/www.freescale.com/webapp/sps/site/overview.jsp?nodeId=02XPgQhHPRjdyB37087725.
Freescale Semiconductor, Inc., “ZigBeeTM,” Freescale Semiconductor Wireless Standards, at least as early as Aug. 18, 2004, 2 pgs., archived at https://web.archive.org/web/20040818075046/http:/www.freescale.com/webapp/sps/site/overview.jsp?nodeId=02XPgQhHPRjdyB.
Freescale Semiconductor, Inc., “ZigBeeTM,” Freescale Semiconductor Wireless Standards, at least as early as Jun. 11, 2004, 2 pgs., archived at https://web.archive.org/web/20040611051834/http:/e-www.motorola.com/webapp/sps/site/overview.jsp?nodeId=02XPgQhHPRjdyB.
Freescale Semiconductor, Inc., “Freescale's ZigBeeTM-ready Platform Wins Sensors Magazine Best of Sensors Expo Award,” Freescale Semiconductor Wireless, at least as early as Aug. 17, 2004, 1 pg., archived at https://web.archive.org/web/20040817203409mp_/http:/www.freescale.com/webapp/sps/site/overview.jsp?nodeId=02XPgQ6988.
Freescale Semiconductor, Inc., “ZigBee Alliance Successfully Concludes First Multi-node Network Test,” press release, Jul. 6, 2004, 2 pgs., archived at https://web.archive.org/web/20040717113733/http:/www.zigbee.org/documents/First-Multi-Node_Testing_FINAL_000.pdf.
Freescale Semiconductor, Inc., “ZigBeeTM Technology from Freescale,” Freescale Semiconductor, Inc. white paper, 2004, 4 pgs., archived at https://web.archive.org/web/20050513024652/http:/www.freescale.com/files/wireless_comm/doc/brochure/BRZIGBEEIECH.pdf.
Freescale Semiconductor, Inc., “ZRP-1 : ZigBee-ready Platform,” at least as early as Oct. 19, 2005, 6 pgs., archived at https://web.archive.org/web/20051019122919/http://www.freescale.com/webapp/sps/site/prod_summary.jsp?code=ZRP-1&nodeId=02XPgQhCQ6m6cy7103.
Freescale Semiconductor, Inc., M68HC08 microcontroller ordering web page, at least as early as Aug. 17, 2004, 5 pgs., archived at https://web.archive.org/web/20040817014804/http:/www.freescale.com/webapp/sps/site/taxonomy.jsp?nodeId=01624684498634.
IBM Corporation, “Tadlys' Bluetooth Wireless Local Network for Corporate,” Wireless e-business, at least as early as May 6, 2004, 2 pgs., archived at https://web.archive.org/web/20040621130525/http://www.tadlys.com/media/downloads/Corporate%20PVDEE01005-3.pdf.
IBM Corporation, “Tadlys' Bluetooth Wireless Local Network for Hotspots,” Wireless e-business, at least as early as May 6, 2004, 2 pgs., archived at https://web.archive.org/web/20040508123915/http://www.tadlys.com/media/downloads/Hotspots%20PVDEE01006-3.pdf.
IEEE, “IEEE 802.15 WPANTM Task Group 4 (TG4)” exemplary web page, Aug. 24, 2004, 2 pgs., archived at https://web.archive.org/web/20040824085452/http:/www.ieee802.org/15/pub/TG4.html.
Korzeniowski, “First Intelligent, Wireless Consumer Devices About To Hit Market,” TechNewsWorld, Jul. 28, 2004, 3 pgs., archived at https://web.archive.org/web/20040821061130/http:/www.technewsworld.com/story/35376.html%20com/.
Malan, “Here come Wireless Sensors,” Machine Design, Jun. 10, 2004, 3 pgs., archived at https://web.archive.org/web/20040610131354/http:/www.machinedesign.com/ASP/viewSelectedArticle.asp?strArticleId=56796&strSite=MDSite&Screen=CURRENTISSUE.
MIT Computer Science and Artificial Intelligence Laboratory, “Cricket v2 User Manual,” Cricket Project, MIT Computer Science and Artificial Intelligence Lab, Cambridge, MA, Jan. 2005, 57 pgs., available online at https://web.archive.org/web/20041206144922/http:/cricket.csail.mit.edu/v2man.html.
MIT Computer Science and Artificial Intelligence Laboratory, “The Cricket Indoor Location System,” at least as early as Nov. 19, 2004, 6 pgs., archived at https://web.archive.org/web/20041119183049/http://cricket.csail.mit.edu/.
Motorola, Inc., “Motorola First to Demonstrate ZigBee 2.4 GHz Wireless Networking Technology,” press release, Mar. 27, 2003, 2 pgs., archived at https://web.archive.org/web/20050205053308/http:/www.motorola.com/mediacenter/news/detail/0, 1958,2743_2228_23,00.html.
Priyantha, “The Cricket Indoor Location System,” Ph D. thesis submitted to Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Jun. 2005, 199 pgs.
Rodriguez et al., “In-building location using Bluetooth,” Proceedings of the International Workshop on Wireless Ad-Hoc Networks (IWWAN 2005), May 23-26, 2005, London, England, 7 pgs.
Tadlys Ltd., “'Hotspot' Gaming Arcade,” at least as early as Dec. 9, 2004, 2 pgs., archived at https://web.archive.org/web/20041209234518/http://www.tadlys.com/media/downloads/Tadlys_gaming_arcade.pdf.
Tadlys Ltd., “About Tadlys,” at least as early as Apr. 5, 2001, 1 pg., archived at https://web.archive.org/web/20010405044249/http:/www.tadlys.com/about.html.
Tadlys Ltd., “An Advertisers' Dream—From direct marketing to sales,” Nov. 2004, 2 pgs., archived at https://web.archive.org/web/20041101092944/http://www.tadlys.com/media/downloads/m-commerce_app.pdf.
Tadlys Ltd., “Bluetooth Glossary,” at least as early as Jun. 2004, 12 pgs., archived at https://web.archive.org/web/20040531082349/http://www.tadlys.com/pages/Downloads_content.asp?intGlobalId=1.
Tadlys Ltd., “First Demo of Distribution and Redemption of e-Coupons over Bluetooth,” Tadlys Company News and Events, Jun. 5, 2001, 1 pg., archived at https://web.archive.org/web/20040601051516/http://tadlys.com/Pages/news_content.asp?iGlobalID=17.
Tadlys Ltd., “Indoor Location Networks,” at least as early as Apr. 3, 2004, 1 pg., archived at https://web.archive.org/web/20040403200221/http:/www.tadlys.com/Pages/Product_content.asp?iGlobalId=2.
Tadlys Ltd., “Operator Systems,” at least as early as Nov. 1, 2004,2 pgs., archived at https://web.archive.org/web/20041101101402/http://www.tadlys.com/media/downloads/operator_network.pdf.
Tadlys Ltd., “Tadlys Announces Range of Bluetooth Access Network Solutions,” Tadlys Company News and Events, Jan. 22, 2001, 1 pg., archived at https://web.archive.org/web/20040624122319/http://www.tadlys.com/Pages/news_content.asp?iGlobalID=16.
Tadlys Ltd., “Tadlys' Wire free networking solutions,” Feb. 2001, 2 pgs., archived at https://web.archive.org/web/20010204012700/http:/www.tadlys.com/solutions.html.
Tadlys Ltd., “Wireless hospital network,” at least as early as Jul. 1, 2004, 2 pgs., archived at https://web.archive.org/web/20040701105046/http://www.tadlys.com/media/downloads/tadlys_hospital_wireless_network.pdf.
Tadlys Ltd., “Wireless Museum Information,” at least as early as Dec. 12, 2005, 2 pgs., archived at https://web.archive.org/web/20051212162456/http://www.tadlys.com/media/downloads/Tadlys_wireless_museum_network.pdf.
Tadlys Ltd., “Corporate Systems,” at least as early as Nov. 1, 2004, 2 pgs., archived at https://web.archive.org/web/20041101095441/http://www.tadlys.com/media/downloads/Corporate_network.pdf.
Dai et al., “Toward Blockchain-Based Accounting and Assurance”, 2017, Journal of Information Systems, pp. 5-21 (Year: 2017).
Alliance Activities: Publications: Identity-Smart Card Alliance, Smart Card Alliance, 1997-2007, [online] [Retrieved on Jan. 7, 2007] Retrieved from the Internet, https://www.smartcardalliance.org/pages/publications-identity.
Antonoff, Michael, Visiting Video Valley, Sound Vision, pp. 116 and 118-119, Nov. 2001.
Applying Biometrics to Door Access, Security Magazine, Sep. 26, 2002 [online] [Retrieved on Jan. 7, 2007] Retrieved from the Internet http://www.securitymagazine.com/CDA/Articles/Technologies/3ae610eaa34d8010VgnVCM100000f932a8c0_.
Biopay, LLC, Frequently Asked Questions (FAQs) About BioPay, BioPay, LLC, 2007, [online] [Retrieved on Jan. 7, 2007] Retrieved from the Internet http://www.biopay.com/faqs-lowes.asp.
Bluetooth, www.bluetoothcom, Printed Jlllle I, 2000.
Blum, Jonathan , Digital Rights Managment May Solve the Napster Problem, Technoloav Investor Industrvsector (Oct. 2000),24-27.
Content protection plan targets wireless home networks, www.eetimes.com, Jan. 11, 2002.
DeBow, Credit/Debit Debuts in Midwest Smart Card Test, Computers in Banking, v6, n11, p. 10, Nov. 1989.
Dennis, Digital Passports Need Not Infringe Civil Liberties, Newsbytes, Dec. 2, 1999, 2 pages.
Farouk, Authentication Mechanisms in Grid Computing Environment Comparative Study, 2012, IEEE, p. 1-6.
Fasca, Chad. The Circuit, Electronic News 45(45). (Nov. 8, 1999),20.
Firecrest Shows How Truly Commercially-Minded Companies Will Exploit the Internet, Computergram International, Jan. 18, 1996. 2pgs.
Kontzer, Tony, Thomson Bets on Smart Cards for Video Encryption, www.informationweek.com, Jun. 7, 2001 (Also listed under Press Release).
Lake, Matt. Downloading for Dollars, Sound Vision. (Nov. 2000), 137-138.
Lewis, Sony and Visa in on-Line Entertainment Venture, New York Times, v145, Nov. 16, 1995. 1 pg.
Liu et al. 2001. A Practical Guide to Biometric Security Technology. IT Professional 3, 1 (Jan. 2001), 27-32. DOI=10.1109/6294.899930 http://dx.doi.org/101109/6294.899930.
McIver, R. et al., Identification and Verification Working Together, BioscryptTM, Aug. 27, 2004, [online] [Retrieved on Jan. 7, 2007] Retrieved from the Internet http://www.ibia.org/membersadmin/whitepapers/pdf/15/Identification%20and%20Verification%20Working%20Together.pdf.
Micronas and Thomson multimedia Showcase a New Copy Protection System That Will Drive the Future of Digital Television, www.micronas.com, Jan. 8, 2002.
Nilsson, J. et al., Match-On-Card for Java Cards, Precise Biometrics, White Paper, Apr. 2004, [online] [Retrieved on Jan. 7, 2007] Retrieved from the Internet http://www.ibia.org/membersadrnin/whitepapers/pdf/17/Precise%20Match-on-Card%20for%20Java%20Cards.pdf.
Nordin, B., Match-On-Card Technology, PreciseTM Biometrics, White Paper, Apr. 2004, [online] [Retrieved on Jan. 7, 2007] Retrieved from the Internet http://www.ibia.org/membersadmin/whitepapers/pdf/17/Precise%20Match-on-Card%20technology.pdf.
Paget, Paul, The Security Behind Secure Extranets, Enterprise Systems Journal, (Dec. 1999), 4 pgs.
PCT International Search Report and Written Opinion, PCT/US04/38124, dated Apr. 7, 2005, 10 pages.
PCT International Search Report and Written Opinion, PCT/US05/07535, dated Dec. 6, 2005, 6 pages.
PCT International Search Report and Written Opinion, PCT/US05/43447, dated Feb. 22, 2007, 7 pages.
PCT International Search Report and Written Opinion, PCT/US05/46843, dated Mar. 1, 2007, 10 pages.
PCT International Search Report and Written Opinion, PCT/US07/11103, dated Apr. 23, 2008, 9 pages.
PCT International Search Report and Written Opinion, PCT/US07/11105, dated Oct. 20, 2008, 10 pages.
PCT International Search Report PCT/US07/11104, dated Jun. 26, 2008, 9 pages.
PCT International Search Report, PCT/US07/11102, dated Oct. 3, 2008, 11 pages.
Pope, Oasis Digital Signature Services: Digital Signing without the Headaches, Internet Computing IEEE, vol. 10, 2006, pp. 81-84.
SAFModuleTM: A Look Into Strong Authentication, saflink Corporation, [online] [Retrieved on Jan. 7, 2007] Retrieved from the Internet http://www.ibia.org/membersadmin/whitepapers/pdf/6/SAFmod_WP.pdf.
Sapsford, Jathon, E-Business: Sound Waves Could Help Ease Web-Fraud Woes, Wall Street Journal, (Aug. 14, 2000), B1.
Say Hello To Bluetooth, Bluetooth Web site 4 pages.
Smart Card Alliance Report, Contactless Technology for Secure Physical Access: Technology and Standsards Choices, Smart Card Alliance, Oct. 2002, p. 1-48.
Smart Cards and Biometrics White Paper, Smart Card Alliance, May 2002, [online] [Retrieved on Jan. 7, 2007] Retrieved from the Internet http://www.securitymanagement.com/library/smartcard_faqtech0802.pdf.
Thomson multimedia unveils copy protection proposal designed to provide additional layer of digital content security, www.thomson-multimedia.com. May 30, 2001. 2 pgs.
Van Winkle, William, Bluetooth the King of Connectivity, Laptop Buyers Guide and Handbook (Jan. 2000), 148-153.
Wade, W., Using Fingerprints to Make Payments at POS Slowly Gaining Popularity, Credit Union Journal, International Biometric Group, Apr. 21, 2003, online. Retrieved on Jan. 7, 2007. http://www.biometricgroup.com/in_the_news/04.21.03.html.
Wallace, Bob, The Internet Unplugged, InformationWeek, 765(22), (Dec. 13, 1999), 22-24.
Weber, Thomas E., In the Age of Napster, Protecting Copyright is a Digital Arms Race, Wall Street Journal, (Jul. 24, 2000), B1.
What is a File, Apr. 30, 1998, http://unixhelp.ed.ac.uk/editors/whatisafile.html.accessed Mar. 11, 2010 via http://waybackmachine.org/19980615000000*/http://unixhelp.ed.ac.uk/editors/whatisafile.html.
Yoshida, Junko, Content Protection Plan Targets Wireless Home Networks, www.eetimes.com, Jan. 11, 2002, 2 pgs.
Callaway, Wireless Sensor Networks: Architectures and Protocols, Jan. 1, 2004, Auerbach Publications, 366 pgs.
Dvorak, IEEE 802.15.4 and Zigbee Overview, Sep. 27, 2005, Motorola, 26 pgs.
Hester et al., “neuRFon(TM) Netform: A Self-Organizing Wireless Sensor Network”, Oct. 14, 2002, Proceedings of the Eleventh International Conference on Computer Communications and Networks, pp. 364-369.
Honkanen et al., “Low End Extension for Bluetooth”, Sep. 19, 2004, Proceedings of the 2004 IEEE Radio and Wireless Conference, Atlanta, GA, pp. 199-202.
Related Publications (1)
Number Date Country
20150195279 A1 Jul 2015 US
Provisional Applications (1)
Number Date Country
60551320 Mar 2004 US
Continuations (1)
Number Date Country
Parent 10598735 US
Child 14666268 US