CN109919756A - Fund transfer system, checking method and method of commerce based on Merkle tree backtracking location technology - Google Patents
Fund transfer system, checking method and method of commerce based on Merkle tree backtracking location technology Download PDFInfo
- Publication number
- CN109919756A CN109919756A CN201910133066.0A CN201910133066A CN109919756A CN 109919756 A CN109919756 A CN 109919756A CN 201910133066 A CN201910133066 A CN 201910133066A CN 109919756 A CN109919756 A CN 109919756A
- Authority
- CN
- China
- Prior art keywords
- ledger
- tree
- block
- transaction
- root
- 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.)
- Granted
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention discloses fund transfer system, checking method and method of commerce based on Merkle tree backtracking location technology, and system includes: center-side and client；Central store module is equipped in center-side；Central store module includes central database and block chain；Central database is for storing transaction record；Block chain is that block is made up of Hash iteration, and block includes block head and block body；Block head is used to store the root of the system general ledger tree of the block and the root of system ledger tree；Block body is used to store the transaction details of the block；It is equipped in client and module is locally stored；It includes local data base and build chain that module, which is locally stored,；Local data base is for storing individual ledger tree；Build chain is the data-link that all block heads are constituted.The present invention, can be to the two-way examination of itself and counterpart's Transaction Information, thus the efficient believable bank transaction under realizing secret protection by realizing distributed general ledger examination and ledger examination.
Description
Technical field
The present invention relates to data processing fields, more particularly to recall the fund transfer system of location technology based on Merkle tree, look into
Proved recipe method and method of commerce.
Background technique
Traditional bank system uses " centralization " management mode for a long time, which has efficiently controllable and manage convenient etc. excellent
Gesture, but recently as the disclosure of some insiders crime and external attack event, the drawbacks of centralization mode, increasingly highlights: in
The heart centrally stored all account information and Transaction Information, it is easy to as the target of hacker attack, bring about great losses.More
Importantly, centralized management, which lacks the transparency and controllability, transaction data, to be verified, depositor can only passively believe completely
Appoint bank, it is difficult to actively implement supervision.Bank possesses the book keeping operation power of each transaction, has and forges customer information, distorts transaction
The ability of record practises fraud there are center under specific circumstances and encroaches on the risk of depositor's interests.
In recent years, " decentralization " management mode based on block chain technology gradually attracts attention and heat is held in both hands.It establishes more
The block chain technology that Fang Gongtong keeps accounts under principle has the anti-tamper advantages such as traceable of high security, open and clear, data.But
The technology is at present still in initial stage, the problems such as missing there are high cost with low efficiency, privacy leakage and responsible party.In addition, according to this
Mode, bank by the Central Position for system of losing, government be more difficult to implement supervision, not can guarantee financial system safety and can
Control property.Currently, being Typical Representative of the block chain in financial application, Central Bank, China with the ideal money that " bit coin " is representative
Prepare oneself legal digital cash of distribution, but the Central Bank's digital cash intended to issue is still using state credit as endorsing, in pipe
Reason transaction data and ca authentication (Certificate Authority) etc. are remained on using centralization mode, can not be from this
The characteristics of block chain is trusted in many ways is embodied in matter, and then is unable to give full play the business advantage of ideal money.Meanwhile it is to existing
The operating mode change of banking system is larger, and construction cost and maintenance cost all will be very high.
Therefore, how under new technology situation, making efficient and convenient Trusted Digital bank is that modern bank industry faces
A great technical problem.Under prior art conditions, " efficiently convenient " can not often get both simultaneously with " credible ".It is " high
It is convenient to imitate " it is intended to use the Db Management Model of conventional center, by the data that bank is centrally stored and maintenance is all
Information, and cannot be as the bit coin network of complete decentralization, it is distributed that each transaction all transfers to all depositors to come
Verifying and storage." credible " means to ensure that bank can only keep accounts strictly according to the facts from technology and system, and can not forge or usurp
Change transaction record, can not remember that " unilateral account " (only records the side's of producing information to certain money transfer transactions, do not record or disorderly record is transferred to
Square information), this requires transaction data can verify that open and clear, in many ways, needs to lock friendship using block chain technology
Easy data, and the pure centralized management mode of data black box formula cannot be used.
Summary of the invention
To solve the above-mentioned problems, the present invention proposes fund transfer system, examination side that location technology is recalled based on Merkle tree
Method and method of commerce.
Based on the fund transfer system of Merkle tree backtracking location technology, including center-side and client；It is set in the center-side
There is central store module；The central store module includes central database and block chain；The central database is for storing
Transaction record；The block chain is that the successive block of the timing of several temporally pieces is made up of Hash iteration；Institute
Stating block includes block head and block body；The block head is used to store the root of the system general ledger tree of the block, system point family
The root and father's block build hashed value of account tree；The block body is used to store the transaction details of the block；In the client
Equipped with module is locally stored；The module that is locally stored includes local data base and build chain；The local data base is for depositing
Store up individual ledger tree；The build chain is the data-link that all block heads are constituted.
The structure of the system general ledger tree is Merkle tree, for storing all current Transaction Informations of all depositors；System
Each leaf node of system general ledger tree corresponds to the hashed values of a current particular transactions, and when all leaf nodes are according to trading
Between sequencing arrange, the root node of system general ledger tree locked current All Activity information.
The structure of the individual ledger tree is multistage expansible, reverse self-growing Merkle tree, for storing individual
All historical transactional informations of depositor.
The system ledger tree condenses together for the root node of all individual ledger trees and is constructed of Merkle
Tree, each leaf node correspond to the root node of the individual ledger tree of single depositor, the system ledger leaf nodes with it is a
Body ledger root vertex corresponding relationship is constant；Each leaf node of the system ledger tree is in affiliated Merkle tree
Sequence of positions uses the layout of position serial number.
Each leaf node of the Merkle tree is unique by the backtracking path that Hash iteration traces back to root node.
The path of the backtracking be leaf node by mostly wheel Hash iteration trace back to Merkle root vertex during
Each Hash factor is mutual to put in order.
The timeslice is the isometric period for periodically dividing exchange hour.
The client and center-side are provided with respective private key and public key, and are recognized by digital signature to carry out identity
Card.
Based on the checking method of transferring accounts of Merkle tree backtracking location technology, the examination includes that general ledger examination and ledger are looked into
It tests, the general ledger examination is for verifying transaction existence, and the ledger examination is for verifying authenticity of transferring accounts；
The checking method the following steps are included:
S11. the transaction leaf node that client is chosen on itself individual ledger tree is used as wait check transaction, is corresponded to
Transaction hashed value be sent to center-side as echo request；
S12. the examination of client executing general ledger and ledger examination.
General ledger examination specifically: client is returned according to center-side, wait check in corresponding block of trading, from
Given transaction hashed value to itself build chain system general ledger root vertex the path Merkle, which is verified by Hash iteration
The correctness of diameter；
The ledger examination specifically:
S121. client is returned according to center-side, in newest block, from the root of itself individual ledger tree to system
The path Merkle of ledger root vertex and from the root of counterpart individual ledger tree to system ledger root vertex
The path Merkle, pass through Hash iteration verify two paths Merkle correctness；
S122. according to two paths Merkle in step S121, client application Merkle tree recalls location technology, respectively
Itself and leaf segment point serial number of the counterpart in system ledger tree are calculated, and compares whether the two serial numbers are distinguished
It is consistent with the position serial number code in respective account；
S123. client according to center-side return slave given transaction hashed value to counterpart's individual ledger tree root value
The correctness in the path is verified in the path Merkle by Hash iteration.
Before the general ledger examination and ledger examination carry out Transaction Inquiries, need advanced row data synchronous and data verification.
Synchronous, the detailed process of the synchronous synchronization including build chain of the data and individual ledger are as follows: client is sent
Data update request to center-side, update the maximum block number in request including client local build chain, and local individual
The hashed value of most end transaction leaf node on ledger tree；Then all after the maximum block number that reception center-side returns
The hashed value and most new root of all newest transaction of the individual ledger tree after new block, and local most end transaction leaf node
Value.
The process of the data verification are as follows:
(1) client is using the hashed value of the last one block of build chain before synchronizing as starting point, to synchronize the last one rear block
Hashed value is terminal, and the continuity of build chain data is verified by Hash iteration；
(2) client is using a nearest quasi- root node before synchronizing as starting point, using the individual ledger tree root value after synchronizing as terminal,
The continuity of individual ledger tree data is verified by Hash calculation.
Based on the transfer transaction method of Merkle tree backtracking location technology, including following money transfer transactions step:
S31. depositor A is transferred accounts by issuing transfer to bank center to depositor B；
S32. bank center generates transfer information simultaneously for transfer information receipt depositor A；
S33. transfer result information is sent to depositor B by bank center.
The transfer includes: the account and transfer amounts, request time, remark information and depositor's A private of depositor A
The digital signature that key trades to this；
The transfer information includes: account balance, the depositor A of depositor A after the completion of transfer, book keeping operation time, transaction
The digital signature that individual ledger root vertex and the private key of bank center trade to this；
The transfer result information includes: transfer, book keeping operation time, the account balance of depositor B, depositor after the completion of transaction
The digital signature that the individual ledger root vertex of B and the private key of bank center trade to this.
It further include system general ledger tree, system ledger tree and individual ledger tree with the generation of the money transfer transactions
Data synchronization updating.
The beneficial effects of the present invention are:
(1) take into account data transparency and execution efficiency: writing to test and separate by data realizes bank and efficiently concentrates book keeping operation, depositor
The new mode for dispersing democratic supervision greatly promotes bank's public affairs letter by inspection supervision mechanism " latching " data of ledger tree
The role of bank is changed the go-between being subjected to supervision by traditional manager by power；
(2) take into account secret protection and Fund Supervision: compared to bit coin network, irrelevant personnel can not obtain the transaction of other depositors
Record and account information, can not also know the globality business information of bank, while data storage centerization and can not distort
Feature is also convenient for auditing bodies and implements supervision and internal auditing to bank；
(3) system reform is easy, and implementation cost is low: without additionally creating public chain or the new digital cash of distribution, only by drawing
The storage for entering asymmetric encryption account management technology and carrying out block chain type to accounting data is transformed, and bank can be allowed to keep system
While system Central Position, the characteristic service and function of numerous ideal moneys are realized.
Detailed description of the invention
Fig. 1 is money transfer transactions flow chart of the invention；
Fig. 2 is individual ledger tree construction schematic diagram of the invention；
Fig. 3 is account block chain structure schematic diagram of the invention；
Fig. 4 is general ledger of the invention, ledger examination flow chart.
Specific embodiment
It is with reference to the accompanying drawing and specific real in order to make those skilled in the art more fully understand technical solution of the present invention
Applying example, the present invention is described in further detail.
Need to illustrate: Merkle tree is Hash binary tree, it is used as quickly concluding and verifying large-scale data integrality
Data structure.The complete Merkle tree needs of construction one are recursive to carry out Hash operation to back end, and will be newly-generated
Hash node is inserted into Merkle tree, and until only remaining next Hash node, which is exactly Merkle root.It is provided fastly
The method of fast verify data existence: when N number of data element is by Hash calculation and is inserted into Merkle tree, any one full section
Point dates back more log2(N) a path node can reach Merkle root, i.e., at most pass through log2(N) secondary Hash calculation can be examined
Finding arbitrary data element whether there is in the Merkle tree, to complete its existence proof.
Fund transfer system based on Merkle tree backtracking location technology, comprising: center-side and client；It is set in the center-side
There is central store module；The central store module includes central database and block chain；The central database is for storing
Transaction record；The block chain is that the successive block of the timing of several temporally pieces is made up of Hash iteration, institute
Stating block includes block head and block body；The block head is used to store the root of the system general ledger tree of the block, system point family
The root and father's block build hashed value of account tree；The block body is used to store the transaction details of the block；In the client
Equipped with module is locally stored；The module that is locally stored includes local data base and build chain；The local data base is for depositing
Store up individual ledger tree；The build chain is the data-link that all block heads are constituted.
The individual ledger tree is all historical tradings composition that individual ledger is stored by Merkle tree, each
Leaf node corresponds to the hashed value of the particular transactions of the depositor；
The system ledger tree condenses together for the root node of all individual ledger trees and is configured to, and equally passes through
The storage of Merkle tree, each leaf node correspond to the root node of the individual ledger tree of single depositor；The system ledger tree
In the root nodes of all individual ledger trees there is fixed position serial number, and this serial number is specifically shown in the depositor couple
In the account information answered.
The timeslice is the isometric period for periodically dividing exchange hour, it is proposed that daily divides, is set as 24
Hour, so as to corresponding with bank existing " journal account ".By the distributed storage and verifying to build chain, all depositors reach
Transaction common recognition, and then realize the supervision to center bank.The system general ledger tree root value of the block of block head storage and it is
System ledger tree root value, respectively corresponds the system general ledger tree and system ledger tree of insertion block chain；Respectively from general ledger and dividing family
Two dimensions of account lock historical trading, and system general ledger tree root value and system ledger tree root value are announced to all depositors, real
The data showed under secret protection disclose.
The client and center-side are provided with respective private key and public key, and are recognized by digital signature to carry out identity
Card.For example, depositor ensures the authenticity of transaction request by digital signature, bank ensures system message by digital signature
With the authenticity for receipt of transferring accounts.Meanwhile the registration mode of the virtual digits currency such as similar bit coin, do not have in digital banking system
The key pair of the CA mechanism (i.e. " certificate authority ") of so-called centralization, depositor is generated by depositor oneself, public key and account
Number corresponding relationship complete mapping when it carries out Account Registration to bank, and be written in the individual ledger of the depositor, private key
It is taken care of by depositor oneself.The asymmetric encryption account management technology of no CA mechanism is to realize the basis of Trusted Digital bank.It compares
In existing banking system, symmetric cryptosystem is generallyd use based on the absolute trust to bank to protect account safety and progress
The mode of identification, the asymmetric encryption techniques that the present invention uses can be to avoid banks using the Information Superiority in hand, arbitrarily
Forge or distort the transaction record of depositor.
As shown in Figure 1, the entire flow of a money transfer transactions, wherein in transaction request TX, VA、VBRespectively indicate the side of producing
The account of Alice and the side of being transferred to Bob, Amount are transfer amounts, Time1For request time, Memo is remark information, SgnAFor
The side's of producing private key is to the signature of the request, to confirm the authenticity of the request；It transfers accounts in receipt RE, Time2For keep accounts the time,
BalanceAFor the account balance of the side of producing after the completion of transaction, rootAIndicate the root node of the individual ledger tree in the side of producing, Sgnc
It is bank's private key to the signature of the transaction, to confirm the completed authenticity of the transaction；It transfers accounts and notifies parameter in Msg and RE class
Seemingly.The receipt RE and transferring accounts of transferring accounts notifies in Msg that the effect of root is both the confirmation to currently trading, and owns to the depositor
The confirmation of historical trading.
Further, the system general ledger tree (General Ledger Tree, abbreviation GLT) is to be deposited by Merkle tree
Current total transaction is stored up to constitute.Specifically, each leaf node of GLT corresponds to the hashed value hash of a current particular transactions
(TX), all leaf nodes of GLT are arranged according to exchange hour sequencing, and root node GLT_ROOT has locked current all
Transaction Information.
The individual ledger tree (Customer Ledger Tree, abbreviation CLT) is to store individual by Merkle tree
Ledger is constituted.Specifically, each leaf node of CLT corresponds to the hashed value hash of the particular transactions of certain individual depositor
(TX), all leaf nodes of CLT are arranged according to exchange hour sequencing, and root node root has locked all of the depositor and gone through
History transaction.The individual ledger tree CLT can multi-tier, reverse growth certainly.As shown in Fig. 2, 3 grades of -8 node structure
Individual ledger tree CLT, CLT are an incomplete binary tree on the whole, but every level-one all can individually be considered as a full binary tree.
The wherein mapping relations between #0 leaf node record depositor's account and its public key, to ensure that the public and private key of the account will not be usurped
Change；#1-#21(is without child node) it is transaction leaf node, record the hashed value of particular transactions；Root node subject to #A and #B leaf node,
They were once the root nodes of CLT, but with the growth of itself trading volume, they are changed into the common of higher level binary tree again successively
Node.Such design can be lockked all historical tradings of depositor by tree root root and be provided transaction recently quick
Back forecasting path, while meet different depositors to transaction extend the needs of, and retraction verification process in greatest extent
Protect depositor's privacy.
The system ledger tree (System Ledger Tree, abbreviation SLT) is the root of all individual ledger trees
Node aggregation is configured to Merkle tree together.Specifically, each leaf node of SLT corresponds to the individual point family of single depositor
All leaf nodes of the root node root, SLT of account tree according to account open an account the time sequencing arrange, root node SLT_
ROOT locks all historical tradings of all depositors.
The backtracking path of Merkle tree has uniqueness, that is, each leaf node traces back to root node by Hash iteration
Path be it is unique, different leaf nodes corresponds to different backtracking paths.Therefore, the backtracking road of some leaf node is given
Diameter can calculate position serial number of the leaf node in Merkle tree；Conversely, providing the position serial number of some leaf node, can also count
Calculate the backtracking path of the leaf node.
The backtracking path be leaf node by the way that mostly wheel Hash iteration traces back to Merkle root vertex during, each Kazakhstan
The uncommon factor is mutual to put in order, and unrelated with specific hashed value.Institute's rheme serial number leaf node is in affiliated Merkle tree
In sequence of positions, i.e. which leaf node.For example, including 2nIn the full binary tree of a leaf node, the position serial number of leaf node
It is followed successively by i=0,1,2 ..., 2n-1.Specifically, the position serial number of leaf node recalls the relationship in path with it are as follows: by leaf segment point sequence
Number it is converted into binary system, then turned left backward ranking, since first Hash factor (leaf node itself), new Hash from the right side
The factor meets 0 to postpone, and before meeting 1 to set, by taking turns Hash iteration, finally traces back to the root node of Merkle tree more.The Kazakhstan obtained in this way
Uncommon factor sequence is exactly the backtracking path of the leaf node.
As shown in figure 3, a system ledger tree of insertion is to include 16 leaf nodes in account block link composition
Full binary tree, leaf node trace back to system ledger root vertex ROOT need 4 (log216) Hash iteration.Wherein, riBoth
I-th of leaf node of system ledger tree, at the same be also position serial number i(i=0..15) individual ledger tree root node
rooti.Enable xj(j=1..4) is ri4 path nodes in trace-back process, although xjNumerical value it is ever-changing, but to same
For the serial number i of position, each xjFront-rear position be fixed, i.e. riHash sequence sequence be constant.
If as a result, with r2For, 2=(0010)2, then corresponding Hash sequence is (x2r2x1x3x4), that is, by leaf node r2It returns
It traces back to the Hash iteration sequence of root ROOT are as follows:
ROOT=hash(hash(hash(x2|hash(r2|x1))|x3)|x4), it is abbreviated as ROOT=hash (x2r2x1x3x4)。
If with r11For, 11=(1011)2, then corresponding Hash sequence is (x4x2x1r11x3), that is, by leaf node r11Backtracking
To the Hash iteration sequence of root ROOT are as follows:
ROOT=hash(x4|hash(hash(x2|hash(x1|r11)) |x3)), it is abbreviated as ROOT=hash (x4x2x1r11x3)。
It should be noted that the subsequent growth of system ledger tree has no effect on original account leaf node riRelative to previous
xjSequence.I.e. as the time increases, bank size expands, and more accounts are created, and system ledger tree extends to the right, but
The new Hash factor is only placed in the right of current Hash sequence by the Hash sequence before having no effect on extension, new backtracking path
?.Equally with r2And r11For, when in Fig. 3 SLT by 16 point spreads be 32 node when, 2=(00010)2, r2Corresponding Hash
Sequence is (x2r2x1x3x4x5)；11=(01011)2, r11Corresponding Hash sequence is (x4x2x1r11x3x5)。
The fixed position serial number of the root node setting of all individual ledger trees in system ledger tree, and referring to citizen's body
The coding mode of the essential informations such as personal address code, birthday, this serial number direct coding is written in the account of depositor in part card,
Account information discloses owner.In this way, the people that transfers accounts is aware of the account of counterpart, it is also known that the individual of counterpart
Leaf segment point serial number of the root node root of ledger tree CLT in SLT, has equally also been known that the root Hash iterates to
The backtracking path of SLT_ROOT.Bank thus be can effectively prevent using the possibility of data edge note " unilateral account ", that is, use other
Leaf node pretends to be the possibility of true sale other side.
As shown in figure 4, the checking method of transferring accounts based on Merkle tree backtracking location technology, the examination includes that general ledger is checked
It is checked with ledger；
(1) general ledger examination is for verifying transaction existence, i.e., according to exchange hour, in the system general ledger tree GLT of corresponding block
Check whether the transaction occurred strictly according to the facts；
(2) ledger examination checks newest system ledger tree SLT, whether the transaction is same for verifying authenticity of transferring accounts
Sample is strictly according to the facts to be recorded in oneself and the individual ledger of counterpart.
The checking method the following steps are included:
S11. the transaction leaf node that client is chosen on itself individual ledger tree is used as wait check transaction, is corresponded to
Transaction hashed value be sent to center-side as echo request；
S12. the examination of client executing general ledger and ledger examination.
General ledger examination specifically: client is returned according to center-side, wait check in corresponding block of trading, from
Given transaction hashed value to itself build chain system general ledger root vertex GLT_ROOT the path Merkle, pass through Hash iteration
Verify the correctness in the path；
The ledger examination specifically:
S121. client is returned according to center-side, in newest block, from the root of itself individual ledger tree to system
The path Merkle of ledger root vertex SLT_ROOT and from the root of counterpart individual ledger tree to system ledger
The correctness in two paths Merkle is verified in the path Merkle of root vertex SLT_ROOT by Hash iteration；
S122. according to two paths Merkle in step S121, client application Merkle tree recalls location technology, respectively
Itself and leaf segment point serial number of the counterpart in system ledger tree are calculated, and compares whether the two serial numbers are distinguished
It is consistent with the position serial number code in respective account；
S123. client according to center-side return slave given transaction hashed value to counterpart's individual ledger tree root value
The correctness in the path is verified in the path Merkle by Hash iteration.
Before the general ledger examination and ledger examination carry out Transaction Inquiries, need advanced row data synchronous and data verification.
The synchronous synchronization including build chain of the data is synchronous with individual ledger, specifically: client sends data
Center-side is updated request to, updates the maximum block number in request including client local build chain, and on the CLT of local most
The hashed value of end transaction leaf node；Then all new blocks after the maximum block number that center-side returns, Yi Jiben are received
The hashed value of all newest transaction of the CLT and newest root root after ground most end transaction leaf node.
The data verification specifically:
(1) client is using the hashed value of the last one block of build chain before synchronizing as starting point, to synchronize the last one rear block
Hashed value is terminal, and the continuity of build chain data is verified by Hash iteration；
(2) client, using the CLT root root after synchronizing as terminal, passes through using a nearest quasi- root node before synchronizing as starting point
The continuity of Hash calculation verifying CLT data.
The beneficial effects of the present invention are:
(1) take into account data transparency and execution efficiency: writing to test and separate by data realizes bank and efficiently concentrates book keeping operation, depositor
The new mode for dispersing democratic supervision greatly promotes bank's public affairs letter by inspection supervision mechanism " latching " data of ledger tree
The role of bank is changed the go-between being subjected to supervision by traditional manager by power；
(2) take into account secret protection and Fund Supervision: compared to bit coin network, irrelevant personnel can not obtain the transaction of other depositors
Record and account information, can not also know the globality business information of bank, while data storage centerization and can not distort
Feature is also convenient for auditing bodies and implements supervision and internal auditing to bank；
(3) system reform is easy, and implementation cost is low: without additionally creating public chain or the new digital cash of distribution, only by drawing
The storage for entering asymmetric encryption account management technology and carrying out block chain type to accounting data is transformed, and bank can be allowed to keep system
While system Central Position, the characteristic service and function of numerous ideal moneys are realized.
It should be noted that for simple description, therefore, it is stated as a systems for each embodiment of the method above-mentioned
The combination of actions of column, but those skilled in the art should understand that, the application is not limited by the described action sequence, because
For according to the application, certain some step be can be performed in other orders or simultaneously.Secondly, those skilled in the art also should
Know, the embodiments described in the specification are all preferred embodiments, related movement and unit not necessarily this Shen
It please be necessary.
In the above-described embodiments, it all emphasizes particularly on different fields to the description of each embodiment, is not described in some embodiment
Part, reference can be made to the related descriptions of other embodiments.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the program can be stored in computer-readable storage medium
In, the program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein, the storage medium can be magnetic
Dish, CD, ROM, RAM etc..
The above disclosure is only the preferred embodiments of the present invention, cannot limit the right model of the present invention with this certainly
It encloses, therefore equivalent changes made in accordance with the claims of the present invention, is still within the scope of the present invention.
Claims (17)
1. the fund transfer system based on Merkle tree backtracking location technology, it is characterised in that: including center-side and client；In described
Central store module is equipped in heart end；The central store module includes central database and block chain；The central database
For storing transaction record；The block chain is that the successive block of the timing of several temporally pieces passes through Hash iteration
It constitutes；The block includes block head and block body；The block head is used to store the root of the system general ledger tree of the block, is
The root and father's block build hashed value of system ledger tree；The block body is used to store the transaction details of the block；The visitor
It is equipped in the end of family and module is locally stored；The module that is locally stored includes local data base and build chain；The local data base
For storing individual ledger tree；The build chain is the data-link that all block heads are constituted.
2. the fund transfer system as described in claim 1 based on Merkle tree backtracking location technology, it is characterised in that: the individual
The structure of ledger tree is multistage expansible, reverse self-growing Merkle tree, and all history for storing individual depositor are handed over
Easy information.
3. the fund transfer system as described in claim 1 based on Merkle tree backtracking location technology, it is characterised in that: the system
Ledger tree is that the root node of all individual ledger trees condenses together the Merkle tree of composition, each leaf node correspondence
The root node of the individual ledger tree of single depositor, the system ledger leaf nodes are corresponding with individual ledger root vertex
Relationship is constant；Sequence of positions of each leaf node of the system ledger tree in affiliated Merkle tree is compiled using position serial number
Row.
4. the fund transfer system as described in claim 1 based on Merkle tree backtracking location technology, it is characterised in that: the system
General ledger tree corresponds to a current particular transactions for storing all current Transaction Informations of all depositors, each of which leaf node
Hashed value, and all leaf nodes according to exchange hour sequencing arrange, the root node of system general ledger tree has locked current
All Activity information.
5. the fund transfer system as claimed in claim 3 based on Merkle tree backtracking location technology, it is characterised in that: described
Each leaf node of Merkle tree is unique by the backtracking path that Hash iteration traces back to root node.
6. the fund transfer system as claimed in claim 4 based on Merkle tree backtracking location technology, it is characterised in that: the backtracking
Path is each Hash factor during Merkle leaf nodes trace back to Merkle root vertex by mostly wheel Hash iteration
Mutual puts in order.
7. the fund transfer system as claimed in claim 1 or 3 based on Merkle tree backtracking location technology, it is characterised in that: described
The subsequent growth of system ledger tree has no effect on sequence of original account leaf node relative to previous path node.
8. the fund transfer system as described in claim 1 based on Merkle tree backtracking location technology, it is characterised in that: the time
Piece is the isometric period for periodically dividing exchange hour.
9. the fund transfer system as described in claim 1 based on Merkle tree backtracking location technology, it is characterised in that: the client
End and center-side are provided with respective private key and public key, and carry out authentication by digital signature.
10. the checking method of transferring accounts based on Merkle tree backtracking location technology, it is characterised in that: the examination includes that general ledger is checked
It is checked with ledger；The general ledger examination is for verifying transaction existence, and the ledger examination is for verifying authenticity of transferring accounts；
The checking method the following steps are included:
S11. the transaction leaf node that client is chosen on itself individual ledger tree is used as wait check transaction, is corresponded to
Transaction hashed value be sent to center-side as echo request；
S12. the examination of client executing general ledger and ledger examination.
11. the checking method of transferring accounts as claimed in claim 10 based on Merkle tree backtracking location technology, it is characterised in that: institute
State general ledger examination specifically: client is returned according to center-side, wait check in the corresponding block of transaction, is dissipated from given transaction
Train value to itself build chain system general ledger root vertex the path Merkle, the correct of the path is verified by Hash iteration
Property；
The ledger examination specifically:
S121. client is returned according to center-side, in newest block, from the root of itself individual ledger tree to system
The path Merkle of ledger root vertex and from the root of counterpart individual ledger tree to system ledger root vertex
The path Merkle, pass through Hash iteration verify two paths Merkle correctness；
S122. according to two paths Merkle in step S121, client application Merkle tree recalls location technology, respectively
Itself and leaf segment point serial number of the counterpart in system ledger tree are calculated, and compares whether the two serial numbers are distinguished
It is consistent with the position serial number code in respective account；
S123. client according to center-side return slave given transaction hashed value to counterpart's individual ledger tree root value
The correctness in the path is verified in the path Merkle by Hash iteration.
12. the checking method of transferring accounts as claimed in claim 10 based on Merkle tree backtracking location technology, it is characterised in that: institute
Before stating general ledger examination and ledger examination progress Transaction Inquiries, need advanced row data synchronous and data verification.
13. the checking method of transferring accounts as claimed in claim 12 based on Merkle tree backtracking location technology, it is characterised in that: institute
State synchronous, the detailed process of the synchronous synchronization including build chain of data with individual ledger are as follows: client sends data update and asks
It asks to center-side, updates on the maximum block number in request including client local build chain, and local individual ledger tree
Most end transaction leaf node hashed value；Then all new blocks after the maximum block number that center-side returns are received, with
And after local most end transaction leaf node all newest transaction of the individual ledger tree hashed value and newest root.
14. the checking method of transferring accounts as claimed in claim 12 based on Merkle tree backtracking location technology, it is characterised in that: institute
State the process of data verification are as follows:
(1) client is using the hashed value of the last one block of build chain before synchronizing as starting point, to synchronize the last one rear block
Hashed value is terminal, and the continuity of build chain data is verified by Hash iteration；
(2) client is using a nearest quasi- root node before synchronizing as starting point, using the individual ledger tree root value after synchronizing as terminal,
The continuity of individual ledger tree data is verified by Hash calculation.
15. the transfer transaction method based on Merkle tree backtracking location technology, it is characterised in that: walked including following money transfer transactions
It is rapid:
S31. depositor A is transferred accounts by issuing transfer to bank center to depositor B；
S32. bank center generates transfer information simultaneously for transfer information receipt depositor A；
S33. transfer result information is sent to depositor B by bank center.
16. the transfer transaction method as claimed in claim 15 based on Merkle tree backtracking location technology, it is characterised in that:
The transfer includes: the account and transfer amounts, request time, remark information and depositor's A private key pair of depositor A
The digital signature of this transaction；
The transfer information includes: account balance, the depositor A of depositor A after the completion of transfer, book keeping operation time, transaction
The digital signature that individual ledger root vertex and the private key of bank center trade to this；
The transfer result information includes: transfer, book keeping operation time, the account balance of depositor B, depositor after the completion of transaction
The digital signature that the individual ledger root vertex of B and the private key of bank center trade to this.
17. the transfer transaction method as claimed in claim 15 based on Merkle tree backtracking location technology, it is characterised in that: with
The generation of the money transfer transactions, further include system general ledger tree, system ledger tree and individual ledger tree data it is synchronous more
Newly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910133066.0A CN109919756B (en) | 2019-02-22 | 2019-02-22 | Transfer system, checking method and transaction method based on Merkle tree backtracking positioning technology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910133066.0A CN109919756B (en) | 2019-02-22 | 2019-02-22 | Transfer system, checking method and transaction method based on Merkle tree backtracking positioning technology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109919756A true CN109919756A (en) | 2019-06-21 |
| CN109919756B CN109919756B (en) | 2023-04-18 |
Family
ID=66961876
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910133066.0A Active CN109919756B (en) | 2019-02-22 | 2019-02-22 | Transfer system, checking method and transaction method based on Merkle tree backtracking positioning technology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109919756B (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110334154A (en) * | 2019-06-28 | 2019-10-15 | 阿里巴巴集团控股有限公司 | Based on the classification storage method and device of block chain, electronic equipment |
| CN110471795A (en) * | 2019-07-31 | 2019-11-19 | 阿里巴巴集团控股有限公司 | Block chain state data reconstruction method and device, electronic equipment |
| CN110688377A (en) * | 2019-08-30 | 2020-01-14 | 阿里巴巴集团控股有限公司 | Method and device for updating state Merck tree |
| CN111008836A (en) * | 2019-11-15 | 2020-04-14 | 哈尔滨工业大学（深圳） | Privacy safe transfer payment method, device and system based on monitorable block chain and storage medium |
| CN111460000A (en) * | 2020-03-27 | 2020-07-28 | 谭凌 | Backtracking data query method and system based on relational database |
| CN111488606A (en) * | 2020-04-08 | 2020-08-04 | 北京瑞策科技有限公司 | Data sharing method and device based on service data block chain |
| US10761948B1 (en) | 2019-07-13 | 2020-09-01 | Alibaba Group Holding Limited | Method, apparatus, and electronic device for restoring state data of blockchain |
| CN111640018A (en) * | 2020-05-06 | 2020-09-08 | 深圳前海微众银行股份有限公司 | Block chain transaction existence verification method and device |
| US10789222B2 (en) | 2019-06-28 | 2020-09-29 | Alibaba Group Holding Limited | Blockchain-based hierarchical data storage |
| CN112286963A (en) * | 2020-11-17 | 2021-01-29 | 北京物资学院 | Trusted inquiry system for block chain terminal data and implementation method thereof |
| US10992459B2 (en) | 2019-08-30 | 2021-04-27 | Advanced New Technologies Co., Ltd. | Updating a state Merkle tree |
| CN112887421A (en) * | 2019-07-31 | 2021-06-01 | 创新先进技术有限公司 | Block chain state data synchronization method and device and electronic equipment |
| US11036720B2 (en) | 2019-06-28 | 2021-06-15 | Advanced New Technologies Co., Ltd. | Blockchain-based hierarchical data storage |
| WO2022033284A1 (en) * | 2020-08-10 | 2022-02-17 | 山西特信环宇信息技术有限公司 | Cone block, and cone blockchain structure and method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106302720A (en) * | 2016-08-13 | 2017-01-04 | 深圳市樊溪电子有限公司 | A kind of for block chain Survivable storage system and method |
| CN107248074A (en) * | 2017-03-29 | 2017-10-13 | 阿里巴巴集团控股有限公司 | A kind of method for processing business and equipment based on block chain |
| CN107705113A (en) * | 2017-09-06 | 2018-02-16 | 浙江大学 | A kind of cross-border inter-bank method of payment of block chain based on Baas frameworks and system |
| CN109033841A (en) * | 2018-07-12 | 2018-12-18 | 杨城 | It is a kind of to write the weak center's trusted data storage system and management method for testing separation |
| CN109347651A (en) * | 2018-08-27 | 2019-02-15 | 西安电子科技大学 | The method and system of block catenary system modeling and security verification based on MSVL |
-
2019
- 2019-02-22 CN CN201910133066.0A patent/CN109919756B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106302720A (en) * | 2016-08-13 | 2017-01-04 | 深圳市樊溪电子有限公司 | A kind of for block chain Survivable storage system and method |
| CN107248074A (en) * | 2017-03-29 | 2017-10-13 | 阿里巴巴集团控股有限公司 | A kind of method for processing business and equipment based on block chain |
| CN107705113A (en) * | 2017-09-06 | 2018-02-16 | 浙江大学 | A kind of cross-border inter-bank method of payment of block chain based on Baas frameworks and system |
| CN109033841A (en) * | 2018-07-12 | 2018-12-18 | 杨城 | It is a kind of to write the weak center's trusted data storage system and management method for testing separation |
| CN109347651A (en) * | 2018-08-27 | 2019-02-15 | 西安电子科技大学 | The method and system of block catenary system modeling and security verification based on MSVL |
Non-Patent Citations (2)
| Title |
|---|
| 牟佳琳等: "面向会计信任危机的区块链技术简析", 《中国管理信息化》 * |
| 王刚等: "信息质量视角下区块链技术在企业会计领域的应用探析", 《财务与会计》 * |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11386054B2 (en) | 2019-06-28 | 2022-07-12 | Advanced New Technologies Co., Ltd. | Blockchain-based hierarchical data storage |
| US11042518B2 (en) | 2019-06-28 | 2021-06-22 | Advanced New Technologies Co., Ltd. | Blockchain-based hierarchical data storage |
| US11036720B2 (en) | 2019-06-28 | 2021-06-15 | Advanced New Technologies Co., Ltd. | Blockchain-based hierarchical data storage |
| CN110334154B (en) * | 2019-06-28 | 2020-07-21 | 阿里巴巴集团控股有限公司 | Block chain based hierarchical storage method and device and electronic equipment |
| CN110334154A (en) * | 2019-06-28 | 2019-10-15 | 阿里巴巴集团控股有限公司 | Based on the classification storage method and device of block chain, electronic equipment |
| US10789222B2 (en) | 2019-06-28 | 2020-09-29 | Alibaba Group Holding Limited | Blockchain-based hierarchical data storage |
| US10761948B1 (en) | 2019-07-13 | 2020-09-01 | Alibaba Group Holding Limited | Method, apparatus, and electronic device for restoring state data of blockchain |
| CN112887421A (en) * | 2019-07-31 | 2021-06-01 | 创新先进技术有限公司 | Block chain state data synchronization method and device and electronic equipment |
| CN110471795A (en) * | 2019-07-31 | 2019-11-19 | 阿里巴巴集团控股有限公司 | Block chain state data reconstruction method and device, electronic equipment |
| CN112887421B (en) * | 2019-07-31 | 2023-07-18 | 创新先进技术有限公司 | Block chain state data synchronization method and device and electronic equipment |
| CN110471795B (en) * | 2019-07-31 | 2020-10-02 | 阿里巴巴集团控股有限公司 | Block chain state data recovery method and device and electronic equipment |
| CN110688377A (en) * | 2019-08-30 | 2020-01-14 | 阿里巴巴集团控股有限公司 | Method and device for updating state Merck tree |
| US10992459B2 (en) | 2019-08-30 | 2021-04-27 | Advanced New Technologies Co., Ltd. | Updating a state Merkle tree |
| CN111008836A (en) * | 2019-11-15 | 2020-04-14 | 哈尔滨工业大学（深圳） | Privacy safe transfer payment method, device and system based on monitorable block chain and storage medium |
| CN111460000A (en) * | 2020-03-27 | 2020-07-28 | 谭凌 | Backtracking data query method and system based on relational database |
| CN111460000B (en) * | 2020-03-27 | 2021-01-12 | 谭凌 | Backtracking data query method and system based on relational database |
| CN111488606B (en) * | 2020-04-08 | 2021-04-27 | 北京瑞策科技有限公司 | Data sharing method and device based on service data block chain |
| CN111488606A (en) * | 2020-04-08 | 2020-08-04 | 北京瑞策科技有限公司 | Data sharing method and device based on service data block chain |
| CN111640018A (en) * | 2020-05-06 | 2020-09-08 | 深圳前海微众银行股份有限公司 | Block chain transaction existence verification method and device |
| WO2022033284A1 (en) * | 2020-08-10 | 2022-02-17 | 山西特信环宇信息技术有限公司 | Cone block, and cone blockchain structure and method |
| CN112286963A (en) * | 2020-11-17 | 2021-01-29 | 北京物资学院 | Trusted inquiry system for block chain terminal data and implementation method thereof |
| CN112286963B (en) * | 2020-11-17 | 2023-05-26 | 北京物资学院 | Block chain terminal data credible query system and implementation method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109919756B (en) | 2023-04-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109919756A (en) | Fund transfer system, checking method and method of commerce based on Merkle tree backtracking location technology | |
| US11669811B2 (en) | Blockchain-based digital token utilization | |
| CN106530088B (en) | Method for trading certificate products based on blockchain security nodes | |
| Singh et al. | Blockchain: Future of financial and cyber security | |
| CN109903026A (en) | Event-handling method and device, electronic equipment based on block chain | |
| CN107688944A (en) | A kind of power system method of commerce based on block chain | |
| CN110741372A (en) | Computer-implemented system and method for managing transactions on a blockchain network | |
| CN108881163A (en) | A kind of multicenter block catenary system with block issue mechanism | |
| CN109903027A (en) | Event-handling method and device, electronic equipment based on block chain | |
| CN106875165A (en) | A kind of common recognition algorithm of utilization software defined network optimization | |
| CN109447807A (en) | The weak center's trust data management system and method for the total score double-strand of digital bank | |
| CN110288480A (en) | A kind of Private transaction method and device of block chain | |
| Taskinsoy | Bitcoin could be the first cryptocurrency to reach a market capitalization of one trillion dollars | |
| CN106504085A (en) | A kind of DVP settlement methods based on block chain technology | |
| CN110162527A (en) | A kind of business source tracing method, device and electronic equipment based on block chain | |
| CN106909852A (en) | Intelligent contract encryption method and device based on triple md5 encryption algorithms | |
| CN108009818A (en) | A kind of on-line payment method and system based on distributed network | |
| CN110490733A (en) | A kind of stock trading method and system based on block chain | |
| CN112801778A (en) | Federated bad asset blockchain | |
| Mamunts et al. | The use of authentication technology blockchain platform for the marine industry | |
| CN111861440A (en) | Bank transfer method and system based on block chain network | |
| Hameed | Blockchain and Cryptocurrencies Technology: a survey | |
| Swati et al. | Application of blockchain technology in travel industry | |
| Dogo et al. | Blockchain 3.0: Towards a secure ballotcoin democracy through a digitized public ledger in developing countries | |
| Khangura et al. | A study on security threats to blockchain & cryptocurrencies |
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 |