Distributed tokenization using several substitution steps
First Claim
1. A method of tokenization, comprising:
- accessing a string of characters;
accessing a first token table and a second token table, each of the first token table and the second token table mapping each of a set of input values to a different token value, the first token table different than the second token table;
replacing, by a processor, a first substring of the string of characters with a first token value mapped to a value of the first sub string of characters by the first token table to form a first intermediate string of characters;
replacing a second substring of the intermediate string of characters with a second token value mapped to a value of the second sub string of characters by the second token table to form a second intermediate string of characters; and
combining the second intermediate string of characters with metadata describing the tokenization to form a tokenized string of characters.
3 Assignments
0 Petitions
Accused Products
Abstract
A method for distributed tokenization of sensitive strings of characters, such as social security numbers, credit card numbers and the like, in a local server is disclosed. The method comprises the steps of receiving from a central server at least one, and preferably at least two, static token lookup tables, and receiving a sensitive string of characters. In a first tokenization step, a first substring of characters is substituted with a corresponding first token from the token lookup table(s) to form a first tokenized string of characters, wherein the first substring of characters is a substring of the sensitive string of characters. Thereafter, in a second step of tokenization, a second substring of characters is substituted with a corresponding second token from the token lookup table(s) to form a second tokenized string of characters, wherein the second substring of characters is a substring of the first tokenized string of characters. Optionally, one or more additional tokenization steps is/are used.
-
Citations
20 Claims
-
1. A method of tokenization, comprising:
-
accessing a string of characters; accessing a first token table and a second token table, each of the first token table and the second token table mapping each of a set of input values to a different token value, the first token table different than the second token table; replacing, by a processor, a first substring of the string of characters with a first token value mapped to a value of the first sub string of characters by the first token table to form a first intermediate string of characters; replacing a second substring of the intermediate string of characters with a second token value mapped to a value of the second sub string of characters by the second token table to form a second intermediate string of characters; and combining the second intermediate string of characters with metadata describing the tokenization to form a tokenized string of characters. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A system comprising:
a processor and a non-transitory computer-readable medium storing executable computer instructions configured to, when executed by the processor, cause the system to perform steps comprising; accessing a string of characters; accessing a first token table and a second token table, each of the first token table and the second token table mapping each of a set of input values to a different token value, the first token table different than the second token table; replacing a first substring of the string of characters with a first token value mapped to a value of the first substring of characters by the first token table to form a first intermediate string of characters; replacing a second substring of the intermediate string of characters with a second token value mapped to a value of the second sub string of characters by the second token table to form a second intermediate string of characters; and combining the second intermediate string of characters with metadata describing the tokenization to form a tokenized string of characters. - View Dependent Claims (12, 13, 14, 15)
-
16. A non-transitory computer-readable storage medium storing executable computer instructions that, when executed by a hardware processor, perform steps comprising:
-
accessing a string of characters; accessing a first token table and a second token table, each of the first token table and the second token table mapping each of a set of input values to a different token value, the first token table different than the second token table; replacing a first substring of the string of characters with a first token value mapped to a value of the first substring of characters by the first token table to form a first intermediate string of characters; replacing a second substring of the intermediate string of characters with a second token value mapped to a value of the second sub string of characters by the second token table to form a second intermediate string of characters; and combining the second intermediate string of characters with metadata describing the tokenization to form a tokenized string of characters. - View Dependent Claims (17, 18, 19, 20)
-
Specification