Abstract: Some embodiments are directed to a computation device for performing a computation on at least a set of values. The values are stored in memory as a plurality of shares that define the value. An operation of the computation may be performed on a set of input values to obtain an output value. The output value may be defined by at least one shared share and at least one computed share. The at least one shared share may also define a further value, e.g., an output of a previously performed computation or an output of a further operation performed in parallel with the operation. The at least one computed share is computed from the at least one shared share and shares of the set of input values. A fault in the shared share affects the further value but a fault in the computed share, complicating share reduction attacks.

Abstract: Some embodiments are directed to a circuit compiling device for compiling a function into a binary circuit and a function evaluation device for evaluating a function using such a binary circuit. The binary circuit comprises conjunction subcircuits each computing a conjunction of function input bits and XOR subcircuits each computing a function output bit. Each function output bit may be represented as a sum of interpolation terms, the plurality of function input bits and the interpolation terms of the one or more function output bits together forming a plurality of interpolation terms. A conjunction subcircuit computes an interpolation term as a conjunction of two interpolation terms. A XOR subcircuit computes a function output bit as a XOR of interpolation terms. Thereby, the first interpolation term and second interpolation term are also used in XOR subcircuits, hence the binary circuit has a smaller number or likelihood of ineffective faults.

Abstract: Various embodiments include a coordinator node for coordinating a multiparty computation (MPC) on one or more datasets. The system comprises a plurality of client nodes, one or more datasets and a plurality of computation nodes. Client nodes may include at least one dataset and/or at least one computation node that can operate as a party to an MPC. The coordinator node is configured to receive a request for an MPC on one or more of the datasets from a requesting node, the MPC including the evaluation of at least one function by two or more computation nodes from different client nodes; determine a computation schedule for the MPC, the computation schedule indicating which client nodes of the plurality of client nodes are to participate in the MPC; send at least part of the determined computation schedule to at least one of the client nodes indicated in the determined computation schedule.

Abstract: In a method of locating medical equipment to be serviced, a map of a medical facility is accessed using an electronic processing device. The map includes a plurality of medical equipment each having a tag indicative of a location thereof. A user input is received which is indicative of a selection of a medical equipment of the plurality of medical equipment. A list of service actions to be performed for the selected medical equipment is displayed on a display device of the electronic processing device.

Abstract: A service actions database stores credentials for performing respective service actions. A service engineer (SE) database stores credentials of respective SE's. In a method of authorizing a servicing session of a medical device, a service ticket to perform a servicing session of the medical device is received. Credentials of a candidate SE are retrieved from the SE database. One or more service actions are determined for resolving the service ticket. Credentials required to perform the servicing session are retrieved from the service actions database based on the determined one or more service actions. It is determined whether the credentials of the candidate SE satisfy the credentials required to perform the servicing session. An indication is output that the candidate SE is unqualified to perform the servicing session when the credentials of the candidate SE do not satisfy the credentials required to perform the servicing session.

Abstract: Some embodiments are directed to an electronic cryptographic device arranged to perform a cryptographic operation on input data obtaining output data. The cryptographic device stores an internal state as sets of shares. Fourier coefficients corresponding to the sets of shares satisfy a predetermined relationship among them. The cryptographic operation is performed by repeatedly updating the internal state.

Abstract: An electronic calculating device (100) arranged to convert an input number (y) represented ((y1, y2, . . . , yk)) m a residue number system (RNS) to an output number represented in a radix representation ((e0, e1, . . . es?1)), the calculating device comprising an input interface (110) arranged to receive the input number (y) represented in the residue number system, and a processor circuit (120) configured to iteratively update an intermediate number (?) represented in the residue number system, wherein iterations produce the digits (e0, e1, . . . es?1) in the radix representation with respect to the bases (b0, b1, . . . , bs?1), at least one iteration comprises computing the intermediate number modulo a base (bt) of the radix representation to obtain a digit (et=(?)bt) of the radix representation, updating the intermediate number (??(??et+F)/bt) by subtracting the digit from the intermediate number, adding an obfuscating number (F; Ft), and dividing by the base (bt).

Abstract: According to an aspect, there is provided a method of operating a first computing node to distribute a computation output, the method comprising: determining a first random mask; providing the first random mask as a private input to a computation by a first evaluator node and a second evaluator node; receiving, from each of the first evaluator node and the second evaluator node, a respective masked computation output, wherein each masked computation output is a function of an output of the computation and the first random mask; if the received respective masked computation outputs match, determining the output of the computation from the received masked computation output and the first random mask; and sending information to the first evaluator node and the second evaluator node to enable the first evaluator node and the second evaluator node to determine the output of the computation from the respective masked computation output.

Abstract: Some embodiments are directed to a keyed message authentication code (MAC) device (100) for computing a keyed MAC for an input message using encoded representations. The keyed MAC device may be configured to apply a sequence of compressions functions, at least one of which takes a state as input in an encoded representation.

Abstract: Some embodiments are directed to an electronic computation device (100) arranged for obfuscated execution of a multiplication. The device comprises a storage (120) arranged for storing multiple variables used in the execution of an arithmetic operation, a variable (x: y; 2) of the multiple variables being represented as multiple multiplicative shares (X=(x0, x1, . . . , xm?1); Y=(y0, y1, . . . , ym?1); 20), said multiplicative shares being represented in the storage as multiple additive shares (xi=(xi,0,xi,1, . . . , xi,n?1); Yi=(yi,0,yi,1, . . . , yi,n?1); 210, 220).

Abstract: Some embodiments are directed to an electronic cryptographic device arranged to perform a cryptographic operation on input data obtaining output data. The cryptographic device stores an internal state as sets of shares. Fourier coefficients corresponding to the sets of shares satisfy a predetermined relationship among them. The cryptographic operation is performed by repeatedly updating the internal state.

Abstract: A cryptographic device (100) arranged to compute a target block cipher (Bt) on an input message (110), the device comprising a first and second block cipher unit (121, 122) arranged to compute the target block cipher (Bt) on the input message, and a first control unit (130) arranged to take the first block cipher result and the second block cipher result as input, and to produces the first block cipher result only if the block cipher results are equal.

Abstract: Some embodiments are directed to an electronic cryptographic device arranged to perform a cryptographic operation on input data obtaining output data. The cryptographic device stores an internal state as sets of shares. Fourier coefficients corresponding to the sets of shares satisfy a predetermined relationship among them. The cryptographic operation is performed by repeatedly updating the internal state.

Abstract: Some embodiments are directed to an electronic cryptographic device arranged to perform a cryptographic operation on input data obtaining output data. The cryptographic device stores an internal state as sets of shares. Fourier coefficients corresponding to the sets of shares satisfy a predetermined relationship among them. The cryptographic operation is performed by repeatedly updating the internal state.

Abstract: Some embodiments are directed to a server device (100) and a client device (200) arranged to authenticating a user of client device (200). The user has access to an authentication string. Server device (100) is configured to encrypt a set of character/position data according to a homomorphic encryption algorithm. The client device allows the user to select a subset from the encrypted set from which a verification number is computed using the homomorphic operation.

Abstract: Some embodiments are directed to an authentication system (100; 101; 102) for computing an authentication token for a service provider to authenticate a user system to the service provider, the authentication system comprising a processor configured to jointly blind with a user system an encrypted user identity and to compute an encrypted identity for the service provider from the blinded encrypted user identity.

Abstract: Some embodiments are directed to a circuit compiling device for compiling a function into a binary circuit and a function evaluation device for evaluating a function using such a binary circuit. The binary circuit comprises conjunction subcircuits each computing a conjunction of function input bits and XOR subcircuits each computing a function output bit. Each function output bit may be represented as a sum of interpolation terms, the plurality of function input bits and the interpolation terms of the one or more function output bits together forming a plurality of interpolation terms. A conjunction subcircuit computes an interpolation term as a conjunction of two interpolation terms. A XOR subcircuit computes a function output bit as a XOR of interpolation terms. Thereby, the first interpolation term and second interpolation term are also used in XOR subcircuits, hence the binary circuit has a smaller number or likelihood of ineffective faults.

Abstract: Various embodiments include a coordinator node for coordinating a multiparty computation (MPC) on one or more datasets. The system comprises a plurality of client nodes, one or more datasets and a plurality of computation nodes. Client nodes may include at least one dataset and/or at least one computation node that can operate as a party to an MPC. The coordinator node is configured to receive a request for an MPC on one or more of the datasets from a requesting node, the MPC including the evaluation of at least one function by two or more computation nodes from different client nodes; determine a computation schedule for the MPC, the computation schedule indicating which client nodes of the plurality of client nodes are to participate in the MPC; send at least part of the determined computation schedule to at least one of the client nodes indicated in the determined computation schedule.

Abstract: Some embodiments are directed to a computation device for performing a computation on at least a set of values. The values are stored in memory as a plurality of shares that define the value. An operation of the computation may be performed on a set of input values to obtain an output value. The output value may be defined by at least one shared share and at least one computed share. The at least one shared share may also define a further value, e.g., an output of a previously performed computation or an output of a further operation performed in parallel with the operation. The at least one computed share is computed from the at least one shared share and shares of the set of input values. A fault in the shared share affects the further value but a fault in the computed share, complicating share reduction attacks.

Abstract: A computation device (200) arranged to evaluate a data function (S) mapping a number (n) of input variables to a number of output variables (m). The computation device comprises selection mechanism (220) receiving as input selection variables and an evaluation mechanism (210) arranged to receive the one or more evaluation variables and to evaluate the evaluation functions for the received evaluation variables, an evaluation function receiving as input the evaluation variables.