SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR ZERO ROUND TRIP SECURE COMMUNICATIONS BASED ON A NOISY SECRET WITH A REDUCED MESSAGE SIZE

    公开(公告)号:US20200295945A1

    公开(公告)日:2020-09-17

    申请号:US16352515

    申请日:2019-03-13

    Abstract: A system, method, and computer program product are provided for implementing zero round trip secure communications based on a noisy secret with a reduced message size, comprising: a) receiving, by a receiver system, an encrypted message including encrypted message keys, and message authentication code (MAC) information a message MAC that is calculated and added for every sub-key, from a sender system; b) obtaining, by the receiver system, a number of a plurality of sub-keys from the received encrypted message; c) obtaining, by the receiver system, a sub-key from the plurality of sub keys associated with the encrypted message; d) utilizing, by the receiver system, a key derivation function to derive a key encryption key and a key MAC key associated with the sub-key; e) calculating, by the receiver system, an encrypted message key MAC associated with the sub-key using the derived key MAC key; f) determining, by the receiver system, whether the calculated encrypted message key MAC matches a received MAC for the sub-key; g) determining, by the receiver system, that the sub-key does not have any noise if the calculated encrypted message key MAC matches the received MAC for the sub-key; h) determining, by the receiver system, that the sub-key has noise if the calculated encrypted message key MAC does not match the received MAC for the sub-key; i) repeating, by the receiver system, steps c though h until a noiseless sub-key is found or all of the plurality of sub-keys are determined to have noise; j) if all of the plurality of sub-keys are determined to have noise, adjusting, by the receiver system, bits of a selected sub-key one by one, for each of the plurality of sub-keys, until a sub-key with one noisy bit is found and corrected to a noiseless sub-key; k) deriving, by the receiver system, a key encryption key from the noiseless sub-key; l) utilizing, by the receiver system, the key encryption key derived from the noiseless sub-key to decrypt a message key associated with the encrypted message; and m) utilizing, by the receiver system, the message key to decrypt the encrypted message.

    System, method, and computer program product for zero round trip secure communications based on noisy secrets

    公开(公告)号:US10972283B2

    公开(公告)日:2021-04-06

    申请号:US16352503

    申请日:2019-03-13

    Abstract: A system, method, and computer program product are provided for implementing zero round trip secure communications based on a noisy secret. In operation, a sender system utilizes a randomly generated message key for encrypting a message to send to a receiver system. The sender system selects a plurality of different sub-keys from a negotiated noisy secret to encrypt the randomly generated message key. The sender system encrypts the message utilizing the randomly generated message key. The sender system sends the encrypted message, all encrypted message keys, and a message MAC that is calculated and added for every sub-key, to the receiver system such that the receiver system is able to perform a MAC-based verification to test sub-key validity of the plurality of different sub-keys.

    System, method, and computer program product for zero round trip secure communications based on a noisy secret with a reduced message size

    公开(公告)号:US10862688B2

    公开(公告)日:2020-12-08

    申请号:US16352515

    申请日:2019-03-13

    Abstract: A system, method, and computer program product are provided for implementing zero round trip secure communications based on a noisy secret with a reduced message size. A receiver system receives from a sender system an encrypted message including encrypted message keys and a message MAC that is calculated and added for every sub-key. The receiver system determines if any one of the sub-keys is noiseless based on its corresponding message MAC. If none of the sub-keys are noiseless, the receiver system adjusts bits of the sub-keys until a sub-key with one noisy bit is found and corrected to form a noiseless sub-key. The noiseless sub-key is then processed to obtain a message key to decrypt the encrypted message.

    System, method, and computer program product for implementing zero round trip secure communications based on noisy secrets with a polynomial secret sharing scheme

    公开(公告)号:US10951415B2

    公开(公告)日:2021-03-16

    申请号:US16352546

    申请日:2019-03-13

    Abstract: Zero round trip secure communications is implemented based on noisy secrets with a polynomial secret sharing scheme. A sender identifies two negotiated noisy secrets associated with an encrypted message to send to a receiver system. The sender utilizes a first negotiated noisy secret for sub-key selection, and generates a secret polynomial using Shamir's polynomial-based secret sharing scheme with N positive integer points and a message key as a secret. The sender divides the first negotiated noisy secret into a plurality of sub-keys, and divides a second negotiated noisy secret into test blocks of a length equivalent to a length of a sub-key. The sender utilizes each of the plurality sub-keys for encrypting a corresponding test block along with one unique point of the secret polynomial. Moreover, the sender sends all encrypted test blocks and corresponding encrypted points of the secret polynomial to the receiver with the encrypted message.

    System, method, and computer program product for zero round trip secure communications based on two noisy secrets

    公开(公告)号:US10892891B2

    公开(公告)日:2021-01-12

    申请号:US16352531

    申请日:2019-03-13

    Abstract: Zero round trip secure communications is implemented based on two noisy secrets. A sender system: calculates a required number of sub-keys to have at least one noiseless sub-key; for each first negotiated secret sub-key, uses the sub-key to encrypt a first half of a message key and test bytes, and adds the encrypted first half of the message key and the encrypted test bytes to the encrypted message; for each second negotiated secret sub-key, uses the sub-key to encrypt a second half of the message key and the test bytes, and adds the encrypted second half of the message key and the encrypted test bytes to the encrypted message; and sends the encrypted message, message MAC information, encrypted first halves of the message key with associated encrypted test bytes, and encrypted second halves of the message key with associated encrypted test bytes to a receiver.

    SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR IMPLEMENTING ZERO ROUND TRIP SECURE COMMUNICATIONS BASED ON NOISY SECRETS WITH A POLYNOMIAL SECRET SHARING SCHEME

    公开(公告)号:US20200295946A1

    公开(公告)日:2020-09-17

    申请号:US16352546

    申请日:2019-03-13

    Abstract: A system, method, and computer program product are provided for implementing zero round trip secure communications based on noisy secrets with a polynomial secret sharing scheme. In operation, a sender system identifies (e.g. negotiates, etc.) two negotiated noisy secrets associated with an encrypted message to send to a receiver system. The sender system utilizes a first negotiated noisy secret for sub-key selection. The sender system generates a secret polynomial using Shamir's polynomial-based secret sharing scheme with N points, where N is a positive integer, and a message key as a secret. The sender system divides the first negotiated noisy secret into a plurality of sub-keys. The sender system divides a second negotiated noisy secret into test blocks of a length equivalent to a length of a sub-key. The sender system utilizes each of the plurality sub-keys for encrypting a corresponding test block along with one unique point of the secret polynomial. Moreover, the sender system sends all encrypted test blocks and corresponding encrypted points of the secret polynomial to the receiver system with the encrypted message.

    SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR ZERO ROUND TRIP SECURE COMMUNICATIONS BASED ON NOISY SECRETS

    公开(公告)号:US20200295944A1

    公开(公告)日:2020-09-17

    申请号:US16352503

    申请日:2019-03-13

    Abstract: A system, method, and computer program product are provided for implementing zero round trip secure communications based on a noisy secret. In operation, a sender system utilizes a randomly generated message key for encrypting a message to send to a receiver system. The sender system selects a plurality of different sub-keys from a negotiated noisy secret to encrypt the randomly generated message key. The sender system encrypts the message utilizing the randomly generated message key. The sender system sends the encrypted message, all encrypted message keys, and a message MAC that is calculated and added for every sub-key, to the receiver system such that the receiver system is able to perform a MAC-based verification to test sub-key validity of the plurality of different sub-keys.

    SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR ZERO ROUND TRIP SECURE COMMUNICATIONS BASED ON TWO NOISY SECRETS

    公开(公告)号:US20200295924A1

    公开(公告)日:2020-09-17

    申请号:US16352531

    申请日:2019-03-13

    Abstract: A system, method, and computer program product are provided for implementing zero round trip secure communications based on two noisy secrets. The method comprises: a) generating, by a sender system, a message key (e.g. a random message key) of a desired length for generating an encrypted message associated with two negotiated secrets; b) utilizing, by the sender system, a key derivation function to derive a message key encryption key and a message key message authentication code (MAC) key; c) encrypting, by the sender system, the message key with the derived message key encryption key; d) calculating, by the sender system, an encrypted message key MAC using the derived message key MAC key; e) calculating, by the sender system, a sub-key size by dividing a size of the message key by two; f) generating, by the sender system, random test bytes; g) calculating, by the sender system, a required number of sub-keys to have at least one noiseless sub-key with a given acceptable level of message loss (the number is the same for both negotiated secrets); h) selecting, by the sender system, a first sub-key from a first negotiated secret using a deterministic algorithm; i) encrypting, by the sender system, a first half of the message key using the first sub-key; j) encrypting, by the sender system, the test bytes using the first sub-key; k) adding, by the sender system, the first half of the message key and the test bytes encrypted using the first sub-key to the encrypted message; l) repeating, by the sender system, operations h through k until no sub-keys associated with the first negotiated secret are left; m) selecting, by the sender system, a second sub-key from a second negotiated secret using the deterministic algorithm; n) encrypting, by the sender system, a second half of the message key using the second sub-key; o) encrypting, by the sender system, the test bytes using the second sub-key; p) adding, by the sender system, the second half of the message key and the test bytes encrypted using the second sub-key to the encrypted message; q) repeating, by the sender system, operations m through p until no sub-keys associated with the second negotiated secret are left; and r) sending, by the sender system, the encrypted message, message MAC information (e.g. a message MAC computed on the ciphertext), encrypted first halves of the message key along with associated encrypted test bytes, and encrypted second halves of the message key along with associated encrypted test bytes to a receiver system.

Patent Agency Ranking