KR102090723B1 - Method for providing blockchain based bicameralism consensus service using quantum random function mechanism - Google Patents

Abstract

Provided is a method for providing a blockchain-based bicameralism consensus service using a quantum random number, which is capable of maintaining fairness and transparency. According to the present invention, the method comprises the steps of: receiving transaction data requesting block generation from a front node and encrypting and transmitting a quantum random number, generated by a quantum random function mechanism, to the front node; receiving verification data from coordinator, standing committee, and steering committee nodes decrypting the quantum random number when the front node inserts the encrypted quantum random number into a header of the block to broadcast the same; allowing the coordinator node to fix a predetermined number of nodes accessed in order of connection from the standing and steering committee nodes as the steering committee node; and allowing the coordinator node to collect a consensus result through direction communications between the standing and steering committee nodes and broadcast the result to at least one node included in a blockchain to generate a block.

Description

Method of providing consensus service for bilateral system using blockchain-based quantum random numbers {METHOD FOR PROVIDING BLOCKCHAIN BASED BICAMERALISM CONSENSUS SERVICE USING QUANTUM RANDOM FUNCTION MECHANISM}

The present invention relates to a method for providing a consensus service using a blockchain based quantum random number, and provides a consensus algorithm that simultaneously guarantees integrity and speed.

Blockchain system is a structure in which blocks called transaction sets are connected in a chain. A block is a bundle of valid transaction information, and the block structure consists of a block hash, block header and body. Among blockchain systems, the public blockchain uses PoW (Proof of Work) and PoS (Proof of Stake) consensus algorithms, and the private blockchain uses PBFT (Delegated Proof of Stake) consensus algorithms. At this time, PBFT is an algorithm developed so that all participants can reach an agreement in a distributed network where malicious participants who do not perform the promised action may exist, and consists of one primary and the other replicas, request, pre-prepare, prepare Agree on requests received from users through 5 processes:, Commit, and Reply.

At this time, a method for deriving hierarchical consensus in a service zone using a PBFT was researched and developed. In this regard, in the prior art, Korean Patent Publication No. 2019-0068799 (published on June 19, 2019), a plurality of services Based on the service zone management ledger that stores the information of the zone consensus group, it is determined whether the user's transaction is processed within the service zone consensus group or through a plurality of service zone consensus groups, and the inter-service zone is disclosed according to the determination result. Based on the local service zone private ledger that exists for each ledger or service zone consensus group, at least one service zone consensus group uses the PBFT algorithm to perform consensus, and the information of the consensus is released to the inter-service zone public ledger Alternatively, a configuration for distributed storage in a private ledger of a local service zone is disclosed.

However, even if the above-described configuration is used, in order to reach consensus, communication with at least one node constituting the blockchain must be communicated, so if the number of nodes as participants increases, the consumption of computing resources and networking resources is severe. As a result, a delay occurs and the throughput is significantly reduced. In addition, PoW and PoS can create thousands of nodes, but PBFT is limited to generating dozens of nodes, and is stopped when the required number is not met. Here, even if an agreement is reached using PoW, there is still a 51% attack and finality uncertainty problem, and even using PoS, the problem of double payment remains with the problem of power monopoly due to the poor and the poor. . Accordingly, research and development of a new consensus structure in the blockchain is required.

In one embodiment of the present invention, in addition to the permanently operated nodes, in addition to the permanently operated nodes, which are harmonized by the internal and external balance of the private blockchain and the self-cleaning effect, and exclude the possibility of forgery and alteration, the temporarily operated operating node nodes selected and registered in a first-come, first-served order If the agreement between the senior node and the operating node is added, and by proceeding through the coordinator, fast consensus can be reached using minimal network traffic and networking resources, and quantum random number is also selected when selecting the coordinator among the senior nodes. Since it does not give time for forgery and alteration by immediately electing by using, it is possible to provide a method for providing a consensus service using a blockchain based quantum random number that can maintain fairness and transparency. However, the technical problem to be achieved by the present embodiment is not limited to the technical problem as described above, and other technical problems may exist.

As a technical means for achieving the above-described technical problem, an embodiment of the present invention receives transaction data requesting block generation from a front node, and is generated by a quantum random number algorithm (Quantum Random Function Mechanism). Encrypting and transmitting the quantum random number to the front node. When the front node inserts and broadcasts the encrypted quantum random number into the header in the block, the verification data is received from the coordinator node, the standing node, and the candidate candidate node that decode the quantum random number. A step of receiving, determining a predetermined number of first-come-first-served access nodes from the coordinator node to the top-ranking node and the top-ranking candidate node as the top-ranking node, and collecting the agreement result through direct communication between the top-ranking node and the top-ranking node at the coordinator node. Browsing the results to at least one node in the chain And decasting to generate a block.

According to any one of the above-described problem solving means of the present invention, in order to exclude the possibility of forgery and alteration, while harmonizing with the internal and external balance of the private blockchain and mutual self-cleaning, in addition to the permanently operated nodes, quantum random numbers are selected and first-come-first-served. By adding the registered temporary operating node, and if the agreement between the standing and operating nodes is proceeded through the coordinator, quick consensus can be reached using minimal network traffic and networking resources, and the coordinator among the standing nodes Even when selecting, it is possible to maintain fairness and transparency because it does not give time for forgery forgery by immediately selecting using quantum random numbers.

1 is a view for explaining a system for providing a consensus service using a blockchain based quantum random number according to an embodiment of the present invention.
FIG. 2 is a block diagram for explaining a dual system consensus service providing server included in the system of FIG. 1.
3 and 4 are diagrams for explaining an embodiment of a process of selecting and agreeing a senior node, an operating node, and a coordinator among consensus services using a blockchain-based quantum random number according to an embodiment of the present invention.
5 is a view for explaining an embodiment of a block structure and a state transition process of a consensus service using a blockchain based quantum random number according to an embodiment of the present invention.
6 and 7 are views illustrating a process in which data is transmitted and received between each of the components included in a system for providing a consensus service using a blockchain based quantum random number in FIG. 1 according to an embodiment of the present invention.
8 is an operation flowchart for explaining a method for providing a consensus service using a blockchain based quantum random number according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art to which the present invention pertains can easily practice. However, the present invention can be implemented in many different forms and is not limited to the embodiments described herein. In addition, in order to clearly describe the present invention in the drawings, parts irrelevant to the description are omitted, and like reference numerals are assigned to similar parts throughout the specification.

Throughout the specification, when a part is "connected" to another part, this includes not only "directly connected" but also "electrically connected" with another element in between. . Also, when a part is said to “include” a certain component, it means that the component may further include other components, not to exclude other components, unless otherwise stated. However, it should be understood that the existence or addition possibilities of numbers, steps, actions, components, parts or combinations thereof are not excluded in advance.

The terms "about", "substantially", and the like used throughout the specification are used in or at a value close to that value when manufacturing and substance tolerances specific to the stated meaning are given, and the understanding of the invention To aid, accurate or absolute figures are used to prevent unconscionable abusers from unduly using the disclosed disclosure. The term "~ (step)" or "step of" as used in the entire specification of the present invention does not mean "step for".

In the present specification, the term “unit” includes a unit realized by hardware, a unit realized by software, and a unit realized by using both. Further, one unit may be realized by using two or more hardware, and two or more units may be realized by one hardware.

In the present specification, some of the operations or functions described as performed by the terminal, the device, or the device may be performed instead on the server connected to the corresponding terminal, device, or device. Similarly, some of the operations or functions described as being performed by the server may be performed in a terminal, apparatus, or device connected to the corresponding server.

In this specification, some of the operations or functions described as mapping or matching with the terminal means that the unique number of the terminal or identification information of the individual, which is the identification data of the terminal, is mapped or matched. Can be interpreted as

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.

1 is a view for explaining a system for providing a consensus service using a blockchain based quantum random number according to an embodiment of the present invention. Referring to FIG. 1, the system for providing a consensus service using a blockchain based quantum random number (1) includes a front node 100, a consensus service providing server 300, at least one operating node 400, and at least one It may include a senior node 500 and the coordinator node 600. However, since the system 1 for providing a consensus service using a blockchain based quantum random number in FIG. 1 is only an embodiment of the present invention, the present invention is not limitedly interpreted through FIG. 1.

At this time, each component of FIG. 1 is generally connected through a network (network, 200). For example, as illustrated in FIG. 1, the front node 100 may be connected to the bilateral consensus service providing server 300 through the network 200. In addition, the two-way consensus service providing server 300 is connected to the front node 100, at least one operating node 400, at least one senior node 500, and the coordinator node 600 through the network 200. You can. Also, the at least one node 400 may be connected to the front node 100 and the coordinator node 600 through the network 200. In addition, the at least one senior node 500 may be connected to the front node 100 and the coordinator node 600. Lastly, the coordinator node 600 may be connected to the front node 100, the operating node 400, the bilateral consensus service providing server 300, and at least one senior node 500 through the network 200.

Here, the network means a connection structure capable of exchanging information between each node such as a plurality of terminals and servers, and examples of such a network include RF, 3GPP (3rd Generation Partnership Project) network, and LTE (Long Term) Evolution network, 5GPP (5th Generation Partnership Project) network, World Interoperability for Microwave Access (WIMAX) network, Internet, Local Area Network (LAN), Wireless Local Area Network (LAN), Wide Area Network (WAN) , PAN (Personal Area Network), Bluetooth (Bluetooth) network, NFC network, satellite broadcasting network, analog broadcasting network, DMB (Digital Multimedia Broadcasting) network, and the like.

In the following, the term at least one is defined as a term including a singular number and a plural number, and even if the term at least one term does not exist, each component may exist in a singular or plural number, and may mean a singular or plural number It will be self-evident. In addition, it may be said that each component is provided in a singular or plural form, depending on the embodiment.

The front node 100 is a node requesting block generation for a transaction using a web page, an app page, a program, or an application related to a bilateral consensus service using a blockchain-based quantum random number. At this time, the front node 100, after accessing the bilateral consensus service providing server 300, requests the generation of a quantum random number, and when the quantum random number is encrypted and transmitted by the bilateral consensus service providing server 300, the front node 100 ) By verifying the signature value using the private key, it may be a node that verifies data of the two-way consensus service providing server 300. In addition, the front node 100 may be a node that broadcasts the verified data to at least one node in the blockchain.

Here, the front node 100 may be implemented as a computer capable of accessing a remote server or terminal through a network. Here, the computer may include, for example, navigation, a laptop equipped with a web browser (WEB Browser), a desktop, a laptop, and the like. In this case, the front node 100 may be implemented as a terminal that can access a remote server or terminal through a network. The front node 100 is, for example, a wireless communication device in which portability and mobility are guaranteed, navigation, PCS (Personal Communication System), GSM (Global System for Mobile communications), PDC (Personal Digital Cellular), PHS (Personal) Handyphone System), PDA (Personal Digital Assistant), IMT (International Mobile Telecommunication) -2000, CDMA (Code Division Multiple Access) -2000, W-CDMA (W-Code Division Multiple Access), Wibro (Wireless Broadband Internet) terminal, It may include all kinds of handheld-based wireless communication devices such as a smart phone, a smart pad, and a tablet PC.

The two-way consensus service providing server 300 may be a server that provides a two-way consensus service web page, app page, program, or application using a blockchain-based quantum random number. In addition, the two-way agreement service providing server 300 may be a server that selects and registers at least one senior node 500 in order to operate the blockchain at all times within the private blockchain. In addition, the two-way consensus service providing server 300 may be a server that registers and stores a senior candidate node 400 that satisfies predetermined computing resource conditions and coin holding conditions outside the private blockchain. At this time, as will be described later, since the senior node 400 is determined on a first-come, first-served basis among the candidate nodes 400, these two terms are defined as using the same reference numerals, but are not defined as the same term. And, when receiving a block generation request from the front node 100, the two-way consensus service providing server 300 prepares to pack the two-way system in order to derive an agreement on whether a transaction to be block-generated, that is, transaction information is correct. It may be a server. To this end, the two-way consensus service providing server 300 selects a candidate node 400 for operation from outside the private blockchain, selects a standing node 500 from inside the private blockchain, and any one of the standing nodes 500 It may be a server that selects the senior node 500 of as the coordinator node 600 to quickly achieve consensus through unification of communication. The two-way consensus service providing server 300 transmits the selected information to the front node 100 for verification, and broadcasts after the verification is completed at the front node 100 to select the selected candidate node 400 for operation committee, When the senior node 500 and the coordinator node 600 confirm that they are selected through decryption using the hash value, the coordinator node 600 transmits the information to the coordinator node 600 so that the coordinator node 600 is a candidate for operation It may be a server that secures information of the node 400 and the senior node 500. In addition, when selecting the two-way consensus service providing server 300, the operation committee candidate node 400, the standing node 500, and the coordinator node 600 may use a quantum random number algorithm (Quantum Random Function Mechanism), but are similar. The use of random number algorithms is not excluded and is not limited to those listed.

Here, the two-way agreement service providing server 300 may be implemented as a computer capable of accessing a remote server or terminal through a network. Here, the computer may include, for example, navigation, a laptop equipped with a web browser (WEB Browser), a desktop, a laptop, and the like.

The at least one node 400 is located outside the private blockchain using a web page, app page, program, or application related to a bilateral consensus service using a blockchain-based quantum random number, but satisfies a predetermined computing resource condition, and It may be a node that has a set number of coins. Further, the at least one operating node 400 may be a node registered in the bilateral consensus service providing server 300 as at least one operating node candidate node 400 before being determined as a member of the bilateral system. At this time, the at least one operating node 400, through the two stages of selection and confirmation finally becomes a node that can participate in the agreement of the two-way system, the selection is made by the two-way agreement service providing server 300, the decision is first-come, first-served As a result, it may be a node formed by the order of access to the coordinator node 600 and a preset number. Here, when the participation of the bilateral system of at least one operating node 400 is confirmed, it may be a node that transmits a positive response to the coordination node 600 to generate a block for the transaction history, and a predetermined percentage or a predetermined number of approval When this exists, it may be a node that broadcasts a result from the coordinator node 600 to generate a block.

Here, the at least one operating node 400 may be implemented as a computer that can access a remote server or terminal through a network. Here, the computer may include, for example, navigation, a laptop equipped with a web browser (WEB Browser), a desktop, a laptop, and the like. At this time, the at least one operating node 400 may be implemented as a terminal that can access a remote server or terminal through a network. At least one operating node 400 is, for example, a wireless communication device that is guaranteed for portability and mobility, navigation, Personal Communication System (PCS), Global System for Mobile communications (GSM), Personal Digital Cellular (PDC), Personal Handyphone System (PHS), Personal Digital Assistant (PDA), International Mobile Telecommunication (IMT) -2000, Code Division Multiple Access (CDMA) -2000, W-Code Division Multiple Access (W-CDMA), Wireless Broadband Internet ) It may include all kinds of handheld-based wireless communication devices such as a terminal, a smartphone, a smartpad, and a tablet PC.

At least one permanent node 500 is located within the private blockchain, using a web page, app page, program, or application related to a bilateral consensus service using a blockchain-based quantum random number, and is always driven so that the private blockchain can be maintained. Node. And, the at least one senior node 500 may be a node registered in the bi-won system consensus service providing server 300, and when the front node 100 requests block generation to store and store transactions, quantum random numbers As a result, it may be a node that is confirmed for participation in the dual system. At this time, the concept of determination is as described above. Here, a node determined to participate in consensus among at least one senior node 500 may be changed whenever a block is generated due to a transaction, and this is also the case with the operational node 400. At this time, the at least one senior node 500 performs the role of the upper house in the dual system, and the at least one operating node 400 serves as the lower house, and the number or ratio to be elected is preset. The at least one senior node 500 determined as described above may agree on a transaction, that is, vote on or off, and transmit the result to the coordinator node 600. Further, the at least one senior node 500 may broadcast a result of the consensus, that is, the aggregated result of voting, from the coordinator node 600 to generate a block if in favor.

Here, the at least one senior node 500 may be implemented as a computer capable of accessing a remote server or terminal through a network. Here, the computer may include, for example, navigation, a laptop equipped with a web browser (WEB Browser), a desktop, a laptop, and the like. At this time, the at least one senior node 500 may be implemented as a terminal that can access a remote server or terminal through a network. The at least one senior node 500 is, for example, a wireless communication device in which portability and mobility are guaranteed, such as navigation, Personal Communication System (PCS), Global System for Mobile communications (GSM), Personal Digital Cellular (PDC), Personal Handyphone System (PHS), Personal Digital Assistant (PDA), International Mobile Telecommunication (IMT) -2000, Code Division Multiple Access (CDMA) -2000, W-Code Division Multiple Access (W-CDMA), Wireless Broadband Internet ) It may include all kinds of handheld-based wireless communication devices such as a terminal, a smartphone, a smartpad, and a tablet PC.

The coordinator node 600 uses a web page, an app page, a program or an application related to a bilateral consensus service using a blockchain-based quantum random number, and a senior node 500 elected by the bilateral random consensus service providing server 300 ), Or it can be a server built separately. At this time, since the coordinator node 600 needs to communicate directly with the operating node 400 and the senior node 500 for agreement between the two-way system, and also broadcast the result, it satisfies the preset computing resource condition or networking resource condition. It may be a node. At this time, the operating node 400 must also satisfy the preset computing resource condition. The difference is that the operating node 400 is a node outside the private blockchain, and the coordinator node 600 is a node inside the private blockchain, The operation node 400 is a temporary node, whereas the coordinator node 600 is one of the permanent nodes 500 that are always in operation. Of course, the coordinator node 600 is similar in that it is a temporary representative selected for consensus for a transaction among the senior nodes 500. In addition, it is most likely that the computing resource condition of the coordinator node 600 is set higher than the computing resource condition of the operational node 400, but it is not excluded that it is set equally or lower. The coordinator node 600 selected among the senior node 500 receives information of the senior node 500 and the candidate candidate node 400 from the bilateral consensus service providing server 300, and the operating candidate node 400 accesses. It may be a server that is determined by the operating node 400 in the order of the order, and transmits the determined result to the standing node 500 and the operating node 400, and the agreement collected from the standing node 500 and the operating node 400 It may be a server that collects the results and broadcasts it to determine whether to generate blocks. At this time, terms of consensus, voting, and pros and cons are all defined as terms describing the same process.

Here, the coordinator node 600 may be implemented as a computer capable of accessing a remote server or terminal through a network. Here, the computer may include, for example, navigation, a laptop equipped with a web browser (WEB Browser), a desktop, a laptop, and the like. At this time, the coordinator node 600 may be implemented as a terminal capable of accessing a remote server or terminal through a network. The coordinator node 600 is, for example, a wireless communication device in which portability and mobility are guaranteed. Navigation, PCS (Personal Communication System), GSM (Global System for Mobile communications), PDC (Personal Digital Cellular), PHS (Personal) Handyphone System), PDA (Personal Digital Assistant), IMT (International Mobile Telecommunication) -2000, CDMA (Code Division Multiple Access) -2000, W-CDMA (W-Code Division Multiple Access), Wibro (Wireless Broadband Internet) terminal, It may include all kinds of handheld-based wireless communication devices such as a smart phone, a smart pad, and a tablet PC.

FIG. 2 is a block diagram for explaining a dual-way consensus service providing server included in the system of FIG. 1, and FIGS. 3 and 4 are senior members of a bi-way consensus service using a blockchain-based quantum random number according to an embodiment of the present invention FIG. 5 is a diagram for explaining an embodiment of a node, an operation node, and a coordinator selection and consensus process, and FIG. 5 is a block structure and state transition process of a binary system consensus service using a blockchain-based quantum random number according to an embodiment of the present invention A diagram for explaining an embodiment of the.

Referring to FIG. 2, the two-way agreement service providing server 300 may include a transmission unit 310, a reception unit 320, a determination unit 330, a generation unit 340, and a registration unit 350.

The two-way consensus service providing server 300 or another server (not shown) operating in conjunction with the front node 100, at least one operating node 400, and at least one senior node 500 according to an embodiment of the present invention ), And when transmitting a consensus service application, program, app page, web page, etc. using a blockchain-based quantum random number to the coordinator node 600, the front node 100, at least one operating node 400, at least One senior node 500 and the coordinator node 600 may install or open a bilateral system consensus service application, program, app page, web page, etc. using a blockchain-based quantum random number. In addition, the service program may be run in the front node 100, at least one operating node 400, at least one senior node 500, and the coordinator node 600 using a script executed in a web browser. Here, the web browser is a program that enables the use of the world wide web (WWW) service, and refers to a program that receives and displays hypertext described in a hypertext mark-up language (HTML), for example, Netscape. , Explorer, Chrome, etc. Further, the application means an application on the terminal, and includes, for example, an app running on a mobile terminal (smartphone).

Before explaining FIG. 2, the consensus algorithm, which is the background from which the bilateral consensus service of the present invention came out, is briefly described. The concepts described below are not described repeatedly in FIG. 2 and below.

Blockchain system is a distributed ledger system in which all transaction information is copied and shared by all participants, and is a collection of various technologies such as data distribution and sharing, cryptography, and consensus algorithm. In order to apply the blockchain system, it is necessary to solve the problem of double payment and general Byzantine. The double-payment problem is a problem of reusing currency in two transactions at the same time, and the Byzantine general problem is a matter of deciding which rule to make decisions for the system to operate normally by a number of honest nodes, even though there are some dishonest nodes in the distributed system. . By solving these two problems, a consensus algorithm was created by multiple participants to maintain a single consistent and consensus blockchain. Blockchains can be composed of public blockchains and private blockchains depending on the participants, and can be composed of a competitive consensus algorithm and a non-competitive consensus algorithm depending on how the chain is maintained. Depending on the environment and purpose of the blockchain, existing algorithms are used as they are or developed, or new and completely different algorithms are used.

Blockchains are divided into public blockchains and private blockchains depending on the participation target. Public blockchain is a blockchain that anyone can freely participate in the blockchain network. Since the subject of operation and participation is unclear, the incentive system coin is issued and operated, and the transparency is enhanced because many people participate, and the more people join the network, the better the security is, but it has many advantages. The consensus is that there is a disadvantage in that it is slow because it has to be synchronized by propagating to the entire network. For the public blockchain, PoW consensus algorithm, PoS consensus algorithm, and DPoS consensus algorithm can be applied. On the other hand, a private blockchain is a blockchain where only authorized persons with legal responsibilities can participate in the blockchain network. Since the subject of operation and participation is clear, there is no need to issue and operate coins, an incentive system. This model has enhanced confidentiality due to the participation of a small number of authorized people, and has the advantage of speeding up transactions with only trusted people.However, due to consensus by a small number of people, some centralization may reduce security. There are disadvantages. For the private blockchain, the PBFT consensus algorithm and the Ripple consensus algorithm can be applied.

Blockchain consensus algorithm can be classified into competitive and non-competitive methods. The competition method maintains the unity of the chain by accepting only one agreement that satisfies a certain condition first, by ensuring different agreements in several places at the same time without guaranteeing finality. This method has the advantage of solving the problem of not participating or opposing maliciously because everyone does not need to participate in the proof, but there is a possibility of double payment due to the fork occurring, and of the secondary chain not selected by the fork that occurred. The disadvantage is that all resources used in mining are invalidated and wasted as a result. The competition methods include PoW consensus algorithm, PoS consensus algorithm, and DPoS consensus algorithm. On the other hand, the non-competition method maintains the unity of the chain by guaranteeing finality and proceeding with only one agreement at a time, and many people by voting or the like. It has the advantage of not wasting resources because only one chain is in progress, but there is a problem that the system may collapse if 1/3 of the votes are not proceeded or the malicious votes are ruined in a manner that more than 2/3 must agree. There is a disadvantage of centralization because voting is conducted under the control of a node or a leader node. Non-competitive methods include the PBFT consensus algorithm and the Ripple consensus algorithm.

The consensus algorithm consists of a PoW consensus algorithm, PoS consensus algorithm, DPoS consensus algorithm, PBFT consensus algorithm, and Ripple consensus algorithm. First, the PoW consensus algorithm increases the nonce by 1 until a number less than the number determined by nBits is obtained by obtaining a hash value through the SHA256 algorithm for the block header to be newly proved. At this time, the task of increasing the nonce by 1 until a number less than the number determined by nBits is called mining, and the worker is called miner. The PoW consensus algorithm requires the hashing power of the CPU or GPU, and the average operation increases stability and safety as the larger network is constructed over time, which consists of the exponential function of the required number of zero bits. It has the advantage of being easy. However, because it uses hashing power, if it has 51% of hashing power, it can attack 51%, which can influence the entire network agreement, and has the disadvantage of using an unnecessarily large amount of computer resources.

Second, the PoS consensus algorithm generates new blocks by participating in the proof as much as the stakes it has. In other words, if you vote as much as you own for a reasonable and thought block among several block candidates, and if the block finally receives a lot of votes and is registered as a regular block, you will receive a reward for the new block as much as you voted. Therefore, the proponents tried to eliminate the motivation to create a block with bad intention by matching the interests of the block creator and the stake holder, and in the PoS consensus algorithm, the validator instead of the miner of the PoW consensus algorithm and the mining instead of mining Use the expression (Minting). It solved the problem of wasting unnecessarily large amounts of computer resources by voting without seeking the hash value, and has the advantage of making the 51% attack much harder because it uses stake rather than hashing power. However, the more the stake is, the more proof it can be, so it is similar to the interest of the bank and may not be distributed to the market, and there is a disadvantage in that there is a Nothing at Stake problem that damages the fairness of the vote by simultaneously voting in several places.

Third, the DPoS consensus algorithm selects witnesses or representatives through voting and allows them to proceed with the PoS consensus algorithm. The candidate who wants to become a representative registers his public key with the pledge on the network, and the voter receives a vote as much as his stake through the voting authority included in the wallet and votes for the representative. If appointed delegates want to make unfair profits through actions such as Nothing at Stake, the voters can immediately vote to elect a new representative. If we consider the general PoS consensus algorithm as direct democracy made by people with stakes, DPoS is an indirect democracy by selecting some representatives of people with stakes. At this time, it is fast because it selects an odd number of 21 people to prevent a tie, and it has the advantage of solving the Nothing at Stake problem.However, a place with many stakes, such as an exchange, can abuse voting rights to elect a representative who is advantageous to them. There is a disadvantage that security and transparency can be threatened by some centralization.

Fourth, in the PBFT consensus algorithm, one elected leader node receives a transaction verified as valid using the verification node, propagates the consensus request to all, and acquires 2/3 votes to generate a block. The PBFT consensus algorithm developed the BFT algorithm of a distributed system that allows normal operation even when some abnormal nodes exist, so that it can be used in an asynchronous network. In addition, in the PBFT, the reader or the verification node removed the strange node more accurately with a higher probability through two broadcasting processes of transmitting and voting through the entire network. It has the advantage of being fast because it is more responsive because it receives and proceeds with the already verified transaction. However, since PBFT communicates between all nodes, the larger the number of nodes, the greater the communication overhead, making it difficult to scale and not suitable for large-scale networks. 33% of nodes do not vote or intend to oppose The disadvantage is that the system can be hung if done.

Fifth, the Ripple consensus algorithm is an asynchronous round-based protocol executed by a network verification server, consisting of a collection phase, a consensus phase, and a closing phase. In the collection phase, the verification server receives the transaction from the network, checks the validity of the signature and the accuracy of the relevant information, and broadcasts the proposal back to the network as a candidate set. In the consensus phase, the server votes on the proposal received and agrees. In the closing phase, if the proposal gets over 80% consent, the proposal is removed from the set of candidates, formally registered with the ledger and the round is closed. The Ripple consensus algorithm aims to process large-scale payments quickly with the goal of a real-time payment system, and is mainly developed for the purpose of servicing interbank transfer services. However, the speed has been established through a very large centralization, and the system can be stopped if 20% of the nodes do not proceed or vote on purpose. The above-mentioned consensus algorithm is summarized in Table 1 below.

PoW PoS DPoS PBFT Ripple type Public Public Public Private Private token need need need Unnecessary Unnecessary Maintenance method compete compete compete Non-competition Non-competition Trust model Unreliable Unreliable trust trust trust Centralization Decentralization Decentralization Centralization Centralization Centralization Transaction rate 10 minutes * 6 confirmations 12 seconds * 100 confirmations 1.5 seconds * 30 confirmations 5 seconds 2-10 seconds Security height height lowness lowness lowness

Centralization is determined by the trust model, and the transaction rate means the time it takes for each consensus algorithm to verify the transaction and create a new block. At this time, speed is generally improved in proportion to the degree of centralization. Security refers to the degree of security against hacking. As fewer obstacles become targets for attack, security can be said to be weaker. Therefore, security decreases in inverse proportion to the degree of centralization. On the other hand, the non-trust model has the advantage of improving security by having a lot of obstacles by decentralization, but it has the disadvantage that the speed is reduced. Accordingly, an embodiment of the present invention, by forming a trust model with a private blockchain, by selecting a node from the outside of the private blockchain to increase security and achieve decentralization, to the node elected from inside and outside the blockchain You can reach an agreement, select a representative, but do not elect in advance like DPoS or PBFT, but randomly select each time a transaction occurs with quantum random numbers and unify the channel of communication to increase transaction speed and security. Together, it is possible to provide a platform that can increase power and eliminate power consumption, double payment, and network delay of PoW, PoS, and PBFT.

Referring to FIG. 2, the transmitter 310 receives transaction data requesting block generation from the front node 100 and encrypts the quantum random number generated by the quantum random algorithm (Quantum Random Function Mechanism). It can be transmitted to the front node 100. Here, the front node 100 is at least one node constituting a blockchain, that is, one node of a normal node. When the last transaction for generating a block in a transaction (tx) pool is received, It can be any node that proposes to create a block. At this time, the transmission unit 310 selects the node selected as the quantum random number among the standing nodes 500 as the coordinator node 600, extracts information of the previously registered operating committee candidate node 400, and encrypts it together with the quantum random number. It can be transmitted to the front node 100.

The ideal random number required for information protection is an unpredictable, independent, non-recurring number, such as the number obtained through coin toss. The cryptographic algorithm or protocol of the cryptosystem is designed after assuming that the random number is the ideal random number, so it is essential to use a random number generator capable of generating a secure random number. The random number generator mainly generates a random number from a pseudo random number generator (PRNG, Deterministic Random Bit Generator; DRBG) that generates a random number through a deterministic algorithm from an initial seed value, and a physical phenomenon that is difficult to predict. Is classified as a true random number generator (TRNG). Since the output random number of the PRNG is determined by the input seed, it is common to use the output random number of the TRNG as the seed. On the other hand, TRNG performs a digitization process that converts the noise source, which is analog data, to digital data for use as an input, and outputs a random number after selectively performing a post-processing process to reduce the bias of the digitized data. Since the output of the ideal random number depends on the unpredictable noise source, which is the input of the random number generator, it is important to understand the characteristics of the noise source used as an entropy source. Therefore, the safety analysis of the post-processing process to reduce the bias of the noise source of the physical characteristics is a matter that must be considered in order to output an ideal random number.

At this time, the quantum random number generator of the quantum random number algorithm is a TRNG that generates random numbers using unpredictability of quantum information. This guarantees unpredictability, unbiasedness, and irrelevance between numbers, and unlike PRNG, it is impossible to track the seed value with an encryption pattern. At this time, the quantum random number generator is a method of generating a random number by measuring the polarization of the photon, the path of the photon, the arrival time of the photon, and the shot noise in a vacuum state. And 0 and 1 are assigned according to the position of the measured instrument. In the case of a quantum random number generator that measures the arrival time of a photon, the observation period is divided into several sections, and a bit that logs the ratio of the period to the section is generated for each observation. Since the shot noise in the vacuum state is an arbitrary state having a Gaussian distribution, a random number may be generated in this section.

Using this, the transmission unit 310 determines the coordinator node 600 among the standing nodes 500 and selects some standing candidate nodes 400 among the plurality of standing candidate nodes 400. Of course, even if the standing candidate node 400 is selected, due to the difference between the above-described concept of selection and confirmation, a predetermined number of standing candidates verified by the coordinator node 600 and registered in the first-come-first-served order as the coordinator node 600 Since only the node 400 is determined to be the senior node 400, the transmitting unit 310, that is, the bilateral consensus service providing server 300, does not know which node will be the senior node 400. Through this, integrity can be guaranteed.

When the receiver 320 broadcasts by inserting the encrypted quantum random number into the header in the block in the front node 100, the coordinator node 600 decoding the quantum random number, the standing node 500, and the operating node candidate node ( 400). At this time, when decoding the quantum random number, the receiving unit 320, the coordinator node 600, the senior node 500, and the operating node candidate node 400, after verifying with the hash included in the ExtraData in the header of the block, decrypt can do. Therefore, the transmitting unit 310 may encrypt the quantum random number using the public key of the front node 100 and transmit the quantum random number to the front node 100, and the receiving unit 320 may transmit the quantum random number to the header in the block in the front node 100. When the encrypted quantum random number is inserted and broadcast, the front node 100 receives the verification data from the coordinator node 600, the senior node 500, and the operational candidate node 400, which decodes the quantum random number. The encrypted quantum random number can be verified by verifying the signature value using the public key of the front node 100, and when the verification is completed, the encrypted quantum random number is inserted into the header in the block to broadcast. can do.

In addition, when the reception node 320 broadcasts by inserting the encrypted quantum random number in the header in the block in the front node 100, the coordinator node 600 decoding the quantum random number, the senior node 500, and the candidate node When receiving the verification data from 400, the receiving unit 320, when the coordinator node 600, which is a node selected as a coordinator among the senior nodes 500, decodes the quantum random number list identifier in the header with a public key, It is possible to secure a quantum random list of candidate nodes 400. Then, when the receiving unit 320 decodes the header from the candidate node 400 and transmits it to the coordinator, the coordinator notifies the senior node 500 and the candidate node 400 of the coordinator using the public key. You can.

Here, referring to (a) of FIG. 5, the block is composed of a sender, a receiver, and a header, wherein the header is a parent hash and a root , Transaction Hash (TxHash), Receive Hash (ReceiptHash), Bloom (Bloom), Number (Number), Time (Time), and Extra (Extra). Extra is a structure that can additionally contain additional data. The data additionally added to the extra is called extra data. Accordingly, when the encrypted quantum random number is inserted into the header in the block by the front node 100 and broadcast, the information of the candidate node 400, the senior node 500, and the coordinator node 600 is put together. In the case of casting, if he is a candidate for a management committee, a standing committee, or a coordinator among the nodes that have received it, it is possible to know that he has been selected or confirmed using this information. Broadcasting means being distributed to all nodes that make up the blockchain as a whole, so if one of the nodes that received it is not a candidate for the operating committee, is not a standing committee, or is not a coordinator, it cannot be decrypted or authenticated, so it is selected or confirmed. Does not.

Returning to FIG. 2 again, the determining unit 330 determines the predetermined number of first-come-first-served access nodes of the coordinator node 600 and the high-ranking node 500 and the high-ranking candidate node 400 as the high-ranking node 400. . When the coordinator node 600 determines the preset number of first-come-first-served access nodes of the coordinator node 600 and the coordinator node 400 in a first-come, first-served node 400, the coordinator node 500 determines the coordinator node 500. ) And the percentage of the node 400 to be 49% and 51%, respectively, or it can be determined that the number of the standing node 500 and the node 400 is 14 and 15, respectively. Even if it is determined by numbers, the percentages of 14 and 15 are also 49% and 51% as a result, so the percentage ratio is a higher concept. At this time, as described above, even if it is selected as a candidate node 400 for the operation, it is not confirmed. For example, if there are 50 candidate nodes 400, and the number of nodes 400 is preset to 15, 15 nodes verified in first-come-first-served order out of 50 nodes are determined as the nodes 400. At this time, since the consensus is drawn between the nodes determined by the determining unit 330, as a result, the number of nodes participating in the consensus is reduced, and as a result, a quick consensus can be derived, and the fixed operating node 400 and the standing node 500 The communication between the coordinator node 600 and the coordinator node 600 may be performed directly through TCP / IP communication rather than broadcasting, thereby reducing network traffic and minimizing delay, thereby improving speed.

The generation unit 340 collects the consensus result by direct communication between the coordinator node 600 and the senior node 500 and the operational node 400 to broadcast the result to at least one node in the blockchain to generate a block. can do. The generation unit 340 may generate a block when the consensus result is that 51% verification of the senior node 500 and the operational node 400 is completed. Of course, the result is broadcast from the coordinator node 600 to the at least one node constituting the blockchain through the operational node 400 and the senior node 600, that is, the normal node.

The registration unit 350 receives the transaction data requesting the block generation from the front node 100 in the transmission unit 310, and encrypts the quantum random number generated by the quantum random number algorithm before transmitting it to the front node 100. , When receiving a subscription request from at least one node that satisfies the preset virtual currency holding condition and computing resource condition, at least one node may be registered as a candidate node for the operation committee 400. Likewise, the senior node 500 may be registered in advance.

Hereinafter, an operation process according to the configuration of the two-way consensus service providing server of FIG. 2 will be described in detail with reference to FIGS. 3 to 7 as an example. However, the embodiment is only one of various embodiments of the present invention, it will be apparent that it is not limited thereto.

Referring to FIG. 3, (a) the bilateral system consensus service providing server 300 selects and registers a senior node 500 inside the blockchain and operates it, and applies for registration when the predetermined conditions are met outside the blockchain. Any node is registered and managed as a candidate node 400 of the operation committee. At this time, the inside of the blockchain is a private blockchain, and the outside is a blockchain composed of nodes not included in the private blockchain. Through this, even if it constitutes a private blockchain, it can take advantage of both decentralization and centralization, and the balance between the inside and outside of the blockchain and the self-cleaning effect of each other becomes possible. Here, it is as described above that the candidate node 400 for the operation committee is selected through the quantum random number, and is determined as the operation node node 400 through the process of registration and verification on a first-come, first-served basis.

(b) At this time, the high-ranking node 500 is a node that is always operated, and the high-ranking node 400 is a temporary node that is selected using a quantum random number whenever there is a block generation request to record a transaction. For example, if there are 14 standing nodes 500 and 15 operating nodes 400, a total of 29 internal and external nodes in the blockchain will participate in the consensus process for block creation. At this time, among the nodes participating in the agreement, the ratio of the participation of the operating node 400 should be maintained at least 51% to monitor whether the standing node 500 is operating fairly. Conversely, among the nodes participating in the agreement, the senior node 500 should be maintained at 49% or less.

At this time, the cycle for generating a block in the blockchain according to an embodiment of the present invention is, for example, 2 seconds. The reason why the cycle can return so quickly is that the coordinator node 600 which is the center of communication among the senior nodes 500 This is because communication is unified by selecting and confirming). Of course, since the coordinator node 600 is also selected as a quantum random number, it is not specified in advance, and the possibility of integrity and forgery can be primitively removed. With the coordinator node 600 determined as described above, the remaining 28 nodes (one node among the 29 nodes has been confirmed as the coordinator node 600, and the remaining 28 nodes) are the direct communication state during the consensus process, and the minimum network. Consensus is reachable by traffic. That is, in a general p2p network, time delay and network load occur in the process of collecting a broadcast confirmation message, but in one embodiment of the present invention, the coordinator node 600, the operating node 400, and the standing node ( 500) can transmit or receive only one message each, thereby achieving the above-described performance. As a result, the coordinator node 600 can be a block producer with only one block producer, and if a block is not generated within 2 seconds, that is, if a consensus is not reached, block generation of the corresponding cycle is Skip.

(c) is a diagram schematically showing a data flow according to an embodiment of the present invention. Looking at this, it starts by proposing to create a block in the front node 100. At this time, the front node 100 receives a new transaction requesting block generation and connects to the two-way consensus service providing server 300 at the time of generating the block to request quantum random number generation. Then, the two-way consensus service providing server 300 receives a request for generating a quantum random number of the front node 100, and derives a consensus for generating a block, the two-way system, that is, the candidate node 400 and the upper node ( 500) is selected as a quantum random number, and any one of the upper-end nodes 500 is selected and confirmed as a representative coordinator node 600, which is also selected using quantum random numbers. In addition, the two-way consensus service providing server 300 encrypts the information of the selected operation committee candidate node 400, the confirmed upper committee node 500, and the coordinator node 600, and quantum random number information for recognizing it. It transmits to the front node 100. In addition, the two-way consensus service providing server 300 transmits information of the candidate node 400 to the coordinator node 600 selected and confirmed.

Meanwhile, the front node 100 broadcasts quantum random number information (including selection and confirmation information) encrypted with all nodes in and out of the blockchain. In other words, the front node 100 broadcasts the encrypted information received from the bidirectional consensus service providing server 300 to all nodes by constructing ExtraData in the block header. Accordingly, all nodes that have been broadcasted by the front node 100 verify their own hashes in ExtraData in the header of the received block, and decrypt only in case of their own information. Therefore, the selected operation committee candidate node 400, the determined standing committee node 500, and the coordinator node 600 decrypt the encrypted information.

Next, it is necessary to determine the operation node 400 among the selected operation node candidate nodes 400, which will be referred to as racing. At this time, the operation candidate node 400 identified as a candidate for the operation committee will proceed with the operation registration registration proceeding in a first-come, first-served order, and the coordinator node 600 may convert 15 operation committee candidate nodes 400 in the first-come-first-served order to the operation node 400. Confirm. If both the operating node 400 and the standing node 500 are determined, the coordinator node 600 notifies the determined operating node 400 and the standing node 500 of the determined results to the operating node 400 and the standing node. The node 500 proceeds to agree, and if the result of the agreement is more than 51%, the result is broadcast to all nodes existing in and outside the block to generate a block.

Here, when the coordinator node 600 selects and confirms the operating node 400 and the standing node 500, a random number ticket granting method incorporating an encryption function using a quantum random number and a public key may be used. At this time, the two-way consensus service providing server 300 may include a hardware-dependent call function capable of implementing a message delivery method, high-speed authentication, and high-speed agreement that cannot be hacked. And, when generating a quantum random number, it may exist separately from the node as described above due to hardware-dependent properties, or may be selected as one of the upper-level nodes 600. At this time, since the contents described in FIG. 3 are solved and described in FIG. 4, redundant descriptions will be omitted.

Referring to FIG. 5, (a) shows the structure of a block. Sander means information of a transmitting node, receiver means information of a receiving node, and header means a header of a block to be generated. In addition, the parent hash in the header is the hash value of the header in the parent block, the root is the hash value for the root node of the Merkle tree in which account status information is collected, and the transaction hash is the Merkle tree of all transactions in the current block. The hash value for the root node, the received hash, the hash value for the root node of the Merkle tree of the reseat of all transactions in the current block, the bloom is a 32-byte filter used to retrieve log information, the number is currently The number, extra, which records the block's initial creation time and provides a chronologically linked criterion, is any additional information related to the current block. In addition, when looking at the extra data in the extra, there are V [1] .... V [v], which are the information of the v candidate node 400, and V [i] .Qe is the candidate node 400 of the i Member variable having a hash value of the public key of the candidate node 400 i, QRND (quantum random number) of the candidate node 400 i, the coordinator node 600 information encrypted with the public key. At this time, QRND is a random number generated by a quantum random number algorithm.

Meanwhile, the two-way consensus service providing server 300 has network information and a public key of at least one node constituting a blockchain, and can use the distributed nature of quantum random numbers to select and confirm nodes probabilities. , After generating a quantum random number, an encrypted public key can be assigned to a selected node, and a hash function of the public key can be generated. In addition, the two-way consensus service providing server 300 may be physically disclosed to at least one node constituting the blockchain. Functionally, the two-way consensus service providing server 300 may have a function function including quantum random number generation, encryption key generation, stochastic selection, and block verification function. Accordingly, the two-way consensus service providing server 300 may serve to select and confirm the coordinator node 600 by combining function functions, and to select the candidate node for the operation committee 400. Using the library function GETQRNARR () of the two-way consensus service providing server 300, QRND, which is a random number of bytes of a desired size within 49151 bytes, can be generated at once, and by applying a bit operation, a uniform distribution within a large natural number N can be obtained. have. (b) is a diagram showing a state transition of the environment, which is the same as described above, and thus the description thereof will be omitted.

The contents not described for the method of providing a consensus service using a quantum random number based on the blockchain in FIGS. 2 to 5 is described above with reference to the method for providing a consensus service using a block chain based quantum random number in FIG. Since it can be easily inferred from the same or described content, the following description will be omitted.

6 and 7 are views illustrating a process in which data is transmitted and received between each of the components included in a system for providing a consensus service using a blockchain based quantum random number in FIG. 1 according to an embodiment of the present invention. Hereinafter, an example of a process in which data is transmitted / received between the respective components will be described with reference to FIGS. 6 and 7, but the present application is not limited to such an embodiment, and according to various embodiments described above, FIG. 6 And it is apparent to those skilled in the art that the process of transmitting and receiving data shown in FIG. 7 may be changed.

At this time, in order to understand FIG. 6, each term must first be defined, as shown in Table 2 below.

i Sequence index node.id Unique identifier of the node node.ip Node's ip address node.port Port of node node.info Node Information node.pk Node's public key node.sk Node's private key node.Qe node.Qe = ENC (QRND | C.info, node.pk) | H (node.pk)
The value obtained by combining the assigned QRND with the node's public key and the node's public key's hash value. | Junction operator [] Empty list, index starting from 1 L [a, b] List of parts a through b in ordered list L CC (a, i) If a is a junction, i-th element, a = b | c | da'd = CC (a, 3) ENC (a, b) Encryption function of a by public key b DEC (a, b) Decryption function of a by private key b H (a) Hash function, hash value of a Connect (a, b) Node a is connected to node b Send (a, b, m) Node a sends message m to node b Recv (a, b, m) Node a receives message m from node b Broadcast (a, m) node a is broadcasting message m F Front node (100) C Coordinator node (600) S List of senior nodes 500 R List of operational nodes 400 V List of candidate nodes 400 G List of at least one node constituting the blockchain Bx block Bx.id Block number QM Bi-won consensus service providing server (300) QRND Generate an integer (r) between 1 and a preset number (N) for each trial QRND% a The remainder after dividing the integer (r) generated by the modulo operation QRND by the natural number (a)

The front node 100 receives a new block requesting a change in state of the current block, and connects to the two-way consensus service providing server 300 and transmits the received block. In addition, the bilateral system consensus service providing server 300 receives a new block and performs a task of collecting the bilateral system in order to derive an agreement for block generation. V [1], which is a v-node candidate node 400 ,… , V [v] is assigned a member variable (Qe) having a quantum random number and coordinator node 600 information, and a hash value of the public key (V [i] .Qe = ENC (V [i] .Q C.info, V [i] .pk) H (V [i] .pk), V [i] .Qe = ENC (V [i] .Q | C.info, V [i] .pk) H (V [i] .pk)).

Then, the front node 100 broadcasts the block received from the dual-source agreement service providing server 300 to all nodes (Broadcast (F, Bx ')). Here, the broadcasted coordinator node 600, the standing node 500, and the operating node candidate node 400 confirm that they are selected or confirmed (Receive (QM, C, Msg), Bx.id | V [1] .id |… | V [v] .id = DEC (Q [i] | C.info, C.sk))

At this time, the candidate node 400 for operation is confirmed as the operation node 400 by registering with the coordinator node 600 in a first-come, first-served basis. And if there are a number of votes, it is the same as broadcasting the result from the coordinator node 600 to all nodes, so it will not be repeated.

// The node identified as the candidate node for operation 400, that is, the node that has received Bx 'starts racing.
for i = 1: v
h = H (some.pk) // For quick recognition, it is determined as a hash.
// For the contents of ExtraData, the Qe values of candidate nodes 400 of operation committee [V [1] .Qe, V [2] .Qe,… , V [v] .Qe] list.
// Qe value is the encryption (random number, coordination information, public key) + public key hash value of V, which is the candidate node 400 of the operation committee.
// Qe = ENC (V [i] .Q | C.info, V [i] .pk) | H (V [i] .pk)
Ex = Bx'.ExtraData [i] // Ex is the Qe value of i-th V.
if h == CC (Ex, 2) // CC means junction data unwinding function, H (V [i] .pk).
// So CC (Ex, 1) is ENC (Q [i] | C.info, V [i] .PK). The original value can be extracted by decoding it.
Q | C.pk | C.ip | C.port = DEC (CC (Ex, 1), some.sk)
// The message transmitted to the C, which is the coordinator node 600 by the candidate node 400 for racing, is a value obtained by encrypting its public key and quantum random number with the public key of the coordinator node 600.
Msg = ENC (some.pk | Q, C.pk)
Connect (some, C) // Racing operation candidate node 400 connects to coordinator node 600, C.
Send (some, C, Msg) // Send the message to the coordinator node 600.
end
end

// The process of selecting the coordinator node 600, the coordinator node 400, some are the coordinator node candidates 400 to access and race with the coordinator node 600.
count = 0 // Counter variable for counting the number of 15 nodes 400.
R = [] // This is a list to contain the top node 400.
While (1)
// Coordinator node 600 receives an authentication message from the currently connected operating node candidate node 400.
Receive (C, some, Msg)
// Coordinator node 600 obtains the public key and quantum random number of the candidate node 400 from the authentication message.
some.pk | Q = DEC (Msg, C.sk)

if count <15
// Coordinator node 600, with respect to the list of candidates for the operation of the candidate node 400
for i = 1: v
// Only when public key and quantum random number match
if some.pk == V [i] .pk and Q == V [i] .Q
R [count] = V [i] // Own candidate node 400, V [i], assigned to R
count + = 1; // increase counter
break // exit the for routine.
end
end
else
// When the number of counters is 15, the coordinator node 600 transmits a new public key for block generation to the operation node 400 for consensus for block generation.
For i = 1: # (R)
newpk, newsk = GenKey () // Coordinator node 600 receives the new key
Send (C, R [i], ENC (newpk, R [i] .pk)) // Encrypt and send to the operating node 400.
End
// The coordinator node 600 performs the same operation with respect to the senior node 500.
For i = 1: # (S)
newpk, newsk = GenKey ()
Send (C, S [i], ENC (newpk, S [i] .pk))
End
break
end
end

Of course, any definitions, programs, and sequences that can represent the method according to an embodiment of the present invention are possible without using the definitions and programs or procedures shown in Tables 2 to 4, and are not limited to the listed ones. However, it is not excluded for reasons not listed.

The order between the above-described steps is only an example, and is not limited thereto. That is, the order between the above-described steps may be mutually varied, and some of these steps may be executed or deleted simultaneously.

The description of the method for providing a consensus service using a blockchain based quantum random number in FIGS. 6 and 7 is not described above. The following description will be omitted because it can be easily inferred from the same or described contents.

8 is an operation flow diagram for explaining a method for providing a consensus service using a blockchain based quantum random number according to an embodiment of the present invention. Referring to FIG. 8, the dual-source consensus service providing server receives transaction data requesting block generation from a front node, and encrypts the quantum random number generated by a quantum random function mechanism to encrypt the front node. And transmit to (S8100).

Then, when the bidirectional system consensus service providing server broadcasts by inserting the encrypted quantum random number in the header in the block at the front node, the verification data is received from the coordinator node, the upper-ranking node, and the operational candidate node that decoded the quantum random number ( S8200).

In addition, the two-way consensus service providing server, the coordinator node to determine the predetermined number of first-come nodes connected to the top-ranking node and the top-ranking candidate node as the top-ranking node (S8300), and direct communication between the top-ranking node and the top-ranking node at the coordinator node. By collecting the consensus result, the result is broadcast to at least one node in the blockchain to generate a block (S8400).

The description of the method for providing a consensus service using a blockchain based quantum random number in FIG. 8 is not described above. Since it can be easily inferred from the same or described content, the following description is omitted.

The method of providing a consensus service using a blockchain based quantum random number according to an embodiment described with reference to FIG. 8 is in the form of a recording medium including instructions executable by a computer, such as an application or a program module executed by a computer Can also be implemented. Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media. Also, the computer-readable medium may include any computer storage medium. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data.

The method for providing a consensus service using a blockchain based quantum random number according to an embodiment of the present invention described above may include an application installed in a terminal (which may include a program included in a platform or an operating system basically mounted in the terminal). ), And may be executed by an application (that is, a program) installed by the user directly on the master terminal through an application providing server such as an application store server, an application, or a web server related to a corresponding service. In this sense, the method for providing a consensus service using a blockchain based quantum random number according to an embodiment of the present invention described above is implemented as an application (that is, a program) basically installed in a terminal or directly installed by a user, and the like. It can be recorded on a computer readable recording medium.

The above description of the present invention is for illustration only, and those of ordinary skill in the art to which the present invention pertains can understand that it can be easily modified into other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, it should be understood that the embodiments described above are illustrative in all respects and not restrictive. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as distributed may be implemented in a combined form.

The scope of the present invention is indicated by the following claims rather than the above detailed description, and it should be interpreted that all changes or modified forms derived from the meaning and scope of the claims and equivalent concepts thereof are included in the scope of the present invention. do.

Claims (10)

In the method for providing a two-way consensus service provided by the two-way consensus service providing server,
When receiving a subscription request from at least one node that satisfies a preset virtual currency holding condition and a computing resource condition, registering the at least one node as a candidate node for operation;
Receiving transaction data requesting block generation from a front node, encrypting the quantum random number generated by a quantum random function mechanism, and transmitting the encrypted quantum random number to the front node;
When the front node inserts and broadcasts an encrypted quantum random number into a header in a block, receiving verification data from a coordinator node, a high-ranking node, and an operational candidate node that decodes the quantum random number;
Determining, by the coordinator node, a predetermined number of first-come-first-served nodes and first-come-first-served nodes among the candidates in the first order; And
Collecting a consensus result by direct communication between the coordinator node and the senior node and the operational node to broadcast the result to at least one node in the blockchain to generate a block;
A method for providing a consensus service for a bilateral system using a quantum random number based on a blockchain including a.
delete According to claim 1,
The step of receiving transaction data requesting block generation from the front node, and encrypting the quantum random number generated by a quantum random function mechanism to transmit to the front node,
Selecting a node selected as a quantum random number from among the permanent nodes as a coordinator node, extracting information of a pre-registered operating committee candidate node, encrypting the quantum random number, and transmitting it to the front node;
Containing, a method for providing a consensus service using a blockchain based quantum random number.
According to claim 1,
In the case where the front node inserts and broadcasts the encrypted quantum random number in the header in the block, in the step of receiving verification data from a coordinator node, a high-ranking node, and an operational candidate node that decodes the quantum random number,
When decoding the quantum random number, the coordinator node, the standing node, and the candidate node for operation are verified and decrypted with the hash included in the ExtraData in the header of the block, and thus, a two-way consensus service using a blockchain-based quantum random number. How to provide.
According to claim 1,
In the coordinator node, determining a predetermined number of first-come-first-served nodes connected to the upper-ranking node and the top-ranking candidate nodes in a first-come-first-served basis is determined as a top-ranking node,
Determining that the percentages of the standing node and the operating node are 49% and 51%, respectively, or the number of the standing node and the operating node is 14 and 15, respectively;
Containing, a method for providing a consensus service using a blockchain based quantum random number.
According to claim 1,
The step of receiving transaction data requesting block generation from the front node, and encrypting the quantum random number generated by a quantum random function mechanism to transmit to the front node,
Encrypting the quantum random number using the public key of the front node and transmitting it to the front node;
Including, a method for providing a consensus service using a blockchain based quantum random number system.
The method of claim 6,
When the front node inserts and broadcasts an encrypted quantum random number into a header in a block, receiving verification data from a coordinator node, a high-ranking node, and an operational candidate node that decodes the quantum random number;
Verifying the encrypted quantum random number by a method of verifying a signature value of the encrypted quantum random number using the public key of the front node at the front node;
When the verification is completed, broadcasting by inserting an encrypted quantum random number in the header in the block;
Containing, a method for providing a consensus service using a blockchain based quantum random number.
According to claim 1,
When the front node inserts and broadcasts an encrypted quantum random number into a header in a block, receiving verification data from a coordinator node, a high-ranking node, and an operational candidate node that decodes the quantum random number,
In the coordinator node, which is a node selected as a coordinator among the standing nodes, when a quantum random number list identifier in a header is decrypted with a public key, obtaining a quantum random number list of the candidate node of the operating committee;
Decoding the header from the operation candidate node and transmitting it to the coordinator, so that the coordinator notifies the senior node and the operation node candidate node of the coordinator selection using a public key;
A method of providing a consensus service using a blockchain based quantum random number that is executed by executing
According to claim 1,
In the step of generating a block by broadcasting the result to at least one node in the blockchain by collecting the agreement result by direct communication between the coordinator node and the senior node and the operating node,
Method for providing a consensus service using a blockchain based quantum random number to generate a block when the consensus result is to complete a 51% verification of the standing and operating nodes.
A computer-readable recording medium recording a program for executing the method of any one of claims 1, 3 to 9.

Images