Patents by Inventor Michael B. Litherland

Michael B. Litherland 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).

  • Patent number: 9652511
    Abstract: Provided are techniques for secure matching supporting fuzzy data. A first bloom filter for a first data element is retrieved, wherein each of the characters in the data element has been encrypted with a beginning offset position of the character and encrypted with an end offset position of the character to produce two encrypted values that are added to the first bloom filter. A second bloom filter for a second data element is retrieved. The first bloom filter and the second bloom filter are compared to determine whether there is a match between the first data element and the second data element.
    Type: Grant
    Filed: March 13, 2013
    Date of Patent: May 16, 2017
    Assignee: International Business Machines Corporation
    Inventors: Michael B. Litherland, Ivan M. Milman, Martin Oberhofer, Donald A. Padilla
  • Patent number: 9652512
    Abstract: Provided are techniques for secure matching supporting fuzzy data. A first bloom filter for a first data element is retrieved, wherein each of the characters in the data element has been encrypted with a beginning offset position of the character and encrypted with an end offset position of the character to produce two encrypted values that are added to the first bloom filter. A second bloom filter for a second data element is retrieved. The first bloom filter and the second bloom filter are compared to determine whether there is a match between the first data element and the second data element.
    Type: Grant
    Filed: September 23, 2014
    Date of Patent: May 16, 2017
    Assignee: International Business Machines Corporation
    Inventors: Michael B. Litherland, Ivan M. Milman, Martin Oberhofer, Donald A. Padilla
  • Publication number: 20150012564
    Abstract: Provided are techniques for secure matching supporting fuzzy data. A first bloom filter for a first data element is retrieved, wherein each of the characters in the data element has been encrypted with a beginning offset position of the character and encrypted with an end offset position of the character to produce two encrypted values that are added to the first bloom filter. A second bloom filter for a second data element is retrieved. The first bloom filter and the second bloom filter are compared to determine whether there is a match between the first data element and the second data element.
    Type: Application
    Filed: September 23, 2014
    Publication date: January 8, 2015
    Inventors: Michael B. Litherland, Ivan M. Milman, Martin Oberhofer, Donald A. Padilla
  • Publication number: 20140365423
    Abstract: A method and system are disclosed for determining relative connectedness from temporal data. A user iterates through a list of items implemented on a mobile device. As each item on the list is located it is marked to generate a corresponding timestamp. The timestamps are then used to generate a timestamped list, which in turn is processed to determine the amount of elapsed time between each item on the list being located. The timestamped list data is then processed to generate relative connectedness data, which in turn is processed to generate a relative connectedness graph. The relative connectedness graph is then processed to assign coordinates to each item on the list. In turn, the coordinates are used to generate a map of the items.
    Type: Application
    Filed: November 15, 2013
    Publication date: December 11, 2014
    Applicant: International Business Machines Corporation
    Inventors: Michael B. Litherland, Ivan M. Milman, Martin Oberhofer, Donald A. Padilla
  • Publication number: 20140365106
    Abstract: A method and system are disclosed for determining relative connectedness from temporal data. A user iterates through a list of items implemented on a mobile device. As each item on the list is located it is marked to generate a corresponding timestamp. The timestamps are then used to generate a timestamped list, which in turn is processed to determine the amount of elapsed time between each item on the list being located. The timestamped list data is then processed to generate relative connectedness data, which in turn is processed to generate a relative connectedness graph. The relative connectedness graph is then processed to assign coordinates to each item on the list. In turn, the coordinates are used to generate a map of the items.
    Type: Application
    Filed: June 10, 2013
    Publication date: December 11, 2014
    Inventors: Michael B. Litherland, Ivan M. Milman, Martin Oberhofer, Donald A. Padilla
  • Publication number: 20140280342
    Abstract: Provided are techniques for secure matching supporting fuzzy data. A first bloom filter for a first data element is retrieved, wherein each of the characters in the data element has been encrypted with a beginning offset position of the character and encrypted with an end offset position of the character to produce two encrypted values that are added to the first bloom filter. A second bloom filter for a second data element is retrieved. The first bloom filter and the second bloom filter are compared to determine whether there is a match between the first data element and the second data element.
    Type: Application
    Filed: March 13, 2013
    Publication date: September 18, 2014
    Inventors: Michael B. Litherland, Ivan M. Milman, Martin Oberhofer, Donald A. Padilla