1. Field of the Invention
The present application relates generally to managing software use, and more specifically to systems and methods to enable the monitoring and adjusting software usage under a software license.
2. Description of the Related Art
A common capability of digital product license systems is the ability to control how many devices are allowed to be used with each product license which is usually sold to an individual customer or company. For example U.S. Pat. No. 5,490,216 refers to a system where a license is given to an individual, but in turn that license is linked to a specific personal computer thereby limiting the copyright holders exposure to copyright abuse if the user decided to share their license with other unauthorized users.
A problem that has arisen over time is the fact that consumers of software have normal patterns of use that include the installation and use of digital products on multiple devices. For example a person may wish to buy software and use it on three computers at their home, a computer at work, a mobile computer and the computers at their holiday home and their parent's house. In addition to these uses, computers are also bought, sold and replaced so over time maybe two or three times this number of computers may be used by the user over time with a legitimate need to install and use the software on every computer.
Publishers of digital products have a dilemma in that they may want their customers to receive the normal freedom to use the software that they have purchased but they also do not want the software licenses to be freely shared amongst end users or even in worst case shared anonymously over the Internet resulting in massive piracy and copyright abuse of the product.
To solve this problem some publishers have set a relatively high device to license ratio in their control systems in the hope that customers will not exceed the maximum number of devices per license. An example of this is Apple iTunes which enables customers to play a purchased music file on up to a preset number (e.g., five) of devices (e.g., PCs) per license before being requested to buy an additional license. They have also implemented a system that allows customers to turn off the license rights of individual devices with regard to a specific music file license and therefore free up that device installation so that the music file can be used on one additional device.
While this method does go some way to appeasing the problem of a normal customers usage expectations, it does not take into consideration the normal attrition that occurs with the purchase and upgrade of personal computing devices or the like and places an expectation on the user to go through a number of involved steps to retain their rights to use the software. Accordingly, there is a need for an improved technique for allowing for a changing number of device installations on a per license basis over time.
The following presents a simplified summary of one or more embodiments in order to provide a basic understanding of such embodiments. This summary is not an extensive overview of all contemplated embodiments, and is intended to neither identify key or critical elements of all embodiments nor delineate the scope of any or all embodiments. Its sole purpose is to present some concepts of one or more embodiments in a simplified form as a prelude to the more detailed description that is presented later.
In accordance with one or more embodiments and corresponding disclosure thereof, various aspects are described in connection with adjusting a license for a digital product over time. The license may comprise at least one allowed copy count corresponding to a maximum number of devices authorized for use with the digital product. In one embodiment, a system for adjustable licensing includes: a communication module for receiving a request for authorization to use the digital product from a given device; a processor module in operative communication with the communication module; and a memory module in operative communication with the processor module.
The memory module may include executable code for the processor module to: (a) verify that a license data associated with the digital product is valid based at least in part on a device identity associated with the given device; and (b) in response to the device identity already being on a record, allow the digital product to be used on the given device.
The memory module may further include executable code for the processor module to: (c) in response to the device identity not being on the record, set the allowed copy count to a first upper limit for a first time period; (d) calculate a device count corresponding to total number of devices already authorized for use with the digital product; and (e) when the calculated device count is less than the first upper limit, allow the digital product to be used on the given device.
In related aspects, the processor module may be adapted to: (a) in response to the device identity not being on the record, after the first time period has expired, set the allowed copy count to a second upper limit for a second time period; (b) recalculate the device count; and/or (c) when the recalculated device count is less than the second upper limit, allow the digital product to be used on the given device. For example, the second time period may comprise a defined number of days since the initial authorization. The processor module may be adapted to, in response to the calculated device count equaling the second upper limit, send a warning regarding the allowed copy count to the given device. The processor module may be adapted to, in response to the calculated device count exceeding the second upper limit, deny the request for authorization.
In further related aspects, the processor module may be adapted to: (a) in response to the device identity not being on the record, after the second time period has expired, set the allowed copy count to a third upper limit; (b) recalculate the device count; and (c) when the recalculated device count is less than the third upper limit, allow the digital product to be used on the given device. The processor module may be adapted to, in response to the calculated device count equaling the third upper limit, send a warning regarding the allowed copy count to the given device. The processor module may be adapted to, in response to the calculated device count exceeding the third upper limit, deny the request for authorization.
To the accomplishment of the foregoing and related ends, the one or more embodiments comprise the features hereinafter fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative aspects of the one or more embodiments. These aspects are indicative, however, of but a few of the various ways in which the principles of various embodiments may be employed and the described embodiments are intended to include all such aspects and their equivalents.
Various embodiments are now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more embodiments. It may be evident, however, that such embodiment(s) can be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing one or more embodiments.
The techniques described herein allow for a changing number of device installations on a per license basis over time. Aspects of the techniques may include a customer feedback system that warns a user when they are nearing the limit of their device installation ceiling for their license. An example scenario could be as follows. A software publisher wants to commence distribution of a software product and to minimize unauthorized copying of their software. Their license may state that the publisher authorizes the user to use their software on up to, for example, five devices, but that the publisher reserves the right to increase this limit at their own discretion. The customer installs the software on the three computers they have at home. Each time the software connects to a license management server controlled by the publisher over the Internet to ensure that the device limit for the individual license has not been exceeded.
The customer may choose to install the same software on their personal computer (PC) at work. Upon contacting the publishers license management server over the Internet a message is displayed to the user warning them that they are nearing the limit of their device count for their license.
Two weeks later the user wishes to install their software on the two computers they own at the customers holiday home. If the publisher uses the proposed invention the maximum number of devices for the license may have been adjusted to accommodate a reasonable small increase in the number of devices linked to a specific license and both PCs may be allowed to install and run even though the publishers stated device limit per license is five.
Then three months later, the user experiences water damage from a flood in their house and a new PC is purchased. Upon installation of the protected software the invention will allow the user to obtain additional device installations from the publishers license management server for the same license (e.g., up to a total of seven devices) even though the device limit is initially set to five. However, if that user shares their license with all the computer users in a college dormitory, the invention can be set to stop wholesale abuse of the license terms, as described in further detail herein.
In accordance with one or more aspects of the embodiments described herein, there is provided a system for adjustable digital licensing over time allows a software user to increase the number of devices they can use with a particular software license over the period of ownership of that license. The terms or rules 60 of an exemplary software license are shown in
It is noted that the various numbers used to describe the embodiments herein, such as, for example, the allowed copy counts, the maximum number of devices authorized for use, the upper limit on the number of devices for a given time period, or the like, are purely exemplary, and that other numbers, data, values, or algorithms may be used in lieu of the exemplary numbers herein.
In related aspects,
Typically the device 50 requesting authorization collects license related information 10 and unique device identifying information 11, compiles the collected information into a communication and sends it to the authorization authority 55. Upon receipt of this communication from the device 50, the license authority 55 checks that the license information is valid (step 13). If the request fails, an authorization is disallowed (step 14) and the device based software is sent a message to this effect. In practice this may involve further action by the device based software to notify the user of the failure to authorize and then either terminate the software or allow the software to continue in some form of trial mode or the like.
If the request for authorization 12 includes license information/data that is valid, the license information checking process (at step 13) will pass and the requesting devices unique identity information 11 is checked to see if it exists in the database of prior authorizations 15. If the device identity exists (step 16), meaning that the software has been successfully registered on the same device in the past, then according to the license terms 60 for the software a reauthorization is automatically allowed (step 17). A communication allowing the software to continue in an authorized state is passed to the requesting device software 50 and the software on the device is subsequently authorized (step 18) and allowed to run.
If the unique identity of the device 11 is not in the authorization database 15 of previous device requests, then the licensing authority 55 checks to see if the new authorization request is the first request or is a subsequent request that has occurred in the first five days from the date of the first successful authorization (step 19).
At step 19, if the request is within the first five day period, the authorization database 15 is consulted for a count of how many successful authorizations for new devices have been allowed. Under the license rules 60, if the device count is less than five then a message is sent to the request device that allows the software to continue in an authorized state (step 18). If the device count is equal to five then the licensing authority 55 may send a message to the requesting device 50 allowing the device to run in an authorized state (step 18), but also may optionally inform the user that the limit of the number of devices available to run under this license has been reached and that subsequent requests for authorization may be denied in the short term (step 22).
If the count of devices authorized for use with the specific license 10 is greater than five (step 23), then the licensing authority 55 sends a message denying authorization (step 25) and the user is optionally notified that the limit of devices that can be authorized with their license terms has been exceeded (step 24). In practice, the software on the requesting device 50 may subsequently terminate the software or may allow the software to run in a limited trial mode if this is available.
If the number of days since the first authorization of a device for the license 10 is not less than six (step 19), then the licensing authority tests the time elapsed from the first successful authorization to see if it is less than thirty-one days since the date and time of the first successful authorization (step 26). If this test at step 26 is successful (i.e., if the time elapsed since the first successful authorization is less than thirty-one days), then a test is made to see if the count of successful new device authorizations is less than seven (step 27). If this is so, a communication is made to the requesting device 50 authorizing the device 50 to run the software (step 28). If the new device count is equal to seven (step 29), then the user is warned that their device limit has been reached (step 30) and the device 50 is subsequently authorized to run (step 28).
However, if the new device count is greater than seven (step 31), a communication is made to the requesting device 50 that the authorization is denied (step 33) and optionally the user is notified that their license device count has been exceeded (step 32).
If the number of days since the first successful authorization is greater than thirty days (step 34), the device count for the license 10 is checked in the authorization database 15 and the device count for the license 10 retrieved. If the number of successful new device authorizations is ten or less (step 35), then the device authorization is allowed (step 36). If the device count is equal to eleven (step 37), then the user is optionally warned that they have reached the limit (step 38) and the device 50 is authorized to run (step 36).
However if the device count is greater than eleven (step 39), then a communication is made to the requesting device 50 that the user be optionally notified that the maximum number of allowed devices under terms of the license has been exceeded (step 40) and the authorization is denied (step 41).
The result is a license system that allows consumers of software to load their software on new or replacement devices as they are purchased over time without exposing the publisher to copying abuses that is common amongst software pirates and casual software copiers.
In one alternative embodiment, there is provided a license management system that is linked to a fixed calendar date rather than the date of first successful authorization. This approach can be used for marketing and distribution purposes such as specifying specific periods of high copy counts to encourage word of mouth and user to user sharing but later restricting the device count to encourage people to begin paying for copies that have been intentionally shared.
It is noted that the example embodiment of
It is further noted that in
The described system could also be used with authorizations for software that is rented or otherwise allowed to be used for a specific period of time or number of uses rather than indefinitely as in the example embodiment of
Another alternative embodiment of the above scenarios could include an algorithm rather than an arbitrary value in calculating both the time period for the calculation of the device count, and the device count related to that specific measured time period. For example, the algorithm for the available device count could be equal to the number of elapsed days since the first successful activation divided by five in brackets plus five. Using the example algorithm a device count of five would be available from day one, and a device count of eleven at day thirty and so on.
In yet another alternative embodiment, the techniques described herein may be used for security applications where access is granted to data or some other valuable or important item as a result of a successful authorization rather than in the example of
In accordance with one or more aspects of the embodiments described herein, there is provided a method for adjusting a license for a digital product over time. The license rules may comprise at least one allowed copy count corresponding to a maximum number of devices authorized for use with the digital product. With reference to the flow chart shown in
In response to the device identity already being on a record, the method 300 may involve allowing the digital product to be used on the given device (step 330). In response to the device identity not being on the record, the method 300 may involve setting the allowed copy count to a first upper limit for a first time period after an initial authorization of the digital product (step 340). The method 300 may further involve calculating a device count corresponding to total number of devices already authorized for use with the digital product (step 350), and when the calculated device count is less than the first upper limit, allowing the digital product to be used on the given device (step 360).
With reference to
With continued reference to
In accordance with one or more aspects of the embodiments described herein, there is provided a system for adjusting a license for a digital product over time. For example, the license rules may comprise at least one allowed copy count corresponding to a maximum number of devices authorized for use with the digital product. With reference to the flow chart shown in
The memory module 430 may include executable code for the processor module to: (a) verify that a license data associated with the digital product is valid based at least in part on a device identity associated with the given device; and (b) in response to the device identity already being on a record, allow the digital product to be used on the given device. The memory module 430 may further include executable code for the processor module to: (c) in response to the device identity not being on the record, set the allowed copy count to a first upper limit for a first time period (e.g., a time period after an initial authorization of the digital product); (d) calculate a device count corresponding to total number of devices already authorized for use with the digital product; and (e) when the calculated device count is less than the first upper limit, allow the digital product to be used on the given device. While the various steps or tasks described herein, e.g., steps (a) through (e) above, sometimes involve having executable code stored in the memory module 430, it is noted that the processor module 420 may otherwise be adapted to perform such steps/tasks.
In related aspects, the digital product may comprise software, and/or the given device may comprise a PC or the like. The license data may comprises information that may be used to verify whether the license for the digital product is valid. The record may comprise an authorization database. In further related aspects, the first time period may comprises a defined number of days since the initial authorization. For example, the defined number of days may comprise six days since the initial authorization, and the first upper limit may comprise five authorized devices. In yet further related aspects, the processor module 420 may comprise one or more processor, and may be adapted to, in response to the calculated device count equaling the first upper limit, send a warning regarding the allowed copy count to the given device. The processor module 420 may be adapted to, in response to the calculated device count exceeding the first upper limit, deny the request for authorization.
In further related aspects, the processor module 420 also be adapted to: (a) in response to the device identity not being on the record, after the first time period has expired, set the allowed copy count to a second upper limit for a second time period; (b) recalculate the device count; and/or (c) when the recalculated device count is less than the second upper limit, allow the digital product to be used on the given device. The second time period may comprise a defined number of days since the initial authorization. For example, the defined number of days may comprise thirty-one days since the initial authorization, and the second upper limit may comprise seven authorized devices. The processor module 420 may be adapted to, in response to the calculated device count equaling the second upper limit, send a warning regarding the allowed copy count to the given device. The processor module 420 may be adapted to, in response to the calculated device count exceeding the second upper limit, deny the request for authorization.
In yet further related aspects, the processor module 420 also be adapted to: (a) in response to the device identity not being on the record, after the second time period has expired, set the allowed copy count to a third upper limit; (b) recalculate the device count; and (c) when the recalculated device count is less than the third upper limit, allow the digital product to be used on the given device. The third upper limit comprises eleven authorized devices. The processor module 420 may be adapted to, in response to the calculated device count equaling the third upper limit, send a warning regarding the allowed copy count to the given device. The processor module 420 may be adapted to, in response to the calculated device count exceeding the third upper limit, deny the request for authorization.
It is noted that the system 400 may optionally include: a means 450 for verifying that a license data associated with the digital product is valid based at least in part on a device identity associated with the given device; a means 460 for, in response to the device identity already being on a record, allowing the digital product to be used on the given device; a means 470 for, in response to the device identity not being on the record, setting the allowed copy count to a first upper limit for a first time period (e.g. a time period after an initial authorization of the digital product); a means 480 for calculating a device count corresponding to total number of devices already authorized for use with the digital product; and/or a means 490 for, when the calculated device count is less than the first upper limit, allowing the digital product to be used on the given device.
It is also noted that the system 400 may optionally include: a means for, in response to the device identity not being on the record, after the first time period has expired, setting the allowed copy count to a second upper limit for a second time period; a means for recalculating the device count; and/or a means for, when the recalculated device count is less than the second upper limit, allowing the digital product to be used on the given device. It is further noted that the system 400 may optionally include: a means for, in response to the device identity not being on the record, after the second time period has expired, setting the allowed copy count to a third upper limit; a means for recalculating the device count; and/or a means for, when the recalculated device count is less than the third upper limit, allowing the digital product to be used on the given device. The at least one processor of processor module 420, in such case, may be in operative communication with the means 450, 460, 470, 480, and 490 via a bus 440 or similar communication coupling. The processor module 420 may effect initiation and scheduling of the processes or functions performed by the means 450, 460, 470, 480, and 490, and any components thereof.
In still further related aspects, the device identity may comprise unique device identifying information, wherein the unique device identifying information may comprise at least one user-configurable parameter and/or at least one non-user-configurable parameter of the given device. The device identity may be generated by utilizing at least one irreversible transformation of the at least one user-configurable and the at least one non-user-configurable parameters of the given device. The device identity may be generated by utilizing a cryptographic hash function on the at least one user-configurable and the at least one non-user-configurable parameters of the given device.
It is noted that generating the device identity may also be described as generating a device fingerprint and may entail the sampling of physical, non-user configurable properties as well as a variety of additional parameters such as uniquely generated hashes and time sensitive values. Physical device parameters available for sampling may include, for example, unique manufacturer characteristics, carbon and silicone degradation and small device failures.
The process of measuring carbon and silicone degradation may be accomplished by measuring a chip's ability to process complex mathematical computations, and its ability to respond to intensive time variable computations. These processes measure how fast electricity travels through the carbon. Using variable offsets to compensate for factors such as heat and additional stresses placed on a chip during the sampling process allows for each and every benchmark to reproduce the expected values. During a standard operating lifetime, the process of passing electricity through the various switches causes a computer chip to degrade. These degradations manifest as gradually slower speeds that extend the processing time required to compute various benchmarking algorithms.
In addition to the chip benchmarking and degradation measurements, the process for generating a device identity may include measuring physical, non-user-configurable characteristics of disk drives and solid state memory devices. Each data storage device has a large variety of damage and unusable data sectors that are nearly unique to each physical unit. The ability to measure and compare values for damaged sectors and data storage failures provides a method for identifying storage devices.
Device parameter sampling, damage measurement and chip benchmarking make up just a part of device fingerprinting technologies described herein. These tools may be further extended by the use of complex encryption algorithms to convolute the device identity values during transmission and comparisons. Such encryption processes may be used in conjunction with random sampling and key generations.
The device identity may be generated by utilizing machine or device parameters associated with one or more of the following: machine model; machine serial number; machine copyright; machine ROM version; machine bus speed; machine details; machine manufacturer; machine ROM release date; machine ROM size; machine UUID; and machine service tag.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: CPU ID; CPU model; CPU details; CPU actual speed; CPU family; CPU manufacturer; CPU voltage; and CPU external clock.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: memory model; memory slots; memory total; and memory details.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: video model; video details; display model; display details; audio model; and audio details.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: network model; network address; Bluetooth address; Blackbox model (including IDE and SCSI); Blackbox serial; Blackbox details; Blackbox damage map; Blackbox volume name; NetStore details; and NetStore volume name.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: optical model; optical serial; optical details; keyboard model; keyboard details; mouse model; mouse details; printer details; and scanner details.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: baseboard manufacturer; baseboard product name; baseboard version; baseboard serial number; and baseboard asset tag.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: chassis manufacturer; chassis type; chassis version; and chassis serial number.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: IDE controller; SATA controller; RAID controller; and SCSI controller.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: port connector designator; port connector type; port connector port type; and system slot type.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: cache level; cache size; cache max size; cache SRAM type; and cache error correction type.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: fan; PCMCIA; modem; portable battery; tape drive; USB controller; and USB hub.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: device model; device model IMEI; device model IMSI; and device model LCD.
The device identity may also be generated by utilizing machine parameters associated with one or more of the following: wireless 802.11; webcam; game controller; silicone serial; and PCI controller.
While the present invention has been illustrated and described with particularity in terms of preferred embodiments, it should be understood that no limitation of the scope of the invention is intended thereby. Features of any of the foregoing methods and devices may be substituted or added into the others, as will be apparent to those of skill in the art. It should also be understood that variations of the particular embodiments described herein incorporating the principles of the present invention will occur to those of ordinary skill in the art and yet be within the scope of the invention.
As used in this application, the terms “component,” “module,” “system,” and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component can be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computing device and the computing device can be a component. One or more components can reside within a process and/or thread of execution and a component can be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components can communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems by way of the signal).
It is understood that the specific order or hierarchy of steps in the processes disclosed herein in an example of exemplary approaches. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged while remaining within the scope of the present disclosure The accompanying method claims present elements of the various steps in sample order, and are not meant to be limited to the specific order or hierarchy presented.
Those skilled in the art will further appreciate that the various illustrative logical blocks, modules, circuits, methods and algorithms described in connection with the examples disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, methods and algorithms have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention
This application claims priority pursuant to 35 U.S.C. §119(e) to U.S. Provisional Application No. 60/988,778, entitled “SYSTEM FOR ADJUSTABLE DIGITAL LICENSING OVER TIME,” filed Nov. 17, 2007, which application is specifically incorporated herein, in its entirety, by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4278837 | Best | Jul 1981 | A |
| 4351982 | Miller et al. | Sep 1982 | A |
| 4446519 | Thomas | May 1984 | A |
| 4458315 | Uchenick | Jul 1984 | A |
| 4471163 | Donald et al. | Sep 1984 | A |
| 4484217 | Block et al. | Nov 1984 | A |
| 4593353 | Pickholtz | Jun 1986 | A |
| 4593376 | Volk | Jun 1986 | A |
| 4599489 | Cargile | Jul 1986 | A |
| 4609777 | Cargile | Sep 1986 | A |
| 4646234 | Tolman et al. | Feb 1987 | A |
| 4654799 | Ogaki et al. | Mar 1987 | A |
| 4658093 | Hellman | Apr 1987 | A |
| 4683553 | Mollier | Jul 1987 | A |
| 4685055 | Thomas | Aug 1987 | A |
| 4688169 | Joshi | Aug 1987 | A |
| 4704610 | Smith et al. | Nov 1987 | A |
| 4712238 | Gilhousen et al. | Dec 1987 | A |
| 4740890 | William | Apr 1988 | A |
| 4791565 | Dunham et al. | Dec 1988 | A |
| 4796220 | Wolfe | Jan 1989 | A |
| 4864494 | Kobus, Jr. | Sep 1989 | A |
| 4888798 | Earnest | Dec 1989 | A |
| 4903296 | Chandra et al. | Feb 1990 | A |
| 4924378 | Hershey et al. | May 1990 | A |
| 4937863 | Robert et al. | Jun 1990 | A |
| 4959861 | Howlette | Sep 1990 | A |
| 4982430 | Frezza et al. | Jan 1991 | A |
| 4999806 | Chernow et al. | Mar 1991 | A |
| 5014234 | Edwards, Jr. | May 1991 | A |
| 5033084 | Beecher | Jul 1991 | A |
| 5034980 | Kubota | Jul 1991 | A |
| 5081676 | Chou et al. | Jan 1992 | A |
| 5083309 | Beysson | Jan 1992 | A |
| 5103476 | Waite et al. | Apr 1992 | A |
| 5109413 | Comerford et al. | Apr 1992 | A |
| 5113518 | Durst et al. | May 1992 | A |
| 5146575 | Nolan, Jr. | Sep 1992 | A |
| 5199066 | Logan | Mar 1993 | A |
| 5210795 | Lipner et al. | May 1993 | A |
| 5222133 | Chou et al. | Jun 1993 | A |
| 5222134 | Waite et al. | Jun 1993 | A |
| 5259029 | Duncan, Jr. | Nov 1993 | A |
| 5260999 | Wyman | Nov 1993 | A |
| 5287408 | Samson | Feb 1994 | A |
| 5291598 | Grundy | Mar 1994 | A |
| 5319705 | Halter et al. | Jun 1994 | A |
| 5337357 | Chou et al. | Aug 1994 | A |
| 5341429 | Stringer et al. | Aug 1994 | A |
| 5343526 | Lassers | Aug 1994 | A |
| 5375240 | Grundy | Dec 1994 | A |
| 5390297 | Barber et al. | Feb 1995 | A |
| 5414269 | Takahashi | May 1995 | A |
| 5418854 | Kaufman et al. | May 1995 | A |
| 5440635 | Bellovin et al. | Aug 1995 | A |
| 5490216 | Richardson, III | Feb 1996 | A |
| 5495411 | Ananda | Feb 1996 | A |
| 5509070 | Schull | Apr 1996 | A |
| 5548645 | Ananda | Aug 1996 | A |
| 5559884 | Davidson et al. | Sep 1996 | A |
| 5579222 | Bains et al. | Nov 1996 | A |
| 5666415 | Kaufman | Sep 1997 | A |
| 5703951 | Dolphin | Dec 1997 | A |
| 5745879 | Wyman | Apr 1998 | A |
| 5754763 | Bereiter | May 1998 | A |
| 5754864 | Hill | May 1998 | A |
| 5790664 | Coley et al. | Aug 1998 | A |
| 5835911 | Nakagawa et al. | Nov 1998 | A |
| 5893910 | Martineau et al. | Apr 1999 | A |
| 5925127 | Ahmad | Jul 1999 | A |
| 5940504 | Griswold | Aug 1999 | A |
| 5956505 | Manduley | Sep 1999 | A |
| 5974150 | Kaish et al. | Oct 1999 | A |
| 6006190 | Baena-Arnaiz et al. | Dec 1999 | A |
| 6009401 | Horstmann | Dec 1999 | A |
| 6029141 | Bezos et al. | Feb 2000 | A |
| 6044471 | Colvin | Mar 2000 | A |
| 6049789 | Frison et al. | Apr 2000 | A |
| 6070171 | Snyder et al. | May 2000 | A |
| 6101606 | Diersch et al. | Aug 2000 | A |
| 6134659 | Sprong et al. | Oct 2000 | A |
| 6158005 | Bharathan et al. | Dec 2000 | A |
| 6169976 | Colosso | Jan 2001 | B1 |
| 6189146 | Misra et al. | Feb 2001 | B1 |
| 6226747 | Larsson et al. | May 2001 | B1 |
| 6230199 | Revashetti et al. | May 2001 | B1 |
| 6233567 | Cohen | May 2001 | B1 |
| 6236971 | Stefik et al. | May 2001 | B1 |
| 6243468 | Pearce et al. | Jun 2001 | B1 |
| 6294793 | Brunfeld et al. | Sep 2001 | B1 |
| 6327617 | Fawcett | Dec 2001 | B1 |
| 6330670 | England et al. | Dec 2001 | B1 |
| 6343280 | Clark | Jan 2002 | B2 |
| 6363486 | Knapton, III | Mar 2002 | B1 |
| 6449645 | Nash | Sep 2002 | B1 |
| 6467088 | alSafadi et al. | Oct 2002 | B1 |
| 6536005 | Augarten | Mar 2003 | B1 |
| 6557105 | Tardo et al. | Apr 2003 | B1 |
| 6587842 | Watts | Jul 2003 | B1 |
| 6697948 | Rabin et al. | Feb 2004 | B1 |
| 6785825 | Colvin | Aug 2004 | B2 |
| 6829596 | Frazee | Dec 2004 | B1 |
| 6857078 | Colvin | Feb 2005 | B2 |
| 6859793 | Lambiase | Feb 2005 | B1 |
| 6880086 | Kidder et al. | Apr 2005 | B2 |
| 6920567 | Doherty et al. | Jul 2005 | B1 |
| 6976009 | Tadayon et al. | Dec 2005 | B2 |
| 7020635 | Hamilton et al. | Mar 2006 | B2 |
| 7024696 | Bahar | Apr 2006 | B1 |
| 7032110 | Su et al. | Apr 2006 | B1 |
| 7069440 | Aull | Jun 2006 | B2 |
| 7069595 | Cognigni et al. | Jun 2006 | B2 |
| 7085741 | Lao et al. | Aug 2006 | B2 |
| 7146645 | Hellsten et al. | Dec 2006 | B1 |
| 7188241 | Cronce et al. | Mar 2007 | B2 |
| 7203966 | Abburi et al. | Apr 2007 | B2 |
| 7206765 | Gilliam et al. | Apr 2007 | B2 |
| 7228567 | Serkowski et al. | Jun 2007 | B2 |
| 7272728 | Pierson et al. | Sep 2007 | B2 |
| 7313828 | Holopainen | Dec 2007 | B2 |
| 7319987 | Hoffman et al. | Jan 2008 | B1 |
| 7327280 | Bachelder et al. | Feb 2008 | B2 |
| 7328453 | Merkle et al. | Feb 2008 | B2 |
| 7337147 | Chen et al. | Feb 2008 | B2 |
| 7343297 | Bergler et al. | Mar 2008 | B2 |
| 7463945 | Kiesel et al. | Dec 2008 | B2 |
| 7644442 | Miller et al. | Jan 2010 | B2 |
| 7653899 | Lindahl et al. | Jan 2010 | B1 |
| 7676804 | Ferguson et al. | Mar 2010 | B2 |
| 7870273 | Watson et al. | Jan 2011 | B2 |
| 7890950 | Nanavati et al. | Feb 2011 | B1 |
| 7908662 | Richardson | Mar 2011 | B2 |
| 7912787 | Sakakihara et al. | Mar 2011 | B2 |
| 8229858 | Mazza et al. | Jul 2012 | B1 |
| 20010034712 | Colvin | Oct 2001 | A1 |
| 20010044782 | Hughes et al. | Nov 2001 | A1 |
| 20020019814 | Ganesan | Feb 2002 | A1 |
| 20020069172 | Omshehe et al. | Jun 2002 | A1 |
| 20020082997 | Kobata et al. | Jun 2002 | A1 |
| 20020152395 | Zhang et al. | Oct 2002 | A1 |
| 20020152401 | Zhang et al. | Oct 2002 | A1 |
| 20020161718 | Coley et al. | Oct 2002 | A1 |
| 20030046566 | Holopainen | Mar 2003 | A1 |
| 20030065918 | Willey | Apr 2003 | A1 |
| 20030125975 | Danz et al. | Jul 2003 | A1 |
| 20030172035 | Cronce et al. | Sep 2003 | A1 |
| 20030200541 | Cheng et al. | Oct 2003 | A1 |
| 20040009815 | Zotto et al. | Jan 2004 | A1 |
| 20040024860 | Sato et al. | Feb 2004 | A1 |
| 20040030912 | Merkle, Jr. et al. | Feb 2004 | A1 |
| 20040039916 | Aldis et al. | Feb 2004 | A1 |
| 20040059929 | Rodgers et al. | Mar 2004 | A1 |
| 20040059938 | Hughes et al. | Mar 2004 | A1 |
| 20040066417 | Anabuki et al. | Apr 2004 | A1 |
| 20040143746 | Ligeti et al. | Jul 2004 | A1 |
| 20040148525 | Aida et al. | Jul 2004 | A1 |
| 20040152516 | Blatter et al. | Aug 2004 | A1 |
| 20040177354 | Gunyakti et al. | Sep 2004 | A1 |
| 20040187018 | Owen et al. | Sep 2004 | A1 |
| 20040221169 | Lee et al. | Nov 2004 | A1 |
| 20040249763 | Vardi | Dec 2004 | A1 |
| 20050027657 | Leontiev et al. | Feb 2005 | A1 |
| 20050069129 | Ho et al. | Mar 2005 | A1 |
| 20050071280 | Irwin et al. | Mar 2005 | A1 |
| 20050076334 | Demeyer | Apr 2005 | A1 |
| 20050108173 | Stefik et al. | May 2005 | A1 |
| 20050138155 | Lewis | Jun 2005 | A1 |
| 20050165693 | Morritzen et al. | Jul 2005 | A1 |
| 20050172280 | Ziegler et al. | Aug 2005 | A1 |
| 20050262498 | Ferguson et al. | Nov 2005 | A1 |
| 20050278395 | Sandaire | Dec 2005 | A1 |
| 20050289072 | Sabharwal | Dec 2005 | A1 |
| 20060048236 | Multerer et al. | Mar 2006 | A1 |
| 20060064756 | Ebert | Mar 2006 | A1 |
| 20060072444 | Engel et al. | Apr 2006 | A1 |
| 20060095454 | Shankar et al. | May 2006 | A1 |
| 20060161914 | Morrison et al. | Jul 2006 | A1 |
| 20060190403 | Lin et al. | Aug 2006 | A1 |
| 20060242081 | Ivanov et al. | Oct 2006 | A1 |
| 20060265337 | Wesinger, Jr. | Nov 2006 | A1 |
| 20060265758 | Khandelwal et al. | Nov 2006 | A1 |
| 20060272031 | Ache et al. | Nov 2006 | A1 |
| 20060282511 | Takano et al. | Dec 2006 | A1 |
| 20070143228 | Jorden et al. | Jun 2007 | A1 |
| 20070150418 | Ben-Menahem et al. | Jun 2007 | A1 |
| 20070162395 | Ben-Yaacov et al. | Jul 2007 | A1 |
| 20070168288 | Bozeman | Jul 2007 | A1 |
| 20070198422 | Prahlad et al. | Aug 2007 | A1 |
| 20070203846 | Kavuri et al. | Aug 2007 | A1 |
| 20070219917 | Liu et al. | Sep 2007 | A1 |
| 20070282615 | Hamilton et al. | Dec 2007 | A1 |
| 20070300308 | Mishura | Dec 2007 | A1 |
| 20080065552 | Elazar et al. | Mar 2008 | A1 |
| 20080086423 | Waites | Apr 2008 | A1 |
| 20080141378 | McLean | Jun 2008 | A1 |
| 20080147556 | Smith et al. | Jun 2008 | A1 |
| 20080148067 | Sitrick et al. | Jun 2008 | A1 |
| 20080172300 | Karki et al. | Jul 2008 | A1 |
| 20080228578 | Mashinsky | Sep 2008 | A1 |
| 20080244754 | Curren | Oct 2008 | A1 |
| 20080247731 | Yamauchi et al. | Oct 2008 | A1 |
| 20080289050 | Kawamoto et al. | Nov 2008 | A1 |
| 20080320607 | Richardson | Dec 2008 | A1 |
| 20090024984 | Maeda | Jan 2009 | A1 |
| 20090037337 | Baitalmal et al. | Feb 2009 | A1 |
| 20090083730 | Richardson | Mar 2009 | A1 |
| 20090138643 | Charles et al. | May 2009 | A1 |
| 20090165080 | Fahn et al. | Jun 2009 | A1 |
| 20090228982 | Kobayashi et al. | Sep 2009 | A1 |
| 20100057703 | Brandt et al. | Mar 2010 | A1 |
| 20100293622 | Nikitin et al. | Nov 2010 | A1 |
| 20100306819 | Nahari et al. | Dec 2010 | A1 |
| 20130007892 | Inooka | Jan 2013 | A1 |
| Number | Date | Country |
|---|---|---|
| 678985 | Jun 1997 | AU |
| 101 55 755 | May 2003 | DE |
| 1 096 406 | May 2001 | EP |
| 1 560 098 | Aug 2005 | EP |
| 1 637 958 | Mar 2006 | EP |
| 1 637 961 | Mar 2006 | EP |
| 1 670 188 | Jun 2006 | EP |
| 4 369 068 | Dec 1992 | JP |
| WO 9209160 | May 1992 | WO |
| 9220022 | Nov 1992 | WO |
| 9301550 | Jan 1993 | WO |
| 9535533 | Dec 1995 | WO |
| 9842098 | Sep 1998 | WO |
| 0067095 | Nov 2000 | WO |
| WO 0072119 | Nov 2000 | WO |
| 2005104686 | Nov 2005 | WO |
| 2007060516 | May 2007 | WO |
| 2008013504 | Jan 2008 | WO |
| Entry |
|---|
| “Technical Details on Microsoft Product Activation for Windows XP,” Internet Citation, XP002398930, Aug. 13, 2001. |
| International Search Report and Written Opinion for corresponding International Application No. PCT/US2008/083809 dated Apr. 29, 2009, total 14 pages. |
| Angha et al.; Securing Transportation Network Infrastructure with Patented Technology of Device Locking—Developed by Uniloc USA; http://www.dksassociates.com/admin/paperfile/ITS%20World%20Paper%20Submission—Uniloc% 20—2—.pdf; Oct. 24, 2006. |
| Econolite; Econolite and Uniloc Partner to Bring Unmatched Infrastructure Security to Advanced Traffic Control Networks with Launch of StrongPoint; http://www.econolite.com/docs/press/20080304—Econolite—StrongPoint.pdf; Mar. 4, 2008. |
| Wikipedia: “Software Extension,” May 28, 2009, Internet Article retrieved on Oct. 11, 2010. XP002604710. |
| Williams et al., “Web Database Applications with PHP & MySQL,” O'Reilly Media Chapter 1. Database Applications and the Web Mar. 2002, Internet Article retrieved on Sep. 21, 2010. XP002603488. |
| Williams, R., “A Painless Guide to CRC Error Detection Algorithms,” Aug. 13, 1993, 33 pages, www.ross.net/crc/download/crc—v3.txt. |
| Osgood, David, Letter to Rhythms Researcher, Mini-Mitter Co., Inc., after 1990, 2 pgs. |
| Corcoran et al., “Techniques for Securing Multimedia Content in Consumer Electronic Appliances using Biometrics Signatures,” Transactions on Consumer Electronics, vol. 51, No. 2, pp. 545-551. |
| Microsoft Corporation, “Operations Guide: Microsoft Systems Management Server 2003,” 2003, Internet Citation retrieved on Jun. 27, 2007. XP 002439673. |
| Rivest, R. “RFC 1321—The MD5 Message Digest Algorithm,” Apr. 1992, Retrieved from the Internet on Jul. 21, 2005. |
| Ye, Ruopeng, “Authenticated Software Update,” A Dissertation Submitted to the College of Computer and Information Science of Northeaster University in Partial Fulfillment of the Requirements for the Degree of Doctor of Phisosophy in Computer Science, Apr. 28, 2008. |
| Wikberg, Michael, “Software License Management from System-Intergrator Viewpoint,” Master's Thesis for a Degree for Computer Science and Engineering, School of Science and Technology, Aalto University, Helsinki, Apr. 30, 2010. |
| Number | Date | Country | |
|---|---|---|---|
| 20090138975 A1 | May 2009 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60988778 | Nov 2007 | US |