A content recording apparatus includes an obtaining unit which obtains a content having a variable-length packet structure, an encrypter which generates encrypted data by encrypting the content, and a recorder which records the encrypted data in a block unit having a fixed length in a recording medium. The encrypted data includes an invalidated region unnecessary for reproduction of the content. The recorder records a size of the invalidated region in the recording medium.

A self-correcting memory system comprising an integrated circuit including memory and memory content authentication functionality, which is operative to compare content to be authenticated to a standard and to output “authentic” if the content to be authenticated equals the standard and “non-authentic” otherwise; and error correction functionality which is operative to apply at least one possible correction to at least one erroneous word entity in said memory, yielding a possibly correct word entity, call said authentication for application to the possibly correct word entity, and if the authentication's output is “authentic”, to replace said erroneous word entity in said memory, with said possibly correct word entity thereby to yield error correction at a level of confidence derived from the level of confidence associated with the authentication.

A first string, having a first string value, that is associated with a sample set of material is received, wherein a second string, having a complementary value relative to the first string value, is also associated with the sample set of material. A determinative hash is generated using the first string value and a symmetric generator polynomial. A second hash, corresponding to the second string, is generated directly from the determinative hash. A canonized hash is generated using the determinative hash and the second hash. It is determined whether at least one of the first string or the second string is stored in string storage that is configured to store a plurality of strings, including by searching a hash table for the canonized hash; in the event it is determined that at least one of the first string or the second string is not stored in the string storage, at least one of the first string or the second string is stored in the string storage.

A method includes receiving, from a server, a plurality of data packets at a wireless client device; identifying, by the wireless client device, receive times for the plurality of data packets; identifying, by the wireless client device, a first subset of the plurality of data packets having shorter delay times than a second subset of the plurality of data packets having higher delay times based on the received times; and mixing, by the wireless client device, a subset of the first plurality of data packets to generate an encryption key.

A storage network receives data and a corresponding task, selects a storage units for the task, determines whether the data slice is locally available and when the data slice is not locally available, determines whether a redundant data slice is available from another storage unit. When the redundant data slice is not available from another storage unit, the storage network facilitates rebuilding the data slice to produce a rebuilt data slice by retrieving a decode threshold number of data slices corresponding to the data slice, decoding the decode threshold number of data slices to reproduce a data segment and re-encoding the data segment to produce a pillar width number of data slices that includes the rebuilt data slice. The storage network then stores locally either the rebuilt data slice or the redundant data slice and processes one of: the data slice locally available, the rebuilt data slice stored locally, or the redundant data slice stored locally in accordance with the corresponding partial task to produce a partial result.

A method for verification of a pruned blockchain transaction includes: receiving, by a receiver of a computing device, a subset of blocks included in a plurality of blocks comprising a blockchain, wherein each block includes one or more blockchain data values; receiving, by the receiver of the computing device, an authentication code; identifying, by a processor of the computing device, a plurality of data chunks in the subset of blocks using the authentication code, where each data chunk of the plurality of data chunks is included in one of the one or more blockchain data values in a block of the subset of blocks; decoding, by the processor of the computing device, a transaction value using at least the identified plurality of data chunks and a fountain code algorithm; and verifying, by the processor of the computing device, the decoded transaction value.

A client system includes a client-side host device, and a client-side storage device including a storage controller and a storage memory. The storage controller includes a host interface, a processor configured to control a read operation and a write operation for the storage memory, and a homomorphic encryption and decryption accelerator configured to, based on receiving a read request from the client-side host device, perform homomorphic encryption on first plaintext data that is read from the storage memory, to generate first homomorphic ciphertext data, and provide the first homomorphic ciphertext data to the client-side host device through the host interface, and based on receiving a write request from the client-side host device, perform homomorphic decryption on second homomorphic ciphertext data that is received through the host interface, to generate second plaintext data, and write the second plaintext data in the storage memory.

Transferring data between memories may include reading data associated with a memory transfer transaction from a first memory, determining whether a bypass indication associated with the memory transfer transaction is asserted, and transferring the data from the first memory to a second memory. The transferring may include bypassing the first-processing if the bypass indication is asserted. The transferring may further include bypassing second-processing the data if the bypass indication is asserted. Following bypassing the second-processing, the data may be stored in the second memory.

A computer implemented method of protecting data in a message for communication from a sender to a receiver, the sender and receiver sharing a secret, the method including splitting the message into a plurality of ordered message blocks, the order being a proper order such that an aggregation of the blocks in the proper order constitutes the message; generating a hash value for each message block, each hash value being generated on the basis of at least a content of the block and the secret; generating, for each block, an encoded indication of a position of the block in the proper order of blocks, the encoding being reversible and based on at least the hash value for the block and a position of the block in the proper order; communicating the blocks to the receiver in an order different to the proper order so as to obfuscate the message; and communicating the encoded indications to the receiver such that the blocks can be reassembled by the receiver in the proper order on the basis of the shared secret.

Methods, systems, apparatus, and computer program products that can automatically answer communication sessions received from trusted callers are disclosed herein. One method includes maintaining, by a processor of an information handling device, a list of trusted callers encoded in a memory and automatically answering a communication session received by the information handling device from a trusted caller in the encoded list of trusted callers without receiving input from a user of the information handling device accepting the communication session on the information handling device. Systems, apparatus, and computer program products that include hardware and/or software that can perform the methods for automatically answering communication sessions received from trusted callers are also disclosed herein.