International Business Machines Corporation

Flavio Alvarenga Bergamaschi

Graham Anthony Bent

David Francis Bacon

Hamish C Hunt

Duy Q Huynh

Santhosh Rao

Kenneth Michael Ashcraft

Erin Christine Burke

Viktors Bertsis

Duc J Vianney

Peter Wai Yee Wong

Jack L H Crawford

Wei Zhang

Evangelos Stavros Eleftheriou

Sreekanth Ramakrishna Iyer

Jong-Deok Choi

Patrick Dantressangle

Oliver Masters

Christopher R Gibson

Nandakumar Sasidharan Rajalekshmi

Enrico Steffinlongo

Peter Wai Yu Wong

In an approach, a process stores a matrix of multibit values for a computation in an analog multiply-accumulate unit including at least one crossbar array of binary analog memory cells connected between respective pairs of word- and bit-lines of the array, where: bits of each multibit value are stored in cells connected along a word-line, and corresponding bits of values in a column of the matrix are stored in cells connected along a bit-line. In each of one or more computation stages for a cryptographic element, the process supplies a set of polynomial coefficients of an element bitwise to respective word-lines of the unit to obtain analog accumulation signals on the respective bit-lines. The process converts the analog signals to digital. The process processes the digital signals obtained from successive bits of the polynomial coefficients in each of the stages to obtain a computation result for the cryptographic element.

In-memory computation in homomorphic encryption systems

A method generates, in a higher security domain (SD), public and secret keys using a first homomorphic encryption scheme (HES), passes the public key to a first shared security zone (SSZ) between the higher SD and a lower SD and through the first SSZ to a second entity in the lower SD, passes a plain text query from the higher SD to the first SSZ, encrypts the plain text query using a second HES, passes the encrypted plain text query to the second entity, performs an oblivious query to generate an encrypted result, and passes that from the lower SD to a second SSZ located between the higher and lower SDs, passes the secret key from the higher SD to the second SSZ, and decrypts the encrypted result using the secret key to generate a plain text result, and passes the plain text result to the higher SD.

Performing secure queries from a higher security domain of information in a lower security domain

Various embodiments are provided for performing weighted partial matching under homomorphic encryption in a computing environment. Selected data may be encoded and encrypted into an encrypted query for comparison using private set intersection (PSI) under homomorphic encryption (HE). An encrypted score may be determined according to data blocks of the selected data and a set of weights for each of the data blocks of the selected data to identify matches between the data and the encrypted query. The encrypted score may be decrypted and decoded to identify matches between the encrypted query with the selected data.

Weighted partial matching under homomorphic encryption

In a fully homomorphic encryption scheme, a method is provided for performing a homomorphic operation on a data set by applying an encrypted operand supplied as a ciphertext. A data set containing 'i' library vectors, each with 'j' coefficients is subjected to a pivot operation such that each set of common &#x2018;j&#x2019; coefficients is stored in respective library ciphertexts. A query ciphertext containing a query vector is then subjected to a homomorphic pivot operation to separate out its &#x2018;j&#x2019; coefficients into respective pivoted query ciphertexts. A more efficient homomorphic computation can then be carried out between the ciphertexts of the pivoted forms of the query and library vectors so as to compute an encrypted set of vector differences between the query vector and each of the library vectors.

Performing vector comparison operations in fully homomorphic encryption

In computer-implemented technology for comparing first and second values that are encrypted according to a fully homomorphic encryption scheme, the following function is computed: where &#x3b5;(.) is a fully homomorphic encryption scheme.

Performing efficient comparison operations on encrypted data

A querying node generates public keys, secret keys, and switch key matrices. A public key associated with a first level and the switch key matrices are sent to a receiving node. The receiving node generates a key-value table, mapping values to keys, and encodes the keys and values using a polynomial ring of a predetermined type. The querying node encodes using a polynomial ring of the same predetermined type, then encrypts a query, using a public key, and sends the query to the receiving node. The receiving node performs a homomorphic comparison of the encrypted, encoded query with each encoded key entry in the encoded key-value store to determine a comparison result. The receiving node sums the results for each of the value entries and returns the summed result to the querying node. The querying node decrypts and decodes the received result using the corresponding secret key.

Efficient two party oblivious transfer using a leveled fully homomorphic encryption

Searching for desired data within an encrypted set of data (using a fully homomorphic encryption) without decrypting the set of data. A lookup key is compared against a set of encrypted data, employing characteristics of the fully homomorphic encryption, to locate and return desired data correlated to the lookup key.

Comparison and search operations of encrypted data

A method and system to minimize redundancy in testing a new software system by utilizing a knowledge base is provided. The knowledge base may be represented in a form of a decision tree including leaf nodes which store previously tested optimal configurations. When the knowledge base does not contain an optimal configuration for the new software, an optimal solution for the new software system may be determined by adding a further decision tree branch to the initial decision tree. A desirable tree branch may be selected from a table including a predetermined set of desirable tree branches for each category of software. As a result, the number of solutions to be tested on the input software may be limited and cost and effort to run redundant tests on a software system may be reduced.

Method and system for optimizing configuration classification of software

An apparatus for enabling connections for use with a network comprising at least one vertex, the apparatus comprising: a receiver, for receiving a first message associated with the first vertex, wherein the first message comprises an indication that the first vertex wishes to join the network; a generator, responsive to receipt of the first message, for generating a second message associated with the at least one vertex, wherein the second message comprising an indication that the at least one vertex is operable to connect to the first vertex; and a probabilistic component for determining a first time value associated with transmission of the second message to the first vertex in accordance with probabilistic data.

Enabling connections for use with a network

Method and system for constructing corrected Java native code are provided. Native source code that interfaces or integrates with Java code is analyzed and validated before the source code is compiled. One or more checks are performed on the native source code to verify that the native source correctly interfaces with the Java code, and the verification results from said one or more checks are reported. The method and system for constructing corrected Java native code can be implemented as a plug-in to a program development environment, wherein a developer may invoke the method and system while developing said native source code.

Method and implementation for constructing of corrected java native code

A method and system to minimize to redundancy in testing a new software system by utilizing a knowledge base is provided. The knowledge base may be represented in a form of a decision tree including leaf nodes which store previously tested optimal configurations. When the knowledge base does not contain an optimal configuration for the new software, an optimal solution for the new software system may be determined by adding a further decision tree branch to the initial decision tree. A desirable tree branch may be selected from a table including a predetermined set of desirable tree branches for each category of software. As a result, the number of solutions to be tested on the input software may be limited and cost and effort to run redundant tests on a software system may be reduced.

Growing community of inventors

Southampton, United Kingdom

Flavio Alvarenga Bergamaschi