WO2018207974A1 - 블록체인 시스템 및 블록체인을 이용한 데이터 관리 방법 - Google Patents

블록체인 시스템 및 블록체인을 이용한 데이터 관리 방법 Download PDF

Info

Publication number
WO2018207974A1
WO2018207974A1 PCT/KR2017/010017 KR2017010017W WO2018207974A1 WO 2018207974 A1 WO2018207974 A1 WO 2018207974A1 KR 2017010017 W KR2017010017 W KR 2017010017W WO 2018207974 A1 WO2018207974 A1 WO 2018207974A1
Authority
WO
WIPO (PCT)
Prior art keywords
type
block
data
event
branch
Prior art date
Application number
PCT/KR2017/010017
Other languages
English (en)
French (fr)
Korean (ko)
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 주식회사 써트온
Publication of WO2018207974A1 publication Critical patent/WO2018207974A1/ko

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor

Definitions

  • the present invention relates to a blockchain system and a data management method using a blockchain, and more particularly, to a blockchain system including a plurality of branches and a data management method using such a blockchain.
  • Blockchain is known as a concept introduced in Bitcoin, a cryptocurrency that is a kind of distributed database. Unlike the conventional storage and management of digital contents such as transaction books and documents in a centralized server, the blockchain system stores and manages the accumulated digital contents in devices (nodes) of a plurality of participants connected through a network. Such a blockchain system has the advantage that digital content itself is open to the public through the Internet, and since verification is frequently performed by a large number of participants, forgery or tampering is very difficult.
  • Such a blockchain system is used for storing a transaction record of a virtual currency system such as Bitcoin or a financial institution. Recently, such blockchain systems have also been used for electronic document management and original verification.
  • Nodes participating in the blockchain must store and maintain the data of the entire blockchain on the device. This is not a problem if the total blockchain size is not large because there are few accumulated transactions, but as the number of blocks increases as the number of new events such as transactions accumulate, the size of the entire blockchain gradually increases.
  • the overall blockchain size of Bitcoin, a representative blockchain system is now several tens of Gbytes.
  • nodes participating in the blockchain need a high level of storage and computing devices capable of storing and maintaining such a large amount of data.
  • a typical personal computer may not reach this level of performance.
  • personal mobile devices such as smartphones and tablet computers are not able to reach this level of performance.
  • An object of the present invention is to provide a blockchain system capable of efficiently and systematically constructing a blockchain by connecting blocks in multiple dimensions.
  • Another object of the present invention is to provide a blockchain system capable of constructing a blockchain in two dimensions by dividing the data contained in the block into two types.
  • Another object of the present invention is to provide a method for efficiently and systematically managing data using a multi-dimensionally connected blockchain.
  • the data is first type data not based on other data.
  • first type blocks that are divided into second type data based on the first type data, and include first type blocks including the first type data, wherein the first type blocks are connected to each other according to a generation order of the blocks;
  • At least one second type of block of the one of the sub-branch is doedoe connection according to the order of creation of each of the blocks, the second block of the first type generated by the single sub-branch is coupled to the root block.
  • one first type block in the main branch may include a hash value of at least a portion of the first type block just generated.
  • the second type block first generated in the one sub branch may include a hash value of at least a portion of the root block to be connected.
  • the second type block that is not first generated in the one sub branch may include a hash value of at least a portion of the second type block that is included in the sub branch and immediately generated.
  • the first type data is data for creating new data
  • the second type data is at least one of modifying, changing, deleting, discarding, inquiring and transferring existing data. Can be done.
  • the data may be information about digital content
  • the first type data may be information about new digital content
  • the second type data may be information based on already generated digital content.
  • the second type of data may be information regarding at least one of modification, change, deletion, discard, inquiry, and transmission of already generated digital content.
  • the data may be information about a document
  • the first type data may be information about a new document generation
  • the second type data may be information based on a document that has already been generated.
  • the second type of data may be information regarding at least one of the modification, modification, deletion, discarding, inquiry, and transmission of the already generated document.
  • the data may be information about an account
  • the first type data may be information about creating a new account
  • the second type data may be information about a transaction of an already created account.
  • the event for two or more data using the blockchain may be divided into a first type event based on existing data and a second type event based on existing data, and providing a main branch to which at least one block is connected in the order of block generation, respectively, Searching for a root block including data on which the second type event is based in the main branch when the type event occurs; if there is no sub branch starting from the root block and distinguished from the main branch, the second branch; A sub branch is generated by creating a block including data according to a type event to be connected to the root block. And a step of sex.
  • the generating of the sub branch may include inserting a hash value of at least a portion of the root block into a block header of a block to be generated.
  • the generating of the sub branch may include determining whether there is a sub branch starting from the root block and distinguished from the main branch.
  • a block including data according to the second type event is connected to the last block of the sub branch.
  • the method may further include extending the sub branch.
  • extending the sub branch may include inserting a hash value of at least a portion of the last block of the sub branch into a block header of a block to be generated.
  • the extending of the sub branch may include determining whether there is a sub branch starting from the root block and distinguished from the main branch.
  • generating the block including data according to the first type event to be connected to the last block of the main branch to further extend the main branch may include.
  • extending the main branch may include inserting a hash value of at least a portion of the last block of the main branch into a block header of a block to be generated.
  • the type 1 event is an event related to creating new material
  • the type 2 event is one of modifying, changing, deleting, discarding, inquiring and transferring existing material. It may be an event about performing.
  • the data is information about digital content
  • the first type event is an event related to creating a new digital content
  • the second type event is an event based on already generated digital content. Can be.
  • the second type event may be an event related to performing at least one of the modification, change, deletion, discard, inquiry, and delivery of already generated digital content.
  • the data may be information about a document
  • the first type event may be an event related to creating a new document
  • the second type event may be an event based on a document already generated.
  • the second type event may be an event related to performing at least one of the modification, change, deletion, inquiry and delivery of the already generated document.
  • the first type event may be an event related to creating a new account
  • the second type event may be an event related to a transaction of an already created account
  • the blockchain system according to an embodiment of the present invention has an advantage of efficiently and systematically constructing a blockchain by connecting blocks in multiple dimensions.
  • the blockchain system according to an embodiment of the present invention has an advantage in that the blockchain can be multi-dimensionally divided into two types of data included in the block.
  • the data management method using a blockchain has the advantage that it is possible to efficiently and systematically manage data using a blockchain connected in multiple dimensions.
  • FIG. 1 illustrates a configuration of individual blocks of a blockchain system according to an embodiment of the present invention.
  • Figure 2 shows that two blocks of the blockchain system according to an embodiment of the present invention are connected.
  • 3 to 6 are diagrams for explaining data of a blockchain system according to an embodiment of the present invention.
  • FIG. 7 is a diagram for describing a method of displaying a block in a blockchain.
  • FIG. 8 is an exemplary diagram of a blockchain system according to an embodiment of the present invention.
  • FIG. 9 is a diagram for an example of using a blockchain system according to an embodiment of the present invention.
  • FIG. 10 is a flowchart illustrating a data management method using a blockchain according to an embodiment of the present invention.
  • 11 to 15 are diagrams for an example of a blockchain for explaining a data management method using a blockchain according to an embodiment of the present invention.
  • FIG. 1 illustrates a configuration of individual blocks of a blockchain system according to an embodiment of the present invention.
  • Figure 2 shows that two blocks of the blockchain system according to an embodiment of the present invention are connected.
  • one block 100 includes a block header 110 and a block body 120.
  • the block header 110 may include a title of a block, a hash value of a previous block, a hash value of a block body, a time stamp, a difficulty goal, and a nonce.
  • the information included in the block header 110 may be configured in various ways.
  • the title of the block refers to identification information that can distinguish the block 100 from other blocks.
  • the title of a block may be determined according to a connection relationship with another block.
  • the hash value of the immediately preceding block is a hash value of a block generated before the block in the branch and connected to the block.
  • the hash value of the immediately preceding block may be a hash value of all or selected portions of information of the immediately preceding block.
  • the hash value of the immediately preceding block may be defined as being a hash value of information of the block header of the immediately preceding block.
  • the hash value of the block body is a hash value of data included in the block body 120 of the block.
  • the block body 120 includes data.
  • the hash value of the block body may be a hash value of all or selected portions of data included in the block body.
  • the hash value of the block body can be determined in various ways.
  • the hash value of the block body may be a hash value for the root of the Merkle tree generated from the data of the block body 120.
  • the hash value of the block body corresponds to a summary of the data of the block body 120, and enables the efficient management and verification of the data of the relatively large block body 120.
  • a time stamp is information about a generation time of a corresponding block.
  • the difficulty goal is the difficulty goal for the proof-of-work algorithm of the block. This is information about determining the hashing power needed to find the nonce of the block.
  • the nonce is counter information used in the proof-of-work algorithm of the block.
  • the block header 110 may exclude some of the above-described information, or may further include other information.
  • the block body 120 includes data stored and managed by the block 100.
  • Data corresponds to digital data.
  • the data can be in various forms.
  • the data may be digital content, document information, account information, transaction information, personnel information, production history information, design and drawing of a product or building, sound information, and the like, but is not limited to a specific form.
  • Data included in the block body 120 may be limited in type or size depending on the block. This limitation of data may be applied to all blocks in common, or may be selectively applied to only a few specific blocks. In addition, the limitation of such data may be changed as necessary.
  • two blocks may be connected to each other.
  • the plurality of blocks may be sequentially connected to form a branch.
  • a branch means a set of blocks in which a plurality of blocks are linearly connected to each other. 2 shows a state in which any two blocks in this branch are connected.
  • any one block 200 in a branch is to be connected to a block 100 just created in the branch.
  • the block 200 is connected via including the hash value of the block 100 just generated.
  • the block 200 may be connected to the block header 210 by including a hash value of the block 100 generated immediately before.
  • the hash value of the block 100 generated immediately before may be a hash value of all or selected portions of information of the immediately preceding block 100 as described above.
  • a hash value of the immediately preceding block 100 may be defined as a hash value of information of the block header 110 of the immediately preceding block.
  • the hash value of the immediately preceding block may be variously changed according to the preference and judgment of the person designing the block.
  • the blockchain system of the present invention includes a plurality of blocks.
  • One block contains one data.
  • data means a unit set of information included in one block.
  • the block body of the block may include data.
  • Data included in the block of the blockchain system may be classified into first type data and second type data.
  • Type 1 data corresponds to data that is not based on other data.
  • Type 2 data corresponds to data based on type 1 data.
  • the first type data 10 may be data about generating new data.
  • the second type data 20 may be data about performing at least one of modifying, changing, deleting, discarding, inquiring, and transferring existing data.
  • the existing data means data generated by the first type data 10.
  • data may be information regarding digital content.
  • Digital content refers to all types of content composed of digital information.
  • Digital content may be, for example, images, images, sounds, text, programming code, spreadsheets, and the like, but is not limited to those listed above.
  • the first type data 10 may be information about new digital content
  • the second type data 20 may be information based on already generated digital content.
  • the second type data 20 may be, for example, information regarding at least one of modification, change, deletion, disposal, inquiry, and transmission of already generated digital content.
  • the already generated digital content means digital content generated by the first type data 10.
  • the data may be information about a document.
  • Document means any type of document composed of digital information.
  • the document may include text, images, tables, and the like.
  • the document may include information on the settlement and settlement of the parties concerned.
  • the first type data 10 may be information about creating a new document
  • the second type data 20 may be information information based on a document that has already been generated.
  • the second type data 20 may be, for example, information regarding at least one of modification, change, deletion, discarding, inquiry, and transmission of the already generated document.
  • the second type data 20 may be information regarding payment, agreement, return, and the like, for the already generated document.
  • the already generated document means a document generated by the first type data 10.
  • the data may be information about an account.
  • the first type data 10 may be information about creating a new account
  • the second type data 20 may be information about a transaction of an already created account.
  • the account already created means an account created by the first type data 10.
  • the data may be transactions, personnel, production history, design, drawings, sound, programming code, and the like.
  • Type 1 data and type 2 data may also be classified according to these various types.
  • the first type data and the second type data are not limited to those described above.
  • FIG. 7 the blocks constituting the blockchain shown in FIGS. 8 to 9 and 11 to 15 will be briefly described.
  • the block includes a block header and a block body, as described with reference to FIGS. 1 and 2. However, for convenience of description, the individual blocks are shown in FIGS. 8 to 9 and 11 to 15 in the manner shown in FIG. 7.
  • the title of the block, the hash value of the previous block, the hash value of the block, and the data included in the block are displayed.
  • the title of the block is displayed in the first column
  • the hash value of the previous block is displayed in the second column
  • the hash value of the block is displayed in the third column
  • the data is displayed in the last column. do.
  • the title of the block is expressed in the form B n or B nm .
  • the title of the block B n means that the block is the n th block of the main branch.
  • the title of the block is B nm means that the block is the m-th type 2 block of the sub branch branched from the n-th block of the main branch.
  • the m-th second type block of any sub branch corresponds to the m + 1 th block of the sub branch.
  • the hash value of a block is indicated using the symbol H.
  • H For example, it is to be the title of the block hash value of the block B is represented by H nm nm.
  • the immediately preceding block of the block whose title is B nm is a block whose title is B n (m-1)
  • the hash value of the immediately preceding block is H n (m-1) .
  • FIG. 8 is an exemplary diagram of a blockchain system according to an embodiment of the present invention.
  • the blockchain system of the present invention includes a plurality of blocks.
  • One block contains one data.
  • the data may be divided into the first type data 10 and the second type data 20.
  • the block may be divided into a first type block 100-1 and a second type block 100-2 according to the type of data to be included.
  • the first type block 100-1 corresponds to a block including the first type data 10.
  • the second type block 100-2 corresponds to a block including the second type data 20.
  • the blockchain system of the present invention includes a main branch 1000 and at least one sub branch 2000.
  • a branch means a set of blocks in which a plurality of blocks are linearly connected to each other.
  • the main branch 1000 includes a generation block initially generated and at least one connection block connected thereto.
  • the main branch 1000 is connected to the connection block without branching in one direction in the first generated block.
  • branches may be formed in the main branch 1000 to form other branches, the branched blocks are not included in the main branch 1000.
  • the branched blocks may be included in the sub branch 2000 to be described later, which will be described below.
  • the main branch 1000 is composed of first type blocks 100-1. That is, the first generated block and the connection block included in the main branch 1000 correspond to the first type block 100-1.
  • the blocks included in the main branch 1000 are connected in order according to the generated order.
  • the concatenation of the blocks is accomplished by including the hash values of at least some of the blocks created just before that block. This type of connection is indicated by the arrows between the blocks in FIG. 8.
  • one first type block includes a hash value of at least a portion of the first type block just generated.
  • the sub branch 2000 is a branch formed by branching from the main branch 1000.
  • the sub branch 2000 includes a root block and at least one connection block connected thereto.
  • the root block is also included in the main branch 1000 and is a block at which branching of the sub branch 2000 begins.
  • the root block corresponds to a generation block first generated in the sub branch 2000.
  • the root block corresponds to the first type block 100-1.
  • the connection block included in the sub branch 2000 corresponds to the second type block 100-2.
  • Blocks included in one sub branch 2000 are connected in order according to the order in which they are created. The concatenation of the blocks is accomplished by including the hash values of at least some of the blocks created just before that block.
  • the connection block (second type block) first generated in one sub branch 2000 includes a hash value of at least a portion of the root block to which the sub branch 2000 is connected.
  • the connection block (second type block) that is not initially generated in one sub branch 2000 includes a hash value of at least a portion of the second type block that is included in the sub branch 2000 and immediately generated. This type of connection is indicated by the arrows between the blocks in FIG. 8.
  • the sub branch 2000 is conditioned to include at least one connection block.
  • a subbranch having a height (length) of one block in which there is no connection block and only a root block exists, but in this specification, such a subbranch is defined as not present in this case. That is, for convenience of description, the sub branch 2000 defines that there is one root block and at least one connection block connected thereto.
  • One or more sub branches 2000 may be formed.
  • the sub branch 2000 may be formed in a shape in which one or two or more extend in one root block.
  • only one sub branch 2000 is formed in one root block.
  • this description does not exclude that two or more subbranches 2000 are extended in one root block in the present invention.
  • the sub branch 2000 may be formed up to the maximum number of blocks of the main branch 1000.
  • the blockchain system is composed of a main branch and a sub branch, and the blocks are composed of a first type block and a second type block.
  • the block chain system is composed of a main branch, a sub branch, and a sub-sub branch.
  • the blocks may also be composed of a first type block, a second type block, and a third type block.
  • the sub-sub branch refers to a branch branched from the sub branch again, with the sub branch as the main branch.
  • the root block of the sub-sub branch may be a second type block included in the sub branch.
  • the connection block of the sub-sub branch may be a third type block.
  • the main branch and the subbranch are relative, and the subbranches may be serially generated.
  • the entire blockchain data may not be stored and used for verification of a specific block.
  • the node may verify the specific block using only blockchain data of the main branch.
  • the specific block is the second type block
  • the node may verify the specific block using only the blockchain data of the sub branch and the main branch including the specific block. This reduces the size of blocks that nodes need to store and verify.
  • FIG. 9 illustrates an example in which data included in a block of a blockchain is information on a document, type 1 data is information on creating a new document, and type 2 data is information based on a document that has already been generated.
  • the second type data may be, for example, information about at least one of modification, change, deletion, discarding, inquiry, and transfer of the already generated document.
  • the blockchain system shown in FIG. 9 stores data about seven different documents. As seven documents (No. 1 to 7) are newly generated, seven first type blocks B 1 to B 7 are generated, and the seven first type blocks B 1 to B 7 are respectively generated. It stores data about the creation of a new document. The seven first type blocks B 1 to B 7 are connected in the generated order to form the main branch 1000.
  • the blockchain system shown in FIG. 9 includes five subbranches extending from five blocks B 1 , B 2 , B 3 , B 4 , and B 6 of the seven first type blocks.
  • a node participating in this blockchain system is assumed to be a node related only to the third document.
  • Node A may want to verify the data for the last modification of document # 3.
  • the node A may store only the block included in the third branch 2300 and the block included in the main branch 1000, and verify data about the last change of the third document by using the same.
  • Node A needs to store and verify.
  • node A only needs to store and verify 12 blocks (seven first type blocks of the main branch 1000 and five second type blocks of the third sub branch 2300).
  • the entire blockchain must be stored and verified.
  • node A in the above-described example should store up to 26 blocks and verify this. Therefore, the blockchain system of the present invention has the effect of reducing the storage space burden and computing burden of the nodes participating in the blockchain.
  • a data management method using a blockchain to be described below relates to a method of managing data using the blockchain system described above with reference to FIGS. 1 to 9. Therefore, for convenience of description, some of the contents overlapping with the description of the blockchain system will be omitted.
  • the data management method using the blockchain of the present invention is a method of managing events for data using the blockchain.
  • an event means that a node has performed some operation on data.
  • the data management method using the blockchain of the present invention is a method of storing and managing data generated according to the above-described event through the blockchain.
  • Events managed by the blockchain can be divided into type 1 events and type 2 events.
  • Type 1 events correspond to events that are not based on existing data.
  • Type 2 events correspond to events based on existing data.
  • the type 1 event may be an event related to generating new material
  • the type 2 event may be an event related to performing at least one of modifying, changing, deleting, discarding, inquiring, and transferring existing data.
  • the data may be information about digital content.
  • the first type event may be an event related to generating new digital content
  • the second type event may be an event based on already generated digital content.
  • the type 2 event may be, for example, an event related to performing at least one of the modification, change, deletion, discard, inquiry, and delivery of already generated digital content.
  • the data may be information about the document.
  • the type 1 event may be an event related to generating a new document
  • the type 2 event may be an event based on an already generated document.
  • the second type event may be an event related to performing at least one of the modification, change, deletion, discarding, inquiry, and delivery of an already generated document.
  • the data may also be information about the account.
  • the type 1 event may be an event relating to creating a new account
  • the type 2 event may be an event relating to a transaction of an already created account.
  • Type 1 events and type 2 events may also be classified according to these various types. Type 1 events and type 2 events are not limited to those described above.
  • FIG. 10 is a flowchart illustrating a data management method using a blockchain according to an embodiment of the present invention.
  • the method may include: preparing a main branch (S100), determining a type of an event (S200), extending a main branch (S510), and searching for a root block. Step S300, determining the existence of the sub branch S400, generating the sub branch S520, and extending the sub branch S530.
  • 11 to 15 show that data is information about a document as an example.
  • the preparing of the main branch (S100) is a preparing of the main branch to which at least one block is connected according to the generation order of the blocks.
  • the main branch is composed of first type blocks containing first type data.
  • the blockchain is provided with a main branch. Specifically, the block chain is in a state where a main branch composed of six first type blocks B 1 to B 6 is provided.
  • data according to an event in which six documents (Nos. 1 to 6) are generated is managed in each block.
  • the data management method using the blockchain of the present invention relates to a method of managing data according to the generated event using the blockchain when a new event occurs while a main branch is provided.
  • step S200 of determining the type of event is performed.
  • the event may be a type 1 event or a type 2 event.
  • Extending the main branch (S510) is a step of generating a block including data according to the first type event that occurred, to be connected to the last block of the main branch.
  • the newly created block is connected to the existing main branch so that the main branch is extended.
  • the node to generate a block generates a block body including data according to the type 1 event that has occurred.
  • the hash value of the block body is inserted into the block header.
  • a hash value of at least a part of the last block of the existing main branch may be inserted into the block header of the block to be newly created.
  • the block header includes a hash value of the block body and a hash value of at least a part of the last block of the existing main branch.
  • the node to generate a block searches for a nonce that satisfies the block generation condition, and inserts the found nonce into the block header to generate the block.
  • FIG. 12 is a diagram for describing a method of managing data according to a first type event in which seven new documents are generated in the blockchain state of FIG. 11.
  • a block B 7 including data according to the first type event in which document 7 is generated is newly generated.
  • the generated block B 7 is connected to the last block B 6 of the existing main branch to extend the main branch.
  • the newly generated block B 7 includes a hash value H 6 of at least a portion of the last block of the existing main branch.
  • the step S300 of searching for the root block is performed.
  • Searching for the root block (S300) is a step of searching for a block including data based on the generated second type event.
  • the root block may be one of the blocks included in the main branch.
  • a step (S400) of determining whether there is a sub branch starting from the found root block and distinguished from the main branch is performed. If the sub branch does not exist, generating a sub branch (S520) is performed. If there is a sub branch, the step (S530) of extending the sub branch is performed.
  • the generating of the sub branch (S520) is a step of generating a block including data according to the generated second type event to be connected to the root block.
  • the newly created block is connected to the root convex to create a sub branch.
  • the node to create a block generates a block body including data according to the type 2 event that has occurred.
  • the hash value of the block body is inserted into the block header.
  • a hash value of at least a portion of the root block may be inserted into a block header of a block to be newly generated.
  • the block header includes a hash value of the block body, a hash value of at least a part of the root block, and the like.
  • the node to generate a block searches for a nonce that satisfies the block generation condition, and inserts the found nonce into the block header to generate the block.
  • FIG. 13 is a diagram for describing a method of managing data according to a case in which a second type event in which five documents are modified in the blockchain state of FIG. 12 occurs.
  • a step (S300) of searching for a root block including data based on the generated type 2 event is performed. Referring to FIG. 13, a block B 5 including data according to an event in which document 5 is generated as a root block is searched for in step S300.
  • step S400 When the root block is searched, a step (S400) of determining whether there is a sub branch starting from the found root block B 5 and distinguished from the main branch is performed. Referring to FIG. 13, in step S400, it is determined that there is no sub branch starting from the root block B 5 .
  • generating a sub branch (S510) is performed.
  • a block B 51 including data according to the second type event in which document 5 is modified is newly generated.
  • the generated block B 51 is connected to the searched root block B 5 to generate a sub branch.
  • the newly generated block B 51 includes a hash value H 5 of at least a portion of the root block.
  • Extending the sub branch (S520) is a step of generating a block including data according to the generated second type event to be connected to the end of the sub branch. The newly created block is connected to the sub branch so that the sub branch is extended.
  • the node to create a block generates a block body including data according to the type 2 event that has occurred.
  • the hash value of the block body is inserted into the block header.
  • a hash value of at least a portion of the last block of the sub branch may be inserted into the block header of the block to be newly generated.
  • the block header includes a hash value of the block body and a hash value of at least a part of the last block of the sub branch.
  • the node to generate a block searches for a nonce that satisfies the block generation condition, and inserts the found nonce into the block header to generate the block.
  • FIGS. 14 and 15 a case in which the generated event is a second type event and a sub branch is present will be described.
  • 14 illustrates an extended state in which a plurality of second type events are generated in a blockchain state of FIG. 13 to generate a plurality of sub branches. It is assumed that a new second type event has occurred in the blockchain state of FIG. 14.
  • FIG. 15 is a diagram for describing a method of managing data according to a second type event in which three documents are inquired in the blockchain state of FIG. 14.
  • a step (S300) of searching for a root block including data based on the generated second type event is performed. Referring to FIG. 15, a block B 3 including data according to an event in which document 3 is generated as a root block in step S300 is searched.
  • step (S400) of determining whether there is a sub branch starting from the found root block B 3 and distinguished from the main branch is performed. Referring to FIG. 15, it is determined in step S400 that there exists a sub branch starting from the root block B 3 .
  • a block B 35 including data according to the second type event in which document 3 is inquired is newly generated.
  • the generated block B 35 is generated to be connected to the last block B 34 of the sub branch starting from the found root block B 3 .
  • the newly generated block B 35 includes a hash value H 34 of at least a portion of the last block of the sub branch.
  • a blockchain including one main branch and at least one subbranch can be formed, and data can be managed using the blockchain.
  • data can be managed using the blockchain.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
PCT/KR2017/010017 2017-05-12 2017-09-13 블록체인 시스템 및 블록체인을 이용한 데이터 관리 방법 WO2018207974A1 (ko)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR1020170059270A KR101964692B1 (ko) 2017-05-12 2017-05-12 블록체인 시스템 및 블록체인을 이용한 데이터 관리 방법
KR10-2017-0059270 2017-05-12

Publications (1)

Publication Number Publication Date
WO2018207974A1 true WO2018207974A1 (ko) 2018-11-15

Family

ID=64105265

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2017/010017 WO2018207974A1 (ko) 2017-05-12 2017-09-13 블록체인 시스템 및 블록체인을 이용한 데이터 관리 방법

Country Status (4)

Country Link
KR (1) KR101964692B1 (zh)
SG (1) SG10201803837VA (zh)
TW (1) TW201901481A (zh)
WO (1) WO2018207974A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109918402A (zh) * 2019-01-31 2019-06-21 平安科技（深圳）有限公司 基于区块链的教育证明获取方法、装置、计算机设备

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102128661B1 (ko) * 2018-11-22 2020-06-30 주식회사 포스코아이씨티 이중 레이어 블록체인 시스템
KR102188718B1 (ko) * 2018-11-29 2020-12-08 롯데정보통신 주식회사 블록체인 기반 결제중개 시스템 및 방법
WO2020138532A1 (ko) * 2018-12-27 2020-07-02 서강대학교 산학협력단 사물 인터넷 환경을 위한 동적 블라인드 투표기반의 블록체인 합의방법
WO2020153552A1 (ko) * 2019-01-22 2020-07-30 인제대학교 산학협력단 기록된 거래의 수정이 가능한 블록체인을 위한 방법 및 장치
KR102189668B1 (ko) * 2019-04-24 2020-12-11 인제대학교 산학협력단 탈중앙화된 계층적 다중 블록체인 방법
KR102189667B1 (ko) * 2019-04-24 2020-12-11 인제대학교 산학협력단 탈중앙화된 블록체인에서 거래의 승인과 수정을 통합한 블록 채굴 방법
KR102330005B1 (ko) 2019-03-11 2021-11-24 순천향대학교 산학협력단 효율적인 내용 변경 및 삭제를 위한 하이브리드 블록체인 시스템 및 하이브리드 블록체인을 이용한 xgs 주입 방법
KR20210005446A (ko) 2019-07-05 2021-01-14 삼성디스플레이 주식회사 전자 장치 및 이의 제조 방법
KR102348741B1 (ko) * 2019-09-16 2022-01-07 손종희 블록체인 기반의 전자영수증 관리 장치 및 방법
KR102332814B1 (ko) * 2019-12-11 2021-11-29 지송학 데이터 자기주권화를 위한 블록체인 구조를 포함하는 블록체인 시스템
KR102267560B1 (ko) * 2020-11-13 2021-06-21 주식회사 케이사인 블록 체인에 저장되는 데이터 크기를 축소할 수 있는 데이터의 변경 이력 관리 방법

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160028552A1 (en) * 2014-07-25 2016-01-28 Blockchain Technologies Corporation System and method for creating a multi-branched blockchain with configurable protocol rules
WO2016046820A1 (en) * 2014-09-23 2016-03-31 Spondoolies Tech Ltd. System and method for providing shared hash engines architecture for a bitcoin block chain
KR20160095720A (ko) * 2015-02-03 2016-08-12 한양대학교 에리카산학협력단 암호화 화폐의 거래를 보호하는 방법 및 장치
KR101701131B1 (ko) * 2016-04-28 2017-02-13 주식회사 라피 이종간 블록체인 연결을 이용한 데이터 기록/검증 방법 및 시스템
KR101727525B1 (ko) * 2016-09-05 2017-04-17 주식회사 스케일체인 블록체인 기반 분산 저장 방법 및 이를 이용한 장치

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160028552A1 (en) * 2014-07-25 2016-01-28 Blockchain Technologies Corporation System and method for creating a multi-branched blockchain with configurable protocol rules
WO2016046820A1 (en) * 2014-09-23 2016-03-31 Spondoolies Tech Ltd. System and method for providing shared hash engines architecture for a bitcoin block chain
KR20160095720A (ko) * 2015-02-03 2016-08-12 한양대학교 에리카산학협력단 암호화 화폐의 거래를 보호하는 방법 및 장치
KR101701131B1 (ko) * 2016-04-28 2017-02-13 주식회사 라피 이종간 블록체인 연결을 이용한 데이터 기록/검증 방법 및 시스템
KR101727525B1 (ko) * 2016-09-05 2017-04-17 주식회사 스케일체인 블록체인 기반 분산 저장 방법 및 이를 이용한 장치

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109918402A (zh) * 2019-01-31 2019-06-21 平安科技（深圳）有限公司 基于区块链的教育证明获取方法、装置、计算机设备

Also Published As

Publication number Publication date
SG10201803837VA (en) 2018-12-28
KR101964692B1 (ko) 2019-04-02
KR20180124541A (ko) 2018-11-21
TW201901481A (zh) 2019-01-01

Similar Documents

Publication Publication Date Title
WO2018207974A1 (ko) 블록체인 시스템 및 블록체인을 이용한 데이터 관리 방법
WO2018207975A1 (ko) 블록체인 시스템 및 블록체인 생성 방법
WO2013081282A1 (en) System and method for recommending application by using keyword
WO2021040124A1 (ko) 인공지능 기반의 법률 문서 분석 시스템 및 방법
WO2011136425A1 (ko) 개체명 사전 및 마이닝 규칙이 결합된 온톨로지 스키마를 이용한 리소스 기술 프레임워크 네트워크 구축 장치 및 방법
WO2016126090A1 (ko) 스마트폰을 사용한 디지털 파일 위변조 입증 시스템 및 방법과 스마트폰 화면 캡쳐 이미지 인증 기능을 가지는 스마트폰 및 스마트폰 화면 캡쳐 이미지 인증 방법
WO2014126335A1 (ko) 클라우드 컴퓨팅 기반의 데이터 관리 방법, 이를 위한 시스템 및 장치
CN107590277A (zh) 数据同步方法、装置、电子设备及存储介质
WO2015129983A1 (ko) 분산 퍼지 연관 규칙 마이닝에 기반한 영화 추천 장치 및 방법
WO2022131441A1 (ko) 블록체인 네트워크를 이용하여 웹페이지를 저장 및 검증하는 방법 및 시스템
WO2020087981A1 (zh) 风控审核模型生成方法、装置、设备及可读存储介质
WO2020130331A1 (ko) 블록체인에서 노드들간 블록 및 전자 문서를 공유 및 검증하는 방법
EP2435935A2 (en) Method of providing by-viewpoint patent map and system thereof
WO2022108318A1 (ko) 스마트 컨트랙트 코드 취약점 분석 장치 및 방법
WO2020062658A1 (zh) 合同生成方法、装置、设备及存储介质
WO2023210860A1 (ko) 단말 그룹핑 기반의 인터넷 접속 관리 서비스를 제공할 수 있는 인터넷 접속 관리 서비스 서버 및 그 동작 방법
WO2011090284A2 (ko) 범세계적으로 고유한 분산객체식별아이디를 이용한 다수의 분산된 가상세계 간 상호 연동 시스템 및 그 방법
WO2017052240A1 (ko) 진본성 및 무결성을 입증하기 위한 사본영상 증거관리시스템
WO2019190234A1 (ko) 블록체인 시스템
WO2013008978A1 (ko) 개체 식별 결과 검색 시스템 및 방법
WO2016093652A2 (ko) 전화번호를 통하여 클라우드 서버에 접속하여 가족 앨범을 이용할 수 있도록 하는 가족 앨범서비스 제공방법
WO2013176433A1 (ko) 디지털 에이징 시스템 및 그 운용방법
WO2019190226A1 (ko) 블록체인 시스템
WO2024101500A1 (ko) Nft 컨테이너를 이용한 nft 발행 시스템 및 방법
WO2017191877A1 (ko) 프로버넌스 관리를 위한 압축 장치 및 방법

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17909552

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 13.03.2020)

122 Ep: pct application non-entry in european phase

Ref document number: 17909552

Country of ref document: EP

Kind code of ref document: A1