Method for assigning encryption keys
    2.
    发明授权
    Method for assigning encryption keys 有权
    分配加密密钥的方法

    公开(公告)号:US06888944B2

    公开(公告)日:2005-05-03

    申请号:US09777506

    申请日:2001-02-05

    摘要: Sets of encryption keys useful by devices for decrypting encrypted content are defined using an error-correcting code such as a Reed-Solomon code to define vectors of length “n” over an alphabet of (0, . . . , N−1), wherein “n” is the number of columns in a key matrix and “N” is the number of rows in the matrix. Each vector represents a set of keys that can be assigned to a device. With this invention, overlap between sets of keys can be minimized to minimize the possibility that the key set of an innocent device might be inadvertently revoked when the key set of a compromised device is revoked. Also, only the generating matrix of the error-correcting code and the index of one set of keys need be stored in memory, since all previously defined key sets can be regenerated if need be from just the generating matrix and index.

    摘要翻译: 使用诸如里德 - 所罗门码的纠错码来定义加密内容解密设备所使用的加密密钥集合,以在(0,...,N-1)的字母表上定义长度为“n”的向量, 其中“n”是键矩阵中的列数,“N”是矩阵中的行数。 每个向量表示可以分配给设备的一组密钥。 利用本发明,可以最小化密钥组之间的重叠,以最小化当被破坏的设备的密钥组被撤销时,无辜设备的密钥组可能被无意中撤销的可能性。 此外,只有纠错码的生成矩阵和一组密钥的索引需要存储在存储器中,因为如果需要仅来自生成矩阵和索引,则可以重新生成所有先前定义的密钥集。

    Method for broadcast encryption and key revocation of stateless receivers
    4.
    发明授权
    Method for broadcast encryption and key revocation of stateless receivers 有权
    无状态接收机的广播加密和密钥撤销方法

    公开(公告)号:US07925025B2

    公开(公告)日:2011-04-12

    申请号:US12061084

    申请日:2008-04-02

    摘要: A tree is used to partition stateless receivers in a broadcast content encryption system into subsets. Two different methods of partitioning are disclosed. When a set of revoked receivers is identified, the revoked receivers define a relatively small cover of the non-revoked receivers by disjoint subsets. Subset keys associated with the subsets are then used to encrypt a session key that in turn is used to encrypt the broadcast content. Only non-revoked receivers can decrypt the session key and, hence, the content.

    摘要翻译: 一棵树用于将广播内容加密系统中的无状态接收器分成子集。 公开了两种不同的分割方法。 当识别出一组撤销的接收者时,撤销的接收者通过不相交的子集定义非撤销的接收者的相对较小的覆盖。 与子集相关联的子集密钥然后用于加密会话密钥,会话密钥又用于加密广播内容。 只有非撤销的接收者可以解密会话密钥,因此可以解密内容。

    METHOD FOR BROADCAST ENCRYPTION AND KEY REVOCATION OF STATELESS RECEIVERS
    5.
    发明申请
    METHOD FOR BROADCAST ENCRYPTION AND KEY REVOCATION OF STATELESS RECEIVERS 有权
    广播加密的方法和无状态接收者的关键重现

    公开(公告)号:US20080192939A1

    公开(公告)日:2008-08-14

    申请号:US12061084

    申请日:2008-04-02

    IPC分类号: H04L9/14 H04L9/08 H04L9/28

    摘要: A tree is used to partition stateless receivers in a broadcast content encryption system into subsets. Two different methods of partitioning are disclosed. When a set of revoked receivers is identified, the revoked receivers define a relatively small cover of the non-revoked receivers by disjoint subsets. Subset keys associated with the subsets are then used to encrypt a session key that in turn is used to encrypt the broadcast content. Only non-revoked receivers can decrypt the session key and, hence, the content.

    摘要翻译: 一棵树用于将广播内容加密系统中的无状态接收器分成子集。 公开了两种不同的分割方法。 当识别出一组撤销的接收者时,撤销的接收者通过不相交的子集定义非撤销的接收者的相对较小的覆盖。 与子集相关联的子集密钥然后用于加密会话密钥,会话密钥又用于加密广播内容。 只有非撤销的接收者可以解密会话密钥,因此可以解密内容。

    Method for broadcast encryption and key revocation of stateless receivers
    7.
    发明授权
    Method for broadcast encryption and key revocation of stateless receivers 失效
    无状态接收机的广播加密和密钥撤销方法

    公开(公告)号:US07698551B2

    公开(公告)日:2010-04-13

    申请号:US11117677

    申请日:2005-04-28

    IPC分类号: H04L9/00

    摘要: A tree is used to partition stateless receivers in a broadcast content encryption system into subsets. Two different methods of partitioning are disclosed. When a set of revoked receivers is identified, the revoked receivers define a relatively small cover of the non-revoked receivers by disjoint subsets. Subset keys associated with the subsets are then used to encrypt a session key that in turn is used to encrypt the broadcast content. Only non-revoked receivers can decrypt the session key and, hence, the content.

    摘要翻译: 一棵树用于将广播内容加密系统中的无状态接收器分成子集。 公开了两种不同的分割方法。 当识别出一组撤销的接收者时,撤销的接收者通过不相交的子集定义非撤销的接收者的相对较小的覆盖。 与子集相关联的子集密钥然后用于加密会话密钥,会话密钥又用于加密广播内容。 只有非撤销的接收者可以解密会话密钥,因此可以解密内容。

    Method for assigning encryption keys
    9.
    发明授权
    Method for assigning encryption keys 有权
    分配加密密钥的方法

    公开(公告)号:US06947563B2

    公开(公告)日:2005-09-20

    申请号:US09789451

    申请日:2001-02-20

    摘要: An encryption key matrix has rows grouped into segments, with a set of one segment per column establishing a slot. Slots are assigned to device manufacturers, with the keys of the slots then being assigned to decryption devices made by the respective manufacturer. In generating the slots, the number “q” of segments in a column is first defined such that a predetermined maximum number of devices can be revoked devices (in that all the keys held by the device are revoked) while ensuring that a good device remains a functional device with a probability of at least (1−Q), wherein Q is a predefined device confidence. Once the number “q” of segments has been defined, the slots themselves are defined in a provably non-discriminatory fashion using an error-correcting code such as a Reed-Solomon code. With this invention, overlap between slots can be minimized to minimize the possibility that the key set of an innocent device might be inadvertently revoked when the keys in the slots of a “bad” manufacturer are revoked.

    摘要翻译: 加密密钥矩阵将行分组成段,每列建立一个段的一组。 插槽被分配给设备制造商,然后插槽的密钥被分配给由相应制造商制造的解密设备。 在产生时隙中,首先定义列中的段数“q”,使得可以撤销预定的最大数量的设备(因为设备保持的所有密钥被撤销),同时确保良好设备保持 具有至少(1-Q)的概率的功能设备,其中Q是预定义的设备置信度。 一旦已经定义了段数“q”,则使用纠错码(例如里德 - 所罗门码)以可证明的非歧视方式来定义时隙本身。 利用本发明,可以最小化时隙之间的重叠,以最小化当“坏”制造商的时隙中的密钥被撤销时,无辜设备的密钥组可能被无意中撤销的可能性。