Patent classifications
H04L2209/30
APPARATUS AND METHOD FOR DETERMINING ENCODED PARAMETER VALUE IN WIRELESS COMMUNICATION SYSTEM
The present disclosure generally aims to prevent failure of decoding data in a wireless communication system. A method for operating a receiving end comprises the steps of: receiving a packet from a transmitting end; decoding the received packet using encoded parameters; detecting failure to release compression of a header in the decoded packet; and adjusting the value of the encoded parameters according to the detection of failure to release compression.
SECURE COMPRESSION
In embodiments, secure compression algorithms are provided that may be employed as a single operation on raw data to produce compressed and encrypted data. In embodiments, the algorithms described herein may be performed using any type of dictionary based encryption. In one embodiment, upon adding a new prefix to a dictionary table, the dictionary table may be permuted to randomize the entries into the table. The randomization may be based upon a permutation value generated by a deterministic pseudo-random generator and/or pseudo-random function. Other embodiments of randomization may be employed to provide secure compression. For example, instead of permuting the entire table upon adding a prefix, the prefix may be randomly added to the table.
Generating and merging keys for grouping and differentiating volumes of files
Methods and apparatus teach a digital spectrum of a file. The digital spectrum is used to map a file's position in a multi-dimensional space. This position relative to another file's position reveals distances between the files. Closest files can be grouped together. When contemplating voluminous numbers of files for digital spectrums, various methods include: concatenating all such files together to get a single key useful for creating a file's spectrum; or compressing files individually and combining their collective dictionaries into a single dictionary with or without the use of tree mechanisms that defines the digital spectrum. Each provides advantage over the other. The latter consumes considerably less run time because each compression event can be distributed to a separate processor. Method two provides better spectrums because it is more informationally valid than is method one.
ADAPTIVE COMPRESSION FOR IDEMPOTENT DATA STORES IN COMPUTER MESSAGING
Systems and methods for adaptive compression for idempotent data stores in computer messaging are generally described. In some examples, a first node may receive a first message that includes a first message identifier and first payload data. In some examples, the first node may determine that a respective available amount of storage of each node of a plurality of nodes is below a first threshold available amount of storage. In some cases, the plurality of nodes may include the first node. The first node may receive a compression key from a primary node of a cluster including the plurality of nodes. The first node may compress a second message identifier stored in a data structure of the first node using the compression key.
Optimizing Data Reduction For Data In Encrypted Volumes
A method of data reduction in a partially encrypted volume includes receiving data to be stored on a storage array, decrypting the data using a first encryption key to generate first decrypted data, and decrypting the data using a second encryption key to generate second decrypted data. The method further includes comparing, by a storage array controller, a first compressibility value of the first decrypted data to a second compressibility value of the second decrypted data. The method further includes storing the first decrypted data if the first compressibility value is greater than or equal to the second compressibility value. The method further includes storing the second decrypted data if the second compressibility value is greater than the first compressibility value.
BLOCKCHAIN-BASED AUTHENTICATION METHOD AND SYSTEM
A method and system of authenticating a device within a network of connected devices that share a ledger of transactions between them under the form of exchanged blockchain messages and comprising: computing a PoK chain (70) based on the enhanced blockchain, receiving an authentication request from an application or a device, the authentication request including one or more PoKs (71), retrieving from the PoK database the PoK chain (70) corresponding to the application or device identified in the authentication request; computing a PoK (71) based on the PoK chain (70) retrieved from the PoK database, comparing it with the PoK (71) included in the authentication request, and if they match, validating the authentication request.
Restoring a storage system from a replication target
Restoring a storage system from a replication target, including: receiving, by a first storage system from a computing device, data to be stored on the first storage system; reducing, by the first storage system, the data using one or more data reduction techniques; sending, from the first storage system to the second storage system, the reduced data, wherein the reduced data is encrypted; and retrieving, by the first storage system from the second storage system, the reduced data, wherein the reduced data is encrypted.
LIGHTWEIGHT FAULT DETECTION MECHANISM FOR STREAMING OF CRYPTOGRAPHIC DATA OBJECTS
plurality of objects that comprise an input to a cryptographic signing function. For each object in the plurality of objects, an output value y.sub.i of a hash function is calculated, where the value i is equal to an index value of the object, a compressed output value x.sub.i of a compression function is calculated, the output value y.sub.i from the computer readable memory, and the compressed output value x.sub.i is stored. For each object in the plurality of objects, an output value y.sub.i of the hash function is calculated, where the value i is equal to the index value of the object, a compressed output value x.sub.i of the compression function executed on the output value y.sub.i is calculated, the output value x.sub.i is determined to be equal to the output value x.sub.i, and the output value y.sub.i is transmitted in an output data stream.
Multi-path end-to-end encryption in a storage system
Multi-path end-to-end encryption in a storage system, includes: receiving, by a storage system through a first path, a first write request for first data to be stored in a dataset, where the first data is encrypted with a first encryption key associated with requests received from the first path; decrypting the first data utilizing the first encryption key; encrypting the first data using a storage system encryption key; storing the first data in the dataset; receiving, by the storage system through a second path, a second write request for second data to be stored in the dataset, where the second data is encrypted with a second encryption key associated with requests received from the second path; decrypting the second data utilizing the second encryption key; encrypting the second data using the storage system encryption key; and storing the second data in the dataset.
Implementing resilient deterministic encryption
A computer-implemented method according to one aspect includes creating an initialization vector, utilizing an instance of plaintext and a secret key; encrypting the instance of plaintext, utilizing the initialization vector, the secret key, and the instance of plaintext; combining the initialization vector and the encrypted instance of plaintext to create a ciphertext string; and outputting the ciphertext string.