CN111598389B - Transaction system for preventing bill market risk based on blockchain - Google Patents

Transaction system for preventing bill market risk based on blockchain Download PDF

Info

Publication number
CN111598389B
CN111598389B CN202010276215.1A CN202010276215A CN111598389B CN 111598389 B CN111598389 B CN 111598389B CN 202010276215 A CN202010276215 A CN 202010276215A CN 111598389 B CN111598389 B CN 111598389B
Authority
CN
China
Prior art keywords
node
nodes
transaction
block
layer
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CN202010276215.1A
Other languages
Chinese (zh)
Other versions
CN111598389A (en
Inventor
吴恒鑫
凌捷
蔡睿
谢锐
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong University of Technology
Original Assignee
Guangdong University of Technology
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 Guangdong University of Technology filed Critical Guangdong University of Technology
Priority to CN202010276215.1A priority Critical patent/CN111598389B/en
Publication of CN111598389A publication Critical patent/CN111598389A/en
Application granted granted Critical
Publication of CN111598389B publication Critical patent/CN111598389B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0635Risk analysis of enterprise or organisation activities
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Abstract

The invention discloses a transaction system for preventing bill market risk based on block chain, comprising: a base layer, a functional layer, an application layer, the base layer comprising: the system comprises a P2P network, an intelligent contract, a consensus algorithm and a digital signature, wherein the base layer is in communication connection with a functional layer, the functional layer is used for providing functions of preserving, purchasing, selling and transferring bills, and the functional layer is in communication connection with an application layer. The invention overcomes the defect of centralization of the traditional transaction system and improves the transaction efficiency by constructing the three-layer transaction system based on the blockchain.

Description

Transaction system for preventing bill market risk based on blockchain
Technical Field
The invention relates to the technical field of blockchains, in particular to a transaction system for preventing bill market risks based on a blockchain.
Background
The bayer fault-tolerant technique is a type of fault-tolerant technique in the field of distributed computing. The bayer hypothesis is a modeling of the real world, and computers and networks may exhibit unpredictable behavior due to hardware errors, network congestion or disruption, and malicious attacks. The parallel bayer fault-tolerant algorithm (Concurrent Byzantine Fault Tolerance, CBFT) is a new consensus algorithm developed from the bayer fault-tolerant algorithm. Compared with the traditional fault-tolerant technology, the CBFT has concurrency, each block can vote and build blocks in a mode of concurrency with other blocks, and therefore the consensus speed is greatly improved.
The ticket market is the primary place of short term funds financing, is the hub that directly links industrial and financial capital, and is a sub-market of the money market, which is the most fundamental and the most widespread component of the trading entity in the entire money system. As the bill market system is centralized, once a central server goes out of the problem, the whole market is paralyzed, the problems of 'one bill for multiple sales', 'making money and endorsement are asynchronous' and the like are easy to occur, risk hidden dangers such as credit risks, operation risks, supervision risks, paper bill storage risks and the like exist, long-term healthy development of the market is affected to a certain extent, and attention and solving are urgently needed.
Disclosure of Invention
The invention provides a block chain-based transaction system for preventing the market risk of the bill, which aims to overcome the defects of low bill transaction efficiency and easy attack in centralization in the prior art.
The primary purpose of the invention is to solve the technical problems, and the technical scheme of the invention is as follows:
a blockchain-based trading system for against ticket market risk, comprising: a base layer, a functional layer, an application layer, the base layer comprising: the system comprises a P2P network, an intelligent contract, a consensus algorithm and a digital signature, wherein the base layer is in communication connection with a functional layer, the functional layer is used for providing functions of preserving, purchasing, selling and transferring bills, and the functional layer is in communication connection with an application layer.
In the scheme, the consensus algorithm is an improved CBFT algorithm, and the consensus negotiation is carried out on the bill through the improved CBFT algorithm.
In this scheme, the specific process of consensus negotiation for the ticket by the improved CBFT algorithm is:
receiving a bill transaction request sent by a user, feeding back the request to a block building node, building a block by the block building node, packaging bill transaction records into the block, generating a block time stamp, recording transaction time and transaction data, and then sending the block to other nodes;
the nodes receive the created blocks, vote the blocks, digitally sign the voting information and then forward the voting information to other nodes, each node receives the votes of all the nodes, and the votes are counted to obtain a final result; the voting includes: agreeing to admit the current block and disagreeing to admit the current block;
if the number of nodes agreeing to admit the current block exceeds two-thirds, the block is confirmed, the current block is added on the blockchain of the bill transaction, and a response is sent to the client of the application layer.
In the scheme, in the bill transaction data consensus process, each node checks voting information with other nodes.
In this scheme, the transaction system further includes a leader node, and authentication by the leader node is required every time the transaction system joins a new node. When a new node is added, the new node is authenticated by the leading node, so that the security of the transaction system is enhanced.
In this scenario, the leader node generates conditions including:
each node of the transaction can send out a request for electing to be a leader node, the node after sending out the request becomes a candidate node, and voting is started when other receiving nodes in the transaction system receive the request;
the candidate nodes can vote for themselves, and when the number of votes of any candidate node is greater than or equal to N/2+1, the candidate node becomes a leading node, wherein N is the total number of nodes of the transaction system;
and only one leader node is allowed to exist in the same period, if the leader node fails, the number of votes cast by other nodes determines that a new leader node is not available any more.
Compared with the prior art, the technical scheme of the invention has the beneficial effects that:
the invention overcomes the defect of centralization of the traditional transaction system and improves the transaction efficiency by constructing the three-layer transaction system based on the blockchain.
Drawings
FIG. 1 is a diagram of a system architecture of the present invention.
FIG. 2 is a flow chart of the consensus negotiation for a bill transaction according to the present invention.
FIG. 3 is a flow chart of electing a leader node in the present invention.
Detailed Description
In order that the above-recited objects, features and advantages of the present invention will be more clearly understood, a more particular description of the invention will be rendered by reference to the appended drawings and appended detailed description. It should be noted that, in the case of no conflict, the embodiments of the present application and the features in the embodiments may be combined with each other.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention, however, the present invention may be practiced in other ways than those described herein, and therefore the scope of the present invention is not limited to the specific embodiments disclosed below.
Noun interpretation
A block: the storage unit adopts a structure of 'block head + block body', wherein the block head is used for verifying the validity data of the recorded data and the index data of the previous block, and the block body contains the recorded data in a certain time.
Blockchain: essentially, the method is a decentralised database, and is used as the underlying technology of the bitcoin, and is a series of data blocks which are generated by the association of a cryptography method, and each data block contains information of a batch of bitcoin network transactions and is used for verifying the validity of the information and generating a next block.
And (3) node: the nodes in the ticket market risk system of the present invention consist of a group of trustworthy participants, referred to as nodes, that participate in building a P2P network environment.
Alliance chain: for members of a particular group and limited third parties, a plurality of preselected nodes are designated internally as billing agents, and the generation of each block is determined jointly by all of the preselected nodes.
Digital signature: only the sender of the information can generate a digital string which cannot be forged by others, and the digital string is also a valid proof for the authenticity of the information sent by the sender of the information.
Intelligent contract: a contract that can be automatically executed on a computer system when certain conditions are met allows us to execute traceable, irreversible and secure transactions without the need for a third party.
The present invention is a client/server mode architecture where the consensus of the instrument transaction is based on a federated chain environment that is decentralised. The alliance chain network is composed of nodes and is responsible for saving the blockchain data, maintaining the data consistency and providing the blockchain service for the client by the alliance chain.
The node deploys intelligent contracts of the bill transaction when the alliance chain environment is built, the intelligent contracts restrict business rules of the bill transaction, are automatically executed when being called by the transaction, and strictly adhere to contract flows. The nodes act as transaction consensus roles that consensus the instrument transaction data through the improved CBFT algorithm.
Example 1
As shown in fig. 1, a blockchain-based trading system for against ticket market risk, comprising: a base layer, a functional layer, an application layer, the base layer comprising: the system comprises a P2P network, an intelligent contract, a consensus algorithm and a digital signature, wherein the base layer is in communication connection with a functional layer, the functional layer is used for providing functions of preserving, purchasing, selling and transferring bills, and the functional layer is in communication connection with an application layer.
The bill transaction participant nodes form blockchain nodes, the bill is regarded as a pass (proof of rights and value), the security and reliability of transaction data are ensured through a blockchain, and the pass is completed.
In the scheme, the consensus algorithm is an improved CBFT algorithm, and the consensus negotiation is carried out on the bill through the improved CBFT algorithm.
It should be noted that, because the improved parallel bayer process fault tolerance algorithm (CBFT algorithm) sometimes coordinates nodes on the transaction system, wrong voting information may be exchanged due to system errors, so that the situation that the final consistency of the system is affected occurs, and therefore, in the process of consensus bill transaction data, each node needs to check voting information with other nodes, so that the final consistency of the system is ensured.
The improved parallel Bayesian and busy-court fault-tolerant algorithm plays an important role in a transaction system for preventing the market risk of bills, and when the transaction operation is carried out, the consensus node can verify the operation legitimacy of updating contract data and refuses the transaction to be linked in a mode of throwing an anti-objection bill in the negotiation process. The transaction confirmation time of the transaction system for preventing the bill market risk is shortened through an improved parallel Bayesian fault tolerance algorithm.
In this scheme, as shown in fig. 2, the specific process of consensus negotiation for the ticket by the improved CBFT algorithm is as follows:
receiving a bill transaction request sent by a user, feeding back the request to a block building node, building a block by the block building node, packaging bill transaction records into the block, generating a block time stamp, recording transaction time and transaction data, and then sending the block to other nodes;
the nodes receive the created blocks, vote the blocks, digitally sign the voting information and then forward the voting information to other nodes, each node receives the votes of all the nodes, and the votes are counted to obtain a final result; the voting includes: agreeing to admit the current block and disagreeing to admit the current block;
if the number of nodes agreeing to admit the current block exceeds two-thirds, the block is confirmed, the current block is added on the blockchain of the bill transaction, and a response is sent to the client of the application layer.
In the scheme, in the bill transaction data consensus process, each node checks voting information with other nodes.
The improved CBFT algorithm improves the consensus speed, shortens the transaction confirmation time, ensures the final consistency of the system through checking the voting information among the nodes, and can effectively consensus the bill transaction data.
In this scheme, the transaction system further includes a leader node, and authentication by the leader node is required every time the transaction system joins a new node. When a new node is added, the new node is authenticated by the leading node, so that the security of the transaction system is enhanced.
It should be noted that, the same piece of bill transaction data needs to be divided into a plurality of distributed nodes, which is easily threatened by the witch attack, if a malicious node exists in the P2P network, and the data originally needed to be divided into a plurality of nodes is fraudulently backed up to the same malicious node, the malicious node can control a large part of the system, so as to destroy the redundancy strategy of the system. In order to reduce the influence of the witch attack on the transaction system for preventing the bill market risk, a reliable leader node is selected, and every time the system joins a new node, the authentication of the leader node is required:
as shown in fig. 3, the step of electing a leader node, in this embodiment, the leader node generates the following conditions:
each node of the transaction can send out a request for electing to be a leading node, the node after sending out the request is a candidate node, and voting is started when other receiving nodes in the transaction system receive the request;
the candidate nodes can vote for themselves, and when the number of votes of any candidate node is greater than or equal to N/2+1, the candidate node becomes a leading node, wherein N is the total number of nodes of the transaction system;
and only one leader node is allowed in the same period, if the leader node fails, the number of votes cast by other nodes determines that a new leader node is not available any more.
When a transaction system for preventing the bill market risk joins a new node, the leading node sends a request for a certificate capable of proving the identity of the node itself to the new joining node, after the new joining node receives the request, the leading node is responded and sends relevant certificate information, and then the leading node performs authentication according to the information to determine whether the new joining node can truly join the network.
It is to be understood that the above examples of the present invention are provided by way of illustration only and not by way of limitation of the embodiments of the present invention. Other variations or modifications of the above teachings will be apparent to those of ordinary skill in the art. It is not necessary here nor is it exhaustive of all embodiments. Any modification, equivalent replacement, improvement, etc. which come within the spirit and principles of the invention are desired to be protected by the following claims.

Claims (2)

1. A blockchain-based trading system for against ticket market risk, comprising: a base layer, a functional layer, an application layer, the base layer comprising: the system comprises a P2P network, an intelligent contract, a consensus algorithm and a digital signature, wherein the base layer is in communication connection with a functional layer, the functional layer is used for providing functions of preserving, purchasing, selling and transferring bills, and the functional layer is in communication connection with an application layer;
the consensus algorithm is an improved CBFT algorithm, and the ticket is subjected to consensus negotiation through the improved CBFT algorithm;
the specific process of consensus negotiation for the bill through the improved CBFT algorithm is as follows:
receiving a bill transaction request sent by a user, feeding back the request to a block building node, building a block by the block building node, packaging bill transaction records into the block, generating a block time stamp, recording transaction time and transaction data, and then sending the block to other nodes;
the nodes receive the created blocks, vote the blocks, digitally sign the voting information and then forward the voting information to other nodes, each node receives the votes of all the nodes, and the votes are counted to obtain a final result; the voting includes: agreeing to admit the current block and disagreeing to admit the current block;
if the number of the nodes agreeing to accept the current block exceeds two thirds, the block is confirmed, meanwhile, the current block is added to a blockchain of the bill transaction, and a response is sent to a client of an application layer;
the transaction system also comprises a leader node, and each time the transaction system joins a new node, authentication passing the leader node is required;
the leader node generates conditions including:
each node of the transaction can send out a request for electing to be a leader node, the node after sending out the request becomes a candidate node, and voting is started when other receiving nodes in the transaction system receive the request;
the candidate nodes can vote for themselves, and when the number of votes of any candidate node is greater than or equal to N/2+1, the candidate node becomes a leading node, wherein N is the total number of nodes of the transaction system;
and only one leader node is allowed to exist in the same period, if the leader node fails, the number of votes cast by other nodes determines that a new leader node is not available any more.
2. The blockchain-based ticketing market risk prevention trading system of claim 1, wherein each node checks voting information against other nodes during the ticketing data consensus process.
CN202010276215.1A 2020-04-09 2020-04-09 Transaction system for preventing bill market risk based on blockchain Active CN111598389B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010276215.1A CN111598389B (en) 2020-04-09 2020-04-09 Transaction system for preventing bill market risk based on blockchain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010276215.1A CN111598389B (en) 2020-04-09 2020-04-09 Transaction system for preventing bill market risk based on blockchain

Publications (2)

Publication Number Publication Date
CN111598389A CN111598389A (en) 2020-08-28
CN111598389B true CN111598389B (en) 2023-04-28

Family

ID=72184951

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010276215.1A Active CN111598389B (en) 2020-04-09 2020-04-09 Transaction system for preventing bill market risk based on blockchain

Country Status (1)

Country Link
CN (1) CN111598389B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112150161B (en) * 2020-09-30 2023-08-08 重庆市科学技术研究院 Electronic ticket transaction risk management and control system and method

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106780033A (en) * 2016-12-16 2017-05-31 杭州云象网络技术有限公司 A kind of digital ticket transaction system construction method based on alliance's chain
CN108830709A (en) * 2018-04-17 2018-11-16 中车工业研究院有限公司 A kind of crowdsourcing transaction system based on block chain
CN109919760A (en) * 2019-01-11 2019-06-21 南京邮电大学 Byzantine failure tolerance common recognition algorithm based on voting mechanism
CN110569395A (en) * 2018-05-18 2019-12-13 北京天德科技有限公司 stable and reliable block chain Byzantine consensus process design method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106780033A (en) * 2016-12-16 2017-05-31 杭州云象网络技术有限公司 A kind of digital ticket transaction system construction method based on alliance's chain
CN108830709A (en) * 2018-04-17 2018-11-16 中车工业研究院有限公司 A kind of crowdsourcing transaction system based on block chain
CN110569395A (en) * 2018-05-18 2019-12-13 北京天德科技有限公司 stable and reliable block chain Byzantine consensus process design method
CN109919760A (en) * 2019-01-11 2019-06-21 南京邮电大学 Byzantine failure tolerance common recognition algorithm based on voting mechanism

Also Published As

Publication number Publication date
CN111598389A (en) 2020-08-28

Similar Documents

Publication Publication Date Title
US11669811B2 (en) Blockchain-based digital token utilization
CN107301600B (en) Core construction method of block chain Internet model for cross-chain transaction
TWI716140B (en) Data processing method and device based on blockchain
US20190354518A1 (en) Chain mesh network for decentralized transaction systems
CN111183445A (en) Method and apparatus for automatic commitment and settlement of digital assets
CN111464518B (en) Method and device for sending and verifying cross-link communication data
CN112235114A (en) Service processing system based on block chain
Wang et al. Inter-bank payment system on enterprise blockchain platform
CN111133463A (en) Intelligent contract execution using distributed coordination
CN109949033A (en) A kind of affaris safety trade system and method based on block chain
JP2022553946A (en) Conducting transactions using private and public blockchains
Innerbichler et al. Federated byzantine agreement to ensure trustworthiness of digital manufacturing platforms
CN111383114A (en) Asset information management method and device based on block chain
CN111402033A (en) Asset information management method and device based on block chain
CN111340628A (en) Asset information management method and device based on block chain
JP7192196B2 (en) Network transaction verification method and system based on multiple nodes, and storage medium
Jeon et al. RMBC: Randomized mesh blockchain using DBFT consensus algorithm
Pupyshev et al. Gravity: a blockchain-agnostic cross-chain communication and data oracles protocol
CN111598389B (en) Transaction system for preventing bill market risk based on blockchain
CN113706302A (en) Cross-chain-based block chain financial data generation method and system
CN114154969B (en) Large-scale trading and settlement method based on block chain
CN116415955A (en) Cross-chain transaction method and system based on combination of hash locking and notary
CN113839768B (en) Cross-link communication method based on satellite link relay
CN117170853A (en) Block chain transaction method and device and electronic equipment
Niu et al. NFT Cross-Chain Transfer Method Under the Notary Group Scheme

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant