Controlling database copyrights

Information

  • Patent Grant
  • 8554684
  • Patent Number
    8,554,684
  • Date Filed
    Monday, July 11, 2011
    13 years ago
  • Date Issued
    Tuesday, October 8, 2013
    11 years ago
Abstract
Briefly, in accordance with one or more embodiments, a utilization permit key may be pre-defined to permit at least one of displaying, editing, storing, copying, and/or transferring of digital data.
Description
FIELD OF THE INVENTION

The present invention relates to utilizing, storing, copying, editing and/or transferring of digital data.


BACKGROUND ART

In the information oriented society of today, database systems are becoming wide spread in which it is possible to use various types of data, stored independently by each computer in the past, by connecting computers via communication lines.


In such a database system, the information handled up to this point has been conventionally coded information that can be processed by computer, and that contains a relatively small amount of information and monochrome binary data, such as facsimile information at the most. It is not possible to handle. data containing a relatively large amount of information, such as data for natural pictures or animation.


With the rapid progress of digital processing techniques for various types of electrical signals, a technique is under development for digital processing of picture signals other than binary data, handled only as analog signals in the past.


By digitizing the picture signal, it is possible to handle a picture signal, such as television signal, by computer. As a technique of the future, attention is now focused on “multimedia systems”, which can simultaneously handle the data processed by computers and digitized picture data Because the picture data contains an overwhelmingly large amount of information compared with character data and audio data, it is difficult to store, transfer or process the picture data by computer. For this reason, techniques for compressing and expanding picture data have been developed, Further, several standards for compression/expansion of picture data have been established. For example, the following standards have been established as common standards: JPEG (Joint Photographic image coding Experts Group) standards for still pictures, H.261 standards for television conferences, MPEG1 (Moving Picture image coding Experts Group 1) standards for picture accumulation, and MPEG2 standards to cope with current television broadcasting and high definition television broadcasting. By implementing these new techniques, it is now possible to transmit digital picture data in real time.


For analog data, which has been widely used in the past, the control of copyrights during processing has not been important issue because the quality of the analog data deteriorates each time the data is stored, copied, edited or transferred. However, the quality of digital data does not deteriorate even when the data is repeatedly stored, copied, edited or transferred. Therefore, the management and control of copyrights during processing of digital data is an important issue.


Up to now, there has been no adequate method for management and control of copyrights for digital data. It has been managed and controlled merely by copyright law or by contracts. In copyright law, only compensation for digital sound and picture recording devices has been prescribed.


It is possible not only to refer to the content of a database, but also to effectively utilize the data obtained from the database by storing, copying or editing the data, and also transferring the edited data to other persons or to the database with the edited data registered as new data.


In a conventional database system, only character data is handled. However, in multimedia systems, sound data and picture data, which are originally analog data, are digitized and used as part of the database in addition to the other data in the database, such as character data.


Under such circumstances, it is an important question as to how to handle copyrights of the data in the database. However, there are no means in the prior art for copyright management and control of such actions as copying, editing, transferring, etc., of data.


A system for executing copyright control by using encrypted data and obtaining a permit key from a key control center via public telephone lines is disclosed in Japanese Patent Application 4-199942 (U.S. Pat No.-08/098415) and Japanese Patent Application 4-289074 (U.S. Pat. No.-08/143912) of the present inventors, A device for this purpose is disclosed in Japanese Patent Application 4-276941 (U.S. Pat. No.-08/135634), also of the present inventors.


SUMMARY OF THE INVENTION

It is an object of the present invention to provide a method for controlling copyrights in the display (including the process of providing sound), storage, copying, editing and transfer of digital data in a database system including real time transmission of digital pictures.


For the control of copyrights in the database system to which the present invention is applied, it is essential to transmit one or more of copyright information; i.e., messages of copyright control, information about copyrights and a program for controlling copyrights, when necessary, in addition to a key for enabling users who wish to use encrypted data.


The copyright control message is displayed on a screen and advises or warns the user if the data is being utilized in a manner inconsistent with the conditions of the user's request or permission. The copyright control program watches and controls data use so that the data is not utilized beyond the conditions of the user's request or permission.


The copyright control program, the copyright information and the copyright control message are supplied together with a permit key in some eases, but they may also be supplied together with data in other eases. It is also possible to supply a part of them together with the permit key, and to supply the other part with the data.


For the data, the permit key, the copyright control message, the copyright information and the copyright control program, there are the following three cases; they are transmitted in encrypted form and decrypted upon use; they are transmitted in encrypted form and decrypted only when they are displayed; or they are not encrypted at all.





DESCRIPTION OF THE DRAWING FIGURES
Brief Description of the Drawings


FIG. 1A and FIG. 1B illustrate examples of display messages of the present invention.



FIG. 2A and FIG. 2B illustrate structures for television signals.



FIG. 3A to FIG. 3J illustrate embodiments of the present invention.



FIGS. 4A-4E illustrate structures of embodiments of the present invention.



FIGS. 5A-5E illustrate structures of embodiments of the present invention.





DETAILED DESCRIPTION

In the following, description will be given on embodiments of the present invention.


As shown in FIG. 3A, the permit key and database data may be obtained via different communication routes, with the permit key being obtained from a key control center via pubic telephone lines. However, if a charging method is arranged, it is also possible to obtain the permit key via the same communication system through which the database data is supplied.


Previous systems have not considered secondary exploitation of copyrighted data, such as forms of use involving storing, copying, editing, transferring, etc. of data. Also, these previous systems do not consider distribution of data outside a LAN to which the users belong. Therefore, these previous systems not adequate to cope with secondary exploitation of data unless the users of the data choose to honor the copyright of the data.


To cope with various forms of the secondary exploitation as described above, in the present invention a plurality of permit keys are prepared to match each form of use, and no utilization is possible unless there is a permit key suitable for the desired form of use. As to the forms of use available for a database, there are display, storage, copying, edit, transfer, etc. Examples of implementing these forms of use in accordance with an embodiment of the invention are shown in FIGS. 4A to 4E. In these Figures, double-framed parts show that data is encrypted.



FIG. 4A illustrates the ease in which the encrypted data supplied to a user is displayed. The encrypted data is first decrypted by a display permit key, and the data thus decrypted is displayed.



FIG. 4B illustrates the case in which the encrypted data supplied to the user is edited. The encrypted data is first decrypted by an edit permit key, and the data thus decrypted is displayed. Subsequently, editing is performed on the decrypted data.



FIG. 4C illustrates the case in which the encrypted data supplied to the user is stored. The encrypted data is first decrypted by a storage permit key, and the data thus decrypted is displayed. Subsequently, the decrypted data is stored.



FIG. 4D illustrates the case in which the encrypted data supplied to the user is copied. The encrypted data is first decrypted by a copy permit key, and the data thus decrypted is displayed. Subsequently, the decrypted data is copied.



FIG. 4E illustrates the case in which the encrypted data supplied to the user is transferred. The encrypted data is first decrypted by a transfer permit key, and the data thus decrypted is displayed. Subsequently, the decrypted data is transferred.


The permit keys suitable for these forms of use should be prepared. However, in the case where the ability to execute several forms of use at the same time is desired, it is necessary to obtain a plurality of permit keys, if the user fails to obtain the permit keys, the desired form of use may not be executed.


To avoid such situations, a permit key can be used which makes it possible to execute several forms of use. Hierarchical permit keys can be used such that an upper level key also fulfills the function of a lower level key. For example, from lower level to upper level, the hierarchy is defined as: display<storage<copying<edit<transfer. With the display permit key, only display operations can be executed. Display and storage operations can be executed by the storage permit key. Display, storage and copying operations can be executed by the copying permit key. Display, storage, copying and edit operations can be executed by the edit permit key. Display, storage, copying, edit and transfer operations can be executed by the transfer permit key.


On the relation of keys, it is possible to order key hierarchy from lower-level to upper-level in the order of: storage<copying<transfer<display<edit. Specifically, the order is set in such manner that storage operations can be executed by a storage permit key; storage and copying operations can be executed by a copying permit key; storage, copying and transfer operations can be executed by a transfer permit key; storage, copying, transfer and display operations can be executed by a display permit key; and storage, copying, transfer, display and edit operations can be executed by an edit permit key.


In this system, storage, copying and transfer are placed at a lower level than display because, even when storage, copying and transfer operations are executed on the data, it is difficult and meaningless to utilize the data since it cannot be displayed. It is necessary to display the data in order to utilize the data. This hierarchical arrangement is best suited to a system, in which encrypted data are supplied and are utilized using a permit key.


The permit key is usually offered to the user on payment basis. Therefore, except where data utilization is unlimited, the number of times the permit key may be used is limited to one time or several times.


Because the data can be used if there is a permit key, it is possible to use the data beyond the permitted range if the permit key is duplicated or falsified. To prevent this, the permit key is encrypted.


In an embodiment of the invention, copyright control is enforced by a copyright control program. The forms of use which are allowed or prohibited by the copyright control program include storing, displaying, copying, editing, transferring, etc. of data. In the case where it is necessary to limit the number of usage times or the forms of use, a message for such purpose may be displayed by the program. Information on the original copyright, and subsequent copyrights for subsequent editions, may be given to the data to ensure complete copyright control. Thus, damage to a data supplier or user, due to falsification of copyright information, is prevented.


In the case where it is necessary to limit the number of usage times or to limit forms of use, it is desirable to display a message for such purpose.


In the case where the information under copyright is falsified, the data supplier or the user may suffer damages. This must he prevented.


To ensure complete copyright control, information on the original copyright and information on secondary and tertiary copyrights for the edition of the data are given to the data.


The above copyright control is executed by the copyright control program.


In a conventional database system, the data itself is offered in a completely defenseless stale. Therefore, copyright control can be executed only when data is taken out of the database. In the subsequent copyright control, there is no other way but to rely on the conscience of the user and to take necessary measures when the data is utilized beyond the permitted range of use.


For this reason, in an embodiment of the invention, the data supplied from the database is left in an encrypted state, and storage is executed under this condition. In addition, copying and transfer are also executed in the encrypted state. Decrypting is performed only in display and edit operations, and these are controlled by the copyright control program. Examples of implementing each form of use in accordance with another embodiment of the invention are shown in FIGS. 5A to 5E. In these Figures, double-framed parts show that data is encrypted.



FIG. 5A illustrates the case in which the encrypted data supplied to the user is displayed. The encrypted data is decrypted by a display permit key, and the data thus decrypted is displayed.



FIG. 5B illustrates the ease in which the encrypted data supplied to the user is edited. The encrypted data is decrypted using an edit permit key, and the data thus decrypted is displayed. Subsequently, the decrypted data is edited.



FIG. 5C illustrates the case in which the encrypted data supplied to the user is stored. The encrypted data is decrypted using a storage permit key, and the data thus decrypted is displayed. Prior to storing the data, the data is encrypted again using the storing permit key. Thus, in this embodiment, the data cannot be stored in the decrypted state.



FIG. 5D illustrates the case in which the encrypted data supplied to the user is copied. The encrypted data is decrypted by a copy permit key, and the data thus decrypted is displayed. Prior to copying of the data, the data is encrypted again using the copy permit key. Thus, in this embodiment, the data cannot be copied in the decrypted state.



FIG. 5E illustrates the case in which the encrypted data supplied to the user is transferred. The encrypted data is decrypted by a transfer permit key, and the data thus decrypted is displayed. Prior to transferring the data, the data is encrypted again by the transfer permit key. Thus, in this embodiment, the data cannot be transferred in the decrypted state.


In so doing, it is impossible to use the data beyond the permitted range. In this case, the copyright control program may be integrated with the data or may be encrypted.


Because the copyright control program is encrypted and the permit key decrypts the copyright control program, and because the copyright control program decrypts and encrypts the data, the data is encrypted twice.


In this case, if a crypt key unique to the data is added to the copyright control program for the purpose of encrypting the data, it is impossible to decrypt the data if the copyright control program is separated from the data.


In this copyright control program, even if the data is stored, copied or transferred within the permitted range of use, and if these operations are executed after the data and the copyright control program have been encrypted, it is impossible to use the data in an undesired mariner.


If an operator uses a computer program inadequately and, as a result, the computer does not respond any more or computer operation is stopped, an error message is displayed so that the operator may know the cause. Similarly, if a user of the database erroneously uses the data beyond the permitted range of the permit key, and, as a result, the computer does not respond or operation is stopped, the user cannot understand the cause. In this case, a copyright control message is displayed by the copyright control program.


The display of the copyright control message as described above also fulfills the function of providing a warning if the user intentionally uses the data beyond the range of use permitted by the permit key.


In general, various programs are incorporated into read-only memory (ROM) inside the equipment which the user uses, or the programs are supplied from software. When the programs are incorporated into ROM, there is no possibility that the programs may be changed. However, the equipment is limited to systems that contain the ROM. On the other hand, when the programs are supplied from software, there is no system limitation if the programs are transferred. However, there is a possibility that the programs may be altered to prevent alteration of the copyright control program in the present invention, the copyright control program should be encrypted.


The database is utilized by various users using various types of devices. Therefore, if the programs for controlling copyrights are supplied as software, it is necessary to cope with various types of devices. In this case, it is necessary to modify the program according to the device that the user uses. In one embodiment of the invention, a translation program to translate the copyright control program is provided in the communication software of the device which the user uses. The copyright control program can then be translated by the translation program so that it suits the device.


Even though the permit key for using the database may become more complicated due to encryption, a data size of several tens of bites is sufficient. Therefore, the time required for transmitting the permit key is far shorter than one second. In other words, even when a payment-based public telephone line is used and other information is transmitted together with the permit key, the increase in cost is negligible. Therefore, as shown in FIG. 3B, when transmitting the permit key, the copyright control program may also be transmitted utilizing surplus time.


In FIG. 3C, the copyright control program is supplied together with the data, and the entire data utilization process is placed under control of the copyright control program. For example, the data supplied in encrypted form cannot be decrypted unless the copyright program supplied with it is used. If there is no such copyright control program, the data cannot be used. Thus, integration of the copyright control program with the data further reinforces copyright control.


Description will now be provided on the supply of copyright control messages. The following are some examples of the copyright control message: “Need a display permit key.” “Need a storage permit key.” “Need a copying permit key.” “Need a edit permit key.” “Need a transfer permit key.”


Some other examples are: “Display unavailable.” “Storage unavailable.” “Copy unavailable.” “Edit unavailable.” “Transfer unavailable.”


These copyright control messages are displayed alone as shown in FIG. 1A or in combination as shown in FIG. 1B.


To display the copyright control message, the message must be stored in the memory of the device which the user uses. The memory in the device is classified as ROM and random-access memory (RAM).


The method of storing the messages in ROM is reliable, but there is a limitation to the device because the user must use the ROM wherein the copyright control messages are stored.


As for methods for storing messages in RAM, there is a method for supplying messages together with the permit key, a method for supplying messages together with the copyright control program, and a method for supplying messages together with the data. When the permit key and the copyright control program are supplied at the same time, the copyright control message can also be supplied at the same time.


The copyright control message is not effective Unless an adequate message is displayed. For this reason, the copyright control message cannot play its designed role if the message is changed in such a manner that no substantial content is displayed, or further, if its content is deleted such that nothing is displayed. To prevent this trouble, the message is encrypted.


The display of the copyright control message is executed by the copyright control program. The modes of display are as follows. (1) When an operation is attempted with no adequate key available, a corresponding message is displayed. (2) All messages corresponding to operations available for the current permit key are displayed, if an operation is attempted without an available permit key.


The copyright control message is supplied together with the permit key as shown in FIG. 3D, or together with the data as shown in FIG. 3E.


The copyright control message is transmitted by transmitting all messages or only the necessary messages required. In the former case, the quantity of information is relatively large, but security is high. In the latter case, the quantity of information is relatively small, but security is low.


It is desirable that the copyright control message be inseparable from the data, as in the case of the copyright control program. This may he facilitated by integrating the copyright control message with the copyright control program.


To display the copyright on printed matter, the name of the author and the date are used. The copyright of the database is displayed by entering information such as the name of the author and the date.


As described above, edit and up-load of edited data are included in the use of the data in the database. Specifically, the presence of secondary data, which is edited from the data, i.e. a work of authorship, is recognized. To ensure the copyright of the data in this context, it is necessary to store the information on original authorship and secondary authorship together with the data. When the data is used in a manner other than for down-loading and display, copyright information including information on the operator, in addition to the copyright information stored up to that moment, is stored together with the data as history.


In this case, only the person who controls the database can put the original authorship into the database as primary data. All data handled by other than the person in charge of database control is considered secondary data. Control of the data history is therefore further reinforced.


When the copyright information is separated from data which is a work of authorship, it becomes extremely difficult to recognize the copyright. Thus, it is necessary that the copyright information be inseparable from the data.


To prevent separation of the copyright information from the data, a method for integrating the data with the copyright information or a method for making the data unusable without copyright information are described. These methods are similar to the methods described above for the copyright control program and the copyright control message.


First, description will be given for a method for integrating the data with the copyright information.


The data handled by computer comprises a file header indicating data name and size, and a file body, which comprises the main body of data. Therefore, for integrating the data with the copyright information, there are methods that integrate the copyright information with the file header, that integrate the copyright information with the file body, and that use other means for this purpose.


Among these methods, the method that integrates the copyright information with the file header, if the data is character information expressed with character code, the copyright information may be integrated even without a file header. Thus, the method is simple, but not very reliable. Also, because the capacity of the file header is not high, it is not sufficient if there is a large amount of copyright information.


Digital picture data and digital sound data are grouped together under a common group header. The copyright information can be integrated into this group header. However, there is a problem of header capacity similar to the case for the file header.


For the method of integrating the copyright information with the file body, one way is to add copyright information for each piece of data edited. Another way is to add the copyright information all together.


To add the copyright information for each edited piece of data, the copyright information is appended to each piece of edited data using a cut-and-paste procedure. This is not only complicated but disadvantageous in that the entire file data becomes too big.


If the picture data indicates the copyright of original authorship, it is easy to identify corresponding data. Thus, it is not always necessary to add the copyright information to each minimum unit of the edited data.


It is also possible to write the copyright information into the copyright control program. In this method, it is difficult to manipulate the copyright information if it is written into the copyright control program integrated with the data as already described.


If the data is a picture signal, it is necessary to have synchronization signal data. in order to define scanning line, field and frame. This synchronization signal has high redundancy and is generally represented with variable-length code. Thus, the copyright information can he mixed with the variable-length code. The number of scanning lines is 480 for VGA standards. By utilizing this method, a considerable quantity of information can be mixed into the picture signal.


If the picture data is an animated picture, it is possible to write a sufficient quantity of copyright information using this method. However, if the picture data is a still picture edited by a cut-and-paste procedure, there may not he enough space to add the copyright information.



FIG. 2A and FIG. 2B represent structures for an analog television signal and a digital television signal. FIG. 2A represents an analog television signal, and FIG. 2B shows a digital television signal.


A signal containing other than picture data, such as the multiplex teletext signal in analog television, is inserted by utilizing the vertical retrace interval. The horizontal retrace interval is not utilized.


In contrast, in digital television, it is possible for a copyright control program or other multiplex teletext signal to be placed into horizontal scanning data or into vertical scanning data.


As a method for integrating the copyright information with data, one way is to write the copyright information into the data itself, and another is to write it into the control code.


With the data used in a computer, there is control code for controlling the communication system or computer system, in addition to the data to be displayed on screen or used for some operation. This control code cannot be seen by the user. Therefore, if the copyright information is written into the control code, the copyright information thus written does not cause trouble for the user.


It is also possible to enter the copyright information into the files of the computer using the technique of a computer virus without affecting the operation itself.


The copyright information may be supplied together with the permit key as shown in FIG. 3F, or it may be supplied together with data as shown in FIG. 3G.


Attention has been focused in recent years on digital signatures. A digital signature is prepared using a private key, which only the owner knows, and the file size of the document data. If the document data is changed, the change can be confirmed by the private key. The content of the document data can be seen at any time by others using a public key. Thus, this scheme offers very high security.


The data in a computer can be changed without leaving any trace. Because of this, an author may not notice that his copyright is infringed, or a user may Use the data without known that the content of the data has been changed. To prevent this, a digital signature is attached to the data, and damage to the copyright owner or the user can be avoided.


The permit key, copyright control program, copyright control message, and copyright information can be combined in any way as necessary to actualize the method for controlling database copyrights.


Also, it is possible to design in such a manner that only a part of the data of the copyright control program, the copyright control message or the copyright information is supplied together with the permit key and the other part is supplied together with the data to be utilized (as shown in FIGS. 3H, 3I and 3J). The part supplied with the permit he and the part supplied together with the data are combined. The functions of the complete permit key maybe served after they have been combined together.


Thus, it is possible to give the function of the permit key to the copyright program and copyright control message, and higher security is ensured.

Claims
  • 1. A method, comprising: receiving a utilization permit key at a computing device;decrypting encrypted data to produce decrypted data, wherein the decrypting is performed by the computing device using the utilization permit key;determining, based at least in part on the utilization permit key, a set of permitted operations;receiving a request for a specified operation;in response to determining that the set of permitted operations does not include the specified operation, preventing the specified operation.
  • 2. The method of claim 1, wherein determining that the set of permitted operations does not include the specified operation is based on a number of times that the specified operation has previously been performed.
  • 3. The method of claim 1, wherein decrypting the encrypted data to produce decrypted data includes: determining a number of times that the utilization permit key has previously been used; anddetermining that the number of times that the utilization permit key has previously been used is less than a key usage limit.
  • 4. The method of claim 3, wherein the key usage limit is one usage.
  • 5. The method of claim 1, wherein the determining that the set of permitted operations does not include the specified operation includes determining that permitting the specified operation would result in the specified operation being performed more times than a specified limit.
  • 6. The method of claim 1, wherein the set of permitted operations includes a plurality of permitted types of operations.
  • 7. The method of claim 1, wherein the set of permitted operations comprises one or more operations selected from the set consisting of displaying, storing, copying, editing, and transferring.
  • 8. The method of claim 1, wherein the set of permitted operations consists of one type of operation, wherein the one type of operation is selected from the set consisting of displaying, storing, copying, editing, and transferring.
  • 9. An article of manufacture including a non-transitory computer-readable memory medium having program instructions stored thereon that, responsive to execution by a computer system, cause the computer system to perform operations comprising: receiving a utilization permit key;decrypting encrypted data to produce decrypted data, wherein the decrypting is performed using the utilization permit key;determining, based at least in part on the utilization permit key, a set of permitted operations;receiving a request for a specified operation;in response to determining that the set of permitted operations does not include the specified operation, preventing the specified operation.
  • 10. The article of manufacture of claim 9, wherein determining that the set of permitted operations does not include the specified operation is based on a number of times that the specified operation has previously been performed.
  • 11. The article of manufacture of claim 9, wherein decrypting the encrypted data to produce decrypted data includes: determining a number of times that the utilization permit key has previously been used; anddetermining that the number of times that the utilization permit key has previously been used is less than a key usage limit.
  • 12. The article of manufacture of claim 11, the operations further comprising: adjusting the utilization permit key to indicate additional usage to decrypt data.
  • 13. The article of manufacture of claim 9, wherein the set of permitted operations includes a plurality of permitted operations.
  • 14. The article of manufacture of claim 9, wherein the set of permitted operations consists of one operation, wherein the one operation is selected from the set consisting of displaying, storing, copying, editing, and transferring.
  • 15. An apparatus, comprising: a processor;memory, coupled to the processor, having stored thereon program instructions executable to cause the apparatus to perform operations comprising: receiving a utilization permit key;decrypting encrypted data to produce decrypted data, wherein the decrypting is performed by using the utilization permit key;determining, based at least in part on the utilization permit key, a set of permitted operations;receiving a request for a specified operation;in response to determining that the set of permitted operations does not include the specified operation, preventing the specified operation.
  • 16. The apparatus of claim 15, wherein determining that the set of permitted operations does not include the specified operation is based on a number of times that the specified operation has previously been performed.
  • 17. The apparatus of claim 15, wherein decrypting the encrypted data to produce decrypted data includes: determining a number of times that the utilization permit key has previously been used; anddetermining that the number of times that the utilization permit key has previously been used is less than a key usage limit.
  • 18. The apparatus of claim 17, the operations further comprising: adjusting the utilization permit key to indicate additional usage.
  • 19. The apparatus of claim 15, wherein the set of permitted operations includes a plurality of permitted operations.
  • 20. The apparatus of claim 15, wherein the set of permitted operations consists of one operation, wherein the one operation is selected from the set consisting of displaying, storing, copying, editing, and transferring.
Priority Claims (1)
Number Date Country Kind
6-64889 Apr 1994 JP national
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. application Ser. No. 11/469,035, filed Aug. 31, 2006 (now U.S. Pat. No. 7,979,354), which is a divisional of U.S. application Ser. No. 08/895,493 filed Jul. 16, 1997 (now U.S. Pat. No. 7,447,914), which is a continuation of U.S. application Ser. No. 08/416,037 filed Mar. 31, 1995 (now abandoned).

US Referenced Citations (300)
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
4458109 Mueller-Schloer Jul 1984 A
4465901 Best 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
5222137 Barrett 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
5349643 Cox 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
5586036 Pintsov 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
5646099 Watts et al. Jul 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
7383447 Saito Jun 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
7730324 Saito Jun 2010 B2
RE41657 Saito Sep 2010 E
7801817 Saito Sep 2010 B2
7827109 Saito Nov 2010 B2
RE42163 Saito Feb 2011 E
7979354 Saito Jul 2011 B2
20020021807 Saito Feb 2002 A1
20020052850 Saito May 2002 A1
20020122173 Bruns Sep 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
20070038575 Saito Feb 2007 A1
20070061267 Saito Mar 2007 A1
20070079145 Saito Apr 2007 A1
20070088960 Saito Apr 2007 A1
20070110228 Saito May 2007 A1
20070174631 Herrod et al. Jul 2007 A1
20100106659 Stefik et al. Apr 2010 A1
20100122088 Oxford May 2010 A1
Foreign Referenced Citations (95)
Number Date Country
3717261 Nov 1987 DE
0121853 Oct 1984 EP
158167 Oct 1985 EP
0191162 Aug 1986 EP
0199410 Oct 1986 EP
0225010 Jun 1987 EP
0341801 Nov 1989 EP
0391261 Oct 1990 EP
0398645 Nov 1990 EP
0430734 Jun 1991 EP
0450841 Oct 1991 EP
0459046 Dec 1991 EP
0489385 Jun 1992 EP
0518365 Dec 1992 EP
0532381 Mar 1993 EP
0542298 May 1993 EP
0551016 Jul 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
0677949 Oct 1995 EP
0354774 Apr 1996 EP
0709760 May 1996 EP
0715241 Jun 1996 EP
0715243 Jun 1996 EP
0719045 Jun 1996 EP
0506435 Oct 1996 EP
0746126 Dec 1996 EP
0438154 Jul 1997 EP
0813133 Dec 1997 EP
0581227 Sep 2005 EP
2231244 Nov 1990 GB
59169000 Sep 1984 JP
60102038 Jun 1985 JP
58169000 Oct 1985 JP
2546983 May 1986 JP
62169540 Jul 1987 JP
01048165 Feb 1989 JP
64041387 Feb 1989 JP
64061782 Mar 1989 JP
3128541 May 1991 JP
03162152 Jul 1991 JP
3265241 Nov 1991 JP
3282989 Dec 1991 JP
04003224 Jan 1992 JP
4181282 Jun 1992 JP
4268844 Sep 1992 JP
0563142 Mar 1993 JP
5056037 Mar 1993 JP
5063142 Mar 1993 JP
5075597 Mar 1993 JP
5122701 May 1993 JP
5276476 Oct 1993 JP
5298373 Nov 1993 JP
5316102 Nov 1993 JP
5324936 Dec 1993 JP
5327693 Dec 1993 JP
5334324 Dec 1993 JP
06-046419 Feb 1994 JP
06037750 Feb 1994 JP
6095591 Apr 1994 JP
6131806 May 1994 JP
06152587 May 1994 JP
06-162059 Jun 1994 JP
6231536 Aug 1994 JP
6236147 Aug 1994 JP
6242304 Sep 1994 JP
6264199 Sep 1994 JP
6264201 Sep 1994 JP
6269959 Sep 1994 JP
6290087 Oct 1994 JP
6318036 Nov 1994 JP
7014045 Jan 1995 JP
7271865 Oct 1995 JP
7302244 Nov 1995 JP
08-287014 Jan 1996 JP
08-185448 Jul 1996 JP
8185448 Jul 1996 JP
08-272745 Oct 1996 JP
8292976 Nov 1996 JP
8503830 Aug 1985 WO
8909528 Oct 1989 WO
9002382 Mar 1990 WO
9116691 Oct 1991 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 (93)
Entry
Office Action in U.S. Appl. No. 11/441,973 issued Oct. 12, 2012, 20 pages.
Office Action in U.S. Appl. No. 12/917,184 issued Jul. 12, 2012, 17 pages.
Office Action in U.S. Appl. No. 11/496,777 issued Jan. 23, 2013, 18 pages.
U.S. Appl. No. 09/362,955, entitled “Data Management System,” by Makoto Saito, filed Jul. 30, 1999, 64 pages.
U.S. Appl. No. 09/665,902, entitled “Digital content management system using electronic watermark,” by Makoto Saito, filed Sep. 20, 2000, 52 pages.
U.S. Appl. No. 10/352,078, entitled “Data copyright management system,” by Makoto Saito, filed Jan. 28, 2003, 160 pages.
U.S. Appl. No. 11/404,124, entitled “Data copyright management system,” by Makoto Saito, filed Apr. 12, 2006, 15 pages.
U.S. Appl. No. 11/701,943, entitled “ Data management system,” by Makoto Saito, filed Feb. 1, 2007, 9 pages.
U.S. Appl. No. 11/701,945, entitled “ Data management system,” by Makoto Saito, filed Feb. 1, 2007, 11 pages.
U.S. Appl. No. 11/701,946, entitled “ Data management system,” by Makoto Saito, filed Feb. 1, 2007, 10 pages.
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, 2 pages. (Retrieved Oct. 12, 2010).
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, 1 page (Retrieved Oct. 12, 2010).
Anonymous, “Encryption of Information to be Recorded so as to Prevent Unauthorized Playback,” Research Disclosure No. 335, Mar. 1992, Emsworth, GB, p. 219.
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.
Tirkel, A.Z. et al., “Electronic Water Mark,” Conference Proceedings Dicta, Dec. 1993, pp. 666-673.
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.
Ham, Lein, et al., “Software Authentication System for Information Integrity,” Computers & Security International Journal Devoted to the Study of Technical and Financial Aspects of Computer Security, vol. 11, No. 8, Dec. 1992, pp. 747-752.
Lennil, P., “The IBM Microkernel Technology,” OS/2 Developer, vol. 5, No. 5,1993, pp. 70-72, 74.
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, Jun. 10-15, 1993, pp. 761-768.
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.
Van Schyndel, R.G., et al., “A Digital Watermark,” IEEE, 1994, pp. 86-90.
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.
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, 10 pages. (Retrieved Jan. 12, 2007).
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, vol. 32, No. 9, Sep. 1994, pp. 50-57.
Menezes, Alfred, et al., “Handbook of Applied Cryptography: Section 11.5.1,” CRC Press, 1997, pp. 452-454.
Fitch, K., “User Authentication and Software Distribution on the Web”, AusWeb96—Technical Futures, The Second Australian WorldWideWeb Conference, 1996, pp. 1-12.
Aviel D. Rubin, “Trusted Distribution of Software Over the Internet,” Internet Society 1995 Symposium on Network and Distributed System Security, 7 pages.
Murphy, Kathleen, “Digimarc Awarded Patent for Digital Watermarking,” Business, Mar. 10, 1998, www.internetnews.com/bus-news/article.php/19611, 2 pages. (Retrieved Aug. 11, 2003).
Hedberg, S.R., “HP's International Cryptography Framework: Compromise or Threat?”, IEEE Computer, Jan. 1997, pp. 28-30.
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.
Adachi, R., “Introduction to Handcraft of Personal Computer,” Natsume Publishing Co., 1983, pp. 141-155.
Announcing the Standard for Des Modes of Operation, U.S. FIPS Publication 81, Dec. 2, 1980, 23 pages.
Rozenblit, M., “Secure Software Distribution” IEEE Network Operations and Management Symposium, 1994, pp. 486-496.
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, P., “Digital Copyright Protection,” AP Professional, 1997, pp. 1-7 and 14-17.
Kent, Stephen T., “Internet Privacy Enhanced Mail,” Association for Computing Machinery, Communications of the ACM, vol. 36, issue 8, Aug. 1993 pp. 48-61.
Masuoka, Fujio, “Progressing Flash Memories: Chapter 1: Semiconductor Memory,” Kogyo Chosa-kai Co., 1992, pp. 34-68.
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, Naohisa, et al., “A Proposal on Digital Watermark in Document Image Communication and Its Application to Realizing a Signature,” Electronics & Communications in Japan Part 1, vol. 73, No. 5, part I, 1990, pp. 22-33.
Morizaki, H., “Introduction to Electronic Devices,” Gijustsu Hyoron Publishing Co., 1989, pp. 260-266.
Gale, Brent et al., “Satellite and Cable TV Scrambling and Descrambling,” Baylin/Gale Productions, 2nd Edition, 1986, pp. 163-165.
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.
Search Report dated Oct. 24, 2002.
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.
Official Action in Japanese Application No. 7-280984 issued Jan. 20, 2004, 4 pages.
Decision of Board of Appeals of Japanese Patent Office (Appeal No. 2004-10462, Patent Application No. 7-280984), 4 pages.
Official Action in Japanese Application No. 2004-149423 issued Oct. 30, 2007, 6 pages.
European Search Report in European Application No. 95116615.6 dated Dec. 1, 1998, 2 pages.
Official Action in Japanese Application No. 2007-260256 issued Jan. 6, 2009, 7 pages.
Official Action in Japanese Application No. 2007-260256 issued Sep. 7, 2009, 4 pages.
Official Action in Japanese Application No. 2007-260256 issued Oct. 13, 2010, 3 pages.
Official Action in Japanese Application No. 7-228366 issued Oct. 15, 2002, 6 pages.
Official Action in Japanese Application No. 7-228366 issued Jul. 15, 2003, 10 pages.
Official Action in Japanese Application No. 7-228366 issued Nov. 11, 2003, 9 pages.
European Search Report for European Application No. 95115068 dated Jun. 30, 1999, 2 pages.
Notification of Inquiry in Japanese Application No. 2002-364160 dated Nov. 18, 2008, 3 pages.
Official Action in Japanese Application No. 2002-364160 issued Jun. 15, 2009, 4 pages.
Official Action in Japanese Application No. 2002-364160 issued Dec. 21, 2009, 4 pages.
Official Action in Japanese Application No. 2006-198703 issued Jan. 4, 2010, 6 pages.
Official Action in Japanese Application No. 2006-198703 issued Jun. 4, 2010, 2 pages.
Notice of Inquiry from the Appeal Board in Japanese Application No. 2006-198703 issued Jan. 19, 2011, 3 pages.
Official Action in U.S. Appl. No. 11/469,035 issued Jun. 11, 2008, 7 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 Jul. 23, 2009, 6 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.
Notice of Allowance in U.S. Appl. No. 11/469,035 issued Mar. 1, 2011, 6 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 Apr. 27, 2007, 9 pages.
Official Action in U.S. Appl. No. 10/105,262 issued Jan. 31, 2008, 10 pages.
Official Action in U.S. Appl. No. 10/105,262 issued Aug. 4, 2008, 16 pages.
Advisory Action in U.S. Appl. No. 10/105,262 issued Oct. 21, 2008, 3 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.
Official Action in U.S. Appl. No. 11/512,695 issued Oct. 15, 2009, 6 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 May 26, 2011, 34 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.
Notice of Allowance in U.S. Appl. No. 11/512,885 issued Feb. 23, 2011, 13 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 U.S. Appl. No. 09/362,955 issued Aug. 3, 2007, 29 pages.
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. 10/352,078 issued Apr. 4, 2011, 14 pages.
Official Action in U.S. Appl. No. 11/496,777 issued Aug. 24, 2010, 15 pages.
Official Action in U.S. Appl. No. 11/496,777 issued Mar. 17, 2011, 12 pages.
Related Publications (1)
Number Date Country
20110282792 A1 Nov 2011 US
Divisions (1)
Number Date Country
Parent 08895493 Jul 1997 US
Child 11469035 US
Continuations (2)
Number Date Country
Parent 11469035 Aug 2006 US
Child 13179723 US
Parent 08416037 Mar 1995 US
Child 08895493 US