International Business Machines Corporation

Globalfoundries Inc.

John Bernard Geagan, Iii

Dulce Beatriz Ponceleon

An encryption scheme is provided in which subset-difference lists are generated by blacklisting subsets corresponding to compromised devices and splitting subset difference lists corresponding to the blacklisted subsets into multiple subset difference lists. In some embodiments, a subset-difference tree is generated. The subset-difference tree includes a plurality of subsets. The subset-difference tree covers a plurality of nodes. Each of the plurality of subsets has an apex node among the plurality of nodes. At least one blacklisted node of the plurality of nodes is determined. A first subset among the plurality of subsets is identified that covers the at least one blacklisted node. A plurality of substitute subsets is determined. Each of the plurality of substitute subsets overlaps the first subset and does not cover the at least one blacklisted node. The plurality of substitute subsets are substituted for the first subset.

Subset-difference broadcast encryption with blacklisting

A system architecture providing memory encryption suitable for protection against liquid nitrogen and trace probe attacks. In one embodiment, a method of and system for memory encryption are provided. A write request is received at a memory controller. The write request includes first data and a first address. The memory controller is embedded in a CPU and is operatively coupled to memory external to the CPU. The first data are encrypted at the memory controller to generate encrypted first data. The encrypted first data are written to the memory.

System architecture for encrypting external memory

Encryption key block generation with barrier descriptors is provided. In some embodiments, a descriptor is read. The descriptor includes a list of revoked devices and a list of boundaries between devices. A plurality of subset differences is generated. The plurality of subset-differences covers a plurality of devices. None of the plurality of devices appears in the list of revoked devices. None of the plurality of subset differences spans any of the boundaries. Encrypted information is generated based on the subset differences.

Encryption key block generation with barrier descriptors

Space-efficient methods of defining a key allocation scheme within a broadcast encryption system are provided. In some embodiments, a descriptor is received. The descriptor includes a plurality of subset definitions and a plurality of pointers. A data segment is resolved from each of the plurality of pointers. The resulting data segments are assembled into a plurality of variant definitions. A media key block is generated from the plurality of subset definitions and the plurality of variant definitions.

Reduced size key allocation descriptors

Embodiments of the present invention relate to searching for secret data through an untrusted searcher without exposing the secret data. In one embodiment, a method of and computer program product for searching for secret data through an untrusted searcher is provided. A secret value is read from a storage medium. The secret value is divided into a plurality of portions. Each of the plurality of portions is ranked. A subset of the secret value is determined from the ranking of the plurality of portions. A search string is constructed from the subset. The search string is transmitted to a searcher via a network. Search results are received from the searcher via the network. The search results are compared to the secret value to determine whether the searcher found the secret value.

Searching for secret data through an untrusted searcher

Embodiments of the present invention relate to time delayed release of previously distributed digital content. In one embodiment, a method of and computer program product for low-bandwidth time-embargoed content disclosure are provided. A first cryptographic key is received. Encrypted content is received, encoded in a computer readable medium. A correction value is received. A predetermined function is applied to the first cryptographic key and the correction value to determine a second cryptographic key. The second cryptographic key is applied to the encrypted content to obtain decrypted content.

Low-bandwidth time-embargoed content disclosure

Embodiments of the invention relate to encoding multi-channel media content. In one embodiment, a set of multi-channel media content is received. The set of multi-channel media content includes a plurality of content frames. Each content frame includes a first channel content frame and second channel content frame. Each of the first channel content frames is grouped into a first group of content frames. Each of the second channel content frames is grouped into a second group of content frames. Each content frame in the first group of content frames is encoded. At least a first content frame in the first group of content frames includes at least one variation, where the variation is a different version of the first content frame. Each content frame in the second group of content frames is also encoded, where the second group of content frames is absent any content frames including a variation.

Forensics in multi-channel media content

Embodiments of this disclosure relate to binary tree structures, and more specifically to assigning resources to a binary tree structure, such as for content protection. In embodiments, a total number of resources in a first category of resources is identified. The resources may be devices that play encryption protected content such as a CD, a DVD, an HD DVD, a BD, and a Secure Digital card, for example. In embodiments, a minimum number of dummy resources are assigned to a corresponding number of leaf nodes of the binary tree structure before resources in the first category of resources are assigned to leaf nodes in the binary tree structure. Generally, the minimum number of dummy resources is greater than or equal to 1+floor(2^floor(log2(N)&#x2212;1)), wherein N is greater than or equal to the total number of resources in the first category of resources.

Growing community of inventors

San Jose, CA, United States of America

John Bernard Geagan, Iii