H04L9/0836

NUTS: flexible hierarchy object graphs

A lock node for storing data and a protected storage unit. The lock node includes an input section which provides a plurality of key maps, each corresponding to one of a plurality of primary keys, respectively, applied to the input section, each key map including at least one main key, a variable lock section producing a derived key from a logical operation on the main keys corresponding to the primary keys applied to the input section, and an output section producing the data in response to the derived key.

Dynamic response signing capability in a distributed system

A system that provides responses to requests obtains a key that is used to digitally sign the request. The key is derived from information that is shared with a requestor to which the response is sent. The requestor derives, using the shared information, derives a key usable to verify the digital signature of the response, thereby enabling the requestor to operate in accordance with whether the digital signature of the response matches the response.

Policy-enabled encryption keys having complex logical operations
11537195 · 2022-12-27 · ·

Examples described herein relate to a system for orchestrating a security object, including a memory and processor configured to define a plurality of complex policies in a database, wherein the complex policies comprises one or more of EQUAL policy, ONE-OF policy, MEMBER OF policy, NULL policy, NOT-NULL policy, GREATER-THAN policy, GREATER-THAN-OR-EQUAL-TO policy, LESS-THAN policy, or LESS-THAN-OR-EQUAL-TO policy, receive the security object and at least one object attribute associated with the security object, determine acceptability of the security object based, at least in part, on the at least one object attribute and at least one of the plurality of complex policies corresponding to the at least one object attribute, and distribute the security object to at least one communication device associated with the processor when the security object is determined to be acceptable, wherein the at least one communication device establishes communication based, at least in part, on the security object.

Encryption key management for international data residency

Media, method, and system for providing encryption key management for international data residency. Organizations using a group-based communication system can designate a particular geopolitical area where that organization's data can be stored and another geopolitical area (which may be the same or different) where encryption keys used to encrypt and decrypt that data should be stored. Users of that organization can post message or access messages previously posted on the group-based communication system from any geopolitical area, causing the system to automatically store and retrieve messages and encryption keys from the appropriate regions to allow the users to transparently access the group-based communication system while maintaining security and data residency requirements.

Apparatus and method for securely managing keys

An integrated circuit includes a system memory, a security processor and a non-security processor. An attack against the integrated circuit is made more difficult based on using a key generated by the security processor. The security processor, as an example, reads a program image from the system memory and generates the key based on the program image. In some instances, a dedicated communication channel is provided for communication between the non-security processor and the security processor. The dedicated channel may be used to provide the key to the non-security processor for performance of a security operation.

Subset-difference broadcast encryption with blacklisting

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.

LOCKING BLOCKCHAIN BLOCKS FOR DATA SECURITY FOR FINITE LENGTH BLOCKCHAINS
20220393876 · 2022-12-08 ·

The present specification discloses a blockchain having a finite number of blockchain blocks secured in a loop with a locking blockchain block executed by instructions stored on a non-volatile computer tangible medium. The blockchain has a genesis blockchain block and a terminating blockchain block that ends the blockchain. The blockchain also has a blockchain lock block that includes a hash digest based on a hash digest from the genesis blockchain block and a hash digest from the terminating blockchain block. The blockchain lock block logically locks the genesis blockchain block to the terminating blockchain block forming the blockchain into a loop by cryptographically linking the genesis blockchain block to the terminating blockchain block, thereby preventing the addition of new blockchain blocks in the blockchain that continue a conventional blockchain through hashes based on just the previous blockchain block.

Pyramid construct with trusted score validation
11522670 · 2022-12-06 · ·

Disclosed herein are systems and methods for decentralized data distribution by a database network system comprising a hierarchical blockchain model. The hierarchical blockchain model may comprise a quantum pyramid consensus to distribute data throughout the database network system in a decentralized and secure manner. The hierarchical construct may be built according to trusted scores calculated for the nodes of the network over their lifetime at the network.

Secure boot of kernel modules

A computer-implemented method for providing a secured updated kernel module of an electronic device, wherein the method comprises the following steps: inserting by a computer a chameleon hash of a kernel module, a kernel module private key of the kernel module and an updated kernel module of the kernel module in a chameleon hash collision function thereby obtaining a collision data, combining by the computer, the updated kernel module with the collision data obtaining thereby a secured updated kernel module. Additionally, it is further described a computer-implemented method for secure updating at least one kernel module of an electronic device, a system comprising a server and an electronic device, computer programs and a computer-readable medium.

ENCRYPTION KEY MANAGEMENT FOR INTERNATIONAL DATA RESIDENCY

Media, method, and system for providing encryption key management for international data residency. Organizations using a group-based communication system can designate a particular geopolitical area where that organization's data can be stored and another geopolitical area (which may be the same or different) where encryption keys used to encrypt and decrypt that data should be stored. Users of that organization can post message or access messages previously posted on the group-based communication system from any geopolitical area, causing the system to automatically store and retrieve messages and encryption keys from the appropriate regions to allow the users to transparently access the group-based communication system while maintaining security and data residency requirements.