Telefonaktiebolaget Lm Ericsson (publ)

Hansa Medical Research Ab

Björn Johansson

Johan Eker

Michael Liljenstam

Carl Von Platen

Martin Pettersson

Thomas Rusert

Jakob Sternby

Patrik Lantz

Song Yuan

Bernard Smeets

Per Persson

Lars Björck

Sanbao Xu

Jan Patrik Persson

Beatriz Grafulla-Gonzalez

Ulrich Von Pawel-Rammingen

Training a neural network and embedding a watermark in the network to prove ownership. The network includes a plurality of trainable parameters associated with network nodes in which the plurality of trainable parameters is split into a first set of trainable parameters and a second set of trainable parameters. A first set of training samples is input to the network and the network is trained by iterating the first set of samples through the network to update the first set of parameters and hindering the second set of parameters to be updated during iteration of the first set of samples. A second set of samples is input and the watermark is embedded by iterating the second set of samples through the network to update the second set of parameters and hindering the first set of parameters to be updated during iteration of the second set of samples.

Neural network watermarking

A neural network having one or more public parts and one or more confidential parts is trained to perform a primary task. A deployment instantiation of the neural network is trained based on optimal performance of the primary task, and based on sub-optimal performance of the primary task conditioned on the confidential parts of the deployment instantiation being inaccessible. An adversary instantiation of the neural network is trained based on optimal performance of the primary task conditioned on the public parts being identical for the deployment instantiation and for the adversary instantiation, and conditioned on the confidential parts of the deployment instantiation being inaccessible. The training of the deployment instantiation and the training of the adversary instantiation are based on a plurality of training data samples, and are performed iteratively by alternating between the training of the deployment instantiation and the training of the adversary instantiation.

Neural network confidentiality

An efficient obfuscation of program control flow, comprising obscuring a control execution flow through a plurality of code blocks of a computer program. It involves obtaining a secret key, initializing a state variable based on the secret key, generating a switching value by processing the state variable through an encoding function, and selecting a code block from among a set of code blocks using the switching value. It further involves executing the block code, which comprises updating the state variable based on a present value of the state variable, and repeating the steps of generating a switching value, selecting a code block, and executing the code block to control execution flow through the set of code blocks.

Efficient obfuscation of program control flow

A method to obscure a control execution flow in a computer program includes initializing a state variable, q, and a switching variable, selecting a code block for execution using a present value of the switching variable, executing the code block, updating the state variable based on a present value of the state variable and a block-dependent constant that is associated with the code block to generate an updated state variable, and by applying a state update function to the updated state variable, and updating the switching variable by processing the state variable through a non-injective output function that generates a new value of the switching variable based on the state variable. The operations of selecting the code block, executing the code block, updating the state variable and updating the switching variable are repeated to control execution flow.

Lightweight dispatcher for program control flow flattening

The invention relates to a method of generating a synthesized image representing a view of a scene from a first input image representing the view and a second input image representing the view, the synthesized image comprising synthesized image positions, by assigning a synthesized image data value to a synthesized image position. The method comprises determining whether input images have at the synthesized image position data values associated with them. If either one has a data value associated, that data value is assigned to the synthesized image position. If both, an average of both values is assigned. The average is a weighed average, with weighing factors being a function of a distance or distances to a closest image position with no image data value or valid image data value assigned.

Device, method and computer program for generating a synthesized image from input images representing differing views

It is presented a method for creating a disocclusion map used for coding a three-dimensional, 3D, video, the method comprises receiving () a pixel-based disocclusion map in which pixels are marked either as disoccluded or not. A block-based disocclusion map is derived () based on the pixel-based disocclusion map. An area of the block-based disocclusion map that has been marked as disoccluded is extended (). It is also presented an encoder (), a decoder () and a system for creating the disocclusion map.

Method and apparatus for creating a disocclusion map used for coding a three-dimensional video

A computer-implemented method of generating tamper-protected computer program code. The method comprises obtaining a representation of the computer program code, the computer program being adapted to cause a data processing system to perform a plurality of computational tasks in a first order of execution, each computational task being represented in the representation of the computer program code by at least one program statement; obtaining a plurality of alternative orders of execution of the computational tasks; generating an executable representation of the program code adapted to cause a data processing system to select a randomized order of execution from the plurality of alternative orders of execution and to execute the computational tasks in the selected randomized order of execution.

Obfuscating execution traces of computer program code

A method of embedding information in a computer program code, including a plurality of program statements. The method comprises: inserting a conditional program statement in the computer program code, the conditional program statement including a condition and a plurality of alternative program statements, the conditional program statement being adapted to cause a data processing system to evaluate said condition and, responsive to a result of said evaluating step, to selectively execute one of said plurality of alternative program statements; wherein said condition is indicative of at least a part of said information; and wherein the plurality of alternative program statements are adapted to cause the computer program code to produce the same program output irrespective of which of said alternative program statements is executed.

Watermarking computer program code

A computer-implemented method of tamper-protecting computer program code. The method comprises: obtaining an input representation of the computer program code; identifying a conditional program statement for causing a data processing system to selectively execute one of at least a first and a second sets of program statements when said computer program is executed by a data processing system; replacing said identified conditional program statement and the first and second sets of program statements with a set of transformed program statements to obtain obfuscated program code, wherein the set of transformed program statements is adapted to cause the data processing system to execute at least a part of each of the transformed program statements when said computer program is executed by the data processing system.

Obfuscating computer program code

A method of embedding information in a computer program code, including a plurality of program statements. The method comprises: parsing the computer program code to identify at least one program statement that includes a first mathematical expression, wherein said first mathematical expression includes at least a first algebraic expression adapted to produce at least one numeric result; generating a modified mathematical expression by performing a predetermined transformation of the first mathematical expression, wherein the modified mathematical expression includes a transformed algebraic expression instead of the first algebraic expression, such that the modified mathematical expression is adapted to produce the same result as the first mathematical expression, and wherein the modified mathematical expression is indicative of at least a part of said information; replacing said first mathematical expression in the identified program statement by the modified mathematical expression.

Watermarking computer code by equivalent mathematical expressions

A computer-implemented method of tamper-protecting a computer program, the method comprising: processing an input representation of the computer program to identify a function call for causing a data processing system to continue execution of the computer program at a predetermined entry point memory address when said computer program is executed by a data processing system; replacing the identified function call with a modified function call, wherein the modified function call includes an algebraic expression for causing the data processing system to compute the entry point memory address when said computer program is executed by the data processing system.

A web browser client includes an aggregated web application runtime environment that controls access by a program fragment of an aggregated web application to a resource therein based upon the originating domain of the program fragment. To do so, the aggregated web application runtime environment appends an access attribute to the Document Object Model (DOM) node associated with the resource. This access attribute is associated with a plurality of access rights definitions where each access rights definition defines a set of access rights to the resource for program fragments originating from a domain with a specific access rights status. Accordingly, the aggregated web application runtime environment sets one or more access rights statuses of the originating domain of the program fragment, and thereafter, grants or denies the program fragment access to the resource based upon one or more sets of access rights defined for that program fragment.

Secure client-side aggregation of web applications

A radio transceiver included in or attached to an imaging camera is used to facilitate the automatic determination of a scale factor in a three-dimensional (3D) reconstruction. The radio transceiver transmits a radio signal from each of one or more camera positions and measures a reflection profile for the transmitted signal. The measured reflection profile is compared to a simulated reflection profile, generated from a 3D model of the subject/scene of interest, to determine an estimate of an unknown scale for the 3D model. In various embodiments, the radio transceiver may be adapted from a radio device that already exists in or on the imaging camera (e.g., a cellular radio, Bluetooth&#xae; radio, or the like) or may be added to an imaging camera.

Three-dimensional reconstruction of scenes and objects

A polypeptide isolated fromis described, having IgG cysteine protease activity. The protease is designated IdeS, Immunoglobulin G-degrading enzyme of. A polypeptide comprises SEQ ID NO: 1 and variants and fragments thereof having IgG cysteine protease activity or the ability to generate an immune response againstin an individual. Polynucleotides encoding these polypeptides and the polypeptides may be used in generating an immune response in an individual. IdeS protease inhibitors may be used in the treatment ofinfection.

Growing community of inventors

Lund, Sweden

Björn Johansson