Method for secure substring search
OwnerKurt Rohloff, David Bruce Cousins +1inventors
InventorsKurt Rohloff, David Bruce Cousins, Richard Schantz
Life of this patent
Estimating the term…
Abstract
A system and method for secure substring search, using fully homomorphic encryption, or somewhat homomorphic encryption. In one embodiment, a first string is homomorphically compared to trial substrings of a second string, each comparison producing a ciphertext containing an encrypted indication of whether the first string matches the trial substrings. These ciphertexts are then combined in a homomorphic logical OR operation to produce a ciphertext which contains an encrypted indication of whether the first string matches any of the trial substrings, i.e., whether the first string is contained in the second string.
Claims20
A method for determining whether a first string is a substring of a second string, the method comprising:
- performing a first sequence of operations, on:
- a set of first ciphertexts corresponding to the first string;
- and
- a set of second ciphertexts corresponding to a trial substring of the second string,
- to form a resulting third ciphertext containing an encrypted indication of whether the first string matches the trial substring.
A system for determining whether a first string is a substring of a second string, the system comprising a processing unit configured to
- perform a first sequence of operations, on:
- a set of first ciphertexts corresponding to the first string;
- and
- a set of second ciphertexts corresponding to a trial substring of the second string,
- to form a resulting third ciphertext containing an encrypted indication of whether the first string matches the trial substring.
Dependencies are inferred from the claim text.