Patents Assigned to Liaison Technologies, Inc.
  • Patent number: 8850071
    Abstract: A map intuition system and method that involves machine learning techniques to analyze data sets and identify mappings and transformation rules as well as machine-human interactions to leverage human intuition and intelligence to rapidly complete a map.
    Type: Grant
    Filed: May 10, 2011
    Date of Patent: September 30, 2014
    Assignee: Liaison Technologies, Inc.
    Inventors: Walter Hughes Lindsay, Joel Timothy Shellman
  • Patent number: 8812844
    Abstract: Systems and methods for maintaining data security using Luhn validation in a multiple domain computing environment are presented. Each domain includes a token generator that can generate tokens associated with sensitive data such as credit card numbers. The token generation algorithm includes a Luhn validation routine for producing a tokenized data string that either passes or fails Luhn. The possibility of token collision is eliminated by a token generation algorithm that embeds a domain designator corresponding to the active domain where the token was created. When multiple tokens represent the same sensitive data, the token manager returns a set of all such tokens found.
    Type: Grant
    Filed: June 20, 2012
    Date of Patent: August 19, 2014
    Assignee: Liaison Technologies, Inc.
    Inventors: Jason Chambers, Theresa Robison, Dameion Dorsner, Sridhar Manickam, Daniel Konisky
  • Patent number: 8806204
    Abstract: Systems and methods for maintaining data security across multiple active domains are presented. Each domain includes a token generator that can generate tokens associated with sensitive data such as credit card numbers. The primary domain includes a centralized key manager. In one embodiment, each domain includes its own local data vault and a replica of each data vault associated with every remote domain. Any domain can access the data vaults (local and replica) and retrieve a token created by any other domain. The possibility of token collision is eliminated by a token generation algorithm that embeds a domain designator corresponding to the active domain where the token was created. When multiple tokens represent the same sensitive data, the token manager returns a set of all such tokens found in the data vaults.
    Type: Grant
    Filed: June 20, 2012
    Date of Patent: August 12, 2014
    Assignee: Liaison Technologies, Inc.
    Inventors: Jason Chambers, Theresa Robison, Dameion Dorsner, Sridhar Manickam, Daniel Konisky
  • Patent number: 8533479
    Abstract: A system and method for communicating a document between multiple locations is disclosed. A computing device receives, via a network, multiple portions of a document signed and/or encrypted at a first location in accordance with a first signing and encryption methodology along with a trailer manifest specifying an order the portions need to be assembled to reconstruct the document. Each of the portions and the manifest is individually decrypted and validated using the first signing and/or encrypting methodology. The portions and manifest are re-signed and/or re-encrypted with a second signing and encryption methodology such that the information can be decrypted, the signatures can be validated and the document can be reassembled at a second location.
    Type: Grant
    Filed: May 28, 2010
    Date of Patent: September 10, 2013
    Assignee: Liaison Technologies, Inc.
    Inventors: Max N. Coburn, Yen Luong Huynh
  • Patent number: 8458487
    Abstract: Systems and methods for secure access and utilization of sensitive data such as credit card numbers, Social Security Numbers, personal identifying information, etc. A tokenizing strategy component provides for creating, managing, and storing tokenization strategies on behalf of a plurality of users. A data tokenizing component is operative to (a) receive an input data string of sensitive data from a user, (b) apply a selected tokenization strategy to the input data string to generate a tokenized data string, and (c) provide the tokenized data string for storage in association with the input data string. A secure server including a secure database stores the tokenized data string and the input data string in a corresponding mapped relationship. A security component controls access to and retrieval of the tokenized data string and to the input data string in accordance with predetermined security requirements of the users.
    Type: Grant
    Filed: March 3, 2011
    Date of Patent: June 4, 2013
    Assignee: Liaison Technologies, Inc.
    Inventors: Gary Palgon, Jason Chambers, Dan Konisky
  • Publication number: 20030023622
    Abstract: The invention is directed to an automated workflow management system. The automated workflow management system may manage content records in a workflow process. For example, the automated workflow management system may prepare data records for storage in a database. Further, the automated workflow management system may prepare content for a catalog. The automated workflow management system may prompt users to act on documents that violate a business logic rule. The automated workflow management system may observe and record user actions. Further, the automated workflow management system may persist those recorded user actions as persisted activities. In addition, the automated workflow management system may replay or repeat the persisted activities. These persisted activities may be associated with specific content records. Further, the user actions may take the form of decisions, editing, classifying, and others. These decisions may be to discard the content record or bypass the business rule.
    Type: Application
    Filed: November 13, 2001
    Publication date: January 30, 2003
    Applicant: Liaison Technology, Inc.
    Inventors: L. Lance Obermeyer, Nathaniel B. Forman, Keith Yarbrough
  • Publication number: 20020021838
    Abstract: A system and method for examining a string of symbols and identifying portions of the string which match a predetermined pattern using adaptively weighted, partitioned context edit distances. A pattern is partitioned into context and value components, and candidate matches for each of the components is identified by calculating an edit distance between that component and each potentially matching set (sub-string) of symbols within the string. One or more candidate matches having the lowest edit distances are selected as matches for the pattern. The weighting of each of the component matches may be adapted to optimize the pattern matching and, in one embodiment, the context components may be heavily weighted to obtain matches of a value for which the corresponding pattern is not well defined. In one embodiment, an edit distance matrix is evaluated for each of a prefix component, a value component and a suffix component of a pattern.
    Type: Application
    Filed: July 26, 2001
    Publication date: February 21, 2002
    Applicant: Liaison Technology, Inc.
    Inventors: Alvin Charles Richardson, Charles Michael Davis, Daniel P. Miranker