Digital content management system and apparatus

Information

  • Patent Grant
  • 8448254
  • Patent Number
    8,448,254
  • Date Filed
    Monday, November 1, 2010
    13 years ago
  • Date Issued
    Tuesday, May 21, 2013
    11 years ago
Abstract
There are provided a digital content management apparatus which further embodies a digital content management apparatus used with a user terminal, and a system which protects the secrets of a digital content. The system and the apparatus are a real time operating system using a micro-kernel, which is incorporated in the digital content management apparatus as an interruption process having high priority. When a user uses the digital content, whether there is an illegitimate usage or not, is watched by interrupting the usage process. In the case where illegitimate usage is carried out, a warning is given or the usage is stopped. The decryption/re-encryption functions of the digital content management apparatus having the decryption/re-encryption functions are not restricted to the inside of the user apparatus. By providing the decryption/re-encryption functions between the networks, the exchange of secret information between different networks is secured. By using this apparatus for converting a crypt algorithm, information exchange is made possible between systems which adopt different algorithms.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


The present invention relates to a system for managing digital content, specifically for managing a copyright of digital content claiming the copyright and for securing secrecy of digital content, and also relates to an apparatus implementing the system.


2. Background Art


In information-oriented society of today, a database system has been spread in which various data values having been stored independently in each computer so far are mutually used by computers connected by communication lines.


The information handled by the prior art database system is classical type coded information which can be processed by a computer and has a small amount of information or monochrome binary data like facsimile data at most. Therefore, the prior art database system has not been able to handle data with an extremely large amount of information such as a natural picture and a motion picture.


However, while the digital processing technique for various electric signals develops, development of the digital processing art has shown progress for a picture signal other than binary data having been handled only as an analog signal.


By digitizing the above picture signal, a picture signal such as a television signal can be handled by a computer. Therefore, a “multimedia system” for handling various data handled by a computer and picture data obtained by digitizing a picture signal at the same time is recognized as a future technique.


Because hitherto widely-spread analog content is deteriorated in quality whenever storing, copying, editing, or transmitting it, copyright issues associated with the above operations has not been a large problem. However, because digital content is not deteriorated in quality after repeatedly storing, copying, editing, or transmitting it, the control of copyrights associated with the above operations is a large problem.


Because there is not hitherto any exact method for handling a copyright for digital content, the copyright is handled by the copyright law or relevant contracts. Even in the copyright law, compensation money for a digital-type sound- or picture-recorder is only systematized.


Use of a database includes not only referring to the contents of the database but also normally effectively using the database by storing, copying, or editing obtained digital content. Moreover, it is possible to transmit edited digital content to another person via on-line by a communication line or via off-line by a proper recording medium. Furthermore, it is possible to transmit the edited digital content to the database to enter it as new digital content.


In an existing database system, only character data is handled. In a multimedia system, however, audio data and picture data which are originally analog content are digitized to a digital content and formed into a database in addition to the data such as characters which have been formed into a database so far.


Under the above situation, how to handle a copyright of digital content formed into a database is a large problem. However, there has not been adequate copyright management means for solving the problem so far, particularly copyright management means completed for secondary utilization of the digital content such as copying, editing, or transmitting of the digital content.


Although digital content referred to as “software with advertisement” or as freeware is, generally, available free of fee, it is copyrighted and its use may be restricted by the copyright depending on the way of use.


In view of the above, the inventor of the present invention has made various proposals thus far in order to protect a copyright of the digital content. In GB 2269302 and U.S. Pat. No. 5,504,933, the inventor has proposed a system for executing copyright management by obtaining a permit key from a key management center through a public telephone line, and has also proposed an apparatus for that purpose in GB 2272822. Furthermore, in EP 677949 and in EP 704785, a system has been proposed for managing the copyright of the digital content.


In these systems and apparatus, those who wish to view encrypted programs request to view a program using a communication device to a management center via a communication line, and the management center transmits a permit key in response to the request for viewing, and charges and collects a fee.


Upon receipt of the permit key, those who wish to view the program send the permit key to a receiver either by an on-line or an off-line means and the receiver, which as received the permit key, decrypts the encrypted program according to the permit key.


The system described in EP 677949 uses a program and copyright information to manage a copyright in addition to a key for permitting usage in order to execute the management of a copyright in displaying (including process to sound), storing, copying, editing, and transmitting of the digital content in a database system, including the real time transmission of digital picture content. The digital content management program for managing the copyright watches and manages to prevent from using the digital content outside the conditions of the user's request or permission.


Furthermore, EP 677949 discloses that the digital content is supplied from a database in an encrypted state, and is decrypted only when displayed and edited by the digital content management program, while the digital content is encrypted again when stored, copied or transmitted. EP 677949 also describes that the digital content management program itself is encrypted and is decrypted by the permit key, and that the decrypted digital content management program performs decryption and encryption of the digital content, and when usage other than storing and displaying of the digital content is executed, the copyright information is stored as a history, in addition to the original copyright information.


In U.S. patent application Ser. No. 08/549,270 and EP 0715241 relating to the present application, there is proposed a decryption/re-encryption apparatus having configuration of a board, PCMCIA card or an IC card for managing the copyright, and a system for depositing a crypt key. Also, a reference is made to apply the copyright management method to a video conference system and an electronic commerce system.


In U.S. patent application Ser. No. 08/549,271 and EP 709760, a system has been proposed wherein the protection of an original digital content copyright and an edited digital content copyright in case of the edited digital content using a plurality of digital contents is carried out by confirming the validity of a usage request according to a digital signature on an edit program by combining a secret-key cryptosystem and a public-key cryptosystem.


In U.S. patent application Ser. No. 08/573,958 and EP 719045, various forms have been proposed for applying the digital content management system to a database and a video-on-demand (VOD) systems or an electronic commerce.


In U.S. patent application Ser. No. 08/663,463, EP 746126, a system has been proposed, in which copyrights on an original digital content and a new digital content are protected by using a third crypt key and a copyright label in case of using and editing a plurality of digital contents.


As can be understood from the digital content management systems and the digital content management apparatus which have been proposed by the inventor of the present invention described above, the management of a digital content copyright can be realized by restricting encryption/decryption/re-encryption and the form of the usage. The cryptography technology and the usage restriction thereof can be realized by using a computer.


In order to use the computer efficiently, an operating system (OS) is used which, supervises the overall operation of the computer. The conventional operating system (OS) used on a personal computer or the like is constituted of a kernel for handling basic services such as memory control, task control, interruption, and communication between processes and OS services for handling other services.


However, improvement in the functions of the OS which supervises the overall operation of computers is now being demanded where circumstances change on the computer side, such as improved capability of microprocessors, a decreased price of RAMs (Random Access Memory) used as a main memory, as well as improvement in the performance capability of computers is required by users, as a consequence, the scale of an OS has become comparatively larger than before.


Since such an enlarged OS occupies a large space itself in the hard disk stored OS, the space for storing the application programs or data needed by the user is liable to be insufficient, with the result in which the usage convenience in the computer becomes unfavorable.


In order to cope with such a situation, in the latest OS, an environmental sub-system for performing emulation of other OS and graphics displaying, and a core sub-system such as a security sub-system are removed from the kernel, as a sub-system that is a part that depends on the user. The basic parts such as a HAL (hardware abstraction layer) for absorbing differences in hardware, a scheduling function, an interruption function, and an I/O control function is a micro-kernel, and a system service API (Application Programming Interface) is interposed between the sub-system and the micro-kernel, thereby constituting the OS.


By doing so, extension of the OS by change or addition of functions will be improved, and portability of the OS can be facilitated corresponding to the applications. By a distributed arrangement for elements of the micro-kernel to a plurality of network computers, the distributed OS can also be realized without difficulty.


Computers are used in computer peripheral units, various control units, and communication devices in addition to the personal computers represented by the desktop type or notebook type computers. In such a case, as an OS unique for embedding, applicable to each of the devices, a real time OS is adopted in which execution speed is emphasized, unlike in a general-purpose personal computer OS, in which the man-machine interface is emphasized.


Naturally, the development cost for a respective OS unique to each device embedded will be high. There has recently been proposed, therefore, that a general-purpose OS for personal computers as a real-time OS for embedding is used instead. By arranging a specified program for embedding in a sub-system combined with the micro-kernel, a real-time OS for embedding can be obtained for embedding.


As the major functions of an OS, there is a task control, such as scheduling, interruption processing, and the like. With respect to task control, there are two kinds of OS's; the single-task type, in which only one task is executed at the same time, and the multi-task type, in which a plurality of task processes are executed at the same time. The multi-task type is further classified into two kinds; one multi-task type, changing of tasks depends on the task to be executed, and the other multi-task type, the changing does not depend on the task to be executed.


In the aforementioned single-task type, the single-task type assigns one process to a CPU (Central Processing Unit) and the CPU is not released until the process comes to an end, and a non-preemptive multi-task type performs time-division for the CPU, and the CPU can be assigned to a plurality of processes. As long as the process which is being executed does not give control back to the OS, other processes are not executed. And a preemptive multi-task type interrupts the process which is being executed during a certain time interval and thereby forcibly move the control to another process. Consequently, real time multi-task can be available only in the case of the preemptive type.


Task control in a computer is performed according to processes being units having system resources such as a memory and a file. Process control is performed according to a thread, being a unit in which CPU time is assigned, in which the process is minutely divided. Incidentally, in this case, the system resources are shared in all the threads in the same process. More than one threads, therefore, may exist which share the system resources in one process.


Each task which is processed by the multi-task type has a priority spectrum, which is generally divided into 32 classes. In such a case, a normal task without interruption is classified into dynamic classes which are divided into 0 to 15 classes, while a task performing interruption is classified into real-time classes divided into 16 to 31 classes.


Interruption processing is carried out using interruption enabling time (generally, 10 milliseconds) referred to as a time slice, as one unit. A normal interruption is carried out during a time slice of 10 milliseconds. In such a situation, a time slice has recently been proposed wherein the interruption enabling time is set to 100 microseconds. When such a real time slice is used, an interruption can be carried out with greater priority than the conventional 10 milliseconds.


SUMMARY OF THE INVENTION

In the present application, there is proposed a digital content management apparatus which further embodies a digital content management apparatus which can be used with the user terminal proposed in EP 704785, for managing a digital content, specifically, a copyright of the digital content claiming the copyright. And also there is proposed a system to which the idea applied to the digital content management apparatus is further applied to secrecy protection of the digital content.


In the present application, a system for watching the illegitimate usage of the digital content and an apparatus therefor are proposed. These system and apparatus are a real time operating system using a micro-kernel, and are incorporated in the digital content management apparatus as an interruption process having a high priority, or are arranged in a network system using the digital content. It is watched whether an illegitimate usage or not, by interrupting into the use process when a user utilizes the digital content. In the case where illegitimate usage is performed, a warning or a stop for the usage is given.


Furthermore, in the present application, decryption/re-encryption functions in the digital content management apparatus having the decryption/re-encryption functions are not restricted within the user apparatus but are provided in a gateway or a node between the networks, so that the exchange of secret information is secured between different networks.


By using the apparatus according to the present invention, for the conversion of crypt algorithm, information exchange can be made possible between systems which adopt different crypt algorithms.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a structural view of a digital content management system to which the present application is applied.



FIG. 2 is a structural view of a digital content management apparatus to which the present application is applied.



FIG. 3 is a structural view of another digital content management apparatus to which the present application is applied.



FIG. 4 is a structural view of a system for watching the digital content usage according to the present invention.



FIG. 5 is a structural view of a system for protecting digital content secrecy according to the present invention.





DETAILED DESCRIPTION OF THE INVENTION

The present invention is a copyright management system and an apparatus for digital content. In the following description, numerous specific details are set forth to provide a more thorough description of the present invention. It will be apparent, however, to one skilled in the art, that the present invention may be practiced without these specific details. In other instances, well known features have not been described in detail so as not to obscure the present invention.


The description of the preferred embodiments according to the present invention is given below referring to the accompanied drawings.



FIG. 1 shows a structure of the digital content management system to which the present application applies.


In this digital content management system illustrated in FIG. 1, reference numerals 1, 2 and 3 represent databases stored text data, binary data of a computer graphics screen or a computer program and digital content of sound or picture data, which are not encrypted. 9 represents a communication network constituted of using a public telephone line offered by a communication enterprise or a CATV line offered by a cable television enterprise, 4 represents a primary user terminal, 5 represents a secondary user terminal, 6 represents a tertiary user terminal, and 7 represents an n-order user terminal, and 8 represents a digital content management center.


On the above arrangement, the databases 1, 2, 3, the digital content management center 8, primary user terminal 4, secondary user terminal 5, tertiary user terminal 6, and n-order user terminal 7 are connected to the communication network 9.


In this Figure, a path shown by a broken line represents a path for transferring encrypted digital content, a path shown by a solid line represents a path for transferring requests from each of the user terminals 4, 5, 6, 7 to the digital content management center 8, a path shown by a one-dot chain line represents a path through which a permit key corresponding to a usage request, a digital content management program and a crypt key are transferred from each of the databases 1, 2, 3, and the digital content management center 8 to each of the user terminals 4, 5, 6, 7.


This digital content management system employs a first public-key Kb1, a first private-key Kv1 corresponding to the first public-key Kb1, a second public-key Kb2, and a second private-key Kv2 corresponding to the second public-key Kb2 that are prepared by the user, and a first secret-key Ks1 and a second secret-key Ks2 prepared by the database. The database encrypts digital content M by using the first secret-key Ks1:

Cmks1=E(Ks1,M),

and further encrypts the first secret-key Ks1 by the first public-key Kb1:

Cks1kb1=E(Kb1,Ks1),

and the second secret-key Ks2 by the second public-key Kb2:

Cks2kb2=E(Kb2,Ks2).


The database then transfers these encrypted digital content Cmks1, the first and second secret-keys Cks1kb1 and Ck2kb2 to the user.


The user decrypts the encrypted first secret-key Cks1kb1 using the first private-key Kv1:

Ks1=D(Kv1,Cks1kb1),

and decrypts the encrypted digital content Cmks1 by the decrypted first secret-key Ks1:

M=D(Ks1,Cmks1)

and uses it. The user decrypts encrypted second secret-key Cks2kb2 by the second private-key Kv2:

Ks2=De(Kv2,Cks2kb2),

which is subsequently used as a crypt key for storing, copying, or transferring digital content.


If the primary user 4 copies digital content obtained and then supplies it to the secondary user 5, the digital content does not involve the copyright of the primary user 4 because no modifications have been made to the digital content. If, however, the primary user 4 produces new digital content based on the digital content obtained or using a means for combining with other digital content, the new digital content involves a secondary copyright for the primary user 4, and the primary user 4 has the original copyright for this secondary work.


Similarly, if the secondary user 5 produces further new digital content based on the digital content obtained from the primary user 4 or combining with other digital content, the new digital content involves a secondary copyright for the secondary user 5, and the secondary user 5 has the original copyright of this secondary work.


Databases 1, 2, and 3 store text data, binary data constituting computer graphics screens or programs and digital content such as digital audio data and digital picture data, which are encrypted and supplied to the primary user terminal 4 via network 9 during a digital content read operation in response to a request from the primary user terminal 4.


Managing the digital content obtaining from the database is carried out by the method described in Japanese Patent Laid-open No. 185448/1996 or in Japanese Patent Laid-Open No. 287014/1996, which have been proposed by the present inventor.


Recently, a PCI (Peripheral Component Interconnect) bus has attracted attention as means for implementing a multiprocessor configuration in a typical personal computer. The PCI bus is a bus for external connection connected to a system bus of a personal computer via a PCI bridge, and allows to implement a multiprocessor configuration.


The digital content includes graphics data, computer programs, digital audio data, still picture data by JPEG and also moving picture data by MPEG 1 or MPEG 2, in addition to character data. In case that the digital content to be managed is moving picture data by JPEG still picture system or moving picture data by MPEG 1 or MPEG 2, as having remarkably large amount of data with high speed, managing the digital content by a single processor is difficult.



FIG. 2 is a block diagram illustrating an arrangement of a digital content management apparatus used for managing the digital content of the above in the digital content management system shown in FIG. 1.


The digital content management apparatus comprises a first digital content management apparatus 12 connected to a user terminal 11 and a second digital content management apparatus 13.


The first digital content management apparatus 12 has a computer configuration having a MPU (MicroProcessor Unit) 24, a local bus 25 of MPU 24, ROM (Read-Only Memory) 26 connected to the local bus 25, RAM 27 and EEPROM (Electrically Erasable Programmable Read-Only Memory) 31.


A PCI bus 23 is connected to a system bus 15 for a microprocessor 14 via a PCI bridge 22 and the local bus 25 for the MPU 24 of the digital content management apparatus 12 is connected to the PCI bus 23, and also a local bus 30 for MPU 29 of the digital content management apparatus 13. Also connected to the system bus 15 of the user terminal 11 are a communications device (COMM) 21 which receives digital content from external databases and transfers digital content to the external of the terminal, a CD-ROM drive (CDRD) 20 which reads digital content supplied on CD-ROM, a flexible disk drive (FDD) 19 which copies received or edited digital content in a flexible disk to supply to the external of terminal, and hard disk drive (HDD) 18 used for storing digital content. COMM 21, CDRD 20, FDD 19, and HDD 18 may also be connected to the PCI bus 23. While ROM, RAM etc., of course, are connected to the system bus 15 of the user terminal, these are not shown in FIG. 2.


The decryption and re-encryption operations are performed by either of the MPU 24 of the first digital content management apparatus 12 and the MPU 29 of the second digital content management apparatus 13, i.e., one performs decryption and the other performs re-encryption at the same time. Since the configuration of the MPU 24 and MPU 29 in FIG. 2 is a multiprosessor configuration which performs parallel processing with a PCI bus 23, high processing speed can be achieved.


In the digital content management apparatus shown in FIG. 2, the storage medium, such as HDD 18, for storing re-encrypted digital content is connected to the system bus 15 of the user terminal 11. In order to store re-encrypted digital content, therefore, the encrypted digital content must be transferred by way of the system bus 15 of the user terminal 11 and the local bus 25 or 30 of the digital content management apparatus 12 or 13, and consequently, processing speed can be slowed.


In the digital content management apparatus shown in FIG. 3, a communications device COMM and a CD-ROM drive CDRD are connected to a local bus of a digital content management apparatus for decryption, and a storage device such as HDD for storing re-encrypted digital content are connected to the local bus of a digital content management apparatus for re-encryption.


The digital content management apparatus 35 for decryption has the computer system configuration having a MPU 37, a local bus 38 for the MPU 37, and ROM 39, RAM 40 and EEPROM 41 connected to the local bus 38, and a communication device COM 42 and a CD-ROM drive CDRD 43 are connected to the local bus 38. The encrypted digital content supplied from the communication device COM 42 and the CD-ROM drive CDRD 43 are decrypted in this apparatus.


The digital content management apparatus 36 for re-encryption has the computer system configuration having a MPU 44, a local bus 45 for the MPU 44, and ROM 46, RAM 47 and EEPROM 48 connected to the local bus 45, and HDD 49 is connected to the local bus 45. The digital content which has been re-encrypted in the digital content management apparatus 36 for re-encryption is stored in HDD 49.


In the protection of a digital content copyright, the greatest issue is how to prevent from illegitimate usage of the digital content on the user side apparatus. Decryption/re-encryption and restriction on usage are carried out by a digital content management program for this purpose.


However, since decryption/re-encryption of the digital content to be protected the copyright is performed using an apparatus on the user side, it is virtually impossible to expect that processing of the decryption/re-encryption and the management of the crypt key which is used for the purpose will be complete. There is a possibility that the digital content will be illegitimately stored, copied, transmitted and edited by invalidating the digital content management program.


In order to restrict such illegitimate usage, it is required that a digital content management program for decryption/re-encryption of the digital content, and for managing the crypt key cannot be altered by the user. For this purpose, incorporation of the digital content management program into the hardware is the most secure method.


For example, there is a configuration in which a dedicated scramble decoder is currently used for descrambling scrambled broadcast programs in analog television broadcast, so that decryption/re-encryption of the digital content and management of the crypt key are available only by using a dedicated digital content management apparatus.


Although such a configuration is reliable, the system structure is lacking in flexibility. When the apparatus on the user side is changed, or the digital content management program is changed, it is very hard for the user to respond to such changes. In case of a network computer on which has been recently focused, since the network computer does not have a function for storing the digital content management program, it would be impossible to realize the digital content management program in the hardware.


In order to correspond with flexibility to a case where the apparatus on the user side changes, or a case where the digital content management program is changed, it is desirable for the digital content management program to be software. However, there is a possibility that the digital content management program is altered as long as the digital content management program is an application program.


For the digital content management program being software, the digital content management program is required to be incorporated in a kernel that is a fixed area and cannot be altered by the user. However, it is not practical for the digital content management program to be incorporated in the fixed area of a kernel, where the digital content management system and the cryptosystem are differentiated between the databases.


As described above, some real time OS can perform interruption in real time slice time which is one or two Figures faster than the time slice of the system in another OS that includes kernel area. By using this technology, the usage status of the digital content which is claiming the copyright, is watched without affecting the overall operation. And if an illegitimate usage is found, it is possible to give a warning or to forcibly stop the usage thereof.


Next, a method for reinforcing a digital content management program by using a real time OS is described.


The digital content management apparatus shown in FIG. 2 has a multi-processor structure in which a first digital content management apparatus 12 and a second digital content management apparatus 13 are connected to an apparatus on the user side via a PCI bus. The decryption and re-encryption operations of the first digital content management apparatus 12 and the second digital content management apparatus 13 are controlled by the digital content management program in the user terminal 11.


The digital content management program of the user terminal 11 also manages the operation of the communication device 21, the CD-ROM drive 20, the flexible disk drive 19 and the hard disk drive 18, which manage loading or downloading of encrypted digital content, and storing into the hard disk drive 18, copying to the flexible disk drive 19 and uploading to the communication device 21 of re-encrypted digital content.


Since illegitimate usage of the digital content is carried out by unauthorized editing, unauthorized storing, unauthorized copying or unauthorized uploading of the decrypted digital content, whether the illegitimate usage has been carried out or not, can be detected by whether editing, storing, copying or uploading of the decrypted digital content is performed or not. As a consequence, the process for watching the illegitimate usage interrupts a digital content use process which is being executed in a certain time interval, while interrupting by a preemptive type multi-task which forcibly carries out watching of the process.


The multi-task time slice normally carried out is 10 milliseconds, and the decryption/re-encryption process is carried out in this time unit. On the other hand, the fastest real time slice is 100 microseconds, which is 1/100 of the normal time unit. Consequently, the watching task, which has high interruption priority, can watch the digital content as to whether the decrypted digital content is being edited, stored, copied or uploaded, so that the usage status of the digital content for which the copyright is claimed can be watched without affecting regular usage by the user, and a warning can be given and usage thereof can be forcibly stopped.


The digital content management program with such a watching function is incorporated into a sub-system area which is operated in the user mode in place of the kernel of the OS, and the watch process is regarded as a process with a high priority. By constituting the system in this way, the usage status of the digital content by decryption/re-encryption and also the illegitimate usage other than the permitted usage can be watched at the same time, and such watching can be executed smoothly.


The digital content management apparatus shown in FIG. 3 has a multi-processor structure in which a first digital content management apparatus 35 and a second digital content management apparatus 36 are connected to an apparatus on the user side via a PC1 bus. The decryption and re-encryption operations of the first digital content management apparatus 35 and the second digital content management apparatus 36 are controlled by the digital content management program in the user terminal 34.


The digital content management program of the user terminal 34 also manages the operation of the communication device 42, the CD-ROM drive 43, the flexible disk drive 19 and the hard disk drive 39, which manage loading or downloading of encrypted digital content, and storing into the hard disk drive 39, copying to the flexible disk drive 19 and uploading to the communication device 42 of re-encrypted digital content.


Since illegitimate usage of the digital content is carried out by unauthorized editing, unauthorizing storing, unauthorized copying or unauthorized uploading of the decrypted digital content, it can be detected as to whether the illegitimate usage has been carried out or not, by checking whether editing, storing, copying or uploading of the decrypted digital content is performed or not. As a consequence, the process for watching the illegitimate usage interrupts a digital content use process which is being executed in a certain time interval, while interrupting by a preemptive type multi-task which forcibly carries out watching of the process.


The multi-task time slice normally carried out is 10 milliseconds, and the decryption/re-encryption process is carried out in this time unit. On the other hand, the fastest real time slice is 100 μs, which is 1/100 of the normal time unit. Consequently, the watching task, which has high interruption priority, can watch the digital content as to whether the decrypted digital content is being edited, stored, copied or uploads, so that the usage status of the digital content for which the copyright is claimed can be watched without affecting regular usage by the user, and if illegitimate usage is found, a warning can be given and usage thereof can be forcibly stopped.


The digital content management program with such a watching function is incorporated into a sub-system area which is operated in the user mode in place of the kernel of the OS, and the watching process is regarded as a process with a high priority. By constituting the system in this way, the usage status of the digital content by decryption/re-encryption and also the illegitimate usage other than the permitted usage can be watched at the same time, and such watching can be executed smoothly.


Next, a structure for watching the illegitimate usage of the digital content in the distributed OS is described referring to FIG. 4. FIG. 4 illustrates a structure of a general distributed type OS, in which servers 51 to 54 and clients 55 to 58 are connected to a network 50.


The network 50 is a restricted network such as LAN (Local Area Network) in an office. Each of the servers 51 to 54 stores basic OS elements of the micro-kernel, application elements which are a sub-system, or the digital content. In order to manage the digital content, the digital content management program which has been described so far is required. This digital content management program is stored, for example, in the server 54. And the watch program for watching the illegitimate usage of the digital content having a high priority for interruption is stored, for example, in the supervisory server 51 for supervising the overall operation of the distributed Os.


Although the terminal apparatus of the clients 55 to 58 is a simple terminal, the terminal is provided with a copying device such as a flexible drive or the like when necessary.


In such a structure, when the clients 55 to 58 use the digital content which is stored in the servers 51 to 54, the clients 55 to 58 are supplied the micro-kernel that is the basic OS elements from each of the servers, and also supplied the digital content management program which is stored in the server 54, and thus, the digital content can be used.


The digital contents stored in the server are either encrypted or not encrypted. In either of these cases, the digital content is supplied with encrypted when supplied to the clients. Therefore, in order for the client to use the encrypted digital content, it is necessary to obtain the crypt key and to decrypt by the digital content management program as has been described above.


The fact that the client uses the digital content and the digital content management program is grasped by the supervisory server 51. This watch process automatically interrupts the process which is being executed by the client at regular intervals without the client's request, and watches, and gives a warning or stop of the usage if an illegitimate usage is detected.


Since such a watch process can be completed with a process having a small size, and therefore, that affects little on the operation on the client side, and the user does not notice the operation of the watch program.


In the distributed OS, the servers and the clients have been explained as separated. However, the aforementioned structure may be applied when a client machine is provided with a hard disk drive, and the client machine also serves as the server machine. When the network 50 is not a restricted one as LAN in a office, but a non-restricted one such as the Internet system, the aforementioned structure can be also applied.


In particular, such a structure is effective in a network computer system. Even in the case where the user modifies a computer not provided with a storage device, a copying device or a communication device for transmission, or use a normal computer pretending to be of a network computer system, the digital content can be managed by remote control.


Furthermore, the structure can be applied to the digital content management system shown in FIG. 1. In such a case, the watch program is stored in the digital content management center 8 of FIG. 1 to regularly watch whether users illegitimately use the encrypted digital content supplied from the database through the network 9 by remote control.


In case where the digital content is broadcast via analog data broadcast or via digital data broadcast, the watch program may be transferred by inserting to the digital content. Also, the watch program may be resident in an apparatus of the digital content user so that the remote control is made possible by periodically broadcasting watch program control signal.


In the case where the digital content having a large amount of information, such as digital picture content is handled in the digital content management system which is carried out via the network, an ISDN (Integrated System for Digital Network) line is used in many cases as a communication line.


As the ISDN line, there are generally used two data channels having a data transmission speed of 64 Kbps (Kilo bits per second) referred to as B channels, and a control channel having a data transmission speed of 16 Kbps referred to as D channel. Naturally, the digital content is transmitted through one or two data channels, while the D channel is not used in many cases.


Thus, if the D channel is used for the interruption watching by the watch program, it would be possible to watch the usage status by remote control without affecting the usage of the digital content at all.


When the user uses information to which a copyright is claimed, the real time OS is automatically linked to the digital content management center, it is also possible to watch and manage the re-encryption mechanism with a real time OS as a result.


Further, in the case where a digital content creator or an end user uses information to which a copyright is claimed, a re-encryption program resident in the PC uses the real time OS so that remote watching and management can be made possible.


Next, application of the digital content management system to the prevention of the leakage of information is described. FIG. 5 illustrates a structure of the system for preventing from the leakage of information by applying the system to an intranet system in which a LAN is connected to the Internet system.


In FIG. 5, reference numerals 60, 61, and 62 represent the network systems which are connected to each other by a public line 63. In particular, the network system 62 is a LAN system established in a office or the like. These network systems are connected with each other via a public communication line or the like to constitute an Internet system as a whole. Clients 64, 64, 64 are connected to the LAN system 62 and servers not shown in the Figure are connected in addition.


The LAN system has secret data such as business secrets and the like therein. Since the LAN system is connected to the outside network, the problems of the leakage of the secret information to the outside, or of the access to the secret information from the outside may arise. As a consequence, although an information partition, called a “fire-wall,” is normally provided between the LAN system and the public line, that is not technologically perfect. Also, even in the case of the business secret data, it may be necessary to supply the business secret data to another party, where the another party network has a common interest, and in such a case, the presence of the fire-wall becomes an obstacle.


As has been described repeatedly, the management of the secret data can be completely carried out through encryption. In the case where the crypt algorithm used in the other party network is common with the algorithm used in the one's own network, the secret data can be shared by sending the crypt key to the other party by some means. In the case where the crypt algorithm used in the other party network is different from the algorithm which is used in one's own network, such means cannot be adopted.


In order to cope with such a problem, crypt key conversion devices 65, 66 and 67 are arranged in place of or together with the fire-wall in the Internet system shown in FIG. 5. These crypt key conversion devices 65, 66 and 67 have the same configuration as the digital content management apparatus which have been described by using FIGS. 2 and 3, and perform decryption/re-encryption by two different crypt keys.


For example, the crypt key conversion device 65 decrypts an encrypted data from the network 60, and re-encrypts the decrypted data by using the crypt key common to the whole Internet system. The crypt key conversion device 67 which has received the re-encrypted data decrypts the re-encrypted data by using the crypt key common to the whole Internet system, and re-encrypts the decrypted data and supplies it to the client 64. By doing this, the problem of sending the crypt key is alleviated.


These crypt key conversion devices 65, 66 and 67 can be arranged in a gateway or a node which is used as a connection between networks. Further, even in a closed network system other than the Internet, which is a liberated system, this system functions efficiently in such cases where individual information such as reliability information, medical information or the like is handled, and where access to the data is necessary to differ by levels.


These crypt key conversion devices also can be used so as to convert the crypt algorithm. There are plurality of crypt algorithms which are currently used or proposed. In the worst case, a plurality of networks using different crypt algorithm respectively coexist, and thus, compatibility is lost, which becomes an obstacle to the development of the information oriented society. Even if a new effective crypt algorithm is developed, and if it has not compatibility with the existing crypt algorithm, an obstacle to the development of the information oriented society may similarly be brought.


In order to cope with such problems, the crypt algorithm can be converted by arranging the crypt key conversion devices 65, 66 and 67 of FIG. 5 in the gateway on the network. These crypt algorithm conversion devices decrypt the encrypted data to be re-encrypted with a different crypt algorithm.


For example, the crypt algorithm conversion device 65 decrypts the data which is encrypted by a crypt algorithm unique to the network 60 and re-encrypts the decrypted data by a crypt algorithm which is common in the whole Internet system. The crypt algorithm conversion device 67 that has received the re-encrypted data decrypts the re-encrypted data, encrypts the decrypted data by the crypt algorithm unique to the network 62, and supplies it to the client 64.


By doing so, it becomes possible to handle the encrypted data between networks that adopt different crypt algorithms. Here, there may be two cases; one is a case in which the crypt key is not changed at all, and the other is a case in which the crypt key is changed at each stage.


In using databases, in a case where a data storing server referred to as “proxy server” or “cache server” is used, and where the digital content is encrypted, the crypt key or crypt algorithm used between a data server and the proxy server may be differentiated from the crypt key or crypt algorithm used between the proxy server and a user, and then, the conversion of them is carried out by using the crypt key conversion device or crypt algorithm conversion device, so that the encrypted digital content can be prevented from illegitimate usage thereof.


The conversion of the crypt algorithm by these devices can be effected by units of countries. Even in the case where crypt algorithms are used which differ from one country to another, it becomes possible to adopt a key escrow system unique to the respective country, or a key recovery system using the key escrow system.


It is understood that particular embodiments described herein are illustrative and the present invention is not limited to these particular embodiments. It will be apparent to those skilled in the art that changes can be made in the various details described herein without departing from the scope of the invention. The present invention is defined by the claims and their full scope of equivalents.

Claims
  • 1. A method, comprising: in response to a forcible interruption of a content use process, a computing system monitoring usage of digital content by the content use process, wherein the forcible interruption is based on an interrupt priority associated with said monitoring; andin response to determining that the monitored usage of the digital content by the content use process is inconsistent with usage rights associated with the digital content, the computing system prohibiting further usage of the digital content by the content use process;wherein the computing system includes a hardware processor.
  • 2. The method of claim 1, wherein said monitoring is performed using a monitoring process, and wherein the interrupt priority associated with said monitoring is an interrupt priority assigned to the monitoring process.
  • 3. The method of claim 2, wherein the interrupt priority assigned to the monitoring process is assigned by an operating system.
  • 4. The method of claim 3, wherein the operating system is a distributed operating system.
  • 5. The method of claim 4, further comprising the computing system supplying the monitoring process over a network to a client device on which the content use process is executed, wherein the forcible interruption of the content use process occurs without the client device requesting the forcible interruption.
  • 6. The method of claim 2, wherein said prohibiting further usage is performed in response to determining that the monitored usage of the digital content includes unauthorized transferring of the digital content by the content use process, and wherein the interrupt priority assigned to the monitoring process is higher than an interrupt priority assigned to the content use process.
  • 7. The method of claim 1, wherein said prohibiting further usage of the digital content by the content use process includes prohibiting further usage at a client device.
  • 8. An apparatus, comprising: a processor; andmemory having instructions stored thereon that are executable by the apparatus to cause the apparatus to: in response to an interruption of a content use process by an operating system, monitor usage of digital content by the content use process; andin response to determining that the monitored usage of the digital content is inconsistent with usage rights associated with the digital content, prohibit further usage of the digital content by the content use process.
  • 9. The apparatus of claim 8, wherein the instructions are executable to cause the apparatus to execute the operating system as a preemptive multitasking operating system.
  • 10. The apparatus of claim 8, wherein the instructions are executable as a subsystem of the operating system to cause the apparatus to monitor the usage of the digital content by the content use process.
  • 11. The apparatus of claim 8, wherein the instructions are executable as a monitoring process to cause the apparatus to interrupt the content use process based on the monitoring process having an interrupt priority that is higher than an interrupt priority of the content use process.
  • 12. The apparatus of claim 8, wherein the instructions are executable to cause the apparatus to monitor the usage of the digital content on a computing system that is coupled to the apparatus via a network.
  • 13. The apparatus of claim 8, wherein the operating system is a distributed operating system, wherein the apparatus is configured to send the instructions executable to monitor usage of the digital content over a network to a computing device, and wherein the sent instructions are executable to cause the computing device to monitor usage of the digital content at the computing device.
  • 14. The apparatus of claim 8, wherein the operating system is a distributed operating system, and wherein the apparatus is configured to receive the instructions executable to monitor usage of the digital content from a server.
  • 15. The apparatus of claim 8, wherein the instructions are executable to cause the apparatus to prohibit the further usage of the digital content in response to determining that monitored editing, copying, storing, or transferring of the digital content is inconsistent with the usage rights associated with the digital content.
  • 16. An article of manufacture including a non-transitory computer readable medium having instructions stored thereon that are executable by a computing system to cause the computing system to execute a watch process that monitors usage of digital content by a forcibly interrupted content use process, wherein the watch process has a higher interrupt priority than an interrupt priority of the content use process.
  • 17. The article of manufacture of claim 16, wherein the instructions are executable to further cause the computing system to prohibit further usage of the digital content by the content use process in response to determining, using the watch process, that the monitored usage of the digital content by the content use process is inconsistent with usage rights associated with the digital content.
  • 18. The article of manufacture of claim 17, wherein the instructions are executable to further cause the computing system to generate, in response to the determining, a warning that the monitored usage is prohibited.
  • 19. The article of manufacture of claim 16, wherein instructions are executable to cause the computing system to monitor usage of decrypted digital copyright data.
  • 20. The article of manufacture of claim 16, wherein instructions are executable to cause the computing system to monitor the usage without affecting the manner in which the content use process accesses the digital content.
Priority Claims (3)
Number Date Country Kind
6-264200 Oct 1994 JP national
6-299835 Dec 1994 JP national
6-309292 Dec 1994 JP national
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 10/013,507 filed Dec. 13, 2001 now U.S. Pat. No. 7,827,109), which is a divisional of prior application Ser. No. 08/868,488, filed Jun. 3, 1997 (now U.S. Pat. No. 6,424,715), which is a continuation-in-part of prior applications Ser. No. 08/549,270 filed on Oct. 27, 1995 (now abandoned) and prior application Ser. No. 08/573,958, filed on Dec. 13, 1995 (now U.S. Pat. No. 5,740,246), which in turn claim the benefit of priority of Japanese Appl. Nos. 6-264200 filed Oct. 27, 1994, 6-299835 filed Dec. 2, 1994, and 06-309292 filed Dec. 13, 1994. The disclosures of each of the above-referenced applications are incorporated by reference herein in their entireties.

US Referenced Citations (288)
Number Name Date Kind
4104721 Markstein et al. Aug 1978 A
4168396 Best Sep 1979 A
4225884 Block et al. Sep 1980 A
4278337 Mashimo Jul 1981 A
4278837 Best Jul 1981 A
4352952 Boone et al. Oct 1982 A
4386233 Smid et al. May 1983 A
4408203 Campbell Oct 1983 A
4423287 Zeidler Dec 1983 A
4465901 Best Aug 1984 A
4466063 Segarra et al. Aug 1984 A
4500750 Elander et al. Feb 1985 A
4527195 Cheung Jul 1985 A
4536647 Atalla et al. Aug 1985 A
4558176 Arnold et al. Dec 1985 A
4567512 Abraham Jan 1986 A
4578530 Zeidler Mar 1986 A
4588991 Atalla May 1986 A
4613901 Gilhousen et al. Sep 1986 A
4623918 Chomet Nov 1986 A
4709266 Hanas et al. Nov 1987 A
4710955 Kauffman Dec 1987 A
4736422 Mason Apr 1988 A
4751732 Kamitake Jun 1988 A
4757534 Matyas et al. Jul 1988 A
4759062 Traub et al. Jul 1988 A
4791565 Dunham et al. Dec 1988 A
4796220 Wolfe Jan 1989 A
4799156 Shavit et al. Jan 1989 A
4817140 Chandra et al. Mar 1989 A
4827508 Shear May 1989 A
4829569 Seth-Smith et al. May 1989 A
4850017 Matyas, Jr. et al. Jul 1989 A
4852154 Lewis et al. Jul 1989 A
4862268 Campbell et al. Aug 1989 A
4864494 Kobus, Jr. Sep 1989 A
4864614 Crowther Sep 1989 A
4864615 Bennett et al. Sep 1989 A
4866707 Marshall et al. Sep 1989 A
4890319 Seth-Smith et al. Dec 1989 A
4890321 Seth-Smith et al. Dec 1989 A
4905277 Nakamura Feb 1990 A
RE33189 Lee et al. Mar 1990 E
4916737 Chomet et al. Apr 1990 A
4919545 Yu Apr 1990 A
4933969 Marshall et al. Jun 1990 A
4941176 Matyas et al. Jul 1990 A
4965568 Atalla et al. Oct 1990 A
4977594 Shear Dec 1990 A
4995080 Bestler et al. Feb 1991 A
5005200 Fischer Apr 1991 A
5007082 Cummins Apr 1991 A
5008853 Bly et al. Apr 1991 A
5008936 Hamilton et al. Apr 1991 A
5010571 Katznelson Apr 1991 A
5029207 Gammie Jul 1991 A
5034980 Kubota Jul 1991 A
5036461 Elliott et al. Jul 1991 A
5046093 Wachob Sep 1991 A
5054064 Walker et al. Oct 1991 A
5060262 Bevins, Jr. et al. Oct 1991 A
5077665 Silverman et al. Dec 1991 A
5083309 Beysson Jan 1992 A
5091938 Thompson et al. Feb 1992 A
5103476 Waite et al. Apr 1992 A
5113518 Durst, Jr. et al. May 1992 A
5124117 Tatebayashi et al. Jun 1992 A
5124984 Engel Jun 1992 A
5126566 Shimada Jun 1992 A
5138659 Kelkar et al. Aug 1992 A
5142579 Anderson Aug 1992 A
5144663 Kudelski et al. Sep 1992 A
5146497 Bright Sep 1992 A
5155680 Wiedemer Oct 1992 A
5157726 Merkle et al. Oct 1992 A
5163096 Clark et al. Nov 1992 A
5173939 Abadi et al. Dec 1992 A
5175416 Mansvelt et al. Dec 1992 A
5191611 Lang Mar 1993 A
5196840 Leith et al. Mar 1993 A
5200999 Matyas et al. Apr 1993 A
5201000 Matyas et al. Apr 1993 A
5204961 Barlow Apr 1993 A
5220604 Gasser et al. Jun 1993 A
5224163 Gasser et al. Jun 1993 A
5227893 Ett Jul 1993 A
5235641 Nozawa et al. Aug 1993 A
5247575 Sprague et al. Sep 1993 A
5253294 Maurer Oct 1993 A
5270773 Sklut et al. Dec 1993 A
5291598 Grundy Mar 1994 A
5293422 Loiacono Mar 1994 A
5301245 Endoh Apr 1994 A
5313521 Torii et al. May 1994 A
5315657 Abadi et al. May 1994 A
5319705 Halter et al. Jun 1994 A
5319710 Atalla et al. Jun 1994 A
5323464 Elander et al. Jun 1994 A
5341425 Wasilewski et al. Aug 1994 A
5343527 Moore Aug 1994 A
5345508 Lynn et al. Sep 1994 A
5347581 Naccache et al. Sep 1994 A
5349662 Johnson et al. Sep 1994 A
5353351 Bartoli et al. Oct 1994 A
5355414 Hale et al. Oct 1994 A
5361091 Hoarty et al. Nov 1994 A
5369702 Shanton Nov 1994 A
5371794 Diffie et al. Dec 1994 A
5375240 Grundy Dec 1994 A
5381480 Butter et al. Jan 1995 A
5388211 Hornbuckle Feb 1995 A
5390297 Barber et al. Feb 1995 A
5392351 Hasebe et al. Feb 1995 A
5400403 Fahn et al. Mar 1995 A
5402492 Goodman et al. Mar 1995 A
5410602 Finkelstein et al. Apr 1995 A
5414772 Naccache et al. May 1995 A
5418853 Kanota et al. May 1995 A
5428606 Moskowitz Jun 1995 A
5428685 Kadooka et al. Jun 1995 A
5438508 Wyman Aug 1995 A
5442541 Hube et al. Aug 1995 A
5442706 Kung Aug 1995 A
5444779 Daniele Aug 1995 A
5444782 Adams, Jr. et al. Aug 1995 A
5450493 Maher Sep 1995 A
5453601 Rosen Sep 1995 A
5455863 Brown et al. Oct 1995 A
5455941 Okuno et al. Oct 1995 A
5457746 Dolphin Oct 1995 A
5465299 Matsumoto et al. Nov 1995 A
5469571 Bunnell Nov 1995 A
5473691 Menezes et al. Dec 1995 A
5475757 Kelly Dec 1995 A
5475758 Kikuchi Dec 1995 A
5479514 Klonowski Dec 1995 A
5483598 Kaufman et al. Jan 1996 A
5483658 Grube et al. Jan 1996 A
5485577 Eyer et al. Jan 1996 A
5490216 Richardson, III Feb 1996 A
5493728 Solton et al. Feb 1996 A
5495533 Linehan et al. Feb 1996 A
5497420 Garneau et al. Mar 1996 A
5497479 Hornbuckle Mar 1996 A
5499298 Narasimhalu et al. Mar 1996 A
5499340 Barritz Mar 1996 A
5504816 Hamilton et al. Apr 1996 A
5504817 Shamir Apr 1996 A
5504818 Okano Apr 1996 A
5504933 Saito Apr 1996 A
5509073 Monnin Apr 1996 A
5509074 Choudhury et al. Apr 1996 A
5511121 Yacobi Apr 1996 A
5513260 Ryan Apr 1996 A
5515441 Faucher May 1996 A
5515538 Kleiman May 1996 A
5517014 Iijima May 1996 A
5530752 Rubin Jun 1996 A
5532920 Hartrick et al. Jul 1996 A
5535383 Gower Jul 1996 A
5541994 Tomko et al. Jul 1996 A
5553143 Ross et al. Sep 1996 A
5553145 Micali Sep 1996 A
5553281 Brown et al. Sep 1996 A
5557346 Lipner et al. Sep 1996 A
5574787 Ryan Nov 1996 A
5577121 Davis et al. Nov 1996 A
5579223 Raman Nov 1996 A
5581682 Anderson et al. Dec 1996 A
5584023 Hsu Dec 1996 A
5586301 Fisherman et al. Dec 1996 A
5604800 Johnson et al. Feb 1997 A
5606609 Houser et al. Feb 1997 A
5606613 Lee et al. Feb 1997 A
5607411 Heironimus et al. Mar 1997 A
5633934 Hember May 1997 A
5636277 Nagahama Jun 1997 A
5642418 Farris et al. Jun 1997 A
5646992 Subler et al. Jul 1997 A
5646997 Barton Jul 1997 A
5646999 Saito Jul 1997 A
5649099 Theimer et al. Jul 1997 A
5651064 Newell Jul 1997 A
5666411 McCarty Sep 1997 A
5680452 Shanton Oct 1997 A
5689587 Bender et al. Nov 1997 A
5706210 Kumano et al. Jan 1998 A
5715393 Naugle Feb 1998 A
5719938 Haas et al. Feb 1998 A
5737416 Cooper et al. Apr 1998 A
5737536 Herrmann et al. Apr 1998 A
5740246 Saito Apr 1998 A
5745572 Press Apr 1998 A
5765152 Erickson Jun 1998 A
5765176 Bloomberg Jun 1998 A
5771383 Magee et al. Jun 1998 A
5794115 Saito Aug 1998 A
5805706 Davis Sep 1998 A
5812762 Kim Sep 1998 A
5818933 Kambe et al. Oct 1998 A
5825892 Braudaway et al. Oct 1998 A
5832083 Iwayama et al. Nov 1998 A
5835601 Shimbo et al. Nov 1998 A
5835765 Matsumoto Nov 1998 A
5841865 Sudia Nov 1998 A
5841886 Rhoads Nov 1998 A
5848155 Cox Dec 1998 A
5848158 Saito et al. Dec 1998 A
5864683 Boebert et al. Jan 1999 A
5867579 Saito Feb 1999 A
5872849 Sudia Feb 1999 A
5889868 Moskowitz et al. Mar 1999 A
5901339 Saito May 1999 A
5910987 Ginter et al. Jun 1999 A
5912969 Sasamoto et al. Jun 1999 A
5933497 Beetcher et al. Aug 1999 A
5968175 Morishita et al. Oct 1999 A
5974141 Saito Oct 1999 A
5982891 Ginter et al. Nov 1999 A
5986690 Hendricks Nov 1999 A
6002772 Saito Dec 1999 A
6006328 Drake Dec 1999 A
6009177 Sudia Dec 1999 A
6026430 Butman et al. Feb 2000 A
6044367 Wolff Mar 2000 A
6069952 Saito et al. May 2000 A
6076077 Saito Jun 2000 A
6081794 Saito et al. Jun 2000 A
6091835 Smithies et al. Jul 2000 A
6097816 Momiki et al. Aug 2000 A
6097818 Saito Aug 2000 A
6128605 Saito et al. Oct 2000 A
6160891 Al-Salqan Dec 2000 A
6182218 Saito Jan 2001 B1
6209092 Linnartz Mar 2001 B1
6226618 Downs et al. May 2001 B1
6272635 Saito Aug 2001 B1
6301673 Foster et al. Oct 2001 B1
6319125 Acres Nov 2001 B1
6408390 Saito Jun 2002 B1
6415271 Turk et al. Jul 2002 B1
6424715 Saito Jul 2002 B1
6438694 Saito Aug 2002 B2
6449717 Saito Sep 2002 B1
6463536 Saito Oct 2002 B2
6519623 Mancisidor Feb 2003 B1
6560339 Iwamura May 2003 B1
6574609 Downs et al. Jun 2003 B1
6603864 Matsunoshita Aug 2003 B1
6615258 Barry et al. Sep 2003 B1
6668324 Mangold et al. Dec 2003 B1
6721887 Saito Apr 2004 B2
6741991 Saito May 2004 B2
6744894 Saito Jun 2004 B1
6789197 Saito Sep 2004 B1
6851053 Liles et al. Feb 2005 B1
6874089 Dick et al. Mar 2005 B2
6912284 Palmatier Jun 2005 B1
7024681 Fransman et al. Apr 2006 B1
7036019 Saito Apr 2006 B1
7093295 Saito Aug 2006 B1
7302415 Saito Nov 2007 B1
7337323 Cochran et al. Feb 2008 B2
7363434 Polyudov Apr 2008 B2
7447914 Saito Nov 2008 B1
7461249 Pearson et al. Dec 2008 B1
7484095 de Jong Jan 2009 B2
7500093 Makita Mar 2009 B2
7711152 Davida et al. May 2010 B1
7730323 Saito Jun 2010 B2
RE41657 Saito Sep 2010 E
20020021807 Saito Feb 2002 A1
20020052850 Saito May 2002 A1
20020112173 Saito Aug 2002 A1
20030135464 Mourad et al. Jul 2003 A1
20030144963 Saito Jul 2003 A1
20050005134 Herrod et al. Jan 2005 A1
20050262023 Saito Nov 2005 A1
20060053077 Mourad et al. Mar 2006 A1
20060282674 Saito Dec 2006 A1
20060288426 Saito Dec 2006 A1
20070033143 Saito Feb 2007 A1
20070061267 Saito Mar 2007 A1
20070079145 Saito Apr 2007 A1
20070088960 Saito Apr 2007 A1
20070174631 Herrod et al. Jul 2007 A1
20100106659 Stefik et al. Apr 2010 A1
20100122088 Oxford May 2010 A1
Foreign Referenced Citations (96)
Number Date Country
3717261 Nov 1987 DE
0121853 Oct 1984 EP
158167 Oct 1985 EP
0199410 Oct 1986 EP
0225010 Jun 1987 EP
0341801 Nov 1989 EP
0391261 Oct 1990 EP
0459046 Dec 1991 EP
0518365 Dec 1992 EP
0191162 Feb 1993 EP
0532381 Mar 1993 EP
0542298 May 1993 EP
0551016 Jul 1993 EP
561685 Sep 1993 EP
0561685 Sep 1993 EP
590763 Apr 1994 EP
0590763 Apr 1994 EP
0421808 Dec 1994 EP
0649074 Apr 1995 EP
0665486 Aug 1995 EP
0430734 Sep 1995 EP
0 677 949 Oct 1995 EP
0354774 Apr 1996 EP
0 715 241 Jun 1996 EP
0715243 Jun 1996 EP
0450841 Aug 1996 EP
0506435 Oct 1996 EP
0489385 Mar 1997 EP
0438154 Jul 1997 EP
0398645 Aug 1997 EP
0813133 Dec 1997 EP
0677949 May 2003 EP
0719045 Oct 2003 EP
0704785 Nov 2003 EP
0715241 Jan 2004 EP
0746126 Dec 2004 EP
0581227 Sep 2005 EP
0709760 May 2006 EP
0709760 Jun 2006 EP
2231244 Nov 1990 GB
58169000 Oct 1983 JP
59169000 Sep 1984 JP
60-102038 Jun 1985 JP
2546983 May 1986 JP
62-169540 Jul 1987 JP
64-041387 Feb 1989 JP
01048165 Feb 1989 JP
64-061782 Mar 1989 JP
03-128541 May 1991 JP
03-162152 Jul 1991 JP
03-265241 Nov 1991 JP
03-282989 Dec 1991 JP
04-003224 Jan 1992 JP
04-181282 Jun 1992 JP
04-268844 Sep 1992 JP
05-056037 Mar 1993 JP
05-063142 Mar 1993 JP
05-075597 Mar 1993 JP
05-122701 May 1993 JP
05-276476 Oct 1993 JP
05-298373 Nov 1993 JP
05-316102 Nov 1993 JP
05-324936 Dec 1993 JP
05-327693 Dec 1993 JP
05-334324 Dec 1993 JP
6037750 Feb 1994 JP
06-095591 Apr 1994 JP
06-131806 May 1994 JP
06-152587 May 1994 JP
06-231536 Aug 1994 JP
06-236147 Aug 1994 JP
06-242304 Sep 1994 JP
06-264199 Sep 1994 JP
06-264201 Sep 1994 JP
06-269959 Sep 1994 JP
06-290087 Oct 1994 JP
06-318036 Nov 1994 JP
07-014045 Jan 1995 JP
7-271865 Oct 1995 JP
7302244 Nov 1995 JP
08-287014 Jan 1996 JP
08-185448 Jul 1996 JP
25-46983 Aug 1996 JP
08-272745 Oct 1996 JP
8292976 Nov 1996 JP
8503830 Aug 1985 WO
8909528 Oct 1989 WO
9002382 Mar 1990 WO
9211598 Jul 1992 WO
9307715 Apr 1993 WO
9520291 Jul 1995 WO
9613113 May 1996 WO
9618152 Jun 1996 WO
9623257 Aug 1996 WO
9627259 Sep 1996 WO
9750036 Dec 1997 WO
Non-Patent Literature Citations (80)
Entry
Memon, Nasir, et al., “Protecting Digital Media Content,” Association for Computing Machinery, Communications of the ACM, New York, Jul. 1998, vol. 41, issue 7, pp. 35-43.
Murphy, Kathleen, “Digimarc Awarded Patent for Digital Watermarking,” Business, Mar. 10, 1998, www.internetnews.com/bus-news/article.php/19611, 2 pages.
Hedberg, S.R. “HP's International Cryptography Framework: Compromise or Threat?” IEEE Computer, Jan. 1997, pp. 28-30.
Zhang, N. X., “Secure Code Distribution,” IEEE Computer, Jun. 1997, pp. 76-79.
Anonymous, “Security,” Government Executive, National Journal, Inc. Washington, vol. 29, issue 1, Jan. 1997, pp. 35-37.
Wayner, “Digital Copyright Protection,” AP Professional, 1997, 16 pages.
Menezes, Alfred, et al., “Handbook of Applied Cryptography,” 1997, sec.11.5.1, CRC Press, pp. 452-454.
Medvinsky, Gennady et al., “NetCash: A design for practical electronic currency on the Internet,” University of Southern California Information Science Institute, Nov. 1993, pp. 2-7.
Fitch, K. “User Authentication and Software Distribution on the Web,” AusWeb96-Technical Futures-Software Distribution and User Authentication on the Web, Nov. 5, 1996, pp. 1-12.
Rubin, A.D., “Trusted Distribution of Software Over the Internet,” Network and Distributed System Security, Feb. 16-17, 1995, San Diego, California, pp. 47-53.
Bryan, John “A look at five different firewall products and services you can install today,” www.byte.com/art/9504/sec10/art6.htm, Apr. 1995.
Rubin, A.D., “Secure Distribution of Electronic Documents in an Hostile Environment,” Computer Communications, vol. 18, No. 6, Jun. 1995, pp. 429-434.
Bellovin, S.M. et al., “Network Firewalls” IEEE Communications Magazine, Sep. 1994, pp. 50-57.
Rozenblit, M., “Secure Software Distribution,” IEEE Network Operations and Management Symposium, vol. 2, Feb. 14-18, 1994, pp. 486-496.
Van Schyndel, R.G., et al., “A Digital Watermark” IEEE, Australia, 1994, pp. 86-90.
Lennil, P. “The IBM Microkernel Technology,” OS/2 Developer, vol. 5, Nov. 1, 1993 (pp. 70-72, 74) XP000672962.
Seki, Kazunori et al., “A Proposal of a New Distribution Scheme for Software Products”, Keio Department of Instrumentation Engineering, Faculty of Science and Technology, Keio University, Research report made at the information Processing Association, Japan, Jul. 20, 1993, vol. 93, No. 64, pp. 19-28.
Vigarie, J. “A device for real-time modification of access conditions in a D2-MAC/Packet EUROCRYPT signal: The Transcontroller,” 18th International Television Symposium and Technical Exhibition, Montreux, Switzerland, Jun. 10-15, 1993, pp. 761-768.
Neuman, Clifford B., “Proxy-Based Authorization and Accounting for Distributed Systems,” Proceedings of the 13th International Conference on Distributed Computing Systems, May 1993, pp. 283-291.
Harn Lein, et al., “A Software Authentication System for Information Integrity” Computers & Security International Journal Devoted to the Study of Technical and Financial Aspects of Computer Security, vol. II, Dec. 1, 1992, pp. 747-752, XP000332279.
Anonymous, “Encryption of Information to be Recorded so as to Prevent Unauthorized Playback,” Research Disclosure No. 335, Mar. 1992, Emsworth, GB, p. 219.
F. Masuoka, “Progressing Flash Memories,” Kogyo Chosakai Co., 1992, pp. 34-68 (English translation of underlined portions only).
Tatsuaki Okamoto, “Universal Electronic Cash”, Technical Report of Institute of Electronics, Information and Communication Engineers (IEICE) Jul. 15, 1991, vol. 91, No. 127, pp. 39-47.
Komatsu N, et al: “A Proposal on Digital Watermark in Document Image Communication and its Application to Realizing a Signature,” Electronics & Communications in Japan Part I, vol. 73, No. 5, Part I, May 1990, pp. 22-33.
Matsumoto, Tsutomu et al., “Cryptographic Key Sharing” Technical Report of Institute of Electronics, Information and Communication Engineers (IEICE), Mar. 27, 1990, vol. 89, No. 482, pp. 33-47.
Morizaki, H., “Introduction to Electronic Devices,” Gijustsu Hyoron Publishing Co., 1989, pp. 260-266.
Gale, B. and Baylin, F., “Scrambling and Descrambling, Satellite and Cable TV,” 2nd Ed, Baylin/Gale Productions 1986 Boulder CO; pp. 163-165.
Grampp, F.T. et al., “Unix Operating System Security,” AT&T Bell Laboratories Technical Journal, vol. 63, No. 8, Oct. 1984, New York, pp. 1649-1672.
R. Adachi, “Introduction to Handcraft of Personal Computer,” Natsume Publishing Co., pp. 141-155 (1983) (English translation of underlined portions only).
U.S. FIPS Publication 81 DES Modes of Operation, Dec. 2, 1980.
Tirkel, A.Z. et al., “Electronic Water Mark”, Conference Proceedings Dicta, Dec. 1993, pp. 666-673.
Kent, Stephen T., “Internet Privacy Enhanced Mail”, Association for Computing Machinery, Communications of the ACM, Aug. 1993, vol. 36, issue 9, pp. 48-61.
Ohtaki, Yasuhiro et al., “Cryptographic Management for Superdistribution” Technical Research Report of Electronic Information Communication Association, Mar. 8, 1991, vol. 90, No. 460, pp. 33-42.
RSA Laboratories, “2.1.3 What are the advantages and disadvantages of public-key cryptography compared with secret-key cryptography?”, http://www.rsa.com/rsalabs/node.asp?id=2167#, third paragraph.
X5 Networks, “What are the Advantages and Disadvantages of Public-Key Cryptography Compared with Secret-Key Cryptography?”, http://x5.net/faqs/crypto/q4.html, third paragraph.
Search Report dated Oct. 24, 2002.
Notice of Rejection mailed Oct. 15, 2002 from the Japanese Patent Office in Application No. 7-228366.
Notice of Rejection Japanese Patent Application No. 7-228366, mailed Jul. 15, 2003.
Notice of Final Decision of Rejection, Japan Patent Application No. 7-228366, dated Nov. 11, 2003.
European Search Report for European Application No. 95115068 dated Jun. 30, 1999, 2 pages.
Official Action in Japanese Application No. 2002-364160 dated Jun. 15, 2009, 4 pages. English Translation Available, 5 pages.
Notification of Inquiry in Japanese Application No. 2002-364160 dated Nov. 18, 2008, 3 pages. English Translation Available, 3 pages.
Official Action in Japanese Application No. 2002-364160 dated Dec. 21, 2009, 4 pages. English Translation Available.
Official Action in U.S. Appl. No. 10/352,078 issued Mar. 19, 2010, 18 pages.
Official Action in U.S. Appl. No. 10/352,078 issued Oct. 18, 2010, 16 pages.
Official Action in U.S. Appl. No. 11/496,777 issued Aug. 24, 2010, 15 pages.
Official Action in Japanese Application No. 2006-198703 dated Jan. 4, 2010, 7 pages. English Translation Available, 6 pages.
Official Action in Japanese Application No. 2006-198703 dated Jun. 4, 2010, 2 pages. English Translation Available, 3 pages.
Official Action in U.S. Appl. No. 11/469,035 issued Mar. 10, 2010, 7 pages.
Official Action in U.S. Appl. No. 11/469,035 issued Sep. 7, 2010, 8 pages.
Official Action in U.S. Appl. No. 11/469,035 issued Jul. 23, 2009, 6 pages.
Official Action in U.S. Appl. No. 11/469,035 issued Dec. 12, 2008, 7 pages.
Official Action in U.S. Appl. No. 11/469,035 issued Jun. 11, 2008, 7 pages.
Intention to Grant issued in European Application No. 06014712.1 on Dec. 17, 2008, 38 pages.
Official Action in European Application No. 06014713.9 issued Oct. 21, 2010, 6 pages.
Office Action for Japanese Patent Application No. 7-280984, issued Jan. 20, 2004. English Translation Available.
Decision of Board of Appeals of Japanese Patent Office (Appeal No. 2004-10462, Patent Application 7-280984), 4 pages.
Interference Initial Memorandum in U.S. Appl. No. 09/097,877, 1 page.
Official Action in U.S. Appl. No. 10/105,262 issued Aug. 4, 2008, 16 pages.
Official Action in U.S. Appl. No. 10/105,262 issued Jan. 31, 2008, 10 pages.
Advisory Action in U.S. Appl. No. 10/105,262 issued Oct. 21, 2008, 2 pages.
Appeal Brief in U.S. Appl. No. 10/105,262 issued Apr. 6, 2009, 58 pages.
Examiner's Answer to Appeal Brief in U.S. Appl. No. 10/105,262 issued Aug. 20, 2009, 21 pages.
Reply Brief in U.S. Appl. No. 10/105,262 issued Oct. 20, 2009, 16 pages.
Official Action in Japanese Application No. 2004-149423 dated Oct. 30, 2007, 2 pages. English Translation Available, 2 pages.
Official Action in U.S. Appl. No. 11/512,695 issued Apr. 16, 2010, 18 pages.
Official Action in U.S. Appl. No. 11/512,695 issued Nov. 18, 2010, 30 pages.
Official Action in U.S. Appl. No. 11/512,695 issued Oct. 15, 2009, 6 pages.
European Search Report for European Application No. 95116615.6 dated Dec. 1, 1998, 2 pages.
Official Action in U.S. Appl. No. 11/512,885 issued Dec. 4, 2009, 7 pages.
Official Action in U.S. Appl. No. 11/512,885 issued Jun. 9, 2010, 20 pages.
Official Action in U.S. Appl. No. 11/512,885 issued Oct. 13, 2010, 2 pages.
Official Action in U.S. Appl. No. 11/441,973 issued Dec. 30, 2009, 12 pages.
Official Action in U.S. Appl. No. 11/441,973 issued Jun. 25, 2010, 18 pages.
Official Action in Japanese Application No. 2007-260256 issued Oct. 13, 2010, 3 pages. English Summary Available.
Official Action in Japanese Patent Application No. 2007-260256 issued Sep. 7, 2009, 8 pages; English Translation Available.
Official Action in Japanese Application No. 2007-260256 dated Jan. 6, 2009, 3 pages. English Translation Available, 3 pages.
Search Report and Opinion issued in European Application No. 07001022.8 dated Mar. 25, 2009; 8 pages.
Office Action in U.S. Appl. No. 13/179,723 issued Dec. 7, 2012, 5 pages.
Office Action in U.S. Appl. No. 11/441,973 issued Oct. 12, 2012, 20 pages.
Related Publications (1)
Number Date Country
20110047626 A1 Feb 2011 US
Divisions (1)
Number Date Country
Parent 08868488 Jun 1997 US
Child 10013507 US
Continuations (1)
Number Date Country
Parent 10013507 Dec 2001 US
Child 12917184 US
Continuation in Parts (2)
Number Date Country
Parent 08573958 Dec 1995 US
Child 08868488 US
Parent 08549270 Oct 1995 US
Child 08573958 US