This application is related to Applicants'concurrently filed U.S. patent applications entitled METHOD AND APPARATUS FOR ESTABLISHING USAGE RIGHTS FOR DIGITAL CONTENT TO BE CREATED IN THE FUTURE (Ser. No. 09/867,747), DEMARCATED DIGITAL CONTENT AND METHOD FOR CREATING AND PROCESSING DEMARCATED DIGITAL WORKS (Ser. No. 09/867,246, METHOD AND APPARATUS FOR DYNAMICALLY ASSIGNING USAGE RIGHTS TO DIGITAL WORKS (Ser. No. 09/867,745, METHOD AND APPARATUS FOR ASSIGNING CONDITIONAL OR CONSEQUENTIAL RIGHTS TO DOCUMENTS AND DOCUMENTS HAVING SUCH RIGHTS (Ser. No. 09/867,749 111325-64), and METHOD AND APPARATUS FOR HIERARCHICAL ASSIGNMENT OF RIGHTS TO DOCUMENTS AND DOCUMENTS HAVING SUCH RIGHTS (Serial No. 09/867,748), incorporated herein by reference in their entirety.
The invention relates generally to distribution of digital works and more specifically to digital works having usage rights that can be transferred to others and a method and apparatus for effecting such a transfer.
One of the most important issues impeding the widespread distribution of digital works or documents (i.e. documents in forms readable by computers), via electronic means, and the Internet in particular, is the current lack of ability to enforce the intellectual property rights of content owners during the distribution and use of digital works. Efforts to resolve this problem have been termed “Intellectual Property Rights Management” (“IPRM”), “Digital Property Rights Management” (“DPRM”), “Intellectual Property Management” (“IPM”), “Rights Management” (“RM”), and “Electronic Copyright Management” (“ECM”), collectively referred to as “Digital rights management (DRM)” herein. There are a number of issues to be considered in digital rights management: authentication, authorization, accounting, payment and financial clearing, rights specification, rights verification, rights enforcement, and document protection for example. U.S. Pat. Nos. 5,530,235, 5,634,012, 5,715,403, 5,638,443, and 5,629,980 disclose DRM concepts addressing these issues and the disclosures thereof are incorporated herein by reference.
In the world of printed documents, a work created by an author is usually provided to a publisher, which formats and prints numerous copies of the work. The copies are then sent by a distributor to bookstores or other retail outlets, from which the copies are purchased by end users. While the low quality of copying and the high cost of distributing printed material have served as deterrents to unauthorized copying of most printed documents, it is far too easy to copy, modify, and redistribute unprotected digital works. Accordingly, some method of protecting digital works is necessary to make it more difficult to copy them without authorization.
Unfortunately, it has been widely recognized that it is difficult to prevent, or even deter, people from making unauthorized distributions of digital works within current general-purpose computing and communications systems such as personal computers, workstations, and other devices connected over communications networks, such as local area networks (LANs), intranets, and the Internet. Many attempts to provide hardware-based solutions to prevent unauthorized copying have proven to be unsuccessful. The proliferation of high band-width “broadband” communications technologies will render it even more convenient to distribute large documents electronically, including video files such as full length motion pictures, and thus will remove any remaining deterrents to unauthorized distribution of digital works. Accordingly, DRM technologies are becoming a high priority.
Two basic DRM schemes have been employed to attempt to solve the document protection problem: secure containers and trusted systems. A “secure container” (or simply an encrypted document) offers a way to keep document contents encrypted until a set of authorization conditions are met and some copyright terms are honored (e.g., payment for use). After the various conditions and terms are verified with the document provider, the document is released to the user in clear form. Commercial products such as IBM's CRYPTOLOPES™ and InterTrust's DIGIBOXES™ fall into this category. Clearly, the secure container approach provides a solution to protecting the document during delivery over insecure channels, but does not provide any mechanism to prevent legitimate users from obtaining the clear document and then using and redistributing it in violation of content owners' intellectual property.
Cryptographic mechanisms are typically used to encrypt (or “encipher”) documents that are then distributed and stored publicly, and ultimately privately deciphered by authorized users. This provides a basic form of protection during document delivery from a document distributor to an intended user over a public network, as well as during document storage on an insecure medium.
In the “trusted system” approach, the entire system is responsible for preventing unauthorized use and distribution of the document. Building a trusted system usually entails introducing new hardware such as a secure processor, secure storage and secure rendering devices. This also requires that all software applications that run on trusted systems be certified to be trusted. While building tamper-proof trusted systems is a real challenge to existing technologies, current market trends suggest that open and untrusted systems such as PC's and workstations using browsers to access the Web, will be the dominant systems used to access digital works. In this sense, existing computing environments such as PCs and workstations equipped with popular operating systems (e.g., Windows™, Linux™, and UNIX) and rendering applications such as browsers are not trusted systems and cannot be made trusted without significantly altering their architectures. Of course, alteration of the architecture defeats a primary purpose of the Web, i.e. flexibility and compatibility.
U.S. Pat. No. 5,634,012, the disclosure of which is incorporated herein by reference, discloses a system for controlling the distribution of digital works. Each rendering device has a repository associated therewith. A predetermined set of usage transaction steps define a protocol used by the repositories for carrying out usage rights associated with a work. Usage rights are encapsulated with the content of the digital work or otherwise associated with the content to travel with the content. The usage rights can permit various types of use such as, viewing only, use once, distribution, and the like. Rights can be granted based on payment or other conditions.
Current DRM techniques do not provide the flexibility of distribution that is possible with conventional printed documents. For example, the purchaser of a copy of a book generally can give that same copy to another, trade that copy, or sell that copy without violating the rights of the copyright holder. However, DRM techniques do not provide a flexible means for accomplishing analogous distribution of digital works without diminishing the control over the digital work by the content owner.
It is an object of the invention to increase the flexibility of distribution of digital content. A first aspect of the invention is a method of transferring digital works from one user to another user comprising, associating usage rights, transfer permission information, and a current user identification flag with digital content, distributing a digital work including the content to a first user in accordance with the usage rights, setting the current user identification flag to correspond to the first user, and transferring the digital work to a second user and setting the current user identification flag to correspond to the second user.
A second aspect of the invention is a system for transferring digital works from one user to another user. The system comprises digital content, a usage rights module containing usage rights information associated with the content for a user, a transfer permission module containing transfer permission information for the content, a current user identification module containing identity information indicating the identity of the user, and means for manipulating the current user identification module to change the identity information.
The invention will be described through a preferred embodiment and the attached drawing in which:
Distributor 120 distributes digital works, such as works 200 and 202 to users 130 and 132 upon request. The digital works can be distributed as a document containing the content and associated usage rights in encrypted form. Distributor 120 encrypts the works with a public key and then encrypts the public key with a private key corresponding to user 130 or 132. Thus the encrypted work is customized solely for the particular user 130 or 132. Users 130 and 132 are then able to use their private key to unencrypt the public key and use it to unencrypt and view the content of the work 200 or 202. Of course, there can be any number of users and any number of digital works. For the sake of simplicity, there are two users and two digital works in the preferred embodiment.
Payment for the work is passed from user 130 or 132 to distributor 120 by way of clearinghouse 150 which collects requests from user 130 and 132 and from other users who wish to sue use a particular content. Clearinghouse 150 also collects payment information, such as debit transactions, credit card transactions, or other known electronic payment schemes, and forwards the collected payments as a payment batch to distributor 120. Of course, clearinghouse 150 may retain a share of the payment as a fee for the above-noted services. Distributor 120 may retain a portion of the batch payment from clearinghouse 150 for distribution services and forward a payment (for example royalties) to author 110. Distributor 120 may compile a bundle or batch of user requests for a single work before distributing the work. In such a case, a single instance of the encrypted work can be generated for unencryption by all of the requesting users 130. Clearinghouse 150 also maintains various records regarding ownership and usage rights as described in detail below.
Each time user 130 or 132 requests (or uses) content of a work, an accounting message can be sent to clearinghouse 150 which ensures that each request by user 130 matches with a document sent to user 130 or 132 by distributor 120. Accounting information is received by clearinghouse 150 directly from distributor 120. Any inconsistencies can be used adjust the payment batches made to distributor 120 accordingly. This accounting scheme is operative to reduce the possibility of fraud in electronic distribution and to handle any time-dependent usage permissions that may result in charges that vary, depending on the duration or other extent of use. Clearinghouse 150 includes server 250 (see
If user 130 and user 132 desire to exchange their respective rights in content 210 and 310, i.e. user 130 desires rights to use content 310 and user 132 desires rights to use content 210, the exchange can be effected using current user ID flag module 216 of rights transfer module 252 to track the current user of content 210 and 310. Of course, the right to exchange is an additional right which has already been awarded and which is tracked in transfer permissions module 214. The exchange of usage rights may involve some fee, paid by user 130 to user 132 or vice versa. Rights transfer module 252 keeps track of this fee/percentage, and notifies the original content owners, who may be entitled to a percentage of the fee which was paid by a user (based on the license agreements between the users and the content owners). The price can be set using a predetermined, on-spot, or dynamic scheme, such as auction or stock-exchange. The exchange right/fee schedules can be attached to the content or other rights (physically, or by a pointer associated with a remote schedule). Current user ID flag module includes a database structure having a current user flag for each of works 200 and 202. Such a flag can be an ID number or any other indication of the current authorized user. The exchange may involve more than two users, in which case current user ID flag module 216 can keep track of rights, fees, percentages, content owners, and current users (an exchange forum, similar to a stock exchange setting).
Subsequently, in step 406, transfer permissions module 214 changes the usage rights 212 and 312 to prohibit use by users 130 and 132 of content 210 and 310 respectively and to permit the same use by the new user 132 and 130 respectively. Finally, in step 408, works 200 and 202 are exchanged between users 130 and 132 with the new usage rights 212 and 312 respectively. Alternatively, works 200 and 202 can be redistributed from distributor 120 or clearinghouse 150 to users 130 and 132. In any case, clearinghouse 150 can track all transactions, usage rights, current user data, and the like.
The preferred embodiment can be adapted to an auction, as well. The right to auction can be awarded by the original content owner to the user, and the user can exercise this right, provided that the price limitations, time limitations, geographical limitations, and usage limitations (specified by the content owner) are followed. The price or range of price or percentages/fees/commissions can be predetermined, or can be dynamic, for example, using the market or other factors, for example, set by the current user. To encourage the exchange between friends, peer-to-peer distribution, or super-distribution, point or other rewards can be awarded to the user. Super-distribution can be done through e-mail or instant-messaging, using address books or “buddy lists.”
The preferred embodiment can be used for version control, for updating/replacing (or providing patches or corrections for) content. The preferred embodiment can process returned content by a user, to obtain a refund, if the nature of the content permits and the owner of the content wishes to give this option to the user as an added usage right.
Instead of trading usage rights, user 130 may wish to merely grant remaining usage rights to user 132. For example, if user 130 buys a license to use software, and later wants to transfer the license to user 132, User 130 can transfer the usage rights to user 132 in a manner similar to the exchange described above. In such a case, clearinghouse 150 can collect an electronic signature from user 132 and send any appropriate notices, such as a terminating notice to user 130. If the content owner requires a fee for such a transfer, clearinghouse 150 can effect the fee transfer. In addition, a certification for disablement or destruction of the of the software in position of user 130 can be issued automatically by clearinghouse 150 and sent to the content owner or authorized representative.
Alternatively, user 130 may have the right to use content for a specific time period. User 130 then uses the content for a portion of the allowed time. However, before the expiration time period, user 130 can transfer the balance of remaining allowable time to user 132. This can be effected in the manner described above. Of course this right also can be assigned to user 130 by the original content owner.
In the case of accessing (or storing) information from multiple servers, clearinghouse 150 can keep track of all servers for an optimized accessing scheme. For example, tags can be used for identification and referral to a specific server for edge delivery of content on the Internet or any other network (as opposed to centralized content delivery), to solve the first-mile-bottleneck problem (related to traffic on the network).
The particular modules of the preferred embodiment have been described by functionality. However, the modules and need not be separate entities, such as separate files or even blocks of code. Also, the fucntions of the various modules can be mixed or combined. The various functions can be accomplished by any combination of software and/or hardware. For example, the invention can be implemented on one or more general purpose programmable computers, such as personal computers, servers, or the like. Date transfer can be accomplished using HTTP over the Internet or in any other manner.
Any usage rights can be transferred traded, or assigned. The various data and files can be stores at any location and linked in an appropriate manner. For example, the content and usage rights need not be stored together. Accordingly, “associated” as used herein refers broadly to an established correspondence such as a call or a link, or other relationship. The digital works can be transferred directly form user to user or through a centralized system. The usage rights include all usage rights that can be expressed by the XrML™ rights language and other rights grammar.
The invention has been described trough a preferred embodiment. However, various modifications can be made without departing from the scope of the invention as defined by the appended claims and legal equivalents.
Number | Name | Date | Kind |
---|---|---|---|
3263158 | Janis | Jul 1966 | A |
3609697 | Blevins et al. | Sep 1971 | A |
3790700 | Callais et al. | Feb 1974 | A |
3798605 | Feistel | Mar 1974 | A |
4159468 | Barnes et al. | Jun 1979 | A |
4220991 | Hamano et al. | Sep 1980 | A |
4278837 | Best | Jul 1981 | A |
4323921 | Guillou | Apr 1982 | A |
4442466 | Mayer | Apr 1984 | A |
4529870 | Chaum | Jul 1985 | A |
4558176 | Arnold et al. | Dec 1985 | A |
4593376 | Volk | Jun 1986 | A |
4614861 | Pavlov et al. | Sep 1986 | A |
4644493 | Chandra et al. | Feb 1987 | A |
4658093 | Hellman | Apr 1987 | A |
4713753 | Beobert et al. | Dec 1987 | A |
4796220 | Wolfe | Jan 1989 | A |
4817140 | Chandra et al. | Mar 1989 | A |
4827508 | Shear | May 1989 | A |
4868376 | Lessin et al. | Sep 1989 | A |
4891838 | Faber | Jan 1990 | A |
4924378 | Hershey et al. | May 1990 | A |
4932054 | Chou et al. | Jun 1990 | A |
4937863 | Robert et al. | Jun 1990 | A |
4949187 | Cohen | Aug 1990 | A |
4953209 | Ryder, Sr. et al. | Aug 1990 | A |
4961142 | Elliott et al. | Oct 1990 | A |
4975647 | Downer et al. | Dec 1990 | A |
4977594 | Shear | Dec 1990 | A |
4999806 | Chernow et al. | Mar 1991 | A |
5010571 | Katznelson | Apr 1991 | A |
5014234 | Edwards, Jr. | May 1991 | A |
5023907 | Johnson et al. | Jun 1991 | A |
5047928 | Wiedemer | Sep 1991 | A |
5050213 | Shear | Sep 1991 | A |
5052040 | Preston et al. | Sep 1991 | A |
5058164 | Elmer et al. | Oct 1991 | A |
5103476 | Waite et al. | Apr 1992 | A |
5113519 | Johnson et al. | May 1992 | A |
5136643 | Fischer | Aug 1992 | A |
5138712 | Corbin | Aug 1992 | A |
5146499 | Geffrotin | Sep 1992 | A |
5148481 | Abraham et al. | Sep 1992 | A |
5159182 | Eisele | Oct 1992 | A |
5183404 | Aldous et al. | Feb 1993 | A |
5191193 | Le Roux | Mar 1993 | A |
5204897 | Wyman | Apr 1993 | A |
5222134 | Waite et al. | Jun 1993 | A |
5235642 | Wobber et al. | Aug 1993 | A |
5247575 | Sprague et al. | Sep 1993 | A |
5255106 | Castro | Oct 1993 | A |
5260999 | Wyman | Nov 1993 | A |
5263157 | Janis | Nov 1993 | A |
5263158 | Janis | Nov 1993 | A |
5276444 | McNair | Jan 1994 | A |
5276735 | Boebert et al. | Jan 1994 | A |
5291596 | Mita | Mar 1994 | A |
5301231 | Abraham et al. | Apr 1994 | A |
5311591 | Fischer | May 1994 | A |
5319705 | Halter et al. | Jun 1994 | A |
5337357 | Chou et al. | Aug 1994 | A |
5339091 | Yamazaki et al. | Aug 1994 | A |
5341429 | Stringer et al. | Aug 1994 | A |
5347579 | Blandford | Sep 1994 | A |
5381526 | Ellson | Jan 1995 | A |
5394469 | Nagel et al. | Feb 1995 | A |
5410598 | Shear | Apr 1995 | A |
5412717 | Fischer | May 1995 | A |
5428606 | Moskowitz | Jun 1995 | A |
5432849 | Johnson et al. | Jul 1995 | A |
5438508 | Wyman | Aug 1995 | A |
5444779 | Daniele | Aug 1995 | A |
5453601 | Rosen | Sep 1995 | A |
5455953 | Russell | Oct 1995 | A |
5457746 | Dolphin | Oct 1995 | A |
5473687 | Lipscomb et al. | Dec 1995 | A |
5473692 | Davis | Dec 1995 | A |
5499298 | Narasimhalu et al. | Mar 1996 | A |
5502766 | Boebert et al. | Mar 1996 | A |
5504814 | Miyahara | Apr 1996 | A |
5504816 | Okano | Apr 1996 | A |
5504837 | Griffeth et al. | Apr 1996 | A |
5509070 | Schull | Apr 1996 | A |
5530235 | Stefik et al. | Jun 1996 | A |
5532920 | Hartrick et al. | Jul 1996 | A |
5534975 | Stefik et al. | Jul 1996 | A |
5539735 | Moskowitz | Jul 1996 | A |
5563946 | Cooper et al. | Oct 1996 | A |
5568552 | Davis | Oct 1996 | A |
5621797 | Rosen | Apr 1997 | A |
5629980 | Stefik et al. | May 1997 | A |
5633932 | Davis et al. | May 1997 | A |
5634012 | Stefik et al. | May 1997 | A |
5638443 | Stefik et al. | Jun 1997 | A |
5649013 | Stuckey et al. | Jul 1997 | A |
5655077 | Jones et al. | Aug 1997 | A |
5708717 | Alasia | Jan 1998 | A |
5734823 | Saigh et al. | Mar 1998 | A |
5734891 | Saigh | Mar 1998 | A |
5737413 | Akiyama et al. | Apr 1998 | A |
5737416 | Cooper et al. | Apr 1998 | A |
5745569 | Moskowitz et al. | Apr 1998 | A |
5748783 | Rhoads | May 1998 | A |
5757907 | Cooper et al. | May 1998 | A |
5761686 | Bloomberg | Jun 1998 | A |
5765152 | Erickson | Jun 1998 | A |
5768426 | Rhoads | Jun 1998 | A |
5825892 | Braudaway et al. | Oct 1998 | A |
5892900 | Ginter et al. | Apr 1999 | A |
5910987 | Ginter et al. | Jun 1999 | A |
5915019 | Ginter et al. | Jun 1999 | A |
5917912 | Ginter et al. | Jun 1999 | A |
5920861 | Hall et al. | Jul 1999 | A |
5940504 | Griswold | Aug 1999 | A |
5943422 | Van Wie et al. | Aug 1999 | A |
5949876 | Ginter et al. | Sep 1999 | A |
5982891 | Ginter et al. | Nov 1999 | A |
5999949 | Crandall | Dec 1999 | A |
6047067 | Rosen | Apr 2000 | A |
6112181 | Shear et al. | Aug 2000 | A |
6115471 | Oki et al. | Sep 2000 | A |
6138119 | Hall et al. | Oct 2000 | A |
6157721 | Shear et al. | Dec 2000 | A |
6185683 | Ginter et al. | Feb 2001 | B1 |
6226618 | Downs et al. | May 2001 | B1 |
6233684 | Stefik et al. | May 2001 | B1 |
6237786 | Ginter et al. | May 2001 | B1 |
6240185 | Van Wie et al. | May 2001 | B1 |
6253193 | Ginter et al. | Jun 2001 | B1 |
6292569 | Shear et al. | Sep 2001 | B1 |
6301660 | Benson | Oct 2001 | B1 |
6327652 | England et al. | Dec 2001 | B1 |
6330670 | England et al. | Dec 2001 | B1 |
6345256 | Milsted et al. | Feb 2002 | B1 |
6363488 | Ginter et al. | Mar 2002 | B1 |
6389402 | Ginter et al. | May 2002 | B1 |
6427140 | Ginter et al. | Jul 2002 | B1 |
6434535 | Kupka et al. | Aug 2002 | B1 |
6611812 | Hurtado et al. | Aug 2003 | B2 |
Number | Date | Country |
---|---|---|
0 084 441 | Jul 1983 | EP |
0 180 460 | May 1986 | EP |
0 332 707 | Sep 1989 | EP |
0 651 554 | May 1995 | EP |
0 668 695 | Aug 1995 | EP |
0 725 376 | Aug 1996 | EP |
2 136 175 | Sep 1984 | GB |
2 236 604 | Apr 1991 | GB |
62-241061 | Oct 1987 | JP |
64-068835 | Mar 1989 | JP |
04-369068 | Dec 1992 | JP |
05-268415 | Oct 1993 | JP |
06-175794 | Jun 1994 | JP |
06-215010 | Aug 1994 | JP |
07-084852 | Mar 1995 | JP |
07-200317 | Aug 1995 | JP |
07-244639 | Sep 1995 | JP |
0 715 241 | Jun 1996 | JP |
WO 9220022 | Nov 1992 | WO |
WO 9301550 | Jan 1993 | WO |
WO 9401821 | Jan 1994 | WO |
WO 9624092 | Aug 1996 | WO |
WO 9748203 | Dec 1997 | WO |
WO 9811690 | Mar 1998 | WO |
WO 9842098 | Sep 1998 | WO |
WO 9949615 | Sep 1999 | WO |
WO 0163528 | Aug 2001 | WO |
Number | Date | Country | |
---|---|---|---|
20020184156 A1 | Dec 2002 | US |