KR20170099154A - Method and server for registering stockholder's list, recording transfer of stock ownership and verifying the registered stockholder's list file - Google Patents

Method and server for registering stockholder's list, recording transfer of stock ownership and verifying the registered stockholder's list file Download PDF

Info

Publication number
KR20170099154A
KR20170099154A KR1020160021166A KR20160021166A KR20170099154A KR 20170099154 A KR20170099154 A KR 20170099154A KR 1020160021166 A KR1020160021166 A KR 1020160021166A KR 20160021166 A KR20160021166 A KR 20160021166A KR 20170099154 A KR20170099154 A KR 20170099154A
Authority
KR
South Korea
Prior art keywords
hash value
server
private key
shareholder
value
Prior art date
Application number
KR1020160021166A
Other languages
Korean (ko)
Other versions
KR101798119B1 (en
Inventor
어준선
홍재우
송주한
Original Assignee
주식회사 코인플러그
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 주식회사 코인플러그 filed Critical 주식회사 코인플러그
Priority to KR1020160021166A priority Critical patent/KR101798119B1/en
Publication of KR20170099154A publication Critical patent/KR20170099154A/en
Application granted granted Critical
Publication of KR101798119B1 publication Critical patent/KR101798119B1/en

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • 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
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • G06F17/30097—
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/30—Payment architectures, schemes or protocols characterised by the use of specific devices or networks
    • G06Q20/36—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes
    • G06Q20/363—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes with the personal data of a user
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0618—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
    • H04L9/0631—Substitution permutation network [SPN], i.e. cipher composed of a number of stages or rounds each involving linear and nonlinear transformations, e.g. AES algorithms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0618—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
    • H04L9/0637—Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer Security & Cryptography (AREA)
  • Signal Processing (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Theoretical Computer Science (AREA)
  • General Business, Economics & Management (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Technology Law (AREA)
  • Computing Systems (AREA)
  • Power Engineering (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Abstract

According to an embodiment of the present invention, a method for registering a shareholder list comprises the following steps of: (a) allowing a server to acquire a shareholder list file or a message digest of the shareholder list file, or supporting the server to acquire the same; and (b) if a predetermined condition is satisfied, allowing the server to register a specific hash value, a representative hash value generated by calculating at least one neighboring hash value matched with the specific hash value, or a value acquired by processing the representative hash value in database, or supporting the server to register the same, wherein the specific hash value is any one of (i) a hash value of the shareholder list file signed by a private key of a specific company and a private key of the server, (ii) a hash value of the shareholder list file signed by the private key of the server, (iii) a hash value of the message digest encoded by the private key of the specific company and the private key of the server, and (iv) a hash value of the message digest encoded by the private key of the server.

Description

 METHOD AND SERVER FOR REGISTERING STOCKHOLDER'S LIST, RECORDING TRANSFER OF STOCK OWNERSHIP AND VERIFYING THE REGISTERED STOCKHOLDER'S LIST FILE,

The present invention relates to a method and server for registering a shareholder list, recording stock ownership transfer, and verifying a registered shareholder list file, and more particularly, to a method and server for obtaining a shareholder list file, (i) a hash value of the shareholder list file signed with the private key of the specific company and the private key of the server, and (ii) (ii) a hash value of the shareholder list file signed with the private key of the server, (iii) a private key of the specific company and a hash value of the message digest encoded with the private key of the server, and (iv) a hash value of the message digest encoded with a private key, and a representative hash value generated by computing at least one neighbor hash value matching the specific hash value, A shareholder list registration process in which a value obtained by processing the table hash value is registered or registered in the database is executed, and (B) a shareholder list reflecting the transfer history of the stock ownership of a specific company between one user and the second user Generating a hash value and a message digest of the shareholder file; and if the predetermined condition is satisfied, generating a hash value and at least one neighbor hash value matching the specific hash value, Quot; ownership transfer history recording process " for registering or registering a hash value or a value obtained by processing the representative hash value in a database, and the specific hash value is referred to as a first specific hash value, 1 representative hash value, if a verification request related to the shareholder list file is obtained, A value obtained by processing the second representative hash value or the second representative hash value generated using the input data included in the database is a value obtained by processing the first representative hash value or the first representative hash value registered in the database A step of registering the shareholder list, recording the stock ownership transfer and verifying the registered shareholder list file, and performing a " verification process " to determine whether or not the shareholder list file has been verified .

Unlisted stocks are stocks that are not listed on the stock exchange. Because unlisted stocks are not traded, trades are traded off-site, typically trading in the unlisted stock market or freeboard market.

As such, there has been an inconvenience in unlisted stock trading since the unlisted stock trading has not been conducted through an online network. Accordingly, there has been no provision of a real-time unlisted stock trading platform capable of modifying transaction details online.

Accordingly, the inventor records the shareholder list and the stock ownership transfer information in the block chain of virtual money, thereby enabling unauthorized trading of stocks, which can not deal with the transaction details and can transfer real-time stock list registration or stock ownership transfer without space limitation Platform to develop.

However, in this case, since an OP message is generated for each file and is recorded in the block chain, a bottleneck phenomenon of service provision may occur when a large number of transaction requests occur, and a transaction fee is required to be paid each time There is a concern.

Accordingly, the inventor of the present invention has the advantage of being able to support the registration of the shareholder list or the transfer of the ownership of the stock in real time, which can not be stolen / altered, but also compensates for the above disadvantages, Developed an unlisted stock trading support system.

SUMMARY OF THE INVENTION The present invention has been made to solve all the problems described above.

The present invention also provides an unlisted stock trading platform capable of recording shareholder roster and stock ownership transfer information in a block chain of virtual money and supporting real-time stock register registration or stock ownership transfer without any restriction on space / Provide for other purposes.

It is another object of the present invention to provide a platform for supporting an unlisted stock trading as described above, which can guarantee a fast service speed and reduce a transaction cost.

In addition, according to the present invention, a merge tree is constructed by using all the shareholder list and stock ownership transfer information in a block chain instead of putting it in a block chain, so that only the root value of the configured merge tree is registered in the block chain, Another purpose is to save money.

It is another object of the present invention to further guarantee the integrity of a database by performing verification using a merge tree generated as described above when requesting verification of a file.

In order to accomplish the above object, a representative structure of the present invention is as follows.

According to one aspect of the present invention, there is provided a method of registering a shareholder list, comprising the steps of: (a) supporting a server to obtain a shareholder file or to acquire or acquire a message digest of the shareholder file; (b) (I) a hash value of the private key of the specific company and the private key of the server signed by the private key of the server, (ii) a hash value of the private key of the server, (iii) a hash value of the message digest encoded by the private key of the specific company and the private key of the server, and (iv) a hash value of the private key of the server, and a value obtained by processing the representative hash value or the representative hash value generated by calculating at least one neighboring hash value matching the specific hash value, A method of registering or comprising support to register are provided to.

According to another aspect of the present invention, there is provided a method for recording a stock ownership transfer, comprising the steps of: (a) obtaining a shareholder file reflecting a previous transaction history of a stock ownership of a specific company between a first user and a second user (B) if the predetermined condition is satisfied, the server determines whether a particular hash value - the particular hash value - is obtained by (i) obtaining a private key of the particular company and (Ii) a hash value of the shareholder list file signed with the private key of the server, (iii) a private key of the specific company, and a private key of the server And (iv) a hash value of the message digest encoded with the private key of the server, and at least one of the hash values matching the particular hash value Representative generated by calculating the hash value, a method is provided including the hash value or the step of support to register and register values processed by the hash value representative of the database.

According to another aspect of the present invention, there is provided a method of verifying a registered shareholder file, comprising the steps of: (a) previously obtaining a shareholder file of a specific company or obtaining a message digest of the shareholder file; A specific hash value, the first specific hash value being a hash value of (i) the private key of the particular company and the shareholder list file signed with the private key of the server, (ii) (Iii) a hash value of the message digest encoded by the private key of the specific company and the private key of the server, and (iv) a hash value of the message digest encoded by the private key of the server, A first representative hash value or a value obtained by processing the first representative hash value, which is generated by calculating at least one neighboring hash value matched with a predetermined one (B) obtaining a second representative hash value or a second representative hash value generated using the input data included in the verification request, If the processed value corresponds to a value obtained by processing the first representative hash value or the first representative hash value registered in the database, the server supports to determine or determine that the verification related to the shareholder list file has been performed The method comprising the steps of:

According to still another aspect of the present invention, there is provided a server for registering a shareholder list, comprising: a communication section in which a server obtains a shareholder file or acquires a message digest of the shareholder file; (I) a hash value of the private key of the specific company and the private key of the server signed by the private key of the server, and (iii) if the message digest of the private key of the server is obtained and the predetermined condition is satisfied, (ii) the hash value of the shareholder list file signed with the private key of the server, (iii) the private key of the specific company and the hash value of the message digest encoded with the private key of the server, and (iv) and a hash value of the message digest encoded with a key, and a representative hash value generated by computing at least one neighbor hash value matching the specific hash value. The server including a processor that supports the registration or registering with the representative value by processing the hash values in the database is provided.

According to still another aspect of the present invention, there is provided a server for recording a stock ownership transfer, comprising: a server for acquiring a stockholder list file reflecting a previous transaction history of a stock ownership of a specific company between a first user and a second user, message digest, and a message digest of the particular company is obtained if the shareholder file is obtained or a message digest of the shareholder file is obtained and a predetermined condition is satisfied, key and a hash value of the shareholder list file signed with the private key of the server, (ii) a hash value of the shareholder list file signed with the private key of the server, (iii) a private key of the specific company, a hash value of the message digest encoded with a private key, and (iv) a hash value of the message digest encoded with a private key of the server. The server that contains the swigap and matching at least one representative of the hash that is generated by calculating the hash value or neighborhood processors that support to register and register values processed by the hash value representative of the database is provided.

According to another aspect of the present invention, there is provided a server for verifying a registered shareholder file, comprising: a communication unit for obtaining a verification request related to a registered shareholder file; and a server for acquiring a shareholder list file (I) obtaining a hash value of the shareholder list file signed by the private key of the specific company and the private key of the server by obtaining a message digest of the shareholder list file, (ii) a hash value of the shareholder list file signed with the private key of the server, (iii) a private key of the specific company and a hash value of the message digest encoded with the private key of the server, and (iv) A first representative hash value generated by computing at least one neighbor hash value that matches one of the hash values of the message digest encoded with the private key of the message digest, A second representative hash value generated using the input data included in the verification request, or a second representative hash value generated using the input data included in the verification request, in a state in which a value obtained by processing the first representative hash value is registered in the database, If the value obtained by processing the second representative hash value corresponds to a value obtained by processing the first representative hash value or the first representative hash value registered in the database, A server is provided that includes a processor to support the processor.

 The present invention has the following effects.

The present invention has the effect of recording shareholder roster and stock ownership transfer information in a block chain of virtual money, supporting real-time registration of shareholder register or stock ownership transfer in real time without imposing up / modification and space limitation.

In addition, the present invention provides a platform for supporting an unlisted stock trading as described above, thereby assuring a fast service speed and reducing transaction costs.

In addition, according to the present invention, a merge tree is constructed by using all the shareholder list and stock ownership transfer information in a block chain instead of putting it in a block chain, so that only the root value of the configured merge tree is registered in the block chain, There is an effect that can be saved.

In addition, the present invention is advantageous in that the integrity of a database can be further guaranteed by performing verification using a merge tree generated as described above when a verification request for a file is requested.

1 is a block diagram illustrating a configuration of a server for registering a stockholder list and recording stock ownership transfer according to an embodiment of the present invention.
FIG. 2 is a sequence diagram illustrating a process of registering a shareholder list according to an embodiment of the present invention.
FIGS. 3 and 4 are views showing examples of a merge tree generated according to an embodiment of the present invention.
FIG. 5 is a sequence diagram illustrating a process of recording stock ownership transfer according to an embodiment of the present invention.

The following detailed description of the invention refers to the accompanying drawings, which illustrate, by way of illustration, specific embodiments in which the invention may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the invention. It should be understood that the various embodiments of the present invention are different, but need not be mutually exclusive. For example, certain features, structures, and characteristics described herein may be implemented in other embodiments without departing from the spirit and scope of the invention in connection with an embodiment. It is also to be understood that the position or arrangement of the individual components within each disclosed embodiment may be varied without departing from the spirit and scope of the invention. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present invention is to be limited only by the appended claims, along with the full scope of equivalents to which such claims are entitled, if properly explained. In the drawings, like reference numerals refer to the same or similar functions throughout the several views.

FIG. 1 is a block diagram illustrating a configuration of a server for registering a shareholder list and recording a stock ownership transfer according to an embodiment of the present invention. FIG. 2 illustrates a process of registering a shareholder list according to an embodiment of the present invention. FIG.

Prior to the description of each embodiment, the expression used in this specification is defined as follows. The left side of ':' indicates the expression, and the right side indicates the definition of the expression.

<Expression definition>

PrivX : Private key of X

PubX : Public key of X

AESX : AES  secret key of X

SigPrivX (Y): Output of ECDSA  or RSA signature of Y using PrivX

VerPubX (Y): Output result of SigPrivX (Y) verification using PubX  (True or False)

Enc PrivX (Y): Output of ECC  or RSA encryption of Y using PrivX

Dec PubX (Y): Output of ECC  or RSA decryption of Y using PubX

Enc AESX (Y): Output of AES  encryption of Y using AESX

Dec AESX (Y): Output of AES  decryption of Y using AESX

Hash (Y): triple sha256 (Hash value of Y)

SigECC256 PrivX (Y): ECC256  Signature of Y using PrivX

VerECC256 PubX (Y): ECC256  signature verification of Y using PubX

First, the process of registering the shareholder list will be described with reference to Figs. 1 and 2. Fig. The registration of the shareholder list may be made at the time of issuance and registration of the initial stock, but also at the time of capital increase, potato stock split, merger.

Referring to FIG. 1, a server 100 according to an embodiment of the present invention includes a communication unit 110 and a processor 120. The server described in each embodiment may be configured differently, but for convenience of explanation, it is assumed that the service is performed through the same server 100. FIG.

The communication unit 110 acquires a share list file (File) or acquires a message digest of the share list file. 2, a public key (PubA) of a specific company 300 can be obtained when a shareholder list file is acquired together with a shareholder list file registration request. The communication unit 110 can respond to the request (S220), and a response corresponding to the request can be made during one TCP session.

The processor 120 may support to generate or generate the message digest (MD = Hash (File)) of the shareholder list file using the hash function when the shareholder list file is obtained (S215). The type of the hash function is not limited. For example, the hash function may be triple sha256. In the present specification, a hash function generally refers to a function for transforming an original file, but in an extreme case, it may include a function for simply storing a file without any processing. In this case, the message digest generated by applying the hash function may be the same as the specific file.

In step S220, the generated message digest may be transmitted to the specific company 300 requesting registration of the shareholder list file in response to the request for registration of the shareholder list file. If the specific company 300 makes a registration request for a shareholder list file through a terminal (not shown), the generated message digest can be transmitted to the terminal.

Next, the communication unit 110 may obtain a message digest (SigPrivA (MD)) signed by the private key (PrivA) of the specific company 300 from the specific company 300 (S225). In this case, since the TCP session may be disconnected after the response in step S220, the message digest from the specific company 300 and the public key (PubA) of the specific company 300 may also be received.

In addition, the processor 120 obtains a message digest signed with the private key of the specific company 300 and transmits the public key of the specific company 300 to the message digest signed with the private key of the specific company 300 It is possible to determine whether the result of checking is true (S230).

If the result of the check is true (S230-2), the processor 120 determines whether the hash value of the shareholder list file signed by the private key of the specific company 300 and the private key of the server 100 or (ii) The hash value of the message digest encoded by the private key of the specific company 300 and the private key of the server 100 may be generated or generated at step S240. The generated hash value may be registered or registered in the database 200 (S250). The reason for registering in the database 200 in the form of the hash value is to reduce the size of the data due to the storage capacity limitation of the database 200 or the like. Here, the database 200 may be a block chain of virtual money. For example, it may be a bit coin block chain.

In this specification, the expression (SigPriv (File), SigPub (File)) for signing a file using a private key or a public key is described based on an expression that encodes an MD using a private key or a public key (EncPriv (MD), EncPub (MD)).

The processor 120 determines whether the hash value of the shareholder list file signed in the order of the private key of the specific company 300 and the private key of the server 100 Or register the hash value of the message digest encoded in the order of the private key of the specific company 300 and the private key of the server 100 in the database 200. That is, the specific company 300 can first sign the private key of the company 300, sign the private key of the server 100, and register the hash value in the database 200. However, the order of signatures may be implemented differently. In particular, if the session between the specific company 300 and the server 100 is maintained, the server 100 may first sign and the specific company 300 may then be signed.

When the hash value is registered in the database 200, the communication unit 110 may obtain a transaction ID (TxID) indicating the location information of the registered hash value on the database 200 from the database 200 S255).

On the other hand, if the above-described confirmation result is false (S230-1), the processor 120 can notify the specific company 300 of failure to register the shareholder list (S260).

In addition, the processor 120 may support saving or storing the shareholder file if the confirmation result is true (S245). At this time, the shareholder file can be encrypted with a symmetric key encryption algorithm such as AES (Advanced Encryption Standard). In this case, the secret key may be a specific secret key processed from the public key of the specific company 300, but is not limited thereto. Also, the processor 120 may attach and store signature information using the private key of the specific company 300 and the private key of the server 100 to the shareholder list file.

The processor 120 receives the public key PubA of the specific company 300, the message digest MD of the shareholder list file, the share list file SigPrivA (File) signed with the private key of the specific company 300, And store or store the acquired transaction ID (TxID) and the shareholder list file (EncAESC (File)). In addition, at least some of the private key of the specific company 300 and the private key of the server 100 (SigPrivC (SigPrivA (File))) and their hash values are further stored It can also support saving.

When the shareholder list is registered in the database 200 as described above, the communication unit 110 can transmit a response indicating that the shareholder registration is successful to the specific company 300 (S260).

However, in the above-described embodiment, when an OP message is generated for each file and is recorded in a block chain, a bottleneck phenomenon of service provision may occur when transaction requests are increased. There are disadvantages that can be costly.

Hereinafter, the above-mentioned disadvantages are compensated for, while making it possible to support the registration of the shareholder list or the transfer of the ownership of the stock in real time, which can not be stooped / altered and real time, Describe unlisted stock trading support systems. This system uses a separate data structure managed by the server 100, unlike the above-described embodiment.

The processor 120 may determine that the particular hash value-the particular hash value-is obtained by the processor 120, if the shareholder file is obtained, or if the message digest of the shareholder file is obtained and a predetermined condition is satisfied, (B) a hash value of the shareholder list file signed with the private key of the server 100, (c) a hash value of the shareholder list file signed with the private key of the server 100, A hash value of the message digest encoded by the private key of the specific company 300 and the private key of the server 100 and (d) a hash value of the message digest encoded by the private key of the server 100 And a representative hash value generated by calculating at least one neighbor hash value matching the specific hash value or a value obtained by processing the representative hash value may be registered or registered in the database.

That is, the processor 120 determines whether the private key (PrivA) of the specific company 300 and the private key (PrivC) of the server 100 are signed with respect to the shareholder list file, as in step S250 of the above- Instead of registering the hash value of the message digest encoded by the private key of the specific company 300 and the private key of the server 100 in the database 200, Supports to generate or generate a representative hash value by computing at least one neighbor hash value with any one of (a) to (d), and supports to register or register the generated representative hash value or the processed value in the database . Here, the database may be a database (for example, a block chain of virtual money) not managed by the server 100 like the database 200 described above, but may alternatively be a database managed by the server 100 have. Although the present invention will be described with reference to a database 200 that is not managed by the server 100, the technical idea of the present invention can also be applied to a database managed by the server 100. [

The computation of a particular hash value and at least one neighbor hash value may be performed by various functions. A particular hash value is denoted as input, and at least one neighboring hash value is denoted by x1, x2, ... , xn, the representative hash value t can be expressed by the following equation.

&Lt; Equation &

t = hash (function (input, x1, x2, ..., xn))

At this time, the server 100 may store and manage the specific hash value and the at least one neighbor hash value in a predetermined data structure. Here, the data structure may be various, for example, a merkle tree structure. In this case, the calculation of the specific hash value and the at least one neighbor hash value may be performed through a merkle tree.

That is, the processor 120 may assist the specific hash value to generate or generate a merkle tree assigned to a particular leaf node, and if the predetermined condition is satisfied, at least one The representative hash value generated by computing the hash value assigned to another leaf node of the leaf node or the processed value of the representative hash value may be registered or registered in the database 200. [

More specifically, (x1) processor 120 is configured to (i) calculate or calculate a hash value assigned to a sibling node of a node to which the particular hash value is assigned, and (ii) And to assign or assign a hash value for the computed value to the parent node of the node. (x2) If the parent node is the root node of the merge tree, the hash value assigned to the parent node is the representative hash value. (x3). On the other hand, if the parent node is not the root node of the merge tree, the processor 120 repeats the above (x1) to (x3) with the hash value assigned to the parent node as the specific hash value .

Then, the processor 120 finally registers the hash value assigned to the root node of the merge tree as a representative hash value in the database 200 or registers it. At this time, a value obtained by processing the representative hash value may be registered. For example, the result of performing the hex operation on the representative hash value can be registered.

Meanwhile, the server 100 stores the specific hash value and the at least one neighbor hash value in a predetermined first data structure, and then stores and manages a second data structure of the same type as the first data structure In this case, the first data structure and the second data structure may be connected in a chain form.

In particular, as in the above example, if the first data structure and the second data structure are merc trees, the root value of the first data structure or the hash value of the root value may be the first leaf node of the second data structure Lt; / RTI &gt;

In addition, when the second data structure is created, verification of the first data structure is performed, so that data integrity can be further guaranteed. Verification of the second data structure will be described later.

In addition, in the case of the first merge tree among the at least one merge tree connected in a chain form, the first leaf node of the first merge tree is assigned a hash value of a predetermined message data composed of text, numbers, or symbols or a processed value thereof . For example, a hash value of an input message initially assigned by the server 100 when generating a merge tree can be assigned.

FIGS. 3 and 4 are views showing examples of a merge tree generated according to an embodiment of the present invention.

FIG. 3 shows a merge tree in which the number of leaf nodes is 4 (2 2 ). Since the illustrated merge tree is the first merge tree (tree_id = 0), it can be seen that the hash value (triplesha256digest (coinplug_unique_message)) of the predetermined message data "Coinplug 2016-01-01" is assigned to the first leaf node h1. If there is a registration request for the shareholder list file, the processor 120 generates the next leaf node of the last leaf node of the currently configured merge tree, and assigns or assigns a value obtained by processing a specific hash value or a specific hash value do. For example, if the merge tree of FIG. 3 has already been assigned to the second leaf node h1 in the previous step, the next leaf node h2 is created to process a specific hash value or a specific hash value (triplesha256digest (input2 )). The processor 120 may also support computing or computing a hash value assigned to (i) a particular hash value and (ii) a h3 node that is a sibling node of the h2 node that is the third leaf node to which the particular hash value is assigned. The hash value for the computed value is assigned to the h2 node and the parent node (h23 node) of the h3 node. Since the parent node (h23 node) is not the root node of the merge tree, the processor 120 can repeat the above process with the hash value assigned to the h23 node as the specific hash value. That is, the hash value assigned to the h23 node is set as a specific hash value, and the hash value assigned to the h23 node and the hash value assigned to the h01 node are calculated and assigned to the h23 node and the parent node (h0123 node) of the h01 node have. At this time, since the h0123 node is the root node of the merge tree, the processor 120 can support registration or registration of the value (hex (h {node_index})) obtained by processing the hash value assigned to the node h0123 in the database 200 .

On the other hand, the predetermined conditions are (i) conditions in which a predetermined number of share list files are acquired or a predetermined number of message digests are generated, (ii) conditions in which a predetermined time elapses, (iii) A condition in which a block is generated in the service characteristic, and (iv) a condition for a service characteristic.

For example, if a plurality of shareholder registration requests are made and a message digest is obtained for the number of leaf nodes of the muckle tree, the result of encoding each private key of each user and the private key of the server 100 for each message digest The hash value may be the input value of the aforementioned mu tree tree (the value assigned to the leaf node).

In addition, the processor 120 may generate the root value of the aforementioned mu tree at predetermined time intervals (condition (ii) above). In this case, the processor 120 may generate a merge tree using the input values up to that time and register or register the root value of the merge tree in the database 200 when a predetermined time has elapsed.

In this case, although a predetermined time has elapsed, a value may not be assigned to a sibling node of a node to which a particular hash value of the merge tree is assigned. If the hash value is not allocated to the sibling node of the node to which the specific hash value is allocated, the processor 120 supports to allocate or assign a predetermined hash value to the sibling node, The route value of the merge tree can be calculated in one way. For example, the processor 120 may support copying and assigning or assigning the particular hash value to the sibling node.

The service characteristic includes at least one of cost information paid by a user who made a request for registration of a shareholder list, time zone information at which the shareholder list registration is performed, region information at which the shareholder list registration service is performed, . However, the present invention is not limited to the one described here, but includes various condition information in which a generally accepted differential service can be provided.

On the other hand, when a new merge tree generation is started and the predetermined condition is satisfied without acquiring a shareholder list file or a message digest, the processor 120 determines whether predetermined message data is allocated to the first leaf node and the second leaf node And supports registration or registration of the root value of the merge tree or a value obtained by processing the merge tree in the database 200. In this case, a merge tree with two leaf nodes can be created.

Meanwhile, as described above, the server 100 stores the specific hash value and the at least one neighbor hash value in a predetermined first data structure, and then stores a second data structure of the same type as the first data structure In case of managing, the first data structure and the second data structure may be connected in a chain form. In particular, if the first data structure and the second data structure are merc trees, a root value of the first data structure or a hash value of the root value may be assigned to a first leaf node of the second data structure.

4 is a diagram illustrating a merge tree generated as the second data structure according to an embodiment of the present invention.

Referring to FIG. 4, it can be seen that the root value (hex (h0123)) of the merge tree (tree_id = 0) of FIG. 3 is assigned to the first leaf node (h4 node) of the new merge tree (triplesha256digest (input4)). The present invention has an advantage of improving data integrity by enabling easy tracking even when data is modulated in the middle by connecting a plurality of data structures generated at the time of occurrence of a transaction.

Next, a process of performing verification on the registered share list file using the above-described data structure will be described.

The server 100 obtains the shareholder list file of the specific company 300 or obtains the message digest of the shareholder list file and stores the first specified hash value (the above-described specific hash value is referred to herein as the first The hash value of the shareholder list file signed with the private key of the specific company 300 and the private key of the server 100, ii) a hash value of the shareholder list file signed with the private key of the server 100, (iii) a private key of the specific company 300 and a hash of the message digest encoded with the private key of the server 100 And (iv) a hash value of the message digest encoded with the private key of the server 100. The first hash value is generated by computing at least one neighbor hash value that matches under certain conditions For convenience of explanation, the representative hash value (Here, referred to as a first representative hash value) or a value obtained by processing the first representative hash value is registered in the database 200, a verification request related to the shareholder list file is acquired through the communication unit 110 A value obtained by processing the second representative hash value or the second representative hash value generated using the input data included in the verification request may be the first representative hash value registered in the database 200 or the first representative hash value registered in the database 200 If a value obtained by processing the representative hash value is associated with the value, the processor 120 can support the determination or determination that the verification associated with the shareholder list file has been performed.

Here, the second representative hash value may be a second specific hash value, and the second specific hash value may be (i) related to the input data included in the verification request, (Ii) a hash value of a file in which the shareholder list file A is signed by the private key of the server 100, and (iii) a hash value of the private key of the server 100, ) A hash value of the private key of the specific company 300 and the private key of the server 100 with respect to the message digest of the shareholder list file A and (iv) message digest of the server 100 and a hash value of the result encoded with the private key of the server 100 and at least one neighborhood hash value matching the second specific hash value.

At this time, the input data included in the verification request includes any one of (i) the shareholder list file, (ii) a message digest for the shareholder list file, or (iii) an ID issued at the time of registering the shareholder list file can do.

In the case where the share list file is included in the input data, the message digest for the shareholder list file is generated in the above-described manner, and the second specific hash value can be calculated based on the message digest. The second representative hash value may be generated by calculating at least one neighboring hash value matching the second specific hash value.

When the input data includes the ID issued at the time of registering the shareholder list file, the value assigned to the leaf node corresponding to the ID in the existing generated muckree may be set to the second specified hash value. In the example shown in Figs. 3 and 4, the ID may be a unique ID.

For the second specific hash value, the description of the first specific hash value described above can be applied equally. That is, the operation of the second specific hash value and the at least one neighbor hash value can be performed by various functions. Since this has been described above, the explanation is omitted.

In this case, the calculation of the second specific hash value and the at least one neighbor hash value may be performed through a merkle tree. Once the verification request associated with the shareholder list file is obtained, the processor 120 may identify the merge tree information and leaf node information associated with the input data.

The second representative hash value may be at least one other hash value that matches the second specific hash value and the second specific hash value in a merge tree assigned to a particular leaf node. Can be generated by computing a hash value assigned to a leaf node.

When a service is performed using a database (for example, a block of virtual money) not managed by the server 100, the processor 120 refers to the predetermined transaction ID corresponding to the identified mu tree tree information can do.

In this case, when a verification request related to the shareholder list file is obtained, the processor 120 refers to a predetermined transaction ID associated with the shareholder list file, and receives an OP message from the database 200 using the transaction ID Acquire or acquire. If the value obtained by processing the second representative hash value or the second representative hash value generated using the input data included in the verification request is smaller than the first representative hash value or the first representative value included in the OP message, If the hashed value is matched with the processed value, it can be determined whether or not the verification related to the specific file has been performed.

Meanwhile, the predetermined transaction ID may be provided in the input data. That is, the user inputs a transaction ID together with either (i) the shareholder list file, (ii) the message digest for the shareholder list file, or (iii) the ID issued at the time of registering the shareholder list file, To the server (100).

In the verification operation, the processor 120 may support creating or creating a new merge tree, in which the merge tree generated in the process of registering the shareholder list described above may be used. That is, the processor 120 calculates a hash value assigned to the sibling node of the node to which the second specific hash value is allocated in the existing generated merge tree (y1) (i) And support to assign or assign a hash value for the operation value to a parent node of the node in a new merge tree. (Y2) if the parent node is the root node of the new merge tree, comparing the hash value assigned to the parent node with the value contained in the OP message as the second representative hash value, and y3) If the parent node is not the root node of the new merge tree, it may repeat the operations (y1) to (y3) using the hash value assigned to the parent node as the second specific hash value.

If the root value of the finally generated muck tree or the processed value corresponds to the value obtained by processing the first representative hash value or the first representative hash value included in the OP message, And can help judge or judge that the verification associated with the file has been made.

As described above, according to the present invention, when a merge tree having n m (= N) leaf nodes is created in the registering step of the shareholder list, verification is performed by performing only the operation of the merge tree height (log n N = m) This makes it possible to quickly check transaction integrity.

Meanwhile, when obtaining the input data, the processor 120 may identify at least one of the merge tree information and the leaf node information related to the input data with reference to time information related to the input data.

Hereinafter, a verification process will be described with reference to a concrete example shown in FIG.

Referring again to FIG. 3, when there is a verification request for input 2, the processor 120 identifies the generated merge tree and leaf node information with reference to the input data information, and outputs the identified merge tree information (tree_id = 0) to the database 200 and obtains the OP message from the database 200. [0157] Processor 120 may then support input 2 to create or create a new merge tree. Since the hash value of input 2 (triplesha256digest (input2)) is assigned to the h2 node, the processor 120 determines the hash value assigned to the h2 node and the hash value assigned to the h3 node, which is the sibling node of the h2 node, It can be used to calculate or calculate values. The hash value for the computed value is assigned to the h2 node and the h23 node, which is the parent node of the h3 node. Since the h23 node is not the root node of the new merge tree, the processor 120 may repeat the process by setting the hash value assigned to the h23 node as the second specified hash value. That is, the hash value assigned to the h23 node is set as the second specific hash value, and the hash value assigned to the h23 node and the hash value assigned to the h01 node in the existing generated merge tree are calculated, Quot; node &quot; node &quot; h0123 &quot; Since the h0123 node is the root node of the merge tree, the processor 120 compares the value (hex (h {node_index}) obtained by processing the hash value assigned to the h0123 node with the value included in the OP message .

Hereinafter, a method of recording stock ownership transfer according to an embodiment of the present invention will be described. However, the description overlapping with the above embodiment will be omitted.

FIG. 5 is a sequence diagram illustrating a process of recording stock ownership transfer according to an embodiment of the present invention.

5, the communication unit 110 transmits stock ownership transfer transaction information (refer to FIG. 5) indicating the previous transaction details of the stock ownership of the specific company 300 between the first user 400-1 and the second user 400-2 TransDE) (S505).

Processor 120 may assist in verifying or verifying that the information associated with the acquired stock ownership transfer transaction information is authentic. If the result of the check is true (S550), the processor 120 supports creation or generation of a share list file (File ') reflecting the previous transaction details of the share ownership (S555) (1) generate or generate a private key of the specific company 300 and a private key of the server 100 or (m) a file signed by the private key of the server 100 S575), the hash value of the generated file may be generated (S577) and registered or registered in the database 200 (S580). In the case of (m), it may be assumed that the server 100 is delegated authority from the specific company 300. In addition, a new shareholder file (File ') may be created by adding a new content to an existing shareholder file (File) or by overwriting the file itself with new contents. The new shareholder file can be in the form of adding at least one of TransDE and SigPrivE (SigPrivD (TransDE)) to the existing shareholder file.

The communication unit 110 may obtain a transaction ID indicating the location information on the database 200 of the registered hash value (S582).

On the other hand, the process of confirming whether the information related to the obtained stock ownership transfer transaction information is genuine can be performed as follows.

If the stock ownership transfer transaction information SigPrivD (TransDE) signed with the private key of the first user 400-1 is obtained through the request for the transfer of stock ownership transfer record (S505), the processor 120 determines (Step S510) to confirm or confirm the stock ownership transfer transaction information using the public key of the user 400-1.

If the result of step S510 is true (S510-2), the communication unit 110 transmits the public key of the first user 400-1, the stock ownership transfer transaction information TransDE, the private and transmits the stock ownership transfer transaction information signed with the key to the second user 400-2 (S520).

Information SigPrivE (SigPrivD (TransDE)) signed with the private key of the second user 400-2 for the stock ownership transfer transaction information SigPrivD (TransDE) signed with the private key of the first user 400-1, ), The processor 120 confirms or confirms the stock ownership transfer transaction information using the public key of the first user 400-1 and the public key of the second user 400-2 (S535).

If the result of the checking in step S535 is also true, the steps after step S550 are performed.

In this case, the processor 120 supports decoding or decoding of the pre-stored stock list file (S552), creates a new stock list file (File ') by reflecting the stock ownership transfer transaction details in the decoded stock list file (S555).

The newly created share list file (File ') includes (i) the private key of the first user 400-1 and the private key of the second user 400-2 with respect to the stock ownership transfer transaction information Signed information (X information) or (ii) the X information and the stock ownership transfer transaction information.

In addition, the processor 120 may support generating or generating a message digest for the newly created share list file using the hash function (S557).

The communication unit 110 transmits the private key of the first user 400-1 and the private key of the second user 400-2 to the generated message digest, the generated stockholder list file, and the stock ownership transfer transaction information, (S562), information including the stock ownership transfer transaction information, and the information signed by the private key of the specific company 300. In addition,

The processor 120 then determines whether or not the specific company 300 determines that the message digest has been generated from the shareholder list file, (ii) (N information) signed by the private key, (iii) supporting the process of confirming the information on the stock ownership transfer transaction information (S565) The N information is received (S567) and the signature information of the specific company 300 can be verified by using the public key of the specific company 300 (S570).

Meanwhile, the processor 120 may support storing or storing the newly created share list file (S560), and the created share list file may be AES encrypted and stored.

When the transaction ID is received, the communication unit 110 transmits information indicating that the registration is successful to the first user 400-1, the second user 400-2, and the specific company 300 (S585).

Meanwhile, the processor 120 stores the public key of the specific company 300, the message digest of the shareholder file, the shareholder file signed with the private key of the specific company 300, the obtained transaction ID, You can support saving or saving files. Also, it is possible to further store or store at least some of the hash values of the L file and the share list file (L file) signed in the order of the private key of the specific company 300, the private key of the server 100 .

Hereinafter, an embodiment in which stock ownership transfer is recorded using the above-described separate data structure will be described. However, redundant description will be omitted.

The processor 120 may be configured to determine whether a specific hash value-the particular hash value (i) has been received from the particular company 300, if the shareholder file file is obtained or a message digest of the shareholder- (Ii) a hash value of the shareholder list file signed with the private key of the server 100, (iii) a hash value of the shareholder list file signed with the private key of the server 100, A hash value of the message digest encoded by the private key of the company 300 and a private key of the server 100 and (iv) a hash value of the message digest encoded by the private key of the server 100. [ And a representative hash value generated by calculating at least one neighbor hash value matching the specific hash value or a value obtained by processing the representative hash value may be registered or registered in the database 200. [

At this time, if the stock ownership transfer transaction information indicating the previous transaction details of the stock ownership is acquired, the processor 120 assists in confirming or confirming whether the information related to the acquired stock ownership transfer transaction information is authentic, If true, the shareholder file may be obtained or a message digest of the shareholder file may be obtained.

Meanwhile, the processor 120 functions to control the flow of data between the communication unit 110 and other components. That is, the processor 120 controls the flow of data between each component of the server 100 to control the communication unit 110 and other components to perform their own functions.

The processor 120 may include a hardware configuration such as a micro processing unit (MPU) or a central processing unit (CPU), a cache memory, and a data bus. It may further include a software configuration of an operating system and an application that performs a specific purpose.

In addition, the embodiments of the present invention described above can be implemented in the form of program instructions that can be executed through various computer components and recorded in a computer-readable recording medium. The computer-readable recording medium may include program commands, data files, data structures, and the like, alone or in combination. The program instructions recorded on the computer-readable recording medium may be those specially designed and constructed for the present invention or may be those known and used by those skilled in the computer software arts. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks and magnetic tape, optical recording media such as CD-ROMs and DVDs, magneto-optical media such as floptical disks, media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those generated by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware device may be configured to operate as one or more software modules for performing the processing according to the present invention, and vice versa.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments, but, on the contrary, Those skilled in the art will appreciate that various modifications, additions and substitutions are possible, without departing from the scope and spirit of the invention as disclosed in the accompanying claims.

Therefore, the spirit of the present invention should not be construed as being limited to the above-described embodiments, and all of the equivalents or equivalents of the claims, as well as the following claims, I will say.

100: Server
110:
120: Processor
200: Database
300: Specific company
400-1: First user
400-2: the second user

Claims (36)

In a method for registering a shareholder list,
(a) supporting the server to obtain a shareholder file or to obtain or acquire a message digest of the shareholder file;
(b) if the predetermined condition is satisfied, the server obtains a specific hash value, the hash value including (i) a hash value of the private key of the specific company and the share list file signed by the private key of the server, (ii) a hash value of the shareholder list file signed with the private key of the server, (iii) a private key of the specific company and a hash value of the message digest encoded with the private key of the server, and (iv) a value obtained by processing a representative hash value or a representative hash value generated by computing at least one neighboring hash value matched with the specific hash value is registered in the database Steps to Support
&Lt; / RTI &gt; The method according to claim 1,
In the step (b)
The predetermined condition is that,
(i) a condition that a predetermined number of shareholder file files are acquired or a predetermined number of message digests are generated, (ii) a condition that a predetermined time elapses, (iii) a condition in which a block is generated in a block chain, ) &Lt; / RTI &gt; service characteristics. The method according to claim 1,
In the step (b)
The server supports the particular hash value to generate or generate a merkle tree assigned to a leaf node,
If the predetermined condition is satisfied, a value obtained by processing the representative hash value or the representative hash value generated by calculating a hash value assigned to at least one other leaf node matching the specified hash value is registered in the database And registering the same. The method of claim 3,
If the merge tree is the first merge tree among at least one merge tree connected in a chain form, the first leaf node of the merge tree is assigned a hash value of a predetermined message data composed of text, numbers, or symbols or a processed value thereof &Lt; / RTI &gt; The method of claim 3,
If the predetermined condition is satisfied,
(x1) The server supports to calculate or calculate a hash value assigned to (i) the specific hash value and (ii) a sibling node of the node to which the specific hash value is assigned, and calculates a hash value To assign or assign to the parent node of the node,
(x2) if the parent node is a root node of the merge tree, supports to register or register the hash value assigned to the parent node as the representative hash value in the database,
(x3) If the parent node is not the root node of the merge tree, the step (x1) to (x3) are repeated by using the hash value assigned to the parent node as the specific hash value. 6. The method of claim 5,
At (x1)
If the hash value is not allocated to the sibling node of the node to which the specific hash value is allocated even though the predetermined condition is satisfied, the server supports to assign or assign a predetermined hash value to the sibling node, ) To (x3). &Lt; / RTI &gt; The method according to claim 1,
When the server stores the specific hash value and the at least one neighbor hash value in a predetermined first data structure and then stores and manages a second data structure of the same type as the first data structure, Wherein the data structure and the second data structure are connected in a chain form. 8. The method of claim 7,
Wherein a root value of the first data structure or a hash value of the root value is assigned to a first leaf node of the second data structure if the first data structure and the second data structure are merc trees. . The method according to claim 1,
In the step (a), if no shareholder list file or message digest is acquired,
If the predetermined condition is satisfied in the step (b), the server supports to generate or generate a merge tree in which predetermined message data is allocated to a first leaf node and a second leaf node, Or registering or registering the processed value in the database. The method according to claim 1,
Wherein the database is a block chain of virtual money or a database managed by the server. In a method for recording stock ownership transfer,
(a) the server acquiring a shareholder file reflecting the previous transaction details of the stock ownership of a specific company between the first user and the second user, or obtaining or obtaining a message digest of the shareholder file;
(b) if the predetermined condition is satisfied, the server obtains a specific hash value, the hash value including (i) a hash value of the private key of the specific company and the share list file signed by the private key of the server, (ii) a hash value of the shareholder list file signed with the private key of the server, (iii) a private key of the specific company and a hash value of the message digest encoded with the private key of the server, and (iv) a value obtained by processing a representative hash value or a representative hash value generated by computing at least one neighboring hash value matched with the specific hash value is registered in the database Steps to Support
&Lt; / RTI &gt; 12. The method of claim 11,
Before the step (a)
(a0) further includes the step of supporting, when the stock ownership transfer transaction information indicating the previous transaction details of the stock ownership is acquired, confirming or confirming whether the information related to the obtained stock ownership transfer transaction information is authentic and,
And if the result of the check is true, the step (a) is performed. 13. The method of claim 12,
The step (a0)
(a01) If the stock ownership transfer transaction information (A information) signed with the private key of the first user is obtained, the server confirms or confirms the stock ownership transfer transaction information using the public key of the first user , &Lt; / RTI &gt; and
(a02) If the information signed with the private key of the second user is obtained with respect to the A information, the server transmits the stock ownership transfer transaction using the public key of the first user and the public key of the second user And supporting information to verify or confirm. 12. The method of claim 11,
In the step (b)
The predetermined condition is that,
(i) a condition that a predetermined number of shareholder file files are acquired or a predetermined number of message digests are generated, (ii) a condition that a predetermined time elapses, (iii) a condition in which a block is generated in a block chain, ) &Lt; / RTI &gt; service characteristics. 12. The method of claim 11,
In the step (b)
The server supports the particular hash value to generate or generate a merkle tree assigned to a leaf node,
If the predetermined condition is satisfied, a value obtained by processing the representative hash value or the representative hash value generated by calculating a hash value assigned to at least one other leaf node matching the specified hash value is registered in the database And registering the same. 16. The method of claim 15,
If the merge tree is the first merge tree among at least one merge tree connected in a chain form, the first leaf node of the merge tree is assigned a hash value of a predetermined message data composed of text, numbers, or symbols or a processed value thereof &Lt; / RTI &gt; 16. The method of claim 15,
If the predetermined condition is satisfied,
(x1) The server supports to calculate or calculate a hash value assigned to (i) the specific hash value and (ii) a sibling node of the node to which the specific hash value is assigned, and calculates a hash value To assign or assign to the parent node of the node,
(x2) if the parent node is a root node of the merge tree, supports to register or register the hash value assigned to the parent node as the representative hash value in the database,
(x3) If the parent node is not the root node of the merge tree, the step (x1) to (x3) are repeated by using the hash value assigned to the parent node as the specific hash value. A method for verifying a registered shareholder file,
(a) a server obtains a shareholder list file of a specific company or obtains a message digest of the shareholder list file, and the first specified hash value - the first specified hash value includes (i) a private key (Ii) a hash value of the shareholder file signed with a private key of the server, (iii) a private key of the specific company, and a private key of the server, (iii) a hash value of the message digest encoded with the private key of the server and (iv) a hash value of the message digest encoded with the private key of the server. The hash value is generated by computing at least one neighbor hash value that matches under certain conditions A step of the server acquiring a verification request related to the shareholder list file in a state where a value obtained by processing the first representative hash value or the first representative hash value is registered in the database,
(b) a second representative hash value generated by using the input data included in the verification request or a value obtained by processing the second representative hash value is the first representative hash value registered in the database or the first representative hash value And if the value is matched with the processed value, the server is assisted to determine or determine that the verification associated with the shareholder file has been performed. 19. The method of claim 18,
The step (a)
(a1) when the verification request related to the shareholder list file is obtained, the server refers to a predetermined transaction ID associated with the shareholder list file, and
(a2) the server obtaining an OP message from the database using the transaction ID,
In the step (b)
Wherein the value of the second representative hash value or the value of the second representative hash value generated using the input data included in the verification request is the first representative hash value or the first representative hash value Wherein the server is configured to determine whether or not the verification associated with the shareholder file has been performed. 20. The method of claim 19,
In the step (a1)
When a verification request related to the shareholder list file is obtained, the server identifies the merge tree information and leaf node information associated with the input data, and refers to the predetermined transaction ID corresponding to the identified mu tree tree information Lt; / RTI &gt; 19. The method of claim 18,
In the step (b)
Wherein the input data includes any one of (i) a shareholder list file, (ii) a message digest for the shareholder list file, or (iii) an ID issued at the time of registering the shareholder list file. 19. The method of claim 18,
Wherein the second representative hash value is a second specific hash value, the second specific hash value is a private key of the particular company for the shareholder list file (A) related to the input data included in the verification request, and (Ii) a hash value of a file in which the shareholder list file (A) is signed with a private key of the server, (iii) a message digest of the shareholder list file (A) A hash value of a private key of the specific company and a hash value of a result of encoding the private key of the server, and (iv) a message digest of the shareholder list file (A) And computing at least one neighboring hash value that matches the second specific hash value. 23. The method of claim 22,
The second representative hash value is a value
The hash value assigned to at least one other leaf node matching the second specific hash value and the second specific hash value in the merkle tree allocated to the specific leaf node is calculated &Lt; / RTI &gt; 24. The method of claim 23,
(x1) The server supports to calculate or calculate a hash value assigned to (i) the second specific hash value and (ii) a sibling node of the node to which the second specific hash value is assigned, To assign or assign a hash value to the parent node of the node,
(x2) if the parent node is the root node of the merge tree, compare the hash value assigned to the parent node with the value contained in the OP message as the second representative hash value,
(x3) If the parent node is not the root node of the merge tree, the step (x1) to (x3) are repeated by using the hash value assigned to the parent node as the second specific hash value Way. A server for registering a shareholder list,
A communication unit for the server to acquire the shareholder file or acquire the message digest of the shareholder file; and
If the shareholder list file is obtained or a message digest of the shareholder list file is obtained and a predetermined condition is satisfied, then the specific hash value - (i) the private key of the specific company and the private key of the server (Ii) hash value of the shareholder list file signed with the private key of the server, (iii) private key of the specific company, and message digest And (iv) a hash value of the message digest encoded with the private key of the server, and a representative hash value generated by computing at least one neighbor hash value matching the specific hash value, Processor that supports registering or registering the processed value of the hash value in the database
/ RTI &gt; 26. The method of claim 25,
The predetermined condition is that,
(i) a condition that a predetermined number of shareholder file files are acquired or a predetermined number of message digests are generated, (ii) a condition that a predetermined time elapses, (iii) a condition in which a block is generated in a block chain, ) &Lt; / RTI &gt; service characteristic of the server. 26. The method of claim 25,
The processor comprising:
Wherein the particular hash value supports creating or generating a merkle tree assigned to a leaf node,
If the predetermined condition is satisfied, a value obtained by processing the representative hash value or the representative hash value generated by calculating a hash value assigned to at least one other leaf node matching the specified hash value is registered in the database Wherein the server is configured to: 28. The method of claim 27,
If the merge tree is the first merge tree among at least one merge tree connected in a chain form, the first leaf node of the merge tree is assigned a hash value of a predetermined message data composed of text, numbers, or symbols or a processed value thereof Lt; / RTI &gt; A server for recording stock ownership transfer,
A communication unit for obtaining a shareholder file reflecting the previous transaction details of the stock ownership of a specific company between the first user and the second user or acquiring a message digest of the shareholder list file;
If the shareholder list file is obtained or a message digest of the shareholder list file is obtained and a predetermined condition is satisfied, then the specific hash value - (i) the private key of the specific company and the private key of the server (Ii) hash value of the shareholder list file signed with the private key of the server, (iii) private key of the specific company, and message digest And (iv) a hash value of the message digest encoded with the private key of the server, and a representative hash value generated by computing at least one neighbor hash value matching the specific hash value, Processor that supports registering or registering the processed value of the hash value in the database
/ RTI &gt; 30. The method of claim 29,
The processor comprising:
When the stock ownership transfer transaction information indicating the previous transaction details of the stock ownership is acquired, the server assists the user to confirm or confirm whether the information related to the acquired stock ownership transfer transaction information is authentic,
If the confirmation result is true, the share list file is obtained or a message digest of the share list file is obtained. 31. The method of claim 30,
The processor comprising:
When the stock ownership transfer transaction information (A information) signed with the private key of the first user is acquired, the stock ownership transfer transaction information is confirmed or confirmed using the public key of the first user,
When the information signed with the private key of the second user is obtained with respect to the A information, it is possible to confirm or confirm the stock ownership transfer transaction information using the public key of the first user and the public key of the second user Lt; / RTI &gt; 30. The method of claim 29,
Wherein the processor is configured to support the particular hash value to generate or generate a merkle tree assigned to a leaf node,
If the predetermined condition is satisfied, a value obtained by processing the representative hash value or the representative hash value generated by calculating a hash value assigned to at least one other leaf node matching the specified hash value is registered in the database Wherein the server is configured to: 33. The method of claim 32,
If the merge tree is the first merge tree among at least one merge tree connected in a chain form, the first leaf node of the merge tree is assigned a hash value of a predetermined message data composed of text, numbers, or symbols or a processed value thereof Lt; / RTI &gt; A server for verifying a registered shareholder list file,
A communication unit for obtaining a verification request related to the registered shareholder list file, and
The server obtains a shareholder list file of a specific company or obtains a message digest of the shareholder list file, and the first specific hash value - the first specific hash value is (i) a private key of the specific company and (Ii) a hash value of the shareholder list file signed with the private key of the server, (iii) a private key of the specific company, and a private key of the server. A hash value of the message digest encoded in the private key of the server and (iv) a hash value of the message digest encoded in the private key of the server. The first hash value is generated by computing at least one neighbor hash value, A verification request related to the shareholder list file is acquired in a state where a representative hash value or a value obtained by processing the first representative hash value is registered in the database, A second representative hash value generated using the included input data or a value obtained by processing the second representative hash value corresponds to a value obtained by processing the first representative hash value or the first representative hash value registered in the database A processor that assists in determining or determining that verification has been performed associated with the shareholder file,
/ RTI &gt; 35. The method of claim 34,
The processor comprising:
Acquiring an OP message from the database using the transaction ID, referring to a predetermined transaction ID associated with the shareholder list file when a verification request related to the shareholder list file is obtained,
Wherein the value of the second representative hash value or the value of the second representative hash value generated using the input data included in the verification request is the first representative hash value or the first representative hash value The server determines whether or not the verification related to the shareholder list file has been performed. 36. The method of claim 35,
When a verification request related to the shareholder list file is obtained, the processor identifies the merge tree information and leaf node information associated with the input data, and refers to the predetermined transaction ID corresponding to the identified merge tree information Server features.
KR1020160021166A 2016-02-23 2016-02-23 Method and server for registering stockholder's list, recording transfer of stock ownership and verifying the registered stockholder's list file KR101798119B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020160021166A KR101798119B1 (en) 2016-02-23 2016-02-23 Method and server for registering stockholder's list, recording transfer of stock ownership and verifying the registered stockholder's list file

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020160021166A KR101798119B1 (en) 2016-02-23 2016-02-23 Method and server for registering stockholder's list, recording transfer of stock ownership and verifying the registered stockholder's list file

Publications (2)

Publication Number Publication Date
KR20170099154A true KR20170099154A (en) 2017-08-31
KR101798119B1 KR101798119B1 (en) 2017-11-16

Family

ID=59761289

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020160021166A KR101798119B1 (en) 2016-02-23 2016-02-23 Method and server for registering stockholder's list, recording transfer of stock ownership and verifying the registered stockholder's list file

Country Status (1)

Country Link
KR (1) KR101798119B1 (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107590659A (en) * 2017-09-07 2018-01-16 中链科技有限公司 Allocation of landownership and land use right data processing method, system and computer-readable recording medium
KR101937188B1 (en) * 2018-02-06 2019-04-09 주식회사 코인플러그 Method for managing information using merkle tree based on blockchain, server and terminal using the same
KR20190051366A (en) * 2017-11-06 2019-05-15 주식회사 트루쇼트 Method, system and non-transitory computer-readable recording medium for supporting securities short sale using distributed ledger
WO2019240499A1 (en) * 2018-06-12 2019-12-19 주식회사 트루쇼트 Method and system for supporting short selling of marketable securities, and non-transitory computer-readeable recording medium
CN111740915A (en) * 2020-08-05 2020-10-02 百度在线网络技术（北京）有限公司 Neighbor node determination method, device, equipment and storage medium
CN112152981A (en) * 2019-06-29 2020-12-29 华为技术有限公司 Communication method, node and communication system
KR20210057642A (en) * 2019-11-12 2021-05-21 주식회사 코스콤 Method for managing information of unlisted stocks and trading platform apparatus therefor
CN117112573A (en) * 2023-10-16 2023-11-24 中国科学技术大学 Structure design method of data right transfer record based on tree structure

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102305863B1 (en) * 2019-11-13 2021-09-29 (주)인프라케이 Online testing and evaluation system by using blockchain platform and artificial intelligence, and method thereof

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000250408A (en) * 1999-03-01 2000-09-14 Ntt Data Corp File authentication system, system and method for signature, system and method for authentication, and recording medium
JP5958703B2 (en) * 2012-08-23 2016-08-02 セイコーインスツル株式会社 Data certification system and data certification server

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107590659A (en) * 2017-09-07 2018-01-16 中链科技有限公司 Allocation of landownership and land use right data processing method, system and computer-readable recording medium
KR20190051366A (en) * 2017-11-06 2019-05-15 주식회사 트루쇼트 Method, system and non-transitory computer-readable recording medium for supporting securities short sale using distributed ledger
KR101937188B1 (en) * 2018-02-06 2019-04-09 주식회사 코인플러그 Method for managing information using merkle tree based on blockchain, server and terminal using the same
WO2019240499A1 (en) * 2018-06-12 2019-12-19 주식회사 트루쇼트 Method and system for supporting short selling of marketable securities, and non-transitory computer-readeable recording medium
KR20190140869A (en) * 2018-06-12 2019-12-20 주식회사 트루쇼트 Method, system and non-transitory computer-readable recording medium for supporting securities short sale
CN112152981A (en) * 2019-06-29 2020-12-29 华为技术有限公司 Communication method, node and communication system
CN112152981B (en) * 2019-06-29 2021-11-19 华为技术有限公司 Communication method, node and communication system
KR20210057642A (en) * 2019-11-12 2021-05-21 주식회사 코스콤 Method for managing information of unlisted stocks and trading platform apparatus therefor
CN111740915A (en) * 2020-08-05 2020-10-02 百度在线网络技术（北京）有限公司 Neighbor node determination method, device, equipment and storage medium
CN117112573A (en) * 2023-10-16 2023-11-24 中国科学技术大学 Structure design method of data right transfer record based on tree structure

Also Published As

Publication number Publication date
KR101798119B1 (en) 2017-11-16

Similar Documents

Publication Publication Date Title
KR101798119B1 (en) Method and server for registering stockholder&#39;s list, recording transfer of stock ownership and verifying the registered stockholder&#39;s list file
US10491396B2 (en) Method and server for providing notary service for file and verifying file recorded by notary service
US10235538B2 (en) Method and server for providing notary service for file and verifying file recorded by notary service
US11651109B2 (en) Permission management method, permission verification method, and related apparatus
US11849051B2 (en) System and method for off-chain cryptographic transaction verification
EP3454238A1 (en) Registration and authorization method, device and system
JP6756041B2 (en) Information protection systems and methods
JP7319961B2 (en) Computer-implemented systems and methods related to binary blockchains forming a pair of coupled blockchains
EP3739538A1 (en) System and method of supporting reflection of transactions between blockchain networks
KR101780634B1 (en) Method and server for issueing and distributing stocks, and transfering the ownership of the stocks by using virtul money
KR101978185B1 (en) Method for managing license of software based on blockchain, and license management server using the same
CN110084600B (en) Processing and verifying method, device, equipment and medium for resolution transaction request
KR101849920B1 (en) Method for providing certificate service based on m of n multiple signatures in use of merkle tree structure and server using the same
CN109447636A (en) A kind of assets transfer method and device
KR101829731B1 (en) Method and server for registering stockholder&#39;s list and recording transfer of stock ownership
CN109067849A (en) Method of data synchronization based on block
KR20180041050A (en) Method for providing certificate service based on m of n multiple signatures in use of merkle tree structure and server using the same
KR101890587B1 (en) Method for providing certificate service based on m of n multiple signatures in use of merkle tree structure and server using the same
KR20180041053A (en) Method for providing certificate service based on m of n multiple signatures in use of merkle tree structure and server using the same
CN118202622A (en) Method and system for distributed blockchain functionality
CN109063493A (en) Decentralization high performance synchronous method
KR20190101700A (en) Payment security verification system and method using private block chain and valid transaction record block location value

Legal Events

Date Code Title Description
A201 Request for examination
A302 Request for accelerated examination
E902 Notification of reason for refusal
E90F Notification of reason for final refusal
E701 Decision to grant or registration of patent right
GRNT Written decision to grant