CN111724168A - Transaction verification method and device based on block chain, electronic equipment and medium - Google Patents
Transaction verification method and device based on block chain, electronic equipment and medium Download PDFInfo
- Publication number
- CN111724168A CN111724168A CN202010583395.8A CN202010583395A CN111724168A CN 111724168 A CN111724168 A CN 111724168A CN 202010583395 A CN202010583395 A CN 202010583395A CN 111724168 A CN111724168 A CN 111724168A
- Authority
- CN
- China
- Prior art keywords
- dotting
- information
- current
- decentralized application
- application end
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
- G06Q20/401—Transaction verification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3825—Use of electronic signatures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3827—Use of message hashing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Computer Security & Cryptography (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present disclosure provides a transaction verification method based on a block chain, which is applied to a decentralized application terminal, and the method includes: responding to disconnection between the decentralized application end and the block chain, acquiring latest time mark information from the block chain, generating initial dotting information based on the time mark information, sequentially performing dotting processing based on the initial dotting information, wherein each time of dotting processing is performed, generating one dotting information, the dotting information comprises dotting information generated by previous dotting and dotting time information of the dotting, responding to transaction connection between the decentralized application end and another decentralized application end, acquiring current dotting information corresponding to the current time, and sending the current dotting information to the another decentralized application end so that the another decentralized application end can verify the current dotting information.
Description
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a transaction verification method and apparatus based on a blockchain, an electronic device, and a computer-readable medium.
Background
The block chain is a distributed account book technology and has the characteristics of decentralization, no tampering, traceability and the like. Current public chain products, such as bitcoin or ether house, use block storage and encryption tagging to ensure that public chain based Decentralized Application (DApp) ends cannot double spend on digital assets within themselves.
However, in the course of implementing the inventive concept, the inventors found that at least the following problems existed in the related art: when DApp is used based on the federation chain technology, digital assets issued by the federation chain will be circulated between potentially off-network DApp terminals, and the digital assets circulated between the DApp terminals are at risk of being illegally copied.
Disclosure of Invention
In view of the above, in order to solve the problem that after the digital assets are exported from the DApp, the digital assets in the DApp may be copied and reused due to artificial data recovery, the present disclosure provides a transaction verification method, an apparatus, an electronic device, and a computer-readable medium based on a blockchain.
One aspect of the present disclosure provides a transaction verification method based on a blockchain, applied to a decentralized application side, the method including: responding to disconnection between the decentralized application end and the block chain, acquiring latest time mark information from the block chain, generating initial dotting information based on the time mark information, sequentially performing dotting processing based on the initial dotting information, wherein each time of dotting processing is performed, generating one dotting information, the dotting information comprises dotting information generated by previous dotting and dotting time information of the dotting, responding to transaction connection between the decentralized application end and another decentralized application end, acquiring current dotting information corresponding to the current time, and sending the current dotting information to the another decentralized application end so that the another decentralized application end can verify the current dotting information.
Another aspect of the present disclosure provides a transaction verification apparatus based on a blockchain, which is applied to a decentralized application terminal, and the apparatus includes a first obtaining module, a generating module, a processing module, a second obtaining module, and a sending module. The first obtaining module is configured to obtain latest timestamp information from the blockchain in response to the decentralized application disconnecting from the blockchain. And the generating module is used for generating initial dotting information based on the time scale information. The processing module is used for sequentially carrying out dotting processing on the basis of the initial dotting information, wherein each time of dotting processing is carried out, one piece of dotting information is generated, and the dotting information comprises the dotting information generated by previous dotting and the dotting time information of the dotting. The second obtaining module is used for responding to the transaction connection established between the decentralized application end and the other decentralized application end and obtaining the current dotting information corresponding to the current moment. And the sending module is used for sending the current dotting information to the other decentralized application end so that the other decentralized application end can verify the current dotting information.
Another aspect of the present disclosure provides an electronic device including: one or more processors, a memory to store one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method as described above.
Another aspect of the disclosure provides a computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to implement the method as described above.
Another aspect of the disclosure provides a computer program comprising computer executable instructions for implementing the method as described above when executed.
The block chain of the embodiment of the present disclosure may send time stamp information to the decentralized application terminal every heartbeat connection with the decentralized application terminal. And when the decentralized application terminal is disconnected with the block chain, acquiring the time mark information sent from the last time of the block chain as the off-network time mark information. The decentralized application end can generate initial dotting information based on the time scale information, and then sequentially perform dotting processing based on the initial dotting information, wherein each time of dotting processing is performed, one piece of dotting information is generated, and the dotting information comprises dotting information generated by previous dotting and dotting time information of the dotting. When the decentralized application end establishes transaction connection with another decentralized application end, current dotting information corresponding to the current moment can be obtained, and the current dotting information is sent to the other decentralized application end, so that the other decentralized application end can verify the current dotting information, if the verification is not passed, the transaction can be forbidden, and therefore the network breaking time mark information of the decentralized application end can not be changed, and the decentralized application end can not perform data recovery during the network breaking period. The embodiment of the disclosure can enable both trading parties to trade even if the network is disconnected, and does not need to worry that the digital assets circulated in each trading node are recovered after being paid and then used for repeated payment, thereby providing safety guarantee for building nodes capable of circulating the digital assets for a alliance chain.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:
FIG. 1 schematically illustrates an exemplary application scenario in which a transaction verification method may be applied, according to an embodiment of the present disclosure;
FIG. 2 schematically illustrates a flow diagram of a blockchain based transaction verification method according to an embodiment of the present disclosure;
FIG. 3 schematically illustrates a block diagram of a blockchain based transaction verification device according to an embodiment of the present disclosure; and
FIG. 4 schematically illustrates a block diagram of an electronic device suitable for implementing a business transaction method in accordance with an embodiment of the disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
The embodiment of the disclosure provides a transaction verification method and device based on a block chain, which are applied to a decentralized application terminal. The method comprises the following steps: and responding to the disconnection of the decentralized application end and the block chain, acquiring the latest time scale information from the block chain, and generating initial dotting information based on the time scale information. However, on the basis of the initial dotting information, dotting processing is performed in sequence, wherein each time dotting processing is performed, one piece of dotting information is generated, and the dotting information includes the dotting information generated by the previous dotting and the dotting time information of the dotting. When the decentralized application end establishes transaction connection with another decentralized application end, current dotting information corresponding to the current moment is obtained, and the current dotting information is sent to the other decentralized application end, so that the other decentralized application end can verify the current dotting information.
Fig. 1 schematically illustrates an exemplary application scenario 100 in which a transaction verification method may be applied according to an embodiment of the present disclosure.
It should be noted that fig. 1 is only an example of an application scenario in which the transaction verification method of the embodiment of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, but does not mean that the embodiment of the present disclosure may not be applied to other devices, systems, environments or scenarios.
As shown in fig. 1, an application scenario 100 of an embodiment of the present disclosure may include a federation chain end 110 and a plurality of decentralized application ends (DApp ends) 120.
According to an embodiment of the present disclosure, the decentralized application 120 may be, for example, various electronic devices having a display screen and supporting network connectivity, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like. The decentralized application 120 may have installed therein, for example, a client application based on the federation chain 110, which may be, for example, a decentralized application based on the federation chain 110.
In the disclosed embodiment, the federation chain 110 can act as an issuer of digital assets for issuing value. Decentralized application 120 may act as a node for delivering value. For example, digital assets are published on the federation chain 110 and then forwarded to the decentralized applications 120, and each decentralized application 120 may use the digital assets published by the federation chain 110 as a medium for transactions during the course of transactions so that the digital assets can be circulated between each decentralized application 120.
However, after the decentralized application 120 exports the digital assets, the data may be artificially recovered, so that the digital assets in the decentralized application 120 are duplicated and reused.
In view of this, the disclosed embodiments provide a transaction verification method. Federation chain 110 may send timestamp information to decentralized application 120 on each heartbeat connection with decentralized application 120. When the decentralized application 120 is disconnected from the federation chain 110, the time stamp information sent from the last time of the federation chain 110 is obtained as the offline time stamp information. The decentralized application 120 may generate initial dotting information based on the time scale information, and then sequentially perform dotting processing based on the initial dotting information, where each time of dotting processing is performed, a piece of dotting information is generated, and the dotting information includes dotting information generated by previous dotting and dotting time information of the previous dotting. When the decentralized application end 120 establishes a transaction connection with another decentralized application end, current dotting information corresponding to the current time can be acquired, and the current dotting information is sent to the other decentralized application end, so that the other decentralized application end can verify the current dotting information, if the verification fails, the transaction can be prohibited, and therefore it can be ensured that the decentralized application end cannot change the network breaking time mark information, and therefore it is ensured that the decentralized application end cannot perform data recovery during the network breaking period, otherwise, the transaction is not allowed.
It should be noted that the transaction verification method provided by the embodiment of the present disclosure may be generally executed by the decentralized application 120. Accordingly, the transaction verification device provided by the embodiment of the present disclosure may be generally disposed in the decentralized application 120. The transaction verification method provided by the embodiments of the present disclosure may also be performed by a server or a server cluster different from the decentralized application 120 and capable of communicating with the decentralized application 120 and/or the federation chain 110. Accordingly, the transaction verification device provided by the embodiment of the present disclosure may also be disposed in a server or a server cluster different from the decentralized application 120 and capable of communicating with the decentralized application 120 and/or the federation chain 110.
It should be understood that the number of decentralized application and federation chains in FIG. 1 is merely illustrative. There may be any number of decentralized applications and federation chains, as desired for the implementation.
Fig. 2 schematically illustrates a flow chart of a blockchain based transaction verification method according to an embodiment of the present disclosure.
The transaction verification method based on the blockchain provided by the embodiment of the disclosure can be applied to a decentralized application terminal, for example. In the disclosed embodiments, the decentralized application may be, for example, various electronic devices having a display screen and supporting network connectivity, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like. For example, a client application based on a block chain may be installed in the decentralized application terminal, and the client application may be, for example, a decentralized application based on a block chain. For example, the user may download a client application of the DApp using the terminal device and complete the registration.
According to an embodiment of the present disclosure, the blockchain may be, for example, a federation chain, and each decentralized application may be, for example, a decentralized application based on the federation chain. For example, a federation chain may be used to publish digital assets, and transactions between decentralized applications may be based on the digital assets published by the federation chain.
As shown in fig. 2, the method includes operations S201 to S205.
In operation S201, last time stamp information from the blockchain is obtained in response to the decentralized application disconnecting from the blockchain.
According to the embodiment of the disclosure, off-line transaction can be realized by the decentralized application ends, and the transaction between the decentralized application ends is independent from the block chain. For example, a decentralized application may implement transactions with other decentralized applications while disconnected from the blockchain. Namely, transaction communication independent of the block chain can be realized between decentralized application terminals.
In the embodiment of the present disclosure, the decentralized application may receive the timestamp information from the blockchain through the heartbeat connection with the blockchain during the connection with the blockchain. For example, the blockchain may send timestamp information to the decentralized application along with the heartbeat information each time the heartbeat is connected. The timestamp information (AS) may be, for example, timestamp information of the block chain at the time.
According to the embodiment of the disclosure, in response to disconnection between the decentralized application terminal and the block chain, time scale information sent by the block chain last time can be acquired as the network disconnection time of the decentralized application terminal and the block chain.
In the embodiment of the present disclosure, for security assurance, the blockchain may perform signature processing on the time stamp information through a private key. And the decentralized application verifies the received time mark information and stores the time mark information under the condition of determining that the time mark information is the time mark information sent by the block chain.
According to the embodiment of the present disclosure, acquiring the timestamp information of the last time from the block chain may be acquiring a timestamp random table of the last time from the block chain, where the timestamp information is included in the timestamp random table.
For example, to further enhance security verification, the blockchain may send a random table of timestamps to the decentralized application with each heartbeat connection. The random table of timestamps may include:
1) time stamp information. The timestamp information may be a timestamp of when the block chain transmitted the timestamp random table. The blockchain may also tag the timestamp information with a key, so that the decentralized application may determine whether the timestamp information is from the blockchain by checking the tag. The decentralized application end can use the time mark information sent from the last time of the block chain as the network breaking time of the decentralized application end and the block chain.
2) And (4) a random number table. The blockchain may design a set of random number tables for each date, e.g., 1000 random numbers per day. The random number table may include a random number and a random number corresponding to the random number. The blockchain may also tag the random number table with a key so that the decentralized application may determine whether the random number table is from the blockchain by checking the tag.
3) And validity period information. According to the embodiment of the disclosure, the validity period information may include the validity period of the random number table of the timestamp random table, and may also include the validity period of the random number table in the random number table of the timestamp random table. If the validity period is exceeded, no offline transactions can be conducted. The period of the validity period may be set according to different user levels.
According to the embodiment of the disclosure, the timestamp random table may further include a signature of the block chain on the balance information of the decentralized application terminal. The content in the random table of the timestamp is not limited in the embodiment of the disclosure, and the embodiment of the disclosure only needs to obtain the time information from the block chain, so that the network breaking time is determined based on the time information from the block chain, and a person skilled in the art can set the content contained in the random table of the timestamp according to the actual safety requirement.
In an embodiment of the disclosure, the blockchain may use a private key to tag the random table of timestamps. The decentralized application terminal can check the signature of the random timing mark table through a public key agreed in advance, and the random timing mark table can be stored locally after the signature passes.
The method and the device for determining the network disconnection time of the decentralized application end and the block chain are determined through the latest time scale information from the block chain. It can be understood that the network break time is information from the block chain side, and the problem of inaccurate network break time caused by artificial copy of the decentralized application end can be avoided.
In operation S202, initial dotting information is generated based on the time stamp information.
According to the embodiment of the present disclosure, a hash value of the timestamp information may be calculated, and the hash value is used as the initial dotting information S0.
In the embodiment of the present disclosure, in order to enhance security, the initial dotting information may be generated based on the time scale information, the random number extracted from the random number table, and the layer height of the current dotting information. For example, S0 is hash (t0+ r + lv), where S0 represents initial dotting information, t0 represents time stamp information, r represents a random number generated in a range of a random number table, a corresponding random number (a hash value may be calculated based on the random number corresponding to the random number) may be read from the random number, lv represents a current layer height, and lv may be 0, for example, and dotting is performed sequentially from the 0 th layer.
In operation S203, dotting processing is sequentially performed based on the initial dotting information, where each dotting processing is performed to generate one piece of dotting information, and the dotting information includes the dotting information generated by the previous dotting and the dotting time information of the current dotting.
According to the embodiment of the present disclosure, the following operations may be performed for each dotting process: and acquiring dotting information generated by previous dotting, extracting a random number from the random number table, and generating the dotting information of the current dotting based on the dotting information generated by the previous dotting, the random number extracted from the random number table, the dotting time information of the current dotting and the layer height of the current dotting information.
For example, Sn ═ hash (S (n-1) + ts + r + lv), where Sn denotes dotting information corresponding to the nth dotting; s (n-1) represents dotting information corresponding to the (n-1) th dotting; ts represents a timestamp character string at the time of the dotting time t corresponding to the nth dotting, the time interval of successful transaction setting in each transaction is st, and t is less than st; r represents that at the time t, a random serial number is generated in the range of the random number table, and the corresponding random number can be read according to the random requirement, wherein the random number is invisible to the application layer; lv denotes the layer height of the current block.
In the embodiment of the present disclosure, dotting may be performed once at preset time intervals. For example, dotting is performed every 5 seconds.
According to the embodiment of the disclosure, S0-S1-S2-S3- … -Sn can be stored in a block chain manner to form a compressed data packet bp (block chain zip packet). The information of each block includes: hash of the previous block, the timestamp, the random number, and the current layer height.
In the embodiment of the present disclosure, in order to ensure that part of data of each decentralized application end is not recoverable, the decentralized application end may periodically calculate a piece of dotting information, and use a block chain storage manner for the dotting information. The calculation process is generated by the decentralized application-side core code mandatory interval. The block time is not more than the time for successfully confirming the off-line transaction. The out-of-block computation is performed by an independent thread in the decentralized application-side process.
In operation S204, in response to the decentralized application establishing a transaction connection with another decentralized application, current dotting information corresponding to the current time is obtained.
According to the embodiment of the disclosure, after the transaction connection is established between the two transaction parties, the current dotting information corresponding to the current time of the own party can be acquired, so that the current dotting information can be sent to the other party for verification.
In operation S205, the current dotting information is sent to another decentralized application terminal, so that the other decentralized application terminal verifies the current dotting information.
According to the embodiment of the disclosure, in order to improve data security and increase verification difficulty, the latest time scale information from the block chain, the current time stamp of the decentralized application end and the current dotting information may be sent to another decentralized application end, so that the other decentralized application end verifies the current dotting information based on the latest time scale information from the block chain and the current time stamp of the decentralized application end.
According to the embodiment of the disclosure, the current dotting information from another decentralized application terminal can be received, the current dotting information is verified, and the transaction between the decentralized application terminal and another decentralized application terminal is executed under the condition that the verification of the current dotting information is passed.
In the embodiment of the disclosure, the two transaction parties can mutually check the current dotting information of the other party, and if the current dotting information of one party does not pass, the transaction cannot be carried out.
In an embodiment of the present disclosure, the layer height corresponding to the current dotting information may be checked based on the latest timestamp information and the current timestamp from the block chain.
For example, the number of dotting layers that should exist in the time difference between the disconnection point and the verification time of the partner may be calculated, and if the number of dotting layers does not match the number of dotting layers, the verification fails. For example, the dotting processing is performed every 5s, the network disconnection time with the block chain is 0:00, the current timestamp is 0:01, there should be 12 dotting information, and the layer height corresponding to the current dotting information should be 12 layers. The two parties of the transaction can verify whether the current dotting information is accurate or not by verifying the layer height of the current dotting information of the other party.
It can be understood that if the data is artificially restored by the decentralized application, the corresponding disconnection time with the blockchain will also change, and the dotting information will be different from that of the normal network disconnection. Therefore, the dotting processing can be sequentially performed in response to disconnection between the decentralized application end and the blockchain, and if the user artificially recovers the data, the dotting information verification cannot be passed and the transaction cannot be performed, so that the asset safety of each user can be ensured.
In another embodiment of the present disclosure, the current dotting information may also be analyzed to obtain a plurality of dotting information, and whether the plurality of dotting information are linked with each other is verified. For example, the dotting information sent by the other party can be counted from beginning to end, and if the collusion disagrees, the verification fails.
According to the embodiment of the present disclosure, sending the current dotting information to another decentralized application terminal may further include: and sending the latest time mark random table (which can comprise time mark information, a random number table, a validity period and the like) from the block chain, the current time stamp of the decentralized application end, the current dotting information, the random number generated by the decentralized application end and the identity information of the decentralized application end to the other decentralized application end.
For example, two parties to a transaction may exchange authentication packets with each other. For example, the parties to a transaction may exchange point-in-time signature packets with each other when both parties to the transaction are disconnected from the blockchain. The verification packet may include:
1) timestamp information (AS) from the last time of the block chain.
2) The random number sequence number used by the self and the corresponding random number.
3) The network breaking time information of the own party, and the time is matched with the time analyzed from the AS.
4) The own party generates a random number K by itself.
5) Own current timestamp T.
6) Validity period information V from a block chain time stamp random Table (TR).
7) The random number N of the day from the random number table of the block chain.
8) And the random number R corresponds to the random number N of the current day from the random number table of the block chain.
9) Signature S of the nonce table from the nonce table of the blockchain.
10) Own node ID.
11) Own current dotting information D0(D0 ═ Sn, Sn denotes current dotting information).
12) The self side calculates a time point hash value D by using the private key of the self node, that is, D ═ hash (D0+ AS + LS + K + T + V + N + R + S + ID), where LS represents the time stamp signature of the block chain to the time stamp information AS.
13) And the other party adds the label value M to the D.
14) Own public key Y.
It can be understood that the content in the verification data packet is not limited in the embodiments of the present disclosure, and those skilled in the art can set the verification data packet according to actual security requirements.
In an embodiment of the present disclosure, both parties of the transaction can verify the validity period of the random table of the timestamp. For example, the random timing tables of the two parties to the transaction may be validated for a finite period of time, and if one of the two parties fails validation, the transaction between the two parties is prohibited. For example, whether the current time of the own party is within the valid period of the random table of the time scale provided by the block chain is verified, if not, the verification fails, and the own node cannot perform the offline transaction. And whether the current time of the opposite side is in the period of validity of the random table of the time mark provided by the block chain can be verified, if not, the verification fails, and the opposite side node does not deal with the current time.
In another embodiment of the present disclosure, the two parties of the transaction may also verify the validity period of the random number table in the time-stamped random table. For example, if the random number table generates one thousand random numbers per day, and the random numbers generated per day are different, the validity period of one random number table is one day. For example, the random number tables of both parties to the transaction may be validated for a limited period of time, and if one of the parties fails validation, the transaction between the parties to the transaction is prohibited.
In yet another embodiment of the present disclosure, the two parties of the transaction may also verify the timestamp information in the random timestamp table. For example, whether the random table of the timestamp sent by the other party is a signature with a block chain can be verified in a signature verification mode, and if not, the transaction between the two parties is prohibited. Or, whether the timestamp information in the timestamp random table sent by the other party has the signature of the block chain can be verified in a signature verification mode, and if the timestamp information does not have the signature of the block chain, the transaction between the two parties is prohibited. For example, the public key Akey provided by the blockchain may be used to verify the last timestamp signature LS provided by the blockchain, and if the verification fails, the transaction process cannot be continued.
In yet another embodiment of the present disclosure, the current timestamp may also be verified. For example, whether the time difference between the current timestamp from the other party and the current timestamp of the own party meets a preset condition is verified, and if not, the transaction between the two parties is prohibited. For example, if the timestamp of the other party differs from the timestamp of the own party by more than 5 seconds (this parameter may be defined by the system level), the verification fails.
In another embodiment of the present disclosure, the random number generated by the other party and the identity information of the other party can also be verified. For example, the value of the time point hash value D may be recalculated based on information provided by the other party, and if the recalculated time point hash value matches the time point hash value provided by the other party, the verification is passed. For example, according to the random number N of the block chain TR table provided by the opposite party, the random number R corresponding to the current day is found in the TR table of the own party, the time point hash value D of the opposite party is calculated by combining the AS, LS, K, T, V, S, and ID provided by the opposite party, and the M provided by the opposite party is decrypted by using the public key Y of the opposite party to obtain D1, and if the recalculated D is equal to the decrypted D1, the verification is passed.
In yet another embodiment of the present disclosure, the random number table content may also be verified. For example, if the current-day random number N provided by the partner does not exist in the random number N provided by the partner for its use and the corresponding random number, the authentication fails.
It is to be understood that the present disclosure does not limit the relationship between the verification content and whether the transaction is allowed. For example, in a scenario with high security, if there is a failure in the verification content in the above example, the two parties are prohibited from performing a transaction. For another example, in a scenario with low security, if the current point information is verified, both parties may be allowed to perform a transaction. For another example, in a scenario with moderate security, if the current dotting information passes verification and the current timestamp passes verification, the two parties may be allowed to perform a transaction.
According to the embodiment of the disclosure, the latest time scale information is acquired from the block link end to serve as the network disconnection time, so that the network disconnection time of official certification can be acquired, and the accuracy is higher. In response to the disconnection between the decentralized application end and the block chain, the disclosed embodiment starts to perform nested dotting in sequence based on the time scale information sent by the block chain until the transaction connection is established, and then obtains the current dotting information for the verification of the other party. According to the method and the device, the dotting information of the other party is mutually verified, the situation that both parties of a transaction are artificially recovered is avoided, if the both parties of the transaction are artificially recovered, the dotting information verification is not passed, the transaction cannot be carried out, and the asset safety can be ensured.
In order to further improve the transaction security, the two transaction parties can provide more verification information for the verification of the other party. E.g., a random list of timestamps from the federation chain along with the validity period of the list, the current timestamp, etc.
The embodiment of the disclosure can enable both trading parties to trade even if the network is disconnected, and does not need to worry that the digital assets circulated in each trading node are recovered after being paid and then used for repeated payment, thereby providing safety guarantee for building nodes capable of circulating the digital assets for a alliance chain.
Fig. 3 schematically illustrates a block diagram of a blockchain based transaction verification device 300 according to an embodiment of the present disclosure.
As shown in fig. 3, the apparatus 300 may include a first obtaining module 310, a generating module 320, a processing module 330, a second obtaining module 340, and a sending module 350.
The first obtaining module 310 is configured to obtain timestamp information of a last time from the blockchain in response to the decentralized application disconnecting from the blockchain. According to the embodiment of the present disclosure, the first obtaining module 310 may, for example, perform operation S201 described above with reference to fig. 2, which is not described herein again.
The generating module 320 is configured to generate initial dotting information based on the timestamp information. According to the embodiment of the present disclosure, the generating module 320 may, for example, perform the operation S202 described above with reference to fig. 2, which is not described herein again.
The processing module 330 is configured to perform dotting processing in sequence based on the initial dotting information, where each time dotting processing is performed, one piece of dotting information is generated, and the dotting information includes dotting information generated by previous dotting and dotting time information of the previous dotting. According to the embodiment of the present disclosure, the processing module 330 may, for example, perform operation S203 described above with reference to fig. 2, which is not described herein again.
The second obtaining module 340 is configured to, in response to the decentralized application terminal establishing a transaction connection with another decentralized application terminal, obtain current dotting information corresponding to a current time. According to the embodiment of the present disclosure, the second obtaining module 340 may, for example, perform the operation S204 described above with reference to fig. 2, which is not described herein again.
The sending module 350 is configured to send the current dotting information to the another decentralized application end, so that the another decentralized application end verifies the current dotting information. According to the embodiment of the present disclosure, the sending module 350 may, for example, perform the operation S205 described above with reference to fig. 2, which is not described herein again.
The apparatus 300 further includes a receiving module, a verifying module, and an executing module (not shown in the figure), according to an embodiment of the present disclosure. And the receiving module is used for receiving the current dotting information from the other decentralized application end. And the verification module is used for verifying the current dotting information. The execution module is used for executing the transaction between the decentralized application end and the other decentralized application end under the condition that the current dotting information is verified to pass.
According to an embodiment of the present disclosure, the decentralized application receives time scale information from the blockchain through a heartbeat connection with the blockchain.
According to an embodiment of the present disclosure, successively performing dotting processing based on the initial dotting information includes: and dotting once at preset time intervals.
According to an embodiment of the present disclosure, the obtaining time stamp information of the last time from the block chain includes: and acquiring a latest time mark random table from the block chain, wherein the time mark random table comprises the time mark information, the time mark random table also comprises validity period information and a random number table, and the random number table comprises a random number and a random number corresponding to the random number.
According to an embodiment of the present disclosure, generating initial dotting information based on the time scale information includes: and generating initial dotting information based on the time scale information, the random serial number extracted from the random number table and the layer height of the current dotting information.
According to an embodiment of the present disclosure, successively performing dotting processing based on the initial dotting information includes: the following operations are performed for each dotting process: obtaining dotting information generated by previous dotting, extracting a random serial number from the random number table, and generating the dotting information of the current dotting based on the dotting information generated by the previous dotting, the random serial number extracted from the random number table, the dotting time information of the current dotting and the layer height of the current dotting information.
According to an embodiment of the present disclosure, the sending module is further configured to: and sending the latest time stamp information from the block chain, the current time stamp of the decentralized application end and the current dotting information to the other decentralized application end, so that the other decentralized application end can verify the current dotting information based on the latest time stamp information from the block chain and the current time stamp of the decentralized application end.
According to an embodiment of the present disclosure, the verifying the current dotting information includes: and checking the layer height corresponding to the current dotting information based on the latest time stamp information from the block chain and the current time stamp.
According to an embodiment of the present disclosure, the verifying the current dotting information includes: analyzing the current dotting information to obtain a plurality of dotting information, and checking whether the plurality of dotting information are linked.
According to an embodiment of the present disclosure, the sending module is further configured to: and sending the latest time scale random table from the block chain, the current time stamp of the decentralized application end, the current dotting information, the random number generated by the decentralized application end and the identity information of the decentralized application end to the other decentralized application end.
According to an embodiment of the present disclosure, the verification module is further configured to perform at least one of the following verifications: verifying the validity period of the random number table in the random timing mark table, verifying the timing mark information in the random timing mark table, verifying the current timestamp, and verifying the random number generated by the other party and the identity information of the other party.
According to an embodiment of the present disclosure, the verifying the validity period of the random table of timestamps includes: and verifying the limited periods of the random timing charts of the two transaction parties, and if one party fails in verification, forbidding the transaction between the two transaction parties.
According to an embodiment of the present disclosure, the verifying the validity period of the random number table in the random number table of the timestamps includes: and verifying the limited periods of the random number tables of the two transaction parties, and if the verification of one party fails, forbidding the transaction between the two transaction parties.
According to an embodiment of the present disclosure, the verifying the timestamp information in the timestamp random table includes: and verifying whether the random table of the time mark sent by the other party is the signature with the block chain or not in a signature verification mode, and if not, forbidding the transaction between the two parties.
According to an embodiment of the present disclosure, the verifying the current timestamp includes: and verifying whether the time difference between the current timestamp from the opposite side and the current timestamp of the own side meets a preset condition, and if not, forbidding the transaction between the first decentralized application end and the second centralized application end.
According to an embodiment of the present disclosure, the transaction between the decentralized application and the further decentralized application is independent from the blockchain.
According to an embodiment of the present disclosure, the blockchain includes a federation chain, and the decentralized application terminal includes a decentralized application terminal based on the federation chain.
According to an embodiment of the present disclosure, the federation chain is for issuing a digital asset, the decentralized application and the further decentralized application conducting a transaction based on the digital asset.
According to an embodiment of the present disclosure, the apparatus 300 may, for example, perform the method described above with reference to fig. 2, which is not described herein again.
Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of or a suitable combination of software, hardware, and firmware implementations. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.
For example, any plurality of the first obtaining module 310, the generating module 320, the processing module 330, the second obtaining module 340 and the sending module 350 may be combined into one module/unit/sub-unit to be implemented, or any one of the modules/units/sub-units may be split into a plurality of modules/units/sub-units. Alternatively, at least part of the functionality of one or more of these modules/units/sub-units may be combined with at least part of the functionality of other modules/units/sub-units and implemented in one module/unit/sub-unit. According to an embodiment of the present disclosure, at least one of the first obtaining module 310, the generating module 320, the processing module 330, the second obtaining module 340, and the sending module 350 may be at least partially implemented as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented by hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or implemented by any one of three implementations of software, hardware, and firmware, or an appropriate combination of any several of them. Alternatively, at least one of the first obtaining module 310, the generating module 320, the processing module 330, the second obtaining module 340 and the sending module 350 may be at least partially implemented as a computer program module, which when executed may perform a corresponding function.
Fig. 4 schematically shows a block diagram of an electronic device adapted to implement the above described method according to an embodiment of the present disclosure. The electronic device shown in fig. 4 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 4, an electronic device 400 according to an embodiment of the present disclosure includes a processor 401 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. Processor 401 may include, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 401 may also include onboard memory for caching purposes. Processor 401 may include a single processing unit or multiple processing units for performing the different actions of the method flows in accordance with embodiments of the present disclosure.
In the RAM 403, various programs and data necessary for the operation of the system 400 are stored. The processor 401, ROM 402 and RAM 403 are connected to each other by a bus 404. The processor 401 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 402 and/or the RAM 403. Note that the programs may also be stored in one or more memories other than the ROM 402 and RAM 403. The processor 401 may also perform various operations of the method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.
According to an embodiment of the present disclosure, system 400 may also include an input/output (I/O) interface 405, input/output (I/O) interface 405 also connected to bus 404. The system 400 may also include one or more of the following components connected to the I/O interface 405: an input section 406 including a keyboard, a mouse, and the like; an output section 407 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 408 including a hard disk and the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. A driver 410 is also connected to the I/O interface 405 as needed. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 410 as necessary, so that a computer program read out therefrom is mounted into the storage section 408 as necessary.
According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 409, and/or installed from the removable medium 411. The computer program, when executed by the processor 401, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium. Examples may include, but are not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
For example, according to embodiments of the present disclosure, a computer-readable storage medium may include ROM 402 and/or RAM 403 and/or one or more memories other than ROM 402 and RAM 403 described above.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.
Claims (14)
1. A transaction verification method based on a blockchain is applied to a decentralized application terminal, and the method comprises the following steps:
responding to the disconnection of the decentralized application end and the block chain, and acquiring latest time scale information from the block chain;
generating initial dotting information based on the time mark information;
based on the initial dotting information, dotting processing is carried out in sequence, wherein each time dotting processing is carried out, one piece of dotting information is generated, and the dotting information comprises the dotting information generated by the previous dotting and the dotting time information of the dotting;
responding to the decentralized application end and establishing transaction connection with another decentralized application end, and acquiring current dotting information corresponding to the current moment; and
and sending the current dotting information to the other decentralized application end so that the other decentralized application end can verify the current dotting information.
2. The method of claim 1, further comprising:
receiving current dotting information from the other decentralized application end;
verifying the current dotting information; and
and under the condition that the current dotting information is verified, executing the transaction between the decentralized application end and the other decentralized application end.
3. The method of claim 1, wherein the obtaining timestamp information from a last time of the block chain comprises:
and acquiring a latest time mark random table from the block chain, wherein the time mark random table comprises the time mark information, the time mark random table also comprises validity period information and a random number table, and the random number table comprises a random number and a random number corresponding to the random number.
4. The method of claim 3, wherein generating initial dotting information based on the time stamp information comprises:
and generating initial dotting information based on the time scale information, the random serial number extracted from the random number table and the layer height of the current dotting information.
5. The method of claim 4, wherein successively performing dotting processing based on the initial dotting information comprises:
the following operations are performed for each dotting process:
obtaining dotting information generated by previous dotting;
extracting a random number from the random number table; and
and generating dotting information of the dotting on the basis of the dotting information generated by the previous dotting, the random serial number extracted from the random number table, the dotting time information of the dotting and the layer height of the current dotting information.
6. The method of claim 1, wherein sending the current dotting information to the other decentralized application further comprises:
and sending the latest time stamp information from the block chain, the current time stamp of the decentralized application end and the current dotting information to the other decentralized application end, so that the other decentralized application end can verify the current dotting information based on the latest time stamp information from the block chain and the current time stamp of the decentralized application end.
7. The method of claim 6, wherein verifying the current dotting information comprises:
and checking the layer height corresponding to the current dotting information based on the latest time stamp information from the block chain and the current time stamp.
8. The method of claim 6, wherein verifying the current dotting information comprises:
analyzing the current dotting information to obtain a plurality of dotting information, and checking whether the plurality of dotting information are linked.
9. The method of claim 3, wherein sending the current dotting information to the other decentralized application further comprises:
and sending the latest time scale random table from the block chain, the current time stamp of the decentralized application end, the current dotting information, the random number generated by the decentralized application end and the identity information of the decentralized application end to the other decentralized application end.
10. The method of claim 9, further comprising at least one of:
verifying the validity period of the random table of the time scale;
verifying the validity period of a random number table in the random timing mark table;
verifying the time mark information in the time mark random table;
verifying the current timestamp;
and verifying the random number generated by the opposite party and the identity information of the opposite party.
11. The method of claim 9, wherein:
verifying the validity period of the random table of the timestamp, comprising:
verifying the finite periods of the random timing mark tables of the two transaction parties, and if one party fails verification, forbidding the transaction between the two transaction parties;
verifying the validity period of the random number table in the random timing mark table, including:
verifying the limited periods of the random number tables of both trading parties, and if one party fails to verify, forbidding the trading between both trading parties;
verifying the timestamp information in the timestamp random table, including:
verifying whether the random table of the time mark sent by the other party is the signature with the block chain or not in a signature verification mode, and if not, forbidding the transaction between the two parties;
verifying the current timestamp, including:
and verifying whether the time difference between the current timestamp from the opposite side and the current timestamp of the own side meets a preset condition, and if not, forbidding the transaction between the first decentralized application end and the second centralized application end.
12. A blockchain-based transaction verification apparatus for decentralized application, the apparatus comprising:
a first obtaining module, configured to obtain latest timestamp information from the blockchain in response to disconnection between the decentralized application and the blockchain;
the generating module is used for generating initial dotting information based on the time scale information;
the processing module is used for sequentially carrying out dotting processing on the basis of the initial dotting information, wherein each time of dotting processing is carried out, one piece of dotting information is generated, and the dotting information comprises the dotting information generated by previous dotting and the dotting time information of the dotting;
the second acquisition module is used for responding to the transaction connection established between the decentralized application end and the other decentralized application end and acquiring the current dotting information corresponding to the current moment; and
and the sending module is used for sending the current dotting information to the other decentralized application end so that the other decentralized application end can verify the current dotting information.
13. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-11.
14. A computer readable medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform the method of any one of claims 1 to 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010583395.8A CN111724168B (en) | 2020-06-23 | 2020-06-23 | Transaction verification method, device, electronic equipment and medium based on blockchain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010583395.8A CN111724168B (en) | 2020-06-23 | 2020-06-23 | Transaction verification method, device, electronic equipment and medium based on blockchain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111724168A true CN111724168A (en) | 2020-09-29 |
| CN111724168B CN111724168B (en) | 2023-09-05 |
Family
ID=72568494
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010583395.8A Active CN111724168B (en) | 2020-06-23 | 2020-06-23 | Transaction verification method, device, electronic equipment and medium based on blockchain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111724168B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112926967A (en) * | 2021-03-18 | 2021-06-08 | 上海能链众合科技有限公司 | Metering and paying method for block chain platform |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109819443A (en) * | 2018-12-29 | 2019-05-28 | 东莞见达信息技术有限公司 | Authentication registration method, apparatus and system based on block chain |
-
2020
- 2020-06-23 CN CN202010583395.8A patent/CN111724168B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109819443A (en) * | 2018-12-29 | 2019-05-28 | 东莞见达信息技术有限公司 | Authentication registration method, apparatus and system based on block chain |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112926967A (en) * | 2021-03-18 | 2021-06-08 | 上海能链众合科技有限公司 | Metering and paying method for block chain platform |
| CN112926967B (en) * | 2021-03-18 | 2024-02-02 | 上海零数众合信息科技有限公司 | Metering and payment method for blockchain platform |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111724168B (en) | 2023-09-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111080295B (en) | Electronic contract processing method and device based on blockchain | |
| JP6892513B2 (en) | Off-chain smart contract service based on a reliable execution environment | |
| CN109242675B (en) | Asset publishing method and device based on block chain and electronic equipment | |
| CN108108967B (en) | Multi-stage PBFT consensus system and method for complex digital assets | |
| CN108111314B (en) | Method and equipment for generating and verifying digital certificate | |
| AU2019204733B2 (en) | Performing parallel execution of transactions in a distributed ledger system | |
| CN108334753B (en) | Pirate application verification method and distributed server node | |
| AU2019203863B2 (en) | Preventing misrepresentation of input data by participants in a secure multi-party computation | |
| CN109493061B (en) | Verification method and device for data of block chain, electronic equipment and storage medium | |
| CN111327648B (en) | Processing method and system based on block chain intelligent contract | |
| TW202023224A (en) | Event-driven blockchain workflow processing | |
| CN111611625B (en) | Cloud data integrity auditing method and device and computer readable storage medium | |
| CN112612856B (en) | Block chain-based data processing method and device | |
| CN110263580B (en) | Data processing method and device based on block chain and block chain link points | |
| WO2021204044A1 (en) | Correction of blockchain data | |
| CN110879826A (en) | Credit blacklist sharing method and device based on block chain | |
| CN112738253A (en) | Data processing method, device and equipment based on block chain and storage medium | |
| CN112035350B (en) | Test method and device for block chain system and computer equipment | |
| CN110190963A (en) | A kind of monitoring method, device and equipment for the request of time service certificates constructing | |
| CN111274597B (en) | Data processing method and device | |
| CN110941840B (en) | Data processing method, system and terminal | |
| CN112231755A (en) | Data authorization method, device and system based on block chain | |
| CN110347750B (en) | Block chain-based data processing method and device | |
| CN111475778A (en) | Music data processing method and device based on block chain | |
| CN111724168B (en) | Transaction verification method, device, electronic equipment and medium based on blockchain |
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 |