최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
DataON 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Edison 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Kafe 바로가기국가/구분 | United States(US) Patent 등록 |
---|---|
국제특허분류(IPC7판) |
|
출원번호 | US-0819063 (2000-09-28) |
발명자 / 주소 |
|
출원인 / 주소 |
|
대리인 / 주소 |
|
인용정보 | 피인용 횟수 : 110 인용 특허 : 425 |
A descriptive data structure provides an abstract representation of a rights management data structure such as a secure container. The abstract representation may describe, for example, the layout of the rights management data structure. It can also provide metadata describing or defining other char
A descriptive data structure provides an abstract representation of a rights management data structure such as a secure container. The abstract representation may describe, for example, the layout of the rights management data structure. It can also provide metadata describing or defining other characteristics of rights management data structure use and/or processing. For example, the descriptive data structure can provide integrity constraints that provide a way to state rules about associated information. The abstract representation can be used to create rights management data structures that are interoperable and compatible with one another. This arrangement preserves flexibility and ease of use without compromising security.
We claim: 1. A data structure embodied on a computer-readable medium, the data structure comprising: information that identifies, at least in part, a first digital object; a first target data block, the first target data block specifying rights pertaining to the first digital object, the first tar
We claim: 1. A data structure embodied on a computer-readable medium, the data structure comprising: information that identifies, at least in part, a first digital object; a first target data block, the first target data block specifying rights pertaining to the first digital object, the first target data block being written in a first format; and a second target data block, the second target data block specifying rights pertaining to the first digital object, the second target data block being written in a second format, the second format being different from the first format. 2. A data structure as in claim 1, further comprising: a first cryptographic seal, the first cryptographic seal having been created using a key associated with a creator of the data structure. 3. A data structure as in claim 2, further comprising: a second cryptographic seal, the second cryptographic seal being associated with the first target data block; and a third cryptographic seal, the third cryptographic seal being associated with the second target data block. 4. A data structure as in claim 3, in which the second cryptographic seal and the third cryptographic seal are created using the key associated with the creator of the data structure. 5. A data structure as in claim 4, in which the key comprises a private key of an asymmetric key pair. 6. A data structure as in claim 5, further comprising: a public key of the asymmetric key pair. 7. A data structure as in claim 6, in which the public key is certified by a certifying authority. 8. A data structure as in claim 5, in which the first cryptographic seal comprises an encrypted hash of at least part of the data structure, the hash being encrypted with the key. 9. A data structure as in claim 8, in which the data structure further comprises a header, and the hash comprises a hash of at least part of the header. 10. A data structure as in claim 4, in which the second cryptographic seal is created by encrypting a hash of at least part of the first target data block using the key associated with the creator of the data structure, and in which the third cryptographic seal is created by encrypting a hash of at least part of the second target data block using the key associated with the creator of the data structure. 11. A data structure as in claim 10, in which the first target data block includes a header, and in which the hash of at least part of the first target data block comprises a hash of at least part of the first target data block's header. 12. A data structure as in claim 11, in which the second target data block includes a header, and in which the hash of at least part of the second target data block comprises a hash of at least part of the second target data block's header. 13. A data structure as in claim 1, further comprising: a data structure identification number. 14. A data structure as in claim 13, further comprising: a first target data block identification number; and a second target data block identification number. 15. A data structure as in claim 14, in which the first data structure identification number, the first target data block identification number, and the second target data block identification number each comprise a unique identification number. 16. A data structure as in claim 1, further comprising: a third target block, the third target block specifying rights pertaining to the first digital object, the third target block being written in a third format, the third format being different from the first format and the second format. 17. A data structure as in claim 1, in which the first target block and the second target block express at least some of the same rights. 18. A data structure as in claim 1, in which the first target block is understandable by a first rights management environment, and the second target block is understandable by a second rights management environment that is unable to understand the first target block. 19. A data structure as in claim 1, in which the first digital object comprises executable code. 20. A data structure as in claim 1, in which the first digital object comprises at least one of: textual electronic content, audio electronic content, video electronic content, and graphical electronic content. 21. A data structure as in claim 1, in which the data structure is machine readable. 22. A data structure as in claim 17, in which the rights specify one or more permitted operations on the first digital object. 23. A data structure as in claim 22, in which the rights further specify an authorized extent of the one or more permitted operations. 24. A data structure as in claim 23, in which the rights specify a number of copies that may be made of the first digital object. 25. A data structure as in claim 22, in which the rights further specify at least one consequence of performing the one or more permitted operations. 26. A data structure as in claim 17, in which the rigths specify one or more required operations on the first digital object. 27. A data structure as in claim 1, further comprising: information that identifies, at least in part, a second digital object. 28. A data structure as in claim 27, further comprising: a third target data block, the third target data block specifying rights pertaining to the second digital object. 29. A data structure as in claim 27, in which the first target data block specifies rights pertaining to the second digital object, and in which the second target data block specifies rights pertaining to the second digital object. 30. A computer program product embodied on a computer-readable medium, the computer program product including instructions which, when executed by a computer system in a first rights management environment, cause the system to perform actions comprising: receiving a digital object; receiving a data structure associated with the digital object, the data structure containing a first target data block and a second target data block, the first target data block being adapted for use in the first rights management environment, and the second target data block being adapted for use in a second rights management environment; and enforcing at least one rule located within, or referenced by, the first target data block to control at least one use of said digital object. 31. A computer program product as in claim 30, further including instructions which, when executed by a computer system in a first rights management environment, cause the system to perform actions comprising: calculating a hash of at least part of the first target data block; decrypting an encrypted hash value received in said data structure; and comparing the calculated hash with the decrypted hash. 32. A computer program product as in claim 30, further including instructions which, when executed by a computer system in a first rights management environment, cause the system to perform actions comprising: evaluating a measure of trust associated with a source of said data structure, wherein said action of enforcing at least one rule is selectively performed based at least in part on a result of said evaluating step. 33. A rights management method comprising: receiving a digital object in a first rights management environment; receiving a data structure associated with the digital object, the data structure containing a first target data block and a second target data block, the first target data block being designed for use in the first rights management environment, and the second target data block being designed for use in a second rights management environment; and enforcing at least one rule located within, or referenced by, the first target data block to control at least one use of said digital object, wherein the first rights management environment defines rules pertaining to the use of objects in a manner that is substantially incompatible with the manner by which the second rights management environment defines rules pertaining to the use of objects. 34. A method as in claim 33, further comprising: calculating a hash of at least part of the first target data block; decrypting an encrypted hash value received in said data structure; and comparing the calculated hash with the decrypted hash. 35. A method as in claim 33, in which the digital object and the data structure are received together. 36. A method as in claim 33, further comprising: evaluating a measure of trust associated with a source of said data structure, wherein said enforcing step is selectively performed based at least in part on a result of said evaluating step. 37. A method as in claim 33, in which the first rights management environment comprises a computer running a first rights management system, and in which the second rights management environment comprises a computer running a second rights management system.
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.