Abstract: An example system includes a processor to pack a received tensor using a designated packing to generate a number of smaller ciphertexts. The processor can compute a rotation using the number of smaller ciphertexts to simulate a rotation operation on the tensor.

Abstract: An example system includes a processor that can receive a number of complex packed tensors, wherein each of the complex packed tensors include real numbers encoded as imaginary parts of complex numbers. The processor can execute a single instruction, multiple data (SIMD) operation on the complex packed tensors using an integrated circuit of real and complex packed tensors in a complex domain to generate a result.

Abstract: An example system includes a processor to partition an arithmetic circuit representing a homomorphically encrypted (HE) code into a number of execution blocks. The processor can generate, for each of the number of execution blocks, manifests describing access patterns for a number of different machine environments. The processor can then dynamically execute the HE code by selecting successive blocks to execute based on an access pattern calculated for the execution block corresponding to a detected current machine environment.

Abstract: An example system includes a processor to compute a tensor of indicators indicating a presence of partial sums in an encrypted vector of indicators. The processor can also securely reorder an encrypted array based on the computed tensor of indicators to generate a reordered encrypted array.

Abstract: A second set of data identifiers, comprising identifiers of data usable in federated model training by a second data owner, is received at a first data owner from the second data owner. An intersection set of data identifiers is determined at the first data owner. At the first data owner according to the intersection set of data identifiers, the data usable in federated model training is rearranged by the first data owner to result in a first training dataset. At the first data owner using the intersection set of data identifiers, the first training dataset, and a previous iteration of an aggregated set of model weights, a first partial set of model weights is computed. An updated aggregated set of model weights, comprising the first partial set of model weights and a second partial set of model weights from the second data owner, is received from an aggregator.

Abstract: A method comprising: receiving an input tensor having a shape defined by [n1, . . . , nk], where k is equal to a number of dimensions that characterize the input tensor; receiving tile tensor metadata comprising: a tile tensor shape defined by [t1, . . . , tk], and information indicative of an interleaving stride to be applied with respect to each dimension of the tile tensor; constructing an output tensor comprising a plurality of the tile tensors, by applying a packing algorithm which maps each element of the input tensor to at least one slot location of one of the plurality of tile tensors, based on the tile tensor shape and the interleaving stride, wherein the interleaving stride results in non-contiguous mapping of the elements of the input tensor, such that each of the tile tensors includes a subset of the elements of the input tensor which are spaced within the input tensor according to the interleaving stride.

Abstract: An example system includes a processor to prune a machine learning model based on an importance of neurons or weights. The processor is to further permute and pack remaining neurons or weights of the pruned machine learning model to reduce an amount of ciphertext computation under a selected constraint.

Abstract: In response to identifying that a Single Instruction, Multiple Data (SIMD) operation has been instructed to be performed or has been performed by a Fully-Homomorphic Encryption (FHE) software on one or more original ciphertexts, performing the following steps: Performing the same operation on one or more original plaintexts, respectively, that are each a decrypted version of one of the one or more original ciphertexts. Decrypting a ciphertext resulting from the operation performed on the one or more original ciphertexts. Comparing the decrypted ciphertext with a plaintext resulting from the same operation performed on the one or more original plaintexts. Based on said comparison, performing at least one of: (a) determining an amount of noise caused by the operation, (b) determining whether unencrypted data underlying the one or more original ciphertexts has become corrupt by the operation, and (c) determining correctness of an algorithm which includes the operation.

Abstract: An example system includes a processor that can obtain a circuit describing operations of sequential secure computation code. The processor can modify the circuit based on a cost function. The processor can partition the circuit into a number of sub-circuits. The processor can assign the number of the sub-circuits to different processors for execution.

Abstract: A method, a neural network, and a computer program product are provided that optimize training of neural networks using homomorphic encrypted elements and dropout algorithms for regularization. The method includes receiving, via an input to the neural network, a training dataset containing samples that are encrypted using homomorphic encryption. The method also includes determining a packing formation and selecting a dropout technique during training of the neural network based on the packing technique. The method further includes starting with a first packing formation from the training dataset, inputting the first packing formation in an iterative or recursive manner into the neural network using the selected dropout technique, with a next packing formation from the training dataset acting as an initial input that is applied to the neural network for a next iteration, until a stopping metric is produced by the neural network.

Abstract: In response to identifying that a Single Instruction, Multiple Data (SIMD) operation has been instructed to be performed or has been performed by a Fully-Homomorphic Encryption (FHE) software on one or more original ciphertexts, performing the following steps: Performing the same operation on one or more original plaintexts, respectively, that are each a decrypted version of one of the one or more original ciphertexts. Decrypting a ciphertext resulting from the operation performed on the one or more original ciphertexts. Comparing the decrypted ciphertext with a plaintext resulting from the same operation performed on the one or more original plaintexts. Based on said comparison, performing at least one of: (a) determining an amount of noise caused by the operation, (b) determining whether unencrypted data underlying the one or more original ciphertexts has become corrupt by the operation, and (c) determining correctness of an algorithm which includes the operation.

Abstract: Executing the operations of an arithmetic circuit by using a hybrid strategy that employs both fully homomorphic encryption (FHE) methods and multi-party computation (MPC) methods. In order to utilize this hybrid strategy, an arithmetic circuit is split into multiple partitions (at least two), and each partition is assigned to be executed using FHE methods or MPC methods. Finally, this hybrid strategy is utilized in a manner that automatically takes into account CPU and network utilization costs.

Abstract: An example system includes a processor that can obtain a circuit describing operations of sequential secure computation code. The processor can modify the circuit based on a cost function. The processor can partition the circuit into a number of sub-circuits. The processor can assign the number of the sub-circuits to different processors for execution.

Abstract: A method comprising: receiving an input tensor having a shape defined by [n1, ...,nk], where k is equal to a number of dimensions that characterize the input tensor; receiving tile tensor metadata comprising: a tile tensor shape defined by [t1, ..., tk], and information indicative of an interleaving stride to be applied with respect to each dimension of the tile tensor; constructing an output tensor comprising a plurality of the tile tensors, by applying a packing algorithm which maps each element of the input tensor to at least one slot location of one of the plurality of tile tensors, based on the tile tensor shape and the interleaving stride, wherein the interleaving stride results in non-contiguous mapping of the elements of the input tensor, such that each of the tile tensors includes a subset of the elements of the input tensor which are spaced within the input tensor according to the interleaving stride.

Abstract: A method for analyzing and controlling epidemics in which an initiating signal is received indicative of a list of newly classified carriers of an infectious disease from an authorized health authority. Location data is received for a mobile device and a mobility pattern derived from the received location data is compared with a mobility pattern of first users to determine occurrence of a proximity event, during which one of the first users was spaced from a given carrier less than a predetermined distance. The proximity event is ranked in terms of the likelihood that the given carrier was involved in the transmission of the disease during the proximity event. If the ranking of the proximity event is higher than a predetermined level, the process is repeated for the first user participating in the proximity event and for second users. Corrective action information is then transmitted.

Abstract: A method and system for accelerating receipt of data in a client to client network. The method includes the steps of intercepting queries and responses, storing the intercepted queries and responses in an acceleration server and transmitting the intercepted responses to clients submitting intercepted queries. The system includes at least one acceleration server designed and configured to perform the steps included in the method.

Abstract: A method for analyzing and controlling epidemics in which an initiating signal is received indicative of a list of newly classified carriers of an infectious disease from an authorized health authority. Location data is received for a mobile device and a mobility pattern derived from the received location data is compared with a mobility pattern of first users to determine occurrence of a proximity event, during which one of the first users was spaced from a given carrier less than a predetermined distance. The proximity event is ranked in terms of the likelihood that the given carrier was involved in the transmission of the disease during the proximity event. If the ranking of the proximity event is higher than a predetermined level, the process is repeated for the first user participating in the proximity event and for second users. Corrective action information is then transmitted.

Abstract: A method and system for accelerating receipt of data in a client to client network. The method includes the steps of intercepting queries and responses, storing the intercepted queries and responses in an acceleration server and transmitting the intercepted responses to clients submitting intercepted queries. The system includes at least one acceleration server designed and configured to perform the steps included in the method.

Abstract: A content presentation system comprising content playing apparatus and content providing apparatus operative to receive an array of digitally represented numbers, representing content as P points in D-dimensional space, to generate therefrom a plurality of projections on at least one sub-space of a vector space comprising a span of at least one D-dimensional vector, and to provide the plurality of projections to the content playing apparatus, the content playing apparatus being operative to reconstruct the array of digitally represented numbers from the plurality of projections and to expose human users to content accordingly.

Abstract: A method and system for accelerating receipt of data in a client to client network. The method includes the steps of intercepting queries and responses, storing the intercepted queries and responses in an acceleration server and transmitting the intercepted responses to clients submitting intercepted queries. The system includes at least one acceleration server designed and configured to perform the steps included in the method.