Patents by Inventor Ehud Aharoni

Ehud Aharoni has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20240089081
    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.
    Type: Application
    Filed: August 25, 2022
    Publication date: March 14, 2024
    Inventors: Eyal KUSHNIR, Hayim SHAUL, Omri SOCEANU, Ehud AHARONI, Nathalie BARACALDO ANGEL, Runhua XU, Heiko H. LUDWIG
  • Publication number: 20240039691
    Abstract: A computer-implemented method including, in a fully-homomorphic encryption (FHE) scheme that employs ciphertext rescaling at different levels of a modulus chain of prime numbers: initializing a scale of the highest level of the modulus chain to a value that equals a weighted geometric mean of all the prime numbers, wherein, in the weighted geometric mean, the weight for each of the prime numbers is two to the power of: a location of the respective prime number in the modulus chain, minus one.
    Type: Application
    Filed: July 26, 2022
    Publication date: February 1, 2024
    Inventors: GILAD EZOV, EHUD AHARONI, OMRI SOCEANU, ALLON ADIR
  • Patent number: 11882206
    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.
    Type: Grant
    Filed: August 15, 2021
    Date of Patent: January 23, 2024
    Assignee: International Business Machines Corporation
    Inventors: Ehud Aharoni, Omri Soceanu, Allon Adir, Hayim Shaul, Gilad Ezov
  • Publication number: 20240013050
    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.
    Type: Application
    Filed: July 5, 2022
    Publication date: January 11, 2024
    Inventors: Subhankar PAL, Alper BUYUKTOSUNOGLU, Ehud AHARONI, Nir DRUCKER, Omri SOCEANU, Hayim SHAUL, Kanthi SARPATWAR, Roman VACULIN, Moran BARUCH, Pradip BOSE
  • Publication number: 20240004610
    Abstract: A computer-implemented method for generating hash values to determine string similarity is disclosed. The computer-implemented method includes converting a first text string of a first data set into a first set of shingles. The computer-implemented method further includes determining a weight associated with each shingle in the first set of shingles based, at least in part, on a particular record field associated with a shingle. The computer-implemented method further includes generating, based on a hash function, a hash value for each shingle in the first set of shingles. The computer-implemented method further includes reducing the hash value generated for each shingle in the first set of shingles, based, at least in part on the weight associated with the shingle.
    Type: Application
    Filed: June 30, 2022
    Publication date: January 4, 2024
    Inventors: Allon Adir, Ehud Aharoni, Omri Soceanu, Michael Mirkin
  • Publication number: 20230421350
    Abstract: A method and system for evaluating and selecting an optimal packing solution (or solutions) for data that is run through a fully homomorphic encryption (FHE) simulation. In some instances, a user selected model architecture is provided in order to start simulating multiple potential configurations. Additionally, the cost of each simulated configuration is taken into account when determining an optimal packing solution.
    Type: Application
    Filed: June 27, 2022
    Publication date: December 28, 2023
    Inventors: OMRI SOCEANU, GILAD EZOV, Ehud Aharoni
  • Patent number: 11856083
    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.
    Type: Grant
    Filed: January 6, 2022
    Date of Patent: December 26, 2023
    Assignee: International Business Machines Corporation
    Inventors: Ehud Aharoni, Omri Soceanu, Allon Adir, Gilad Ezov, Hayim Shaul
  • Patent number: 11841982
    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.
    Type: Grant
    Filed: October 20, 2021
    Date of Patent: December 12, 2023
    Assignee: International Business Machines Corporation
    Inventors: Hayim Shaul, Ehud Aharoni, Dov Murik, Omri Soceanu, Gilad Ezov, Lev Greenberg, Evgeny Shindin
  • Publication number: 20230306237
    Abstract: Identifying and avoiding an overflow event while performing machine learning inference operations with homomorphic encryption. Prior to a first run of a machine learning inference operation, a first overflow event is created in order to determine the values that are achieved values. These values are compared to a set of user selected homomorphic encryption libraries in order to determine which parameters of the machine learning inference operation must be adjusted in order to avoid future overflow events during subsequent runs of the machine learning inference operation.
    Type: Application
    Filed: March 24, 2022
    Publication date: September 28, 2023
    Inventors: LEV GREENBERG, Ehud Aharoni, GILAD EZOV
  • Publication number: 20230297649
    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.
    Type: Application
    Filed: March 21, 2022
    Publication date: September 21, 2023
    Inventors: Nir Drucker, Ehud Aharoni, Hayim Shaul, Allon Adir, Lev Greenberg
  • Publication number: 20230216657
    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.
    Type: Application
    Filed: January 6, 2022
    Publication date: July 6, 2023
    Inventors: Ehud Aharoni, OMRI SOCEANU, Allon Adir, GILAD EZOV, Hayim Shaul
  • Publication number: 20230208610
    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.
    Type: Application
    Filed: December 28, 2021
    Publication date: June 29, 2023
    Inventors: Hayim Shaul, OMRI SOCEANU, Ehud Aharoni, Dov Murik, GILAD EZOV
  • Publication number: 20230119283
    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.
    Type: Application
    Filed: October 20, 2021
    Publication date: April 20, 2023
    Inventors: Hayim SHAUL, Ehud AHARONI, Dov MURIK, Omri SOCEANU, Gilad EZOV, Lev GREENBERG, Evgeny SHINDIN
  • Publication number: 20230085239
    Abstract: An example system includes a processor to receive a preprocessed query from a client device for a fully homomorphic encryption (FHE) encrypted database. The processor can execute the preprocessed query on the FHE encrypted database to generate a response. The processor can transmit a partially-processed response to the client device, which can post-process the query computation.
    Type: Application
    Filed: September 13, 2021
    Publication date: March 16, 2023
    Inventors: Allon ADIR, Michael MIRKIN, Ramy MASALHA, Ehud AHARONI, Omri SOCEANU
  • Publication number: 20230053311
    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.
    Type: Application
    Filed: August 15, 2021
    Publication date: February 16, 2023
    Inventors: Ehud Aharoni, Omri Soceanu, Allon Adir, Hayim Shaul, Gilad Ezov
  • Patent number: 11528134
    Abstract: An example system includes a processor to receive, at a setup or sign-up, a first cipher including a biometric template transformed using a first transformation and encrypted using a secret key, a second cipher including a security vector encrypted using the secret key, a third cipher including the biometric template transformed using a second transformation and encrypted, and a fourth cipher including an encrypted second security vector. The processor can receive, at a runtime or sign-in, a fifth cipher and a sixth cipher. The processor can verify that the fifth cipher includes a second biometric template transformed using the first transformation and encrypted using the secret key and that the sixth cipher includes the second biometric template transformed using the second transformation by testing a format attribute of the transformation functions using comparisons of inner products.
    Type: Grant
    Filed: March 24, 2020
    Date of Patent: December 13, 2022
    Assignee: International Business Machines Corporation
    Inventors: Ehud Aharoni, Allon Adir, Dov Murik, Ariel Farkash, Omri Soceanu
  • Publication number: 20220376888
    Abstract: Privacy-preserving homomorphic inferencing utilizes batch processing on encrypted data records. Each data record has a private data portion of interest against which the inferencing is carried out. Batch processing is enabled with respect to a set of encrypted data records by techniques that ensure that each encrypted data record has its associated private data portion in a unique location relative to the other data records. The set of encrypted data records are then summed to generate a single encrypted data record against which the inferencing is done. In a first embodiment, the private data portions of interest are selectively and uniquely positioned at runtime (when the inferencing is being applied). In a second embodiment, the private data portions of interest are initially positioned with the data-at-rest, preferably in an off-line process; thereafter, at runtime individual encrypted data records are processed as necessary to adjust the private data portions to unique positions prior to batching.
    Type: Application
    Filed: May 10, 2021
    Publication date: November 24, 2022
    Applicant: International Business Machines Corporation
    Inventors: Kanthi Sarpatwar, Roman Vaculin, Ehud Aharoni, James Thomas Rayfield, Omri Soceanu
  • Patent number: 11477007
    Abstract: An efficient packing method that will optimize use of the homomorphic encryption ciphertext slots, trading-off size, latency, and throughput. Technology for working with tensors (multi-dimensional arrays) in a system that imposes tiles, that is, fixed-size vectors. An example of a system that imposes tiles are homomorphic encryption schemes, where each ciphertext encrypts a vector of some fixed size. The tensors are packed into tiles and then manipulated via operations on those tiles. Also, syntax for notation for describing packing details. This technology interprets the tiles as multi-dimensional arrays, and combines them to cover enough space to hold the tensor. An efficient summation algorithm can then sum over any dimension of this tile tensor construct that exists in the physical or logical addressing space of a computer data memory.
    Type: Grant
    Filed: April 13, 2021
    Date of Patent: October 18, 2022
    Assignee: International Business Machines Corporation
    Inventors: Omri Soceanu, Ehud Aharoni, Allon Adir, Lev Greenberg, Gilad Ezov, Ramy Masalha
  • Publication number: 20220329407
    Abstract: An efficient packing method that will optimize use of the homomorphic encryption ciphertext slots, trading-off size, latency, and throughput. Technology for working with tensors (multi-dimensional arrays) in a system that imposes tiles, that is, fixed-size vectors. An example of a system that imposes tiles are homomorphic encryption schemes, where each ciphertext encrypts a vector of some fixed size. The tensors are packed into tiles and then manipulated via operations on those tiles. Also, syntax for notation for describing packing details. This technology interprets the tiles as multi-dimensional arrays, and combines them to cover enough space to hold the tensor. An efficient summation algorithm can then sum over any dimension of this tile tensor construct that exists in the physical or logical addressing space of a computer data memory.
    Type: Application
    Filed: April 13, 2021
    Publication date: October 13, 2022
    Inventors: Omri Soceanu, Ehud Aharoni, Allon Adir, Lev Greenberg, Gilad Ezov, Ramy Masalha
  • Patent number: 11424928
    Abstract: Embodiments may include techniques to prevent illegal ciphertexts using distance computations on homomorphic and/or functional encrypted templates while detecting whether the resulting distance does not meet requirements for validity.
    Type: Grant
    Filed: May 30, 2020
    Date of Patent: August 23, 2022
    Assignee: International Business Machines Corporation
    Inventors: Ehud Aharoni, Omri Soceanu, Ariel Farkash, Allon Adir