Abstract: A method includes, at a first communications device: processing encapsulation keys of a plurality of second communications devices using an encapsulation function to generate a symmetric key, an authenticable token, and a ciphertext; and transmitting, to each of the second communications devices, the token and a respective portion of the ciphertext depending on the respective encapsulation key of that second communications device. The token is a cryptographic commitment of the symmetric key, and the ciphertext is a multi-recipient encapsulation of the symmetric key under the encapsulation keys of the second communications devices. The method further includes, at each second communications device: processing the respective decapsulation key and the respective portion of the ciphertext using a decapsulation function to generate a respective candidate copy of the symmetric key; authenticating the token, whereby to determine that the respective candidate copy of the symmetric key corresponds to the symmetric key.

Abstract: Lattice-based threshold signature schemes and threshold decryption schemes are described. The threshold signature schemes are described in two or three rounds and are secure under Module Learning with Errors and Module Short integer Solution assumptions. In each of the signature and threshold decryption schemes, blinders may be introduced to shield information about the secret key that may otherwise be leaked by honest participants in the scheme.

Abstract: Disclosed herein are method and systems for transmitting a plurality of ciphertexts to a plurality of users. The systems and methods described herein provide for performing an encryption update comprising a plurality of encryption keys and a multi-ciphertext to a plurality of recipient nodes. Methods and systems for organizing a database are also disclosed herein.

Abstract: Disclosed herein are method and systems for transmitting a plurality of ciphertexts to a plurality of users. The systems and methods described herein provide for performing an encryption update comprising a plurality of encryption keys and a multi-ciphertext to a plurality of recipient nodes. Methods and systems for organizing a database are also disclosed herein.

Abstract: Methods for hiding the identity of communications devices in a continuous group key agreement are provided. A group member making a request relating to changing a group state provides a signed challenge value to a server, which signed challenge value has been signed using a group signature key. The server checks the signed challenge value to determine if the group member is in possession of the group signature key and is therefore a member of the group. As the group signature key is used, the server cannot determine the identity of the group member making the request.

Abstract: There is disclosed a computer-implemented method for generating a Fiat-Shamir digital signature in accordance with a signing key and a verification key, the signing key corresponding to a plurality of secret shares of a secret where each secret share is sampled from a modulo q base ring and the verification key corresponding to a public matrix sampled from the modulo q base ring and solution data. The larger the number of secret shares, the greater the countermeasure against side channel attacks but also the greater the processing complexity. In this regard, the computer-implemented method provides for efficient scaling between the number of secret shares and the processing complexity.

Abstract: A key generation method is provided. A first peer obtains an ephemeral key from a second peer via a server. The first peer uses the ephemeral key to compute a ciphertext that encrypts a first parameter. The first peer uses the first parameter to generate a session key. The ciphertext is sent to the server by the first peer to allow the second peer to generate the session key. The key may be subsequently used for communication, such as by using a key management algorithm such as Double Rachet.

Abstract: A key generation method is provided. A first peer obtains an ephemeral key from a second peer via a server. The first peer uses the ephemeral key to compute a ciphertext that encrypts a first parameter. The first peer uses the first parameter to generate a session key. The ciphertext is sent to the server by the first peer to allow the second peer to generate the session key. The key may be subsequently used for communication, such as by using a key management algorithm such as Double Rachet.

Abstract: A method includes, at a first communications device: processing encapsulation keys of a plurality of second communications devices using an encapsulation function to generate a symmetric key, an authenticable token, and a ciphertext; and transmitting, to each of the second communications devices, the token and a respective portion of the ciphertext depending on the respective encapsulation key of that second communications device. The token is a cryptographic commitment of the symmetric key, and the ciphertext is a multi-recipient encapsulation of the symmetric key under the encapsulation keys of the second communications devices. The method further includes, at each second communications device: processing the respective decapsulation key and the respective portion of the ciphertext using a decapsulation function to generate a respective candidate copy of the symmetric key; authenticating the token, whereby to determine that the respective candidate copy of the symmetric key corresponds to the symmetric key.

Abstract: Disclosed herein are method and systems for transmitting a plurality of ciphertexts to a plurality of users. The systems and methods described herein provide for performing an encryption update comprising a plurality of encryption keys and a multi-ciphertext to a plurality of recipient nodes. Methods and systems for organizing a database are also disclosed herein.

Abstract: Certain examples described herein relate to secure update propagation. The examples present systems and methods to transmit data in the form of updates over a network and to ensure the authenticity of the updates. The examples use a set-homomorphic digital signature scheme to sign updates such that a combined digital signature may be used to verify a batch of updates in place of a set of individual digital signatures. The combined digital signature may be generated by aggregating individual digital signatures.

Abstract: A key generation method is provided. A first peer obtains an ephemeral key from a second peer via a server. The first peer uses the ephemeral key to compute a ciphertext that encrypts a first parameter. The first peer uses the first parameter to generate a session key. The ciphertext is sent to the server by the first peer to allow the second peer to generate the session key. The key may be subsequently used for communication, such as by using a key management algorithm such as Double Rachet.

Abstract: Certain examples described herein relate to secure update propagation. The examples present systems and methods to transmit data in the form of updates over a network and to ensure the authenticity of the updates. The examples use a set-homomorphic digital signature scheme to sign updates such that a combined digital signature may be used to verify a batch of updates in place of a set of individual digital signatures. The combined digital signature may be generated by aggregating individual digital signatures.

Abstract: Basically, this invention provides for an inbred corn line designated G07-NPFF6309, methods for producing a corn plant by crossing plants of the inbred line G07-NPFF6309 with plants of another corn plants. The invention relates to the various parts of inbred including culturable cells. This invention also relates to methods for introducing transgenic transgenes into inbred corn line G07-NPFF6309 and plants produced by said methods.