Abstract: A method for handling an outgoing call within a telecommunications network is provided. The method includes on request of one or more applications, initiating an outgoing call to a callee, the initiating comprising the steps of generating an API request, identifying the callee and identifying an action of calling said callee; the one or more applications sending the API request to a first server to initiate the outgoing call; the first server, through an API module, deconstructing the API request and instructing a call module to handle the outgoing call; a second server receiving the outgoing call request from the first server; and the second server initiating the outgoing call. The disclosure also provides methods for handling an incoming call within a telecommunications network.

Abstract: An example system includes a processor to mask a ciphertext using four random elements to generate masked ciphertexts. The processor can send the masked ciphertexts to a server device. The processor can receive masked plaintexts from the server device. The processor can unmask the masked plaintexts using the four random elements to generate unmasked plaintexts.

Abstract: A method for handling an outgoing call within a telecommunications network is provided. The method includes on request of one or more applications, initiating an outgoing call to a callee, the initiating comprising the steps of generating an API request, identifying the callee and identifying an action of calling said callee; the one or more applications sending the API request to a first server to initiate the outgoing call; the first server, through an API module, deconstructing the API request and instructing a call module to handle the outgoing call; a second server receiving the outgoing call request from the first server; and the second server initiating the outgoing call. The disclosure also provides methods for handling an incoming call within a telecommunications network.

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.

Abstract: A computer-implemented method for privately determining data intersection is disclosed. The computer-implemented method includes performing private set intersection between two record sets to determine identical intersecting records corresponding to a particular record field. The computer-implemented method includes removing any identical intersecting records from each record set to form two record subsets. The computer-implemented method includes separately computing locality sensitive hash values for each of the two record subsets, wherein the locality sensitive hash values are computed for records corresponding to the particular record field. The computer-implemented method includes jointly performing private set intersection between the locality sensitive hash values separately computed for each of the two record subsets.

Abstract: An example system includes a processor to receive, from a client device, a delete query requesting deletion of a row of in a fully homomorphically encrypted (FHE) database. The processor can store an identifier of the row to be deleted in a deletion queue, where the row is to be replaced with values of a row to be inserted from a received insertion query.

Abstract: An example system includes a processor to receive, from a client device, a delete query requesting deletion of a row of in a fully homomorphically encrypted (FHE) database. The processor can store an identifier of the row to be deleted in a deletion queue, where the row is to be replaced with values of a row to be inserted from a received insertion query.

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.