H04L2209/20

Method for Block Cipher Enhanced by Nonce Text Protection and Decryption Thereof
20190140820 · 2019-05-09 ·

A method for block cipher enhanced by nonce text protection comprises: (a) providing a plain text data block; (b) inputting a corresponding nonce text based-on the plain text; (c) combining the plain text data with the nonce text to form a mix text with block length equal to block length of the plain text plus block length of the nonce text; and (d) utilizing a block encryption process to encrypt the mix text to generate a cipher text.

SECURE VERIFICATION OF CONDITIONS OF A CONTRACT USING A SET OF VERIFICATION TOOLS
20190109702 · 2019-04-11 ·

A device may receive a request for a contract associated with a project. The request may include a blockchain identifier for an organization associated with the project and a set of project requirements for the project. The device may generate the contract using information included in the request. The contract may include one or more conditions that are associated with the set of project requirements. The device may create one or more blocks in a blockchain using the one or more conditions of the contract and the blockchain identifier. The device may receive multimedia data associated with completion of a phase of the project. The device may verify whether the phase of the project is complete using metadata associated with the multimedia data. The device may perform one or more actions based on verifying whether the phase of the project is complete.

Elliptic curve random number generation

An elliptic curve random number generator avoids escrow keys by choosing a point Q on the elliptic curve as verifiably random. An arbitrary string is chosen and a hash of that string computed. The hash is then converted to a field element of the desired field, the field element regarded as the x-coordinate of a point Q on the elliptic curve and the x-coordinate is tested for validity on the desired elliptic curve. If valid, the x-coordinate is decompressed to the point Q, wherein the choice of which is the two points is also derived from the hash value. Intentional use of escrow keys can provide for back up functionality. The relationship between P and Q is used as an escrow key and stored by for a security domain. The administrator logs the output of the generator to reconstruct the random number with the escrow key.

General encryption enhancement
12047487 · 2024-07-23 ·

A computerized process is described for improving a computer's asymmetric and symmetric encryption capabilities that results in ciphertext with higher data confidentiality, substantially greater security level, and increased data protection without encrypting any data bit more than one time. The process utilizes computing resources, eight asymmetric/symmetric encryption ciphers, eight different asymmetric/symmetric encryption keys; cipher parameters for each said cipher; and plaintext to be encrypted. A novel mechanism is described that copies bit values from common bit positions of plaintext bytes into eight partitions. Each partition of bytes is independently encrypted using a cipher with its own key and the resulting partitions of encrypted bytes are combined to form ciphertext. As the ciphertext requires eight ciphers and keys for decryption, the ciphertext security level is significantly enhanced over single cipher and key encryption. This process is reversed to decrypt ciphertext to plaintext.

Efficiently batching pre-encrypted data for homomorphic inference

Privacy-preserving homomorphic inferencing utilizes batch processing on encrypted data records. Each data record has a private data portion of interest against which the inferencing is carried out. Batch processing is enabled with respect to a set of encrypted data records by techniques that ensure that each encrypted data record has its associated private data portion in a unique location relative to the other data records. The set of encrypted data records are then summed to generate a single encrypted data record against which the inferencing is done. In a first embodiment, the private data portions of interest are selectively and uniquely positioned at runtime (when the inferencing is being applied). In a second embodiment, the private data portions of interest are initially positioned with the data-at-rest, preferably in an off-line process; thereafter, at runtime individual encrypted data records are processed as necessary to adjust the private data portions to unique positions prior to batching.

PREVENTING STATISTICAL INFERENCE ATTACKS ON DATA THAT IS SHARED AMONG MULTIPLE STAKEHOLDERS WITH DISJOINT ACCESS PRIVILEGES
20190081950 · 2019-03-14 ·

According to one embodiment, a method, computer system, and computer program product for preventing statistical inference attacks is provided. The present invention may include splitting records into items, and classifying these items into shared items and private items; grouping the private items according to privacy and confidentiality requirements; restricting access of the private items to stakeholders based on the confidentiality requirements using cryptographic keys; generating and encrypting one or more placeholders for both existent and non-existent stakeholders; storing private items in private storage as indicated by links; creating shared records comprising links, placeholders, and shared items; adding integrity signatures to the shared records; and publishing the shared records to a shared medium.

Splitting digital promises recorded in a blockchain
10225076 · 2019-03-05 ·

A method and system to securely split a digital promise that is recorded in a blockchain. A digital promise represents a promise by a promisor to pay a promisee an asset when a specified condition is satisfied. The specified condition may be fulfillment of a digital contract, also recorded in the blockchain, to which the digital promise is linked. When splitting a digital promise, a split transaction is recorded indicating a split into a first child digital promise and a second child digital promise. In each child digital promise, the promisor promises to pay a child promisee a portion of the asset when a specified child condition is satisfied. When a digital promise is split, the digital promise itself is no longer payable, but the child digital promises are payable when both the specified condition and the specified child condition for the child digital promise are satisfied.

Method of transmitting and receiving audio signals and apparatus thereof

Example embodiments disclosed herein relate to a method of transmitting an audio signal and also a method of receiving an audio signal. The method of transmitting the audio signal includes: receiving the audio signal including a plurality of frames having a left and right subframes containing audio data of a first number of bits; encoding the left and right subframes into a parity code of a second number of bits; generating serial data by combining the parity code and the audio data; and transmitting the serial data over an audio transmission media having a bandwidth of a third number of bits, a sum of the first number of bits and the second number of bits being below the third number of bits. The method of receiving the audio signal includes: receiving a serial signal combining a parity code; decoding the serial signal by calculating a syndrome based on the parity code; detecting an error by comparing the syndrome with the audio data; and generating a corrected audio signal by correcting the detected error.

Parallell processing of a single data buffer

Technologies for executing a serial data processing algorithm on a single variable-length data buffer includes padding data segments of the buffer, streaming the data segments into a data register and executing the serial data processing algorithm on each of the segments in parallel.

Method to detect an OTA (over the air) standard message affected by an error

A method is to detect a message compatible with the OTA (Over The Air) standard and affected by a wrong ciphering. The method may include receiving the ciphered OTA message; deciphering the OTA message; and reading a counter field of padding bytes in the deciphered OTA message and reading corresponding padding bytes in the OTA message deciphered. The method may also include detecting at least one bit in at least one of the padding bytes of the OTA message deciphered, with the at least one bit being indicative of the wrong ciphering.