# US 2021/0342470 A1 · Secure attribute verification

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

- Number: US 2021/0342470 A1
- Document ID: US20210342470A1
- Status: Published application
- Kind: A1
- Application number: 16/863,850
- Filed: 2020-04-30
- Published: 2021-11-04
- Earliest claimed: 2020-04-30
- Assignees: Lenovo (Singapore) Pte. Ltd.
- Applicants: LENOVO (Singapore) PTE. LTD.
- Inventors: Igor Stolbikov; Jixin Feng; Scott W. Li
- Web page: https://patentgrep.com/patent/US20210342470A1

## CPC

- G06F 21/6245: {Protecting personal data, e.g. for financial or medical purposes}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/3228: {One-time or temporary data, i.e. information which is sent for every authentication or authorization, e.g. one-time-password, one-time-token or one-time-key}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 63/123: {received data contents, e.g. message integrity}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

For secure attribute verification, a processor generates a plurality of hashes of a seed and a previous public group index. The processor further iteratively generates a public group index for each hash. The processor generates a one-time user identifier expressed as a hash chain of identifiers each based on one of the public group indexes. The processor verifies user attributes from the one-time user identifier.

## Claims

### Claim 1

An apparatus comprising:
a processor;
a memory storing code executable by the processor to:
generate a plurality of the hashes of a seed and a previous public group index;
iteratively generate a public group index for each hash;
generate a one-time user identifier expressed as a hash chain of identifiers each based on one of the public group indexes; and
verify user attributes from the one-time user identifier.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein an initial hash is generated from only the seed.

### Claim 3 (depends on 2)

The apparatus of claim 2, wherein the code is further executable by the processor to generate the seed as a hash of user attributes.

### Claim 4 (depends on 1)

The apparatus of claim 1, wherein the code is further executable by the processor to generate the identifier by using the public group index to index a public group to retrieve the corresponding identifier.

### Claim 5 (depends on 4)

The apparatus of claim 4, wherein each public group index calculated as a deterministic function of the hash.

### Claim 6 (depends on 4)

The apparatus of claim 4, wherein each public group index calculated as hard discreet logarithm function over the public group of large order q over the hash.

### Claim 7 (depends on 4)

The apparatus of claim 4, wherein each public group index calculated as a hard logarithm function over the public group of large order q of the hash, wherein q is a number of identifiers in the public group.

### Claim 8 (depends on 1)

The apparatus of claim 1, where a given public group index is the previous public group index for a subsequent verification of the user attributes.

### Claim 9 (depends on 1)

The apparatus of claim 1, wherein the one-time user identifier comprises in the range of 2-4 identifiers.

### Claim 10

A method comprising:
generating, by use of a processor, a plurality of the hashes of a seed and a previous public group index;
iteratively generating a public group index for each hash;
generating a one-time user identifier expressed as a hash chain of identifiers each based on one of the public group indexes; and
verifying user attributes from the one-time user identifier.

### Claim 11 (depends on 10)

The method of claim 10, wherein an initial hash is generated from only the seed.

### Claim 12 (depends on 11)

The method of claim 11, wherein the method further comprises generating the seed as a hash of user attributes.

### Claim 13 (depends on 10)

The method of claim 10, the method further comprising generating the identifier by using the public group index to index a public group to retrieve the corresponding identifier.

### Claim 14 (depends on 13)

The method of claim 13, wherein each public group index calculated as a deterministic function of the hash.

### Claim 15 (depends on 13)

The method of claim 13, wherein each public group index calculated as hard discreet logarithm function over the public group of large order q over the hash.

### Claim 16 (depends on 13)

The method of claim 13, wherein each public group index calculated as a hard logarithm function over the public group of large order q of the hash, wherein q is a number of identifiers in the public group.

### Claim 17 (depends on 10)

The method of claim 10, where a given public group index is the previous public group index for a subsequent verification of the user attributes.

### Claim 18 (depends on 10)

The method of claim 10, wherein the one-time user identifier comprises in the range of 2-4 identifiers.

### Claim 19

A program product comprising a computer readable storage medium that stores code executable by a processor, the executable code comprising code to:
generate a plurality of the hashes of a seed and a previous public group index;
iteratively generate a public group index for each hash;
generate a one-time user identifier expressed as a hash chain of identifiers each based on one of the public group indexes; and
verify user attributes from the one-time user identifier.

### Claim 20 (depends on 19)

The program product of claim 19, wherein the code is further executable by the processor to generate the identifier by using the public group index to index a public group to retrieve the corresponding identifier.
