System and Method for Authenticating an Operating System to a Central Processing Unit, Providing the CPU/OS with Secure Storage, and Authenticating the CPU/OS to a Third Party
    6.
    发明申请
    System and Method for Authenticating an Operating System to a Central Processing Unit, Providing the CPU/OS with Secure Storage, and Authenticating the CPU/OS to a Third Party 有权
    用于向中央处理单元验证操作系统的系统和方法,向CPU / OS提供安全存储,以及向第三方认证CPU / OS

    公开(公告)号:US20070118769A1

    公开(公告)日:2007-05-24

    申请号:US11615361

    申请日:2006-12-22

    IPC分类号: G06F12/14

    摘要: In accordance with certain aspects, a chain of trust is established between a subscriber unit and a content provider. A request is submitted from the subscriber unit to the content provider. A challenge nonce is generated at the content provider and returned to the subscriber unit. At the subscriber unit, an operating system (OS) certificate containing an identity of the operating system from the software identity register, information describing the operating system, the challenge nonce, and a CPU public key is formed, and the OS certificate is signed using a CPU private key. The OS certificate and a CPU manufacturer certificate supplied by a manufacturer of the CPU are passed from the subscriber unit to the content provider, and are evaluated at the content provider to determine whether to reject or fulfill the request.

    摘要翻译: 根据某些方面,在用户单元和内容提供商之间建立信任链。 从用户单元向内容提供商提交请求。 挑战随机数在内容提供者处产生并返回到用户单元。 在订户单元处,形成包含来自软件身份寄存器的操作系统的身份的操作系统(OS)证书,描述操作系统的信息,挑战随机数和CPU公钥,并且使用 一个CPU私钥。 由CPU制造商提供的OS证书和CPU制造商证书从用户单元传递到内容提供商,并在内容提供商处进行评估,以确定是否拒绝或完成请求。

    MODEL-BASED ACCESS CONTROL
    7.
    发明申请
    MODEL-BASED ACCESS CONTROL 审中-公开
    基于模型的访问控制

    公开(公告)号:US20080244736A1

    公开(公告)日:2008-10-02

    申请号:US11694014

    申请日:2007-03-30

    IPC分类号: G06F12/14

    CPC分类号: G06F21/604 G06F21/6218

    摘要: Access control as it relates to policies or permissions is provided based on a created model. A security policy is abstracted and can be independent of a mechanism used to protect resources. An asbstract model of a potential user, user role and/or resource is created without associating a specific individual and/or resource with a model. These abstract user models and abstract resource models can be used across applications or within disparate applications. The abstracted security policies can be selectively applied to the model. Specific users and/or resources can be associated with one or more abstract user model or abstract resource model. The models can be nested to provide configurations for larger systems.

    摘要翻译: 基于创建的模型提供与策略或权限相关的访问控制。 安全策略被抽象出来,可以独立于用于保护资源的机制。 创建潜在用户,用户角色和/或资源的抽象模型,而不将特定个人和/或资源与模型相关联。 这些抽象用户模型和抽象资源模型可以跨应用程序或不同的应用程序使用。 抽象的安全策略可以选择性地应用于模型。 特定用户和/或资源可以与一个或多个抽象用户模型或抽象资源模型相关联。 这些型号可以嵌套,以提供更大系统的配置。

    Key-based secure storage
    8.
    发明申请
    Key-based secure storage 有权
    基于密钥的安全存储

    公开(公告)号:US20060021064A1

    公开(公告)日:2006-01-26

    申请号:US11221047

    申请日:2005-09-07

    IPC分类号: H04L9/32

    摘要: A one-way hash function is applied to a seed supplied by an application to produce a hashed seed that is used to generate the application storage key. A one-way hash function is applied to a seed supplied by a user to produce a first hashed seed that is passed to a keyed hash function, which is keyed to an identity for the user, to produce a second hashed seed. The second hashed seed is used to generate the user storage key. An operating system storage key is generated from an unhashed seed. One of the storage keys is used to encrypt the downloaded content. An access predicate attached to the content when it is downloaded is associated with the storage key to enforce certain limitations on the access of the content.

    摘要翻译: 单向散列函数应用于由应用程序提供的种子以产生用于生成应用程序存储密钥的散列种子。 单向散列函数被应用于由用户提供的种子以产生第一散列种子,该第一散列种子被传递给键入的哈希函数,其被键入用户的身份,以产生第二散列种子。 第二个散列种子用于生成用户存储密钥。 从未分解的种子生成操作系统存储密钥。 其中一个存储密钥用于加密下载的内容。 在下载时附加到内容的访问谓词与存储密钥相关联,以对内容的访问执行某些限制。

    Distributed transaction processing using two-phase commit protocol with
presumed-commit without log force
    9.
    发明授权
    Distributed transaction processing using two-phase commit protocol with presumed-commit without log force 失效
    分布式事务处理使用两阶段提交协议与推定提交无日志强制

    公开(公告)号:US5335343A

    公开(公告)日:1994-08-02

    申请号:US909556

    申请日:1992-07-06

    摘要: A two-phase commit protocol for a distributed transaction processing system employs the presumed-commit configuration, with the exception that the new presumed-commit protocol coordinator needs to force-write only a "commit" log record for committed transactions, not the previous force writing of two log records. In order to provide information needed to allow the coordinator to answer inquiries from subordinate processes following a crash or loss of communications, a technique for circumscribing the set of indeterminate transactions is employed. The transactions are numbered in increasing order, identified by a transaction ID (T.sub.-- ID). The commit protocol is not allowed to begin unless the transaction ID of the committing transaction is within some preselected range of numbers starting from the highest-numbered stably-recorded transaction ID. That is, if the transaction number is too far removed from the highest TID of a stably stored log record (written to disk storage and able to survive a crash), then log records are written to disk until this condition hold. This may require writing to a disk log record for the committing transaction. Most commit transactions can, however, proceed without waiting for a disk write (forced log), and so performance is improved. A technique is disclosed for circumscribing the set of indeterminate transactions (not shown whether they committed, aborted or never started) so that information is small. It must be "permanently" retained, but the coordinator can store some of it in a cache (volatile memory) to answer inquiries.

    摘要翻译: 分布式事务处理系统的两阶段提交协议采用假定提交配置,除了新的推定提交协议协调器需要强制写入已提交事务的“提交”日志记录,而不是先前的强制 写两个日志记录。 为了提供所需的信息,允许协调者在通信崩溃或丢失之后回答下属进程的询问,采用限定一组不确定交易的技术。 交易按照递增顺序编号,由交易ID(T-ID)标识。 提交协议不允许开始,除非提交事务的事务ID处于从最高编号的稳定记录的事务ID开始的一些预选的数字范围内。 也就是说,如果交易号码远离稳定存储的日志记录的最高TID(写入磁盘存储并能够在崩溃中生存)太远,则将日志记录写入磁盘,直到此条件成立为止。 这可能需要写入提交事务的磁盘日志记录。 然而,大多数提交事务可以在不等待磁盘写入(强制日志)的情况下进行,因此性能得到改善。 公开了一种用于限制一组不确定事务(未示出,是否提交,中止或从未启动)的技术,使得信息很小。 它必须“永久”保留,但协调器可以将其中的一些存储在缓存(易失性存储器)中以回答查询。

    Computer network with modified host-to-host encryption keys
    10.
    发明授权
    Computer network with modified host-to-host encryption keys 失效
    具有修改的主机到主机加密密钥的计算机网络

    公开(公告)号:US5268962A

    公开(公告)日:1993-12-07

    申请号:US917870

    申请日:1992-07-21

    摘要: In a computer network, each pair of host computers that need to exchange data packets establish a single host-to-host encryption/decryption key. Then, whenever one host computer sends a data packet to the other host computer, it first forms a predefined logical combination of the established host-to-host key and the destination buffer index to which the data packet is being sent, and then uses the resulting value to encrypt the secure portions of the data packet. The destination buffer index is included in the data packet's header, which is not encrypted. When the receiving host computer receives the encrypted data packet, it reads the destination buffer index from the packet header, forms the same predefined logical combination of the established host-to-host key and the destination buffer index to generate a decryption key, and uses the computed decryption key to decrypt the secure portions of the received data packet. If the destination buffer index in the received data packet has been modified either by noise or by an interloper, the decryption key computed by the receiving host computer will be different from the encryption key used by the sending host computer, and therefore the portions of the received data packet decrypted using the computed decryption key will be unintelligible. Thus, interlopers are prevented from breaching the confidentiality of encrypted data.