Telefonaktiebolaget Lm Ericsson (publ)

Debricked Ab

Martin Hell

Bernard Smeets

Alexander Maximov

Mats Näslund

Elena Dubrova

Pegah Nikbakht Bideh

Linus Karlsson

Ben Smeets

A method for prioritizing among vulnerabilities in a software code for a user by using a server is presented. The method comprises receiving a request, a software identification associated to the software code, and a user identification associated to the user from a user computer, fetching domain specific knowledge (DSK) data from a DSK database by using the software identification, wherein the DSK database comprises non-user defined features related to the vulnerabilities, fetching user specific knowledge (USK) data from a USK database by using the user identification, wherein the USK database comprises user defined features related to the vulnerabilities, determining utility estimations for the vulnerabilities, respectively, by comparing the vulnerabilities with the DSK data and comparing the vulnerabilities with the USK data, and transferring the utility estimations from the server to the user computer such that a prioritized list of vulnerabilities can be achieved.

Method for prioritizing among vulnerabilities in a software code and a server

A method of providing a hash value for a piece of data is disclosed, where the hash value provides for a time-stamp for the piece of data upon verification, for limiting a risk of collisions between hash values. The method comprises collecting one or more root time-stamps for a root of a hash tree structure defining a hash function, wherein the root-time stamp is a root time-stamp from the past, determining whether a nonce may be received from a server, and upon failure to receive the nonce from the server, providing the hash value by a hash function of the root time-stamp and the piece of data, or upon success in receiving the nonce from the server, providing the hash value by the hash function of the root time-stamp, the piece of data and the nonce. An electronic device and a computer program are also disclosed.

Method of providing a hash value for a piece of data, electronic device and computer program

A device provides a one-time proof of knowledge about a one-time signing key to a server without revealing the one-time signing key by computing a hash as a hash function from the one-time signing key, and transmitting, to the server, the computed hash, an identity associated with the electronic device and a hash path of the hash. The server receives the message from the device and checks whether the hash corresponds to a one-time signing key for a root hash included in a public certificate associated with the identity, checks whether an index corresponding to the hash path from the one-time signing key to the root hash corresponds to a correct time slot, and determines it to be proven that the device is in possession of the correct one-time signing key when the checks are fulfilled.

Methods of proving validity and determining validity, electronic device, server and computer programs

A technique for generating a keystream () for ciphering or deciphering a data stream () is provided. As to a method aspect of the technique, a nonlinear feedback shift register, NLFSR (), including n register stages implemented in a Galois configuration is operated. At least one register stage of the implemented n register stages is representable by at least one register stage of a linear feedback shift register, LFSR. A first subset of the implemented n register stages is representable by a second subset of a second NLFSR. A number of register stages receiving a nonlinear feedback in the second NLFSR is greater than one and less than a number of register stages receiving a nonlinear feedback in the implemented NLFSR. The keystream () is outputted from a nonlinear output function (). An input of the nonlinear output function () is coupled to at least two of the implemented n register stages of the NLFSR ().

Stream ciphering technique

A hash value provides for a time-stamp for a piece of data upon verification. Providing the hash value includes deriving one-time signing keys of signer's one-time signing key hash chain by a one-way function of a secret key of the signer and a function of an index of the one-time signing key, and providing the hash value for the piece of data by a hash function including the piece of data and the derived one-time signing key. An electronic device having a processor arranged to implement a functional module for deriving a one-time signing key and providing a hash value for a piece of data by a hash function including the piece of data and the derived one-time signing key is also disclosed. The functional module is arranged to perform the method. A computer program for implementing the method on the electronic device is also disclosed.

Growing community of inventors

Malmo, Sweden

Martin Hell