# US 2019/0243986 A1 · Method for managing information using tree structure based on blockchain, server and terminal using the same

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

- Number: US 2019/0243986 A1
- Document ID: US20190243986A1
- Status: Published application
- Kind: A1
- Application number: 16/268,885
- Filed: 2019-02-06
- Published: 2019-08-08
- Earliest claimed: 2018-02-06
- Assignees: Coinplug, Inc.
- Applicants: Coinplug, Inc.
- Inventors: Joon Sun UHR; Jay Wu HONG; Joo Han SONG; Moon Gju SUH
- Web page: https://patentgrep.com/patent/US20190243986A1

## CPC

- G06F 21/6227: {where protection concerns the structure of data, e.g. records, types, queries}
- G06F 21/6245: {Protecting personal data, e.g. for financial or medical purposes}
- G06F 21/64: Protecting data integrity, e.g. using checksums, certificates or signatures
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- 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

A method for information management using a specific tree based on a blockchain is provided. The method includes steps of: a user device (a) if private data related to a subject are acquired from a specific user of the user device, generating the specific tree, wherein the specific tree has leaf nodes to which private function values, created by applying its algorithm to the private data or their processed values, is allocated; and (b) (i) performing one of (i-1) registering a representative value of the specific tree as a subject ID of the subject and (i-2) registering information on the specific tree as the subject ID of the subject, in the blockchain, and (ii) supports another device to register one of (ii-1) the representative value of the specific tree as the subject ID and (ii-2) the information on the specific tree as the subject ID, in the blockchain.

## Claims

### Claim 1

A method for information management using at least one specific tree based on a blockchain, comprising steps of:
(a) a user device, if one or more private data related to at least one subject are acquired from a specific user of the user device, generating or supporting another device to generate the specific tree, wherein the specific tree has leaf nodes to which each of private function values, created by applying its corresponding algorithm to each of the private data or their processed values, is allocated; and
(b) the user device (i) performs one of processes of (i-1) registering a representative value of the specific tree as a subject ID of the subject in the blockchain such that the representative value corresponds to the subject and (i-2) registering information on the specific tree as the subject ID of the subject in the blockchain such that the information on the specific tree corresponds to the subject, and (ii) supports another device to perform one of processes of (ii-1) registering the representative value of the specific tree as the subject ID of the subject in the blockchain such that the representative value corresponds to the subject and (ii-2) registering the information on the specific tree as the subject ID of the subject in the blockchain such that the information on the specific tree corresponds to the subject.

### Claim 2 (depends on 1)

The method of claim 1, wherein, at the step of (a), the user device performs or supports another device to perform processes of generating one or more pseudo-public data including (i) one or more prefix values, corresponding to specific private data among the private data, which are one of (i-1) one or more representative private values of one or more specific ranges of the specific private data and (i-2) one or more reliability values of the specific private data, and (ii) a specific private value of the specific private data, registering the generated pseudo-public data as one or more sub-data corresponding to a sub-structure of a specific leaf node to which the specific private data is allocated, and allocating a pseudo-public function value created by applying the algorithm to the pseudo-public data to the specific leaf node.

### Claim 3 (depends on 2)

The method of claim 2, wherein the user device performs or supports another device to perform processes of generating prefix values, corresponding to the specific private data, determining the pseudo-public data of multi-levels including (i) the prefix values and (ii) the specific private function value of the specific private data, registering the pseudo-public data of multi-levels as the sub-data corresponding to the specific leaf node, and allocating a partial pseudo-public function value created by applying the algorithm to at least part of the pseudo-public data of multi-levels to the specific leaf node.

### Claim 4 (depends on 3)

The method of claim 3, wherein the pseudo-public data of lower levels covers at least one broader open range of the specific private data, and wherein the pseudo-public data of a specific level include (i) a specific prefix value corresponding to the specific level and (ii) a lower function value of the pseudo-public data of a level just below the specific level or the specific private function value of the specific private data.

### Claim 5 (depends on 4)

The method of claim 4, wherein the user device allocates or supports another device to allocate a top function value, created by applying the algorithm to the pseudo-public data of a highest level among the pseudo-public data of multi-levels, to the specific leaf node.

### Claim 6 (depends on 1)

The method of claim 1, wherein, at the step of (a), said their processed values are the pseudo-public data including (i) one or more prefix values, corresponding to specific private data among the private data, which is one of (i-1) one or more representative private values of one or more specific ranges of the specific private data and (i-2) one or more reliability values of the specific private data, and (ii) the specific private function value of the specific private data.

### Claim 7 (depends on 1)

The method of claim 1, wherein, at the step of (a),
(x1) the user device performs or supports another device to perform calculating at least one intermediate function value by applying the algorithm to the private function values allocated to sibling nodes neighboring with each other among nodes, of the specific tree, to which the private function values are allocated, and allocating the intermediate function value to a parent node of the sibling nodes,
(x2) the user device determines or supports another device to determine, if the parent node is a representative node of the specific tree, the intermediate function value allocated to the parent node as a representative value of the specific tree, and
(x3) the user device performs or supports another device to perform (x1) to (x2) repeatedly, if the parent node is not the representative node of the specific tree, by treating the parent node as one of the sibling nodes.

### Claim 8 (depends on 1)

The method of claim 1, wherein, at the step of (a), the user device, if at least part of the leaf nodes do not have any private function values allocated thereto, allocates or supports another device to allocate one or more certain function values to said at least part of the leaf nodes.

### Claim 9

A method for information management using at least one specific tree based on a blockchain, comprising steps of:
(a) a service-providing server, on condition that at least one specific tree for reference has been generated and information on the specific tree for reference has been registered as a subject ID of at least one subject in the blockchain such that the information on the specific tree for reference corresponds to the subject, wherein the specific tree for reference has leaf nodes to which each of private function values, created by applying its corresponding algorithm to each of one or more private data related to the subject or their processed values, is allocated, if specific private data among the private data is acquired from at least one user device, acquiring or supporting another device to acquire the information on the specific tree for reference stored in the blockchain as corresponding to the subject; and
(b) the service-providing server allocating or supporting another device to allocate at least one specific private function value, created by applying the algorithm to the specific private data or their processed values, to at least one specific leaf node at a location corresponding to the specific private data by referring to the information on the specific tree for reference, to thereby generate at least one specific tree for comparison, and determining or supporting another device to determine whether the specific private data acquired from the user device is forged by comparing a representative value of the specific tree for comparison and a representative value in the information on the specific tree for reference acquired from the blockchain.

### Claim 10

A user device for information management using at least one specific tree based on a blockchain, comprising:
at least one memory that stores instructions; and
at least one processor configured to execute the instructions to perform processes of: (I) if one or more private data related to at least one subject are acquired from a specific user of the user device, generating or supporting another device to generate the specific tree, wherein the specific tree has leaf nodes to which each of private function values, created by applying its corresponding algorithm to each of the private data or their processed values, is allocated, and (II) (i) (i-1) registering a representative value of the specific tree as a subject ID of the subject in the blockchain such that the representative value corresponds to the subject and (i-2) registering information on the specific tree as the subject ID of the subject in the blockchain such that the information on the specific tree corresponds to the subject, and (ii) supporting another device to perform one (ii-1) registering the representative value of the specific tree as the subject ID of the subject in the blockchain such that the representative value corresponds to the subject and (ii-2) registering the information on the specific tree as the subject ID of the subject in the blockchain such that the information on the specific tree corresponds to the subject.

### Claim 11 (depends on 10)

The user device of claim 10, wherein, at the process of (I), the processor performs or supports another device to perform processes of generating one or more pseudo-public data including (i) one or more prefix values, corresponding to specific private data among the private data, which are one of (i-1) one or more representative private values of one or more specific ranges of the specific private data and (i-2) one or more reliability values of the specific private data, and (ii) a specific private value of the specific private data, registering the generated pseudo-public data as one or more sub-data corresponding to a sub-structure of a specific leaf node to which the specific private data is allocated, and allocating a pseudo-public function value created by applying the algorithm to the pseudo-public data to the specific leaf node.

### Claim 12 (depends on 11)

The user device of claim 11, wherein the processor performs or supports another device to perform processes of generating prefix values, corresponding to the specific private data, determining the pseudo-public data of multi-levels including (i) the prefix values and (ii) the specific private function value of the specific private data, registering the pseudo-public data of multi-levels as the sub-data corresponding to the specific leaf node, and allocating a partial pseudo-public function value created by applying the algorithm to at least part of the pseudo-public data of multi-levels to the specific leaf node.

### Claim 13 (depends on 12)

The user device of claim 12, wherein the pseudo-public data of lower levels covers at least one broader open range of the specific private data, and wherein the pseudo-public data of a specific level include (i) a specific prefix value corresponding to the specific level and (ii) a lower function value of the pseudo-public data of a level just below the specific level or the specific private function value of the specific private data.

### Claim 14 (depends on 13)

The user device of claim 13, wherein the processor allocates or supports another device to allocate a top function value, created by applying the algorithm to the pseudo-public data of a highest level among the pseudo-public data of multi-levels, to the specific leaf node.

### Claim 15 (depends on 1)

The user device of claim 1, wherein, at the process of (I), said their processed values are the pseudo-public data including (i) one or more prefix values, corresponding to specific private data among the private data, which is one of (i-1) one or more representative private values of one or more specific ranges of the specific private data and (i-2) one or more reliability values of the specific private data, and (ii) the specific private function value of the specific private data.

### Claim 16 (depends on 10)

The user device of claim 10, wherein, at the process of (I),
(x1) the processor performs or supports another device to perform calculating at least one intermediate function value by applying the algorithm to the private function values allocated to sibling nodes neighboring with each other among nodes, of the specific tree, to which the private function values are allocated, and allocating the intermediate function value to a parent node of the sibling nodes,
(x2) the processor determines or supports another device to determine, if the parent node is a representative node of the specific tree, the intermediate function value allocated to the parent node as a representative value of the specific tree, and
(x3) the processor performs or supports another device to perform (x1) to (x2) repeatedly, if the parent node is not the representative node of the specific tree, by treating the parent node as one of the sibling nodes.

### Claim 17 (depends on 10)

The user device of claim 10, wherein, at the process of (I), the processor, if at least part of the leaf nodes do not have any private function values allocated thereto, allocates or supports another device to allocate one or more certain function values to said at least part of the leaf nodes.

### Claim 18

A service-providing server for information management using at least one specific tree based on a blockchain, comprising:
at least one memory that stores instructions; and
at least one processor configured to execute the instructions to perform processes of: (I) on condition that at least one specific tree for reference has been generated and information on the specific tree for reference has been registered as a subject ID of at least one subject in the blockchain such that the information on the specific tree for reference corresponds to the subject, wherein the specific tree for reference has leaf nodes to which each of private function values, created by applying its corresponding algorithm to each of one or more private data related to the subject or their processed values, is allocated, if specific private data among the private data is acquired from at least one user device, acquiring or supporting another device to acquire the information on the specific tree for reference stored in the blockchain as corresponding to the subject; and (II) allocating or supporting another device to allocate at least one specific private function value, created by applying the algorithm to the specific private data or their processed values, to at least one specific leaf node at a location corresponding to the specific private data by referring to the information on the specific tree for reference, to thereby generate at least one specific tree for comparison, and determining or supporting another device to determine whether the specific private data acquired from the user device is forged by comparing a representative value of the specific tree for comparison and a representative value in the information on the specific tree for reference acquired from the blockchain.
