1. Field of the Invention
The present invention relates to a system for managing data for using, i.e., storing, copying, editing, or transferring digital data content.
2. Background Art
Because analog data content is deteriorated in quality whenever storing, copying, editing, or transferring it, controlling copyrights associated with these operations has not been a serious problem. However, because digital data content is not deteriorated in quality after repeatedly storing, copying, editing, or transferring it, controlling copyrights associated with these operations for digital data content is a serious problem.
Because there has been hitherto no adequate method for controlling a copyright for digital data content, the copyright is handled by the copyright law or contracts. Even in the copyright law, compensation money for a digital-type sound- or picture-recorder is only systematized.
Use of a data content includes not only referring to its contents but also normally effectively using by storing, copying, or editing obtained data content. Moreover, it is possible to transmit edited data content to another person via on-line basis by a communication line or via off-line basis using a proper recording medium. Furthermore, it is possible to transmit the edited data content to the database to be registered as new data content.
In a conventional database system, only character data content is handled. In a multimedia system, however, audio data content and picture data content which are originally analog data contents are digitalized and formed into a database in addition to the data content such as characters which have been formed into a database so far.
Under these circumstances, how to deal with a copyright of data content in 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 such as copying, editing, or transferring of the data content.
The inventor of the present invention proposed a system for managing a copyright by obtaining a permit key from a key control center via a public telephone line in Japanese Patent Laid-Open No. 46419/1994 (GB 2269302A) and Japanese Patent Laid-Open No. 141004/1994 (U.S. Pat. No. 5,504,933) and moreover, proposed an apparatus for managing the copyright in Japanese Patent Laid-Open No. 132916/1994 (GB 2272822A).
Moreover, a copyright management method for primary utilization of digital data content such as display (including process to sound) or storage including real-time transmission of the digital data content in a database system and secondary utilization of the digital data content such as copying, editing, or transferring of the digital data content by further developing the above invention is proposed in Japanese Patent Application No. 64889/1994 (U.S. patent application Ser. No. 08/416,037).
The database copyright management system of the above application in order to manage the copyright, either one or more of a program for managing the copyright, copyright information, and a copyright control message are used in addition to a use permit key corresponding to a requested use, and data content which has been transferred with encryption is decrypted to be used for viewing and editing, and the data content is encrypted again when used for storing, copying and transferring.
The copyright control message is displayed when utilization beyond the range of the user's request or authorized operation is found to give caution or warning to a user and the copyright management program performs monitoring and managing so that utilization beyond the range of the user's request or authorized operation is not performed.
On the other hand, it is widely practiced to establish LAN (Local Area Network) by connecting computers with each other in offices, organizations, companies, etc. Also, a plurality of networks are connected with each other, and Internet is now organized in a global scale, by which a plurality of networks are utilized as if they are a single network.
In LAN used in an organization such as firm, secret information is often stored, which must not be disclosed to outsiders. For this reason, it is necessary to arrange the secret information in such a manner that only a specific group of users can gain access and use such information, and such access is generally placed under control to prevent leakage of secret information to outsiders.
There are roughly two methods to control the access: a method to control access with access permission, and a method to do it by encryption.
The method of access control by access permission is described in U.S. Pat. Nos. 5,173,939, 5,220,604, 5,224,163, 5,315,657, 5,414,772 and 5,438,508, in EP 506435, and in JP Laid-Open 169540/1987.
The access control method based on encryption is disclosed in U.S. Pat. Nos. 4,736,422, 5,224,163, 5,400,403, 5,457,746, and 5,584,023, in EP 438154 and EP 506435, and in JP Laid Open 145923/1993. The access control method based on encryption and digital signature is described in U.S Pat. Nos. 4,919,545 and 5,465,299.
Intranet is now being propagated, in which a plurality of LANs are connected with each other via Internet and these LANs are utilized as if they are a single LAN. In the intranet, information exchange is performed via Internet, which basically provides no guarantee for prevention of piracy, and information is encrypted to prevent the piracy when secret information is exchanged.
The prevention of information piracy during transmission by means of encryption is disclosed in U.S. Pat. Nos. 5,504,818 and 5,515,441, and the use of a plurality of crypt keys is described in U.S. Pat. Nos. 5,504,816; 5,353,351, 5,475,757, and 5,381,480. Also, performing re-encryption is described in U.S. Pat. No. 5,479,514.
When encrypting management of crypt key including transfer and receipt of crypt key becomes an important issue. Generation of keys by IC card is disclosed in U.S. Pat. No. 5,577,121, and encryption/decryption by IC card is disclosed in U.S. Pat. Nos. 5,347,581 and 5,504,817. Also, electronic watermark technique is described in EP 649074.
In the video conference system, a television picture has been added to the conventional voice telephone set. Recently, the video conference system is advanced in which a computer system is incorporated in the video conference system so that the quality of the voice and the picture are improved, and data content can be handled at the same time as well as the voice and the picture.
Under these circumstances, security a the violation of the user's privacy and the data content leakage due to eavesdropping by persons other an the participants of the conference are protected by the cryptosystem using a secret-key.
However, since the conference content obtained by the participants themselves are decrypted, in the case where participants themselves store the content of the conference and sometimes edit the content, and further, use for secondary usage such as distribution to the persons other than the participants of the conference, the privacy of other participants of the video conference and data content security remains unprotected.
In particular, the compression technology of the transfer of data content is advanced while the volume of the data content storage medium is advanced with the result that the possibility is getting more and more realistic that all the content of the video conference may be copied to the data content storage medium or transmitted via a network.
Also, electronic commerce system with digital data content for commercial dealing is now being used for practical applications. Above all, various types of experiment are now under way for digital cash system to exchange electronic data content instead of cash so that the system can be used by general public.
The digital cash system which has been proposed so far is based on a secret-key cryptosystem. The encrypted digital cash data content is transferred from a bank account or a cash service of a credit company, and is stored in an IC card so that a terminal device for input/output is used to make a payment. The digital cash system which uses this IC card as a cash-box can be used at any place such as shops or the like as long as the input/output terminal is installed. However, the system cannot be used at places such as homes or the like where no input/output terminal is installed.
Since the digital cash is an encrypted data content any device can be used as the cash-box which stores digital cash data content, in addition to the IC card, as long as the device can store encrypted data content and transmit the data content to the party to which the payment is made. As a terminal which can be specifically used as the cash-box, there are personal computers, intelligent television sets, portable telephone sets such as personal digital assistant (PDA), personal handyphone system OHS), intelligent telephone sets, and PC cards or the like which has an input/output function.
It is desirable that the digital cash is processed as an object associated with data content and functions instead of being as a simple data content. In handling a digital cash, there are a common digital cash form, an unentered digital cash form private for an owner, an entry column in the digital cash form private for the owner, a digital cash data content showing an amount of money, an instruction of handling digital cash, and a digital cash form private for the owner in which an amount of money is entered. In an object-oriented programing, concepts such as an object, a class, a slot, a message and an instance are used.
In these correspondence relations, the common digital cash form is the object; the unentered digital cash form private for an owner: the class; the entry column of a digital cash form private for the owner: the slot; the instruction of handling digital cash: the message; and the digital cash form private for the owner in which an amount of money is entered: the instance.
A digital cash data content comprising the amount of money and the like is used as an argument, then, is transferred and stored in the slot which is referred to as an instance variable by the message so that a new instance is made which is a digital cash in which the amount of money is renewed.
The encryption technique used in the data management system is utilized not only in the distribution of copyrighted data content but also in the distribution of digital cash.
Then, basic encryption-related technique used in the present invention is described below.
—Crypt Key—
Secret-key system is also called “common key system” because the same key is used for encryption and decryption and because it is necessary to keep the key in secret, it is also called “secret-key system.” Typical examples of encryption algorithm using secret-key are: DES (Data Encryption Standard) system of National Bureau of Standards FEAL (Fast Encryption Algorithm) system of NTT, and MISTY system of Mitsubishi Electric Corp. In the embodiments dried below, the secret-key is referred as “Ks”.
In contrast, the public-key system is a cryptosystem using a public-key being made public and a private-key, which is maintained in secret to those other than the owner of the key. One key is used for encryption and the other key is used for decryption. Typical example is RSA public-key system. In the embodiments described below, the public-key is referred as “Kb”, and the private-key is referred as “Kv”.
Here, the operation to encrypt data content, a plain text material M to a cryptogram Cks using a secret-key Ks is expressed as:
Cks=E(M, Ks).
The operation to decrypt he cryptogram Cks to the plain text data content M using a crypt key Ks is expressed as:
M=D(Cks, Ks).
Also, the operation to encrypt the plain text data content M to a cryptogram Ckb using a public key Kb is expressed as:
Ckb=E(M, Kb).
The operation to decrypt the cryptogram Ck to the plain text data content M using a private-key Kv is expressed as:
M=D(Ckb, Kv).
The operation to encrypt the plain text data content M to a cryptogram Ckv using a private-key Kv is expressed as:
Ckv=E(M, Kv),
and the operation to decrypt the cryptogram Ckv to the plain text data content M using the public-key Kb is expressed as:
M=D(Ckv, Kb).
The encryption technique is the means to exclude illegitimate use of data content, but perfect operation is not guaranteed. Thus, the possibility of illegitimate use of data content cannot be completely excluded.
On the other hand, electronic watermark technique cannot exclude illegitimate use of possibility of illegitimate use, but if illegitimate use is detected, it is possible to check the illegitimate use by verifying the content of electronic watermark, and be are a number of methods in this technique. These methods are described in Nikkei Electronics, No. 683, 1997-2-24, pp. 99-124, “‘Digital watermark’ to help stop to use illegal proprietary digital works in the multimedia age.” Also, description is given on this technique by Walter Bender et al., “Introducing data-hiding technology to support digital watermark for protecting copyrights,” IBM System Journal, vol. 35, Nos. 3 & 4, International Business Machines Corporation.
To prevent piracy or leakage of data content, a cryptography technique and electronic watermark technique are combined together and used. In a data content supplied to a first user, a first user data is entered as electronic watermark by a data management center, and the data content with an electronic watermark entered in it is eyed using a crypt key and is supplied. The encrypted data content is decrypted using a crypt key distributed from the data management center and is used. In case it is to be stored, it is encrypted using another crypt key.
In case the data content is copied and transferred to a second user, a user data of the second user is entered as electronic watermark, and a scenario to enter the user data of the second user as electronic watermark is registered at the data management center, and the data content with electronic watermark entered in it is encrypted using another crypt key and is supplied. When the validity of the second user is confirmed by the scenario, another crypt key is distributed to the second user. The encrypted data content is decrypted using another crypt key and is used. When it is to be stored, it is encrypted using still another key.
In the data content obtained by the first user, the first user data is entered as electronic watermark by a data center. If the data content is copied and transferred without taking a normal procedure, the data center verifies the electronic watermark entered there, and it is possible to detect that the first user has copied and transferred the data content without taking a normal procedure.
When it is copied and transferred by a normal procedure, electronic watermark of each user is entered, and this makes it possible to dearly define the route of copying and transfer. When copying and transfer are repeated, noise in the data content is increased by the entered electronic watermark, and this makes it possible to exclude and inhibit copying and transfer, i.e. to decrease the risk of illegitimate utilization of data content.
Because a key used for encryption of the data content is stored at the key center, the key center can be utilized when a key escrow system or a key recovery system is used in a practical application.
Further, the secret-key can be used as user data and the secret-key is encrypted using the public-key of the data center and this is entered as electronic watermark. By decrypting this using the private-key of the data center when necessary and by confirming the secret-key, it is possible to achieve a key escrow system or a key recovery system in simple manner but with high security.
In addition to copyright management of data content using a charged crypt key, the present invention is also applicable in applications such as maintenance of privacy of participants in a video conference based on a video conference system using a free-of-charge crypt key and also for maintenance of security of the data content, or the maintenance of data security in electronic data interchange (EDI) such as electronic commerce.
The present invention is a digital data management system described with respect to copyright management. 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 following explanation is provided to illustrate various embodiments of the invention.
[Embodiment 1]
Description is given now on the first embodiment of the invention referring to
As the user data, a user ID, a user E-mail address or a secret-key generated to X request of secret-key of the user can be used. Further, a random number prepared by the data center as the one specific for the user can be used.
Also, it may be designed in such a manner that the data management center combines the first user information (having data amount of several tens of bytes in general) with the first user public-key Kb1 (having data amount of about one thousand bits) and obtains a first user data I1 (having data amount of one thousand and several hundreds of bits), and that MD5 hash value of 16 bytes, obtained by turning the first user data I1 to hash value by MD5 hash algorithm, can be used as the user data.
The decrypted secret-keys Ks1 and Ks2 are stored in the device. The user is not the owner of the secret-keys Ks1 and ks2, but the key center or the data center is the owner. Because there may be possibility of improper use of the secret-keys if the management of the secret-keys is made by the user, the secret-keys Ks1 and Ks2 are automatically stored in IC card, PCMCIA card, insert board or software which are not under the user's control.
Here, the fee to use the data content M0 is charged. The secret-keys Ks1 and Ks2 can be generated using the first user data I1. if the data content name and the first user data I1 are available, Ks1 can be generated again. Therefore, it will suffice that the data content name Tm0, the first user data I1 and the first user public-key Kb1 are stored. The secret-keys may be selected each time from library of the key center instead of generating them.
Japanese Patent Laid On 271865/1995, filed by the present inventor, describes a method to divide a copyright management program and to distribute by attaching to each data content and key.
This method can be applied to the secret-keys themselves, and the secret-key Ks1 can be divided to partial secret-keys Ks11 and Ks12 as:
Ks11+Ks12=Ks1
and the secret-key Ks2 can be divided to partial secret-keys Ks21 and Ks22 as:
Ks21+Ks22=ms2
The partial secret-keys Ks11 and Ks21 are distributed as partial secret-keys, and the remaining partial secret-keys Ks12 and Ks22 are attached to the data content and distributed. Then, the first user cannot engage any more in the management of the secret-keys Ks1 and Ks2.
The scenario of editing process of the data content M1 (information relating to electronic watermark such as the first user data) is stored to use for verification.
As a simplified procedure, the first user data I1 may be entered as an electronic watermark Wi1 instead of the encrypted first user data Ci1kb0 for the electronic watermark.
In this case, the secret-key Ks1 is abandoned by the procedure such as overwriting of the secret-key Ks2 on the secret-key Ks1.
As a simplified procedure, the second user data I2 may be entered as electronic watermark Wi2 instead of the encrypted second user data Ci2kb0.
The second user U2 specifies the data content name Tm0 to the key center, presents a public-key Kb2 of the second user, and requests the distribution of the secret-key Ks2 for decryption and the secret-key Ks3 for re-encryption.
The secret-keys Ks2 and Ks3 at the second user handled and are decrypted and stored in the same manner as the secret-keys Ks1 and Ks2 at the first user.
In tis case, the secret-key Ks2 is abandoned by the procedure such as overwriting of the secret-key Ks3 on the secret-key Ks2.
Then, the same procedure is repeated.
The embodiment as described above is arranged under the assumption that the distributed data content is utilized at real time, while it may be designed in such a manner that the data content obtained advance and stored by the user is decrypted later and is used.
In such a case, the first user is at the position of the second user in the above embodiment, and a similar operation is performed.
As it is evident from the above description, the first user data is entered as electronic watermark in the data content obtained by the first user by the data center.
Therefore, if it is copied and transferred without taking a normal procedure, the data center verifies the electronic watermark entered therein, and it is detected that the first user has copied and transferred it without taking a normal procedure.
When it is copied and transferred by a normal procedure, electronic watermark of each user is entered in the data content, and this clears the route of copying and transfer. When copying and are repeated, noise in the data content increases by the entered electronic watermark, and this makes it possible to exclude and inhibit copying and transfer, i.e. to decrease the risk of illegitimate utilization.
Because a key used for encrypting the data content is stored at the key center, the key center can be utilized when a key escrow system or a key recovery system is used in a practical application.
Further, the secret-key can be used as user data, and the secret-key is encrypted using the public-key of the data center and this is entered as electronic watermark By decrypting the using the private-key of the data center when necessary and by confirming the secret-key, it is possible to achieve a key escrow system or a key recovery system in a simple but highly secure manner.
[Embodiment 2]
Description is given now on a second embodiment of the invention referring to
At the data center in the data management center, a data content M0 of IP (information provider) is stored in database in advance or the data content M0 is transferred from IP each time at the request of the fast user U1.
Here, the fee to use the data content M0 is charged.
As the user data, a user ID, a user E-mail address or a secret-key generated to the request of secret-key of the user can be, used. Further, a random number prepared by the data center as the one specific for the user can be used.
Also, it may be designed in such a manner that the data management center combines the first user information (having data amount of several tens of bytes in general) with a first user public-key Kb1 (having data amount of about 1000 bits) and obtains a first user data I1 (having data amount of one thousand and several hundreds of bits), and that MD5 hash value of 16 bytes, obtained by turning the first user data I1 to hash value by MD5 hash algorithm, can be used as the user data.
The decrypted secret-keys Ks1 and Ks2 are stored in the device. The user is not the owner of the secret-keys Ks1 and Ks2, but the key center or the data center is the owner. Because here may be possibility of improper use of the secret-keys if the management of the secret-keys is made by the user, the secret-keys Ks1 and Ks2 are automatically stored in IC card, PCMCIA card, insert board or software which are not under the user's control.
The secret-keys Ks1 and Ks2 can be generated using the first user data I1. If the data content name and the first user data I1 are available, Ks1 can be generated again. Therefore, it will suffice that the data content name Tm0, the first user data I1 and the first user public-key Kb1 are stored.
The secret-key may be selected each time from library of the key center instead of generating them.
Japanese Patent Laid-Open 271865/1995, filed by the present inventor, describes a method to divide a copyright management program and to distribute respectively together with data content and key attached thereto.
This method can be applied to the secret-keys themselves, and the secret-key Ks1 can be divided to partial secret-keys Ks11 and Ks12 as:
Ks11+Ks12=Ks1
and the secret-key Ks2 can be divided to secret-keys Ks21 and Ks22 as:
Ks21+Ks22=Ks2.
The partial secret-keys Ks11 and Ks21 are distributed as partial secret-keys, and the remaining partial secret-keys Ks12 and Ks22 are attached to the data content and distributed. Then, the first user cannot engage any more in the management of the secret-keys Ks1 and Ks2.
The scenario of editing process of the data content M1 (information relating to electronic watermark such as the first user data) is stored to use for verification.
As a simplified procedure, the first user data I1 may be entered as an electronic watermark Wi1 instead of the encrypted first user data Ci1kb0 for electronic watermark.
In this case, the secret-key Ks1 is abandoned by a procedure such as overwriting of the secret-key Ks2 on the secret-key Ks1.
As a simplified procedure, the second user data I2 may be entered as electronic watermark Wi2 instead of the encrypted second user data Ci2kb0.
The second user U2 specifies the data content name Tm0 to the key center, presents the public-key Kb2 of the second user, and requests the distribution of the secret-key Ks3 for decryption and a secret-key Ks4 for re-encryption.
The secret-keys Ks3 and Ks4 at the second user are handled in the same manner as the secret-keys Ks1 and Ks2 at the first user.
Here, the secret-key Ks3 is abandoned by a procedure such as overwriting of the secret-key Ks4 on the secret-key Ks3.
Then, the same procedure is repeated.
The embodiment as described above is arranged under the assumption that the distributed data content is utilized in real time, while it may be designed in such a manner that the data content obtained in advance and stored by the user is decrypted later and is used.
In such a case, the fist user is at the position of the second user in the above embodiment, and a similar operation is performed.
As it is evident from the above description, the first user data is entered as electronic watermark in the data content obtained by the first user by the data center.
Therefore, if it is copied and transferred without taking a normal procedure, the data center verifies the electronic watermark entered therein, and it is detected that the first user has copied and transferred it without taking a normal procedure.
When it is copied and transferred by a normal procedure, electronic watermark of each user is entered on the data content, and this clears the route of copying and transfer. When copying and transfer are repeated, noise in the data content increases by the entered electronic watermark, and this makes it possible to exclude and inhibit copying and transfer, i.e. to decrease the risk of illegitimate utilization.
Because a key used for encrypting the data content is stored at the key center, the key center can be utilized when a key escrow system or a key recovery system is used in a practical application.
Further, the secret-key can be used as user data, and the secret-key is encrypted using the public-key of the data cent and this is entered as electronic watermark. By decypting this using the private-key of the data center when necessary and by confirming the secret-key, it is possible to achieve a key escrow system or a key recovery system in simple manner but with high security.
[Embodiment 3]
Description is given below on a third embodiment of the invention referring to
The data management center stores the data content M0 of IP (information provider) in database in advance or the data content M0 is transferred from IP each time at the request of the first user U1.
As the user data, a user ID, a user E-mail address or a secret-key generated to the request of secret-key of the user can be used. Further, a random number prepared by the data center as the one specific for the user can be used.
Also, it may be designed in such a manner that the data management center combines the first user information (having data amount of several tens of bytes in general) with a first user public-key Kb1 (having data amount of about 1000 bits) and obtains a first user data I1 (having data amount of one thousand and several hundreds of bits), and that MD5 hash value of 16 bytes, obtained by tuning the first user data I1 to hash value by MD5 hash algorithm, can be used as the user data.
The scenario of the editing process of the data content M1 (information relating to electronic watermark such as the first user data) is stored to use for verification.
As a simplified procedure, the first user data I1 may be entered as electronic watermark Wi1 instead of the encrypted first user data Ci1kb0.
Here, the fee to use the data content M0 is charged.
The secret-keys Ks1 and Ks2 can be generated using the first user data I1. If the data content name and the first user data I1 are available, Ks1 can be generated again. Therefore, it will suffice that the data content name Tm0 and the first user data I1 are stored.
The secret-key may be selected each time from library of the key center instead of generating them.
Japanese Patent Laid Open 271865/1995, filed by the present inventor, describes a method to divide a copyright management program and to distribute respectively together with data content and key attached hereto.
This method can be applied to the secret-keys themselves, and the secret-key Ks1 can be divided to partial secret-keys Ks11 and Ks12 as:
Ks11+Ks12=Ks1
and the secret-key Ks2 can be divided to partial secret-keys Ks21 and Ks22 as:
Ks21+Ks22=Ks2.
The partial secret-keys Ks11 and Ks21 are distributed as partial secret-keys, and the remaining partial secret-keys Ks12 and Ks22 are attached to the data content and distributed. Then, the first user cannot engage any more in the management of the secret-keys Ks1 and Ks2.
In this case, the secret-key Ks1 is abandoned by a procedure such as overwriting of the secret-key Ks2 on the secret-key Ks1.
As a simplified procedure, the second user data. In may be entered as electronic watermark Wi2 instead of the encrypted second user data Ci2kb0.
The second user U2 specifies the data content name Tm0 to the data management center, presents the public-key Kb2 of the second user, and requests the distribution of the secret-key Ks2 for decryption and the secret-key Ks3 for re-encryption.
The secret-keys Ks2 and Ks3 at the second user are handled, and decrypted and stored in the same manner as the secret-keys Ks1 and Ks2 at the first user.
In this case, the secret-key Ks2 is abandoned by a procedure such as overeating of the secret-key Ks3 on the secret-key Ks2.
Then, the same procedure is repeated.
The embodiment as described above is arranged under the assumption that the distributed data content is utilized in real time, while it may be designed in such a manner that the data content obtained in advance and stored by the user is decrypted later and is used.
In such a case, the first user is at the position of the second user in the above embodiment, and a similar operation is performed.
As it is evident from the above description, the first user data is entered as electronic watermark in the data content obtained by the first user by the data center.
Therefore, if it is copied and transferred without taking a normal procedure, the data center verifies the electronic watermark entered therein, and it is detected that the first user has copied and transferred it without taking a normal procedure.
When it is copied and transferred by a normal procedure, electronic watermark of each user is entered in the data content, and this clears the route of copying and transfer. When copying and transfer are repeated, noise in the data content increases by the entered electronic watermark, and this makes it possible to exclude and inhibit copying and transfer, i.e. to decrease the risk of illegitimate utilization.
Because a key used for encrypting the data colt is stored at the data management center, the data management center can be utilized when a key escrow system or a key recovery system is used in a practical application
[Embodiment 4]
Description is given now on the fourth embodiment of the invention referring to
Unlike the first to the third embodiments, which relate to the data management system as a whole, the fourth embodiment is directed to data management operation on the user side. The flow chart shown in
In this embodiment, the data management program is arranged as an object program, and the user data and the secret-key are stored as instance variables in the slot of the object.
If not stored, the procedure of (3) above to store the first user data I1 to the data management program object is repeated.
The data content to be utilized is not the data content M0 obtained from the data management center, but it is the data content M1 where the user data I1 of the first user U1 is entered as electronic watermark. However, the electronic watermark gives no change to external appearance, and it can be used without any trouble.
If not stored, the procedure in (21) above to store the second user data I2 to the data management program object is repeated.
The data content to be used is not the data content M0 obtained from the data management center, but it is the data content M2 where the data I2 of the second user U2 is entered as electronic watermark. However, the electronic watermark gives no change to external appearance, and it can be used without any trouble.
By overwriting the electronic watermark W2 on the electronic watermark W1, such as only W2 is entered in the data content M2, it is possible to design in such a manner that a single electronic watermark is entered at all times and it is only the electronic watermark of the final user data. Or else, such as the electronic watermark W2 may be written at the same time without overwriting on the electronic watermark W1 in the data content M2, it is also possible that the electronic watermarks entered increase and these are the electronic watermarks of all of the user data.
Then the same procedure is repeated.
The first to the fourth embodiments as described above represent the cases where illegitimate use of the data under control of the data management center is prevented, i.e. a charged key is used for a charged data.
However, in the arrangement as described above, by replacing the data management center with a host of video conference, the first user with a guest of video conference, and the second and the subsequent users with observers of video conference, it is possible in the application for a video conference system to prevent leakage of the content of the conference.
Similarly, in the application for a digital cash system, by replacing the data management center with a client side bank, the first use with a client, and the second user with a shop, it is possible to improve security in the digital cash system.
In the system as described above, each of the users to utilize the system must be registered at the data management center in advance. At the time of registration, data management program is provided to the users.
In the present invention to utilize the data M, the first secret-key Ks1, the second secret-key Ks2 and the data management program are transferred to each user, and each user must store them.
As the place to store them, it is ideal to use an IC card now being propagated; in which an IC element is encapsulated in a card-like container, or in particular, to use a PC card where microprocessor is encapsulated.
Also, it is possible to design in such a manner that the data management program serves as an agent on the data management center side so that utilization status, transfer status, etc. of the data content are automatically reported when the user sends a request to use to the data management center.
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.
This application is a continuation of prior application Ser. No. 09/362,955 filed Jul. 30, 1999 now abandoned, which is a Division of prior application Ser. No. 08/825,868, filed Apr. 2, 1997 (now U.S. Pat. No. 6,002,772), which is a Continuation In Part of prior application Ser. No. 08/536,747 filed Sep. 29, 1995 (now U.S. Pat. No. 6,069,952) and a Continuation In Part of prior application Ser. No. 08/549,270, filed Oct. 27, 1995 (now Abandoned).
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 | 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 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 | Jun 1995 | A |
5438508 | Wyman | Aug 1995 | A |
5442541 | Hube et al. | Aug 1995 | A |
5442706 | Kung | Aug 1995 | A |
5444779 | Daniele et al. | 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 | 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 |
5651064 | Newell | Jul 1997 | A |
5666411 | McCarty | Sep 1997 | A |
5680452 | Shanton | Oct 1997 | A |
5689587 | Bender | 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 et al. | 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 | 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 | Dec 1998 | A |
5864683 | Boebert | Jan 1999 | A |
5867579 | Saito | Feb 1999 | A |
5872849 | Sudia | Feb 1999 | A |
5889868 | Moskowitz | 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 | 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 | May 2000 | A |
6076077 | Saito | Jun 2000 | A |
6081794 | Saito | Jun 2000 | A |
6091835 | Smithies et al. | Jul 2000 | A |
6097816 | Saito 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 |
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 |
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 |
20070033143 | Saito | Feb 2007 | A1 |
20070061267 | Saito | Mar 2007 | A1 |
20070174631 | Herrod et al. | Jul 2007 | A1 |
20100106659 | Stefik et al. | Apr 2010 | A1 |
20100122088 | Oxford | May 2010 | A1 |
Number | Date | Country |
---|---|---|
0121853 | Oct 1984 | EP |
0158167 | Mar 1985 | EP |
0199410 | Oct 1986 | EP |
0225010 | Jun 1987 | EP |
0341801 | Nov 1989 | EP |
0391261 | Mar 1990 | EP |
0459046 | Dec 1991 | EP |
0542298 | Nov 1992 | EP |
0 518 365 | Dec 1992 | EP |
0191162 | Feb 1993 | EP |
0532381 | Mar 1993 | EP |
0551016 | Jul 1993 | EP |
0590763 | Apr 1994 | EP |
590763 | Apr 1994 | EP |
0421808 | Dec 1994 | EP |
0649074 | Apr 1995 | EP |
0665486 | Aug 1995 | EP |
0430734 | Sep 1995 | EP |
0354774 | Apr 1996 | EP |
0715243 | Jun 1996 | EP |
0450841 | Aug 1996 | EP |
0561685 | Sep 1996 | EP |
0506435 | Oct 1996 | EP |
0677949 | 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 |
2231244 | Nov 1990 | GB |
58169000 | Oct 1983 | JP |
59169000 | Sep 1984 | JP |
60102038 | Jun 1985 | JP |
1048165 | Feb 1989 | JP |
64-061782 | Aug 1989 | JP |
3128541 | May 1991 | JP |
03-162152 | Jul 1991 | JP |
3265241 | Nov 1991 | JP |
03-282989 | Dec 1991 | JP |
04003224 | Jan 1992 | JP |
4181282 | Jun 1992 | JP |
4268844 | Sep 1992 | JP |
5056037 | Mar 1993 | JP |
5063142 | Mar 1993 | JP |
05063142 | Mar 1993 | JP |
5075597 | Mar 1993 | JP |
5122701 | May 1993 | JP |
05122701 | May 1993 | JP |
5276476 | Oct 1993 | JP |
05-298373 | 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 |
6-264201 | Sep 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 |
2546983 | Aug 1996 | JP |
08-272745 | Oct 1996 | JP |
8292976 | Nov 1996 | JP |
WO8503830 | Aug 1985 | WO |
WO8909528 | Oct 1989 | WO |
WO 9002382 | Mar 1990 | WO |
9116691 | Oct 1991 | WO |
9211598 | Jul 1992 | WO |
WO9307715 | Apr 1993 | WO |
WO 9520291 | Jul 1995 | WO |
WO9613113 | May 1996 | WO |
9618152 | Jun 1996 | WO |
WO9623257 | Aug 1996 | WO |
W09627259 | Sep 1996 | WO |
WO9627259 | Sep 1996 | WO |
WO9750036 | Dec 1997 | WO |
Entry |
---|
U.S. Appl. No. 11/496,777, filed Jul. 31, 2006, Saito. |
U.S. Appl. No. 11/491,400, filed Jul. 20, 2006, Saito. |
U.S. Appl. No. 11/480,690, filed Jul. 3, 2006, Saito. |
U.S. Appl. No. 11/446,604, filed Jun. 1, 2006, Saito. |
U.S. Appl. No. 11/404,124, filed Apr. 12, 2006, Saito. |
Harn, 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. II, Dec. 1, 1992, pp. 747-752, XP000332279. |
Lennil, P. “The IBM Microkernel Technology,” OS/2 Developer, vol. 5, Nov. 1, 1993 (pp. 70-72, 74) XP000672962. |
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. |
Kazunori Seki et al, “A Proposal of a New Distribution Scheme”, 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 (95-IS-45-3). |
U.S. Appl. No. 10/170,677, filed Jun. 13, 2002, Saito. |
U.S. Appl. No. 10/013,507, filed Dec. 13, 2001, Saito. |
U.S. Appl. No. 09/985,279, filed Nov. 2, 2001, Saito. |
U.S. Appl. No. 09/665,902, filed Sep. 20, 2000, Saito. |
U.S. Appl. No. 09/476,334, filed Jan. 30, 2000, Saito. |
U.S. Appl. No. 09/362,955, filed Jul. 30, 1999, Saito. |
U.S. Appl. No. 08/895,493, filed Jul. 16, 1997, Saito. |
U.S. Appl. No. 08/846,661, filed May 1, 1997, Saito. |
U.S. Appl. No. 08/733,504, filed Oct. 18, 1996, Saito. |
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. |
Kent, Stephen. T. “Internet Privacy Enhance Mail,” Association for Computing Machinery, Communications of the ACM, Aug. 1993, vol. 36, pp. 48-61. |
Communication from European Patent Office, Mitsubishi Corp. Dec. 12, 1998. |
Notice of Rejection mailed Oct. 15, 2002 from the Japanese Patent Office in Application No. 7-228366. |
Office Action dated Aug. 3, 2007 in U.S. Appl. No. 09/362,955, Saito. |
Saito; U.S. Appl. No. 11/701,943, filed Feb. 1, 2007. |
Office Action in U.S. Appl. No. 10/352,078 issued Dec. 12, 2011, 10 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/496,777 issued Mar. 17, 2011, 12 pages. |
Notice of Allowance in U.S. Appl. No. 11/469,035 issued Mar. 1, 2011, 6 pages. |
Notice of Inquiry from the Appeal Board in Japanese Application No. 2006-198703 issued Jan. 19, 2011, 3 pages. English Translation Available. |
Official Action in U.S. Appl. No. 10/352,078 issued Apr. 4, 2011, 14 pages. |
Official Action in U.S. Appl. No. 11/512,695 issued May 26, 2011, 34 pages. |
Saito; U.S. Appl. No. 08/549,270, filed Oct. 27, 1995. |
Saito; U.S. Appl. No. 11/701,945, filed Feb. 1, 2007. |
Saito; U.S. Appl. No. 11/701,946, filed Feb. 1, 2007. |
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. |
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, 18 pages. |
Official Action in U.S. Appl. No. 10/105,262 issued Aug. 8, 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. |
Official Action in European Application No. 06014713.9 issued Oct. 21, 2010, 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. |
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. |
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. |
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 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. |
European Search Report for European Application No. 95115068 dated Jun. 30, 1999, 2 pages. |
Notice of Rejection in Japanese Patent Application No. 7-228366, mailed Jul. 15, 2003, 10 pages. English Translation Available. |
Notice of Final Decision of Rejection, Japan Patent Application No. 7-228366, dated Nov. 11, 2003, English Translation Available. |
European Search Report for European Application No. 95116615.6 dated Dec. 1, 1998, 2 pages. |
Official Action in Japanese Application No. 2004-149423 dated Oct. 30, 2007, 2 pages. English Translation Available, 2 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. |
Search Report dated Oct. 24, 2002. |
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 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,695 issued Apr. 16, 2010, 18 pages. |
Official Action in U.S. Appl. No. 11/512,695 issued Nov. 18, 2010, 30 pages. |
Interference Initial Memorandum in U.S. Appl. No. 09/097,877, 1 page. |
Office Action in U.S. Appl. No. 13/179,723 issued Dec. 7, 2012, 5 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. |
Office Action in U.S. Appl. No. 11/496,777 issued Jun. 17, 2013, 14 pages. |
U.S. Appl. No. 11/556,992, filed Nov. 6, 2006, Saito. |
U.S. Appl. No. 11/469,035, filed Aug. 31, 2006, Saito. |
U.S. Appl. No. 11/512,885, filed Aug. 29, 2006, Saito. |
U.S. Appl. No. 11/512,695, filed Aug. 29, 2006, Saito. |
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 pgs. |
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, P. “Digital Copyright Protection” AP Professional, 1997, pp. 1-7 and 14-17. |
Menezes, Alfred, et al., “Handbook of Applied Cryptography” 1997, sec. 11.5.1, CRC Press, pp. 452-454. |
Fitch, K. “User Authentication and Software Distribution on the Web”, ausweb97@scu.edu.au 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, vol. 32, No. 9, Oct. 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. |
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. |
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 . . . ” 18th International Television Symposium and Technical Exhibition, Montreaux, Switzerland, Jun. 10-15, 1993, pp. 761-768. |
Office Action in European Application No. 06014713.9 issued Jun. 28, 2012, 6 pages. |
Office Action in U.S. Appl. No. 10/352,078 issued Aug. 25, 2011, 34 pages. |
Number | Date | Country | |
---|---|---|---|
20060282674 A1 | Dec 2006 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 08825868 | Apr 1997 | US |
Child | 09362955 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09362955 | Jul 1999 | US |
Child | 11441973 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 08536747 | Sep 1995 | US |
Child | 08825868 | US | |
Parent | 08549270 | Oct 1995 | US |
Child | 08536747 | US |