# US 8,280,817 B2 · Authentication and tracking system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 8,280,817 B2
- Document ID: US8280817B2
- Status: Granted
- Kind: B2
- Application number: 13/049,282
- Filed: 2011-03-16
- Published: 2011-09-15
- Granted: 2012-10-02
- Earliest claimed: 2003-11-03
- Assignees: Verify Brand LLC
- Inventors: David Dillon
- Web page: https://patentgrep.com/patent/US8280817B2

## CPC

- G06Q 30/06: Buying, selling or leasing transactions
- G06Q 10/08: Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q 30/0185: {Product, service or business identity fraud}
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

A subset of unique codes are generated from a set of codes. The subset of codes are stored in a database on a secure server and each of the codes is marked on a corresponding instantiation of the product. The marked instantiations are distributed. During their distribution, the marked instantiations are verified for authenticity and for routing. This verification is performed by reading or scanning the codes on the instantiations, and transmitting that information to the secure server for comparison against the codes and other information located in the database contained therein.

## Claims

### Claim 1

A system for authenticating one or more instantiations of a product comprising:
a secure server with a database storing a subset of unique code strings, wherein each unique code string of the subset is marked on a unique instantiation of a product, wherein the subset of unique code strings is derived from a code string model having finite parameters of code string length and code string character types, the finite parameters defining the total quantity of unique code strings, a size B of a subset of unique code strings of a total quantity of unique code strings is selected based on the equation B=P*(ND), where P is a probability of guessing a code string of a subset of unique code strings, N is a quantity of the finite parameters of a code string length, D is a quantity of code string character types, and ND is the total quantity of unique code strings; and
a communication device, coupled to the secure server by a network, that transmits an inquiry signal to the secure server, wherein the inquiry signal includes a code string marked on an instantiations of the product,
wherein the secure server receives the inquiry signal, searches the database to determine whether the code string in the received inquiry signal matches a code string of the subset of unique code strings stored in the database in order to validate authenticity of the instantiation of the product corresponding to the code string in the received inquiry signal.

### Claim 2 (depends on 1)

The system of claim 1, wherein the code string model comprises a serial number, wherein the finite parameters include having at least seven alphanumeric characters.

### Claim 3 (depends on 1)

The system of claim 1, wherein the communication device includes a keypad used for manual entry of the one unique code string.

### Claim 4 (depends on 1)

The system of claim 1, wherein the communication device is a cellular phone.

### Claim 5 (depends on 1)

The system of claim 1, wherein the database is one of a plurality of databases storing subsets of unique code strings, wherein each of the plurality of databases corresponds to a distinct product.

### Claim 6 (depends on 5)

The system of claim 5, wherein the inquiry signal also includes an indication of the distinct product and the inquiry signal is automatically shifted to the database of the secure server based on the indication of the distinct product.

### Claim 7 (depends on 6)

The system of claim 6, wherein a same subset of unique code strings are stored in at least two of the plurality of databases.

### Claim 8 (depends on 1)

The system of claim 1, wherein the communication device comprises a laser scanner.

### Claim 9 (depends on 1)

The system of claim 1, wherein each of the subset of unique code strings is marked on or affixed to a tag.

### Claim 10 (depends on 1)

The system of claim 1, wherein each of the subset of unique code strings is embedded within layers of a tag, the tag being a holographic compilation.

### Claim 11 (depends on 1)

The system of claim 1, wherein each of the subset of unique code strings is programmed in a radio frequency tag.

### Claim 12 (depends on 1)

The system of claim 1, wherein each of the subset of unique code strings is encoded within threads of a tag.

### Claim 13 (depends on 1)

The system of claim 1, wherein the communication device comprises a field reader, wherein the field reader scans the code string marked on the instantiation of the product, encodes the scanned unique code string into a machine-readable format, and transmits the encoded unique code string to the secure server, and wherein the secure server decodes the encoded unique code string to produce the scanned unique code string.

### Claim 14

A system for authenticating one or more instantiations of a product comprising:
a secure server with a database storing a subset of unique code strings, wherein each unique code string of the subset is marked on a unique instantiation of a product, wherein the subset of unique code strings is derived from a code string model having finite parameters of code string length and code string character types, the finite parameters defining the total quantity of unique code strings, a quantity of the finite parameters of code string length N and a quantity of code string character types D are selected based on the equations P=B/(ND) and P≦X, wherein P is the probability of guessing any code string of a subset of unique code strings, B is a size of the subset of unique code strings, ND is a total quantity of unique code strings and X is a user-selectable probability of guessing any code string of the subset of unique code strings; and
a communication device, coupled to the secure server by a network, that transmits an inquiry signal to the secure server, wherein the inquiry signal includes a code string marked on an instantiations of the product,
wherein the secure server receives the inquiry signal, searches the database to determine whether the code string in the received inquiry signal matches a code string of the subset of unique code strings stored in the database in order to validate authenticity of the instantiation of the product corresponding to the code string in the received inquiry signal.

### Claim 15 (depends on 14)

The system of claim 14, wherein the code string model comprises a serial number, wherein the finite parameters include having at least seven alphanumeric characters.

### Claim 16 (depends on 14)

The system of claim 14, wherein the communication device includes a keypad used for manual entry of the one unique code string.

### Claim 17 (depends on 14)

The system of claim 14, wherein the communication device is a cellular phone.

### Claim 18 (depends on 14)

The system of claim 14, wherein the database is one of a plurality of databases storing subsets of unique code strings, wherein each of the plurality of databases corresponds to a distinct product.

### Claim 19 (depends on 18)

The system of claim 18, wherein the inquiry signal also includes an indication of the distinct product and the inquiry signal is automatically shifted to the database of the secure server based on the indication of the distinct product.

### Claim 20 (depends on 19)

The system of claim 19, wherein a same subset of unique code strings are stored in at least two of the plurality of databases.

### Claim 21 (depends on 14)

The system of claim 14, wherein the communication device comprises a laser scanner.

### Claim 22 (depends on 14)

The system of claim 14, wherein each of the subset of unique code strings is marked on or affixed to a tag.

### Claim 23 (depends on 14)

The system of claim 14, wherein each of the subset of unique code strings is embedded within layers of a tag, the tag being a holographic compilation.

### Claim 24 (depends on 14)

The system of claim 14, wherein each of the subset of unique code strings is programmed in a radio frequency tag.

### Claim 25 (depends on 14)

The system of claim 14, wherein each of the subset of unique code strings is encoded within threads of a tag.

### Claim 26 (depends on 14)

The system of claim 14, wherein the communication device comprises a field reader, wherein the field reader scans the code string marked on the instantiation of the product, encodes the scanned unique code string into a machine-readable format, and transmits the encoded unique code string to the secure server, and wherein the secure server decodes the encoded unique code string to reveal the scanned unique code string.

### Claim 27

A method for authenticating one or more instantiations of a product comprising:
storing a subset of unique code strings in a database of a secure server, wherein each unique code string of the subset of unique codes strings are marked on a unique instantiation of a product, wherein the subset of unique code strings is derived from a code string model having finite parameters of code string length and code string character types, the finite parameters defining the total quantity of unique code strings, a size B of a subset of unique code strings of a total quantity of unique code strings is selected based on the equation B=P*(ND), where P is a probability of guessing a code string of a subset of unique code strings, N is a quantity of the finite parameters of a code string length, D is a quantity of code string character types, and ND is the total quantity of unique code strings;
receiving, by the secure server from a communication device, an inquiry signal that includes a code string marked on an instantiation of the product; and
searching, by the secure server, to determine whether the code string in the received inquiry signal matches a code string of the subset of unique code strings stored in the database in order to validate authenticity of the instantiation of the product corresponding to the code string in the received inquiry signal.

### Claim 28 (depends on 27)

The method of claim 27, wherein the code string model comprises a serial number, wherein the finite parameters include having at least seven alphanumeric characters.

### Claim 29 (depends on 27)

The method of claim 27, wherein the communication device includes a keypad used for manual entry of the one unique code string.

### Claim 30 (depends on 27)

The method of claim 27, wherein the communication device is a cellular phone.

### Claim 31 (depends on 27)

The method of claim 27, wherein the database is one of a plurality of databases storing subsets of unique code strings, wherein each of the plurality of databases corresponds to a distinct product.

### Claim 32 (depends on 31)

The method of claim 31, wherein the inquiry signal also includes an indication of the distinct product and the inquiry signal is automatically shifted to the database of the secure server based on the indication of the distinct product.

### Claim 33 (depends on 32)

The method of claim 32, wherein a same subset of unique code strings are stored in at least two of the plurality of databases.

### Claim 34 (depends on 27)

The method of claim 27, wherein the communication device comprises a laser scanner.

### Claim 35 (depends on 27)

The method of claim 27, wherein each of the subset of unique code strings is marked on or affixed to a tag.

### Claim 36 (depends on 27)

The method of claim 27, wherein each of the subset of unique code strings is embedded within layers of a tag, the tag being a holographic compilation.

### Claim 37 (depends on 27)

The method of claim 27, wherein each of the subset of unique code strings is programmed in a radio frequency tag.

### Claim 38 (depends on 27)

The method of claim 27, wherein each of the subset of unique code strings is encoded within threads of a tag.

### Claim 39 (depends on 27)

The method of claim 27, wherein the communication device comprises a field reader, wherein the field reader scans the code string marked on the instantiation of the product, encodes the scanned unique code string into a machine-readable format, and transmits the encoded unique code string to the secure server, and wherein the secure server decodes the encoded unique code string to produce the scanned unique code string.

### Claim 40

A method for authenticating one or more instantiations of a product comprising:
storing a subset of unique code strings in a database of a secure server, wherein each of the unique code strings of the subset of unique code strings are marked on a unique instantiation of a product, wherein the subset of unique code strings is derived from a code string model having finite parameters of code string length and code string character types, the finite parameters defining the total quantity of unique code strings, a quantity of the finite parameters of code string length N and a quantity of code string character types D are selected based on the equations P=B/(ND) and P≦X, wherein P is the probability of guessing any code string of a subset of unique code strings, B is a size of the subset of unique code strings, ND is a total quantity of unique code strings and X is a user-selectable probability of guessing any code string of the subset of unique code strings;
receiving, by the secure server from a communication device, an inquiry signal that includes a code string marked on an instantiation of the product; and
searching, by the secure server, to determine whether the code string in the received inquiry signal matches a code string of the subset of unique code strings stored in the database in order to validate authenticity of the instantiation of the product corresponding to the code string in the received inquiry signal.

### Claim 41 (depends on 40)

The method of claim 40, wherein the code string model comprises a serial number, wherein the finite parameters include having at least seven alphanumeric characters.

### Claim 42 (depends on 40)

The method of claim 40, wherein the communication device includes a keypad used for manual entry of the one unique code string.

### Claim 43 (depends on 40)

The method of claim 40, wherein the communication device is a cellular phone.

### Claim 44 (depends on 40)

The method of claim 40, wherein the database is one of a plurality of databases storing subsets of unique code strings, wherein each of the plurality of databases corresponds to a distinct product.

### Claim 45 (depends on 44)

The method of claim 44, wherein the inquiry signal also includes an indication of the distinct product and the inquiry signal is automatically shifted to the database of the secure server based on the indication of the distinct product.

### Claim 46 (depends on 45)

The method of claim 45, wherein a same subset of unique code strings are stored in at least two of the plurality of databases.

### Claim 47 (depends on 40)

The method of claim 40, wherein the communication device comprises a laser scanner.

### Claim 48 (depends on 40)

The method of claim 40, wherein each of the subset of unique code strings is marked on or affixed to a tag.

### Claim 49 (depends on 40)

The method of claim 40, wherein each of the subset of unique code strings is embedded within layers of a tag, the tag being a holographic compilation.

### Claim 50 (depends on 40)

The method of claim 40, wherein each of the subset of unique code strings is programmed in a radio frequency tag.

### Claim 51 (depends on 40)

The method of claim 40, wherein each of the subset of unique code strings is encoded within threads of a tag.

### Claim 52 (depends on 40)

The method of claim 40, wherein the communication device comprises a field reader, wherein the field reader scans the code string marked on the instantiation of the product, encodes the scanned unique code string into a machine-readable format, and transmits the encoded unique code string to the secure server, and wherein the secure server decodes the encoded unique code string to produce the scanned unique code string.
