CN111523894A - Data delay publishing method, device and storage medium - Google Patents
Data delay publishing method, device and storage medium Download PDFInfo
- Publication number
- CN111523894A CN111523894A CN202010373079.8A CN202010373079A CN111523894A CN 111523894 A CN111523894 A CN 111523894A CN 202010373079 A CN202010373079 A CN 202010373079A CN 111523894 A CN111523894 A CN 111523894A
- Authority
- CN
- China
- Prior art keywords
- transaction
- delayed
- publishing
- root
- public key
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 46
- 230000003111 delayed effect Effects 0.000 claims abstract description 153
- 238000012795 verification Methods 0.000 claims abstract description 108
- 238000004806 packaging method and process Methods 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 9
- 238000005065 mining Methods 0.000 claims description 7
- 238000010200 validation analysis Methods 0.000 claims description 6
- 238000012937 correction Methods 0.000 claims description 5
- 230000000694 effects Effects 0.000 description 9
- 230000002159 abnormal effect Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
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/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0863—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving passwords or one-time passwords
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- General Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Databases & Information Systems (AREA)
- Computing Systems (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Computer Hardware Design (AREA)
- Health & Medical Sciences (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Storage Device Security (AREA)
Abstract
The invention provides a data delay publishing method, a device and a storage medium, wherein the method comprises the following steps: receiving a delayed publishing original transaction; when the original transaction can be packed into a block, public keys of a plurality of nodes are selected, and a secret key and a Merkel root are generated according to the public keys; encrypting the original text by using the secret key to generate a first ciphertext, and generating a delayed publishing encryption transaction according to the first ciphertext; replacing the encrypted transaction with the original transaction; respectively generating data sets of the selected nodes; respectively sending each data set to each corresponding node; and when the verification transaction is executed, calculating to obtain a second Merkel root according to the public key and the Merkel root path in the executed verification transaction, wherein the second Merkel root is the same as the Merkel root recorded by the corresponding delayed publishing encryption transaction, and the secret key of the corresponding encryption transaction is restored when the public key in each verification transaction which is executed successfully is enough to restore the secret key of the corresponding encryption transaction. The application realizes automatic delay of publishing information.
Description
Technical Field
The present application relates to the field of block chaining technologies, and in particular, to a data delay publishing method, device, and storage medium.
Background
The delayed public of some information in society has certain requirements, such as decryption of detailed contents of some thesis, and some commercial information can firstly publish some abstracts to attract the requirements of consumers, such as obtaining the detailed information, paying or waiting for a certain time and then decrypting freely as a public purpose; the existing delayed publishing method is to encrypt the information to be delayed published to generate encrypted information, break up the encrypted information, record the broken encrypted information to a block chain step by step after a period of time, and collect the broken encrypted information and decrypt and restore the information by a user. In the mechanism, the information is restored seriously by manual decryption, and automatic decryption cannot be realized; when the broken encrypted information is published, if the incorrect broken encrypted information is recorded on the block chain, the user cannot restore the information according to the collected broken encrypted information.
Disclosure of Invention
In view of the above-mentioned drawbacks and deficiencies of the prior art, it is desirable to provide a data delay publishing method, apparatus, and storage medium that automatically delays publishing information.
In a first aspect, the present invention provides a data delay publishing method suitable for a blockchain node, where the method includes:
receiving a first delayed publishing original transaction, and storing the first delayed publishing original transaction in a transaction pool; the first delayed publishing original transaction comprises a first original text and first delayed information;
when the mining right of the first block with the first block height is obtained and the first delay publication original transaction can be packaged into the first block, sequentially executing the following steps:
randomly selecting public keys of a first number of block chain nodes, and generating a first secret key according to each public key and a preset secret key generation rule;
generating a first Merkel root according to each public key;
symmetrically encrypting the first original text by using a first secret key to generate a first ciphertext, and generating a first delayed publishing encryption transaction according to the first ciphertext, the first delayed information and the first Merkel root;
replacing the first delayed publishing original transaction with the first delayed publishing encrypted transaction, packaging the first delayed publishing encrypted transaction into a first block, and recording a first ciphertext, first delay information and a first Meckel root on a block chain when the first delayed publishing encrypted transaction is executed;
respectively generating a first data set of each selected block chain node; the first data set comprises a Merker root path of a public key of a corresponding block chain node when generating a first Merker root, a first transaction hash of a first delayed publishing encryption transaction and first delay information;
respectively sending each first data set to each corresponding block chain node so as to determine a second block height according to the first block height and the first delay information, and generating a first verification transaction according to the second data set and broadcasting the first verification transaction to other block chain nodes when the block height reaches the second block height; wherein the second data set comprises the held public key, the received Merkel root path in the first data set and the first transaction hash;
when the verification transaction is executed, calculating to obtain a second Merkel root according to the public key and the Merkel root path in the executed verification transaction, and judging whether the second Merkel root is the same as the Merkel root recorded by the delayed publishing encryption transaction corresponding to the executed verification transaction:
if yes, judging whether the public key in each verification transaction which is successfully executed is enough to restore the corresponding secret key of the delayed publishing encryption transaction:
if yes, restoring a corresponding secret key for delayed publishing encrypted transaction according to the public key in each successfully executed verification transaction, and recording the restored secret key to the block chain;
the restored secret key is used for the user side of each user to decrypt the corresponding delayed publishing encryption transaction so as to obtain the corresponding original text.
In a second aspect, the present invention provides a data delay publishing method suitable for a blockchain node, where the method includes:
receiving a first delayed publishing original transaction, and storing the first delayed publishing original transaction in a transaction pool; the first delayed publishing original transaction comprises a first original text and first delayed information;
when the mining right of the first block with the first block height is obtained and the first delay publication original transaction can be packaged into the first block, sequentially executing the following steps:
randomly selecting public keys of a first number of block chain nodes, and generating a first secret key according to each public key and a preset secret key generation rule;
generating a first Merkel root according to each public key;
symmetrically encrypting the first original text by using a first secret key to generate a first ciphertext, and generating a first delayed publishing encryption transaction according to the first ciphertext, the first delayed information and the first Merkel root;
replacing the first delayed publishing original transaction with the first delayed publishing encrypted transaction, packaging the first delayed publishing encrypted transaction into a first block, and recording a first ciphertext, first delay information and a first Meckel root on a block chain when the first delayed publishing encrypted transaction is executed;
respectively generating a first data set of each selected block chain node; the first data set comprises a Merker root path of a public key of a corresponding block chain node when generating a first Merker root, a first transaction hash of a first delayed publishing encryption transaction and first delay information;
respectively sending each first data set to each corresponding block chain node so as to determine a second block height according to the first block height and the first delay information, and generating a first verification transaction according to the second data set and broadcasting the first verification transaction to other block chain nodes when the block height reaches the second block height; wherein the second data set comprises the held public key, the received Merkel root path in the first data set and the first transaction hash;
when the verification transaction is executed, calculating to obtain a second Merkel root according to the public key and the Merkel root path in the executed verification transaction, and judging whether the second Merkel root is the same as the Merkel root recorded by the delayed publishing encryption transaction corresponding to the executed verification transaction:
if yes, recording the verification transaction which is successfully executed on the blockchain;
wherein, each user's user end still is used for:
judging whether the public key in each verification transaction which is successfully executed is enough to restore the corresponding secret key of the delayed publishing encryption transaction: if yes, restoring the key of the corresponding delayed publishing encrypted transaction according to the public key in each successfully executed verification transaction, and decrypting the corresponding delayed publishing encrypted transaction according to the restored key to obtain the corresponding original text.
In a third aspect, the present invention also provides an apparatus comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform a data delay publishing method provided according to embodiments of the present invention.
In a fourth aspect, the present invention further provides a storage medium storing a computer program, where the computer program makes a computer execute the data delay publishing method provided in accordance with the embodiments of the present invention.
The data delay publishing method, the data delay publishing device and the data delay publishing storage medium provided by the embodiments of the invention publish the original transaction by receiving the delay; when the original transaction can be packed into a block, public keys of a plurality of nodes are selected, and a secret key and a Merkel root are generated according to the public keys; encrypting the original text by using the secret key to generate a first ciphertext, and generating a delayed publishing encryption transaction according to the first ciphertext; replacing the encrypted transaction with the original transaction; respectively generating data sets of the selected nodes; respectively sending each data set to each corresponding node; and when the verification transaction is executed, calculating to obtain a second Merkel root according to the public key and the Merkel root path in the executed verification transaction, wherein the second Merkel root is the same as the Merkel root recorded by the corresponding delayed publishing encryption transaction, and the public key in each successfully executed verification transaction is enough to restore the secret key of the corresponding encryption transaction, thereby realizing the method for restoring the secret key of the corresponding encryption transaction and realizing the automatic delayed publishing of information.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a data delay publishing method according to an embodiment of the present invention.
Fig. 2 is a flowchart of another data delay publishing method according to an embodiment of the present invention.
Fig. 3 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a flowchart of a data delay publishing method according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, the present invention provides a data delay publishing method applicable to a blockchain node, where the method includes:
s11: receiving a first delayed publishing original transaction, and storing the first delayed publishing original transaction in a transaction pool; the first delayed publishing original transaction comprises a first original text and first delayed information;
when the mining right of the first block with the first block height is obtained and the first delay publication original transaction can be packaged into the first block, sequentially executing the following steps:
s121: randomly selecting public keys of a first number of block chain nodes, and generating a first secret key according to each public key and a preset secret key generation rule;
s122: generating a first Merkel root according to each public key;
s123: symmetrically encrypting the first original text by using a first secret key to generate a first ciphertext, and generating a first delayed publishing encryption transaction according to the first ciphertext, the first delayed information and the first Merkel root;
s124: replacing the first delayed publishing original transaction with the first delayed publishing encrypted transaction, packaging the first delayed publishing encrypted transaction into a first block, and recording a first ciphertext, first delay information and a first Meckel root on a block chain when the first delayed publishing encrypted transaction is executed;
s125: respectively generating a first data set of each selected block chain node; the first data set comprises a Merker root path of a public key of a corresponding block chain node when generating a first Merker root, a first transaction hash of a first delayed publishing encryption transaction and first delay information;
s126: respectively sending each first data set to each corresponding block chain node so as to determine a second block height according to the first block height and the first delay information, and generating a first verification transaction according to the second data set and broadcasting the first verification transaction to other block chain nodes when the block height reaches the second block height; wherein the second data set comprises the held public key, the received Merkel root path in the first data set and the first transaction hash;
s131: when the verification transaction is executed, calculating to obtain a second Merkel root according to the public key and the Merkel root path in the executed verification transaction, and judging whether the second Merkel root is the same as the Merkel root recorded by the delayed publishing encryption transaction corresponding to the executed verification transaction:
if yes, go to step S132: judging whether the public key in each verification transaction which is successfully executed is enough to restore the corresponding secret key of the delayed publishing encryption transaction:
if yes, go to step S1321: restoring a corresponding secret key for delayed publishing encrypted transaction according to the public key in each successfully executed verification transaction, and recording the restored secret key to the block chain;
the restored secret key is used for the user side of each user to decrypt the corresponding delayed publishing encryption transaction so as to obtain the corresponding original text.
Specifically, determining whether the public key in each successfully executed verification transaction is sufficient to restore the corresponding key of the delayed publishing encryption transaction includes determining whether a third number of successfully executed verification transactions is equal to a fourth number, where the fourth number is a number of public keys used to generate a michael root recorded by the corresponding delayed publishing encryption transaction; the delay information is offset height; the pre-configured secret key generation rule is that all the selected public keys are connected in series to generate a secret key as an example;
assuming that A obtains the mining right of block (100), the first quantity is 3, and the public key of the 3 block chain nodes selected by A is the public key pub _ B, pub _ C, pub _ D of B, C, D; the offset height is 1000;
taking the current node as a:
step S11 is executed, the original transaction tx1_ ori is received and published in a delayed mode, and tx1_ ori is stored in a transaction pool; tx1_ ori includes plaintext and 1000;
when a obtains the cut right of block (100) and tx1_ ori can be packed into block (100), a performs in sequence:
a executes step S121, selecting B, C, D public key pub _ B, pub _ C, pub _ D, and generating a first key (pwd ═ pub _ B + pub _ C + pub _ D) according to pub _ B, pub _ C, pub _ D and a preconfigured key generation rule;
a, executing the step S122, and generating Merkel root merkleothorash according to pub _ B, pub _ C, pub _ D;
step S123 is executed, the original text is symmetrically encrypted by pwd to generate a ciphertext, and a first delayed publishing encryption transaction tx1_ enc is generated according to the ciphertext, 1000 and merkleothash;
step S124 is executed, tx1_ enc is used for replacing tx1_ ori, tx1_ enc is packaged into block (100), and ciphertext, 1000 and merkleroothash are recorded on a block chain when tx1_ enc is executed;
a executes step S125 to generate data set dataset _ D of data set dataset _ C, D of data set dataset _ B, C of B;
dataset _ B includes path _ B (path _ B is the merkel root path of pub _ B when merklerooth ash is generated), transaction hash of tx1_ enc (hash (tx1_ enc), 1000;
dataset _ C comprises path _ C (path _ C is the Merkel root path of pub _ C when merklerooth ash is generated), hash (tx1_ enc), 1000;
dataset _ D comprises path _ D (path _ D is the Merkel root path of pub _ D when merklerooth ash is generated), hash (tx1_ enc), 1000;
step S126 is executed by A, and dataset _ B, dataset _ C and dataset _ D are transmitted to B, C and D respectively;
b determines a second block height 1100 according to 100 and 1000, and generates a verification transaction tx _ ve r _ B according to Pub _ B, path _ B and hash (tx1_ enc) when the block height reaches 1100;
c determining a second block height 1100 according to 100 and 1000, and generating a verification transaction tx _ ve r _ C according to Pub _ C, path _ C and hash (tx1_ enc) when the block height reaches 1100;
d determining a second block height 1100 according to 100 and 1000, and generating a verification transaction tx _ ve r _ D according to Pub _ D, path _ D and hash (tx1_ enc) when the block height reaches 1100;
suppose a receives each verification transaction in the order of tx _ ver _ B, tx _ ver _ C, tx _ ver _ D and tx _ ver _ B, tx _ ver _ C, tx _ ver _ D can both execute successfully (indicating that the meikerr root of tx _ ver _ B, tx _ ver _ C, tx _ ver _ D is the same as the meikerr root recorded for the deferred publishing encrypted transaction corresponding to the executed verification transaction);
step S131 is executed, Merkel root merkleothorash 'is obtained through calculation according to pub _ B and path _ B when tx _ ver _ B is executed, and whether merkleothorash' is the same as merkleothorash is judged:
if yes, go to step S132: judging whether the public key in each verification transaction which is successfully executed is enough to restore the corresponding secret key of the delayed publishing encryption transaction:
since only 1 (tx _ ver _ B), less than 3, successfully performed authentication transaction is not enough to restore pwd of tx1_ enc;
step S131 is executed, Merkel root merkleothorash is obtained through calculation according to pub _ C and path _ C when tx _ ver _ C is executed, and whether merkleothorash' is the same as merkleothorash is judged:
if yes, go to step S132: judging whether the public key in each verification transaction which is successfully executed is enough to restore the corresponding secret key of the delayed publishing encryption transaction:
since there are only 2 (tx _ ver _ B, tx _ ver _ C), less than 3, verification transactions that were successfully performed, it is not enough to restore pwd for tx1_ enc;
step S131 is executed, Merkel root merklerooth '″ is obtained through calculation according to pub _ D and path _ D when tx _ ver _ D is executed, and whether merklerooth' ″ is the same as merklerooth is judged:
if yes, go to step S132: judging whether the public key in each verification transaction which is successfully executed is enough to restore the corresponding secret key of the delayed publishing encryption transaction:
since there are 3 (tx _ ver _ B, tx _ ver _ C, tx _ v er _ D) authentication transactions successfully performed, which are the same as the number (3) of public keys used to generate the mekerr root recorded by tx1_ enc, step S1321 is performed: restoring pwd of tx1_ e nc according to pub _ B, pub _ C, pub _ D, and recording the restored pwd of tx1_ enc on a block chain;
the pwd of the restored tx1_ enc is used for the user side of each user to decrypt the tx1_ enc to obtain the corresponding original text.
In more embodiments, the delay information may be configured to a certain fixed block height according to actual requirements, so that the same technical effect can be achieved.
In further embodiments, the preconfigured key generation rule may also be configured according to actual requirements, for example, configured to concatenate the selected public keys, and perform a hash operation on the concatenated strings to generate the key, so as to achieve the same technical effect.
In more embodiments, since the verification transaction needs to be sent after being signed by the node, and the necessary step of transaction execution is to perform signature verification, the public key held by the node sending the verification transaction can be acquired in the process of signature verification, so that the parameter of the held public key can not be included in the verification transaction, and the same technical effect can be achieved.
In further embodiments, the first number may also be configured according to actual requirements, for example, configured as 4, and the same technical effect may be achieved.
In further embodiments, an operation when the second mekerr root is different from the mekerr root recorded in the delayed publishing encryption exchange corresponding to the executed verification exchange may be further configured according to actual requirements, for example, configured to: updating the number of abnormal transmissions of the block link points that generated the executed validation transaction; or, configured to: updating the abnormal sending times of the blockchain node generating the executed verification transaction, and shielding other transactions generated by the blockchain node generating the executed verification transaction when the abnormal sending times reach a pre-configured numerical value; the same technical effect can be achieved.
The above-described embodiments enable automatic deferred publication of information.
Preferably, generating the first meikerr root from the respective public keys comprises:
generating a second number of error correcting codes according to the Reed Solomon coding rule and each public key, and generating a first Meckel root according to each public key and each error correcting code;
generating a first delayed publishing encryption transaction according to the first ciphertext, the first delay information and the first Meckel root comprises the following steps:
generating a first delayed publishing encryption transaction according to the first ciphertext, the first delay information, the first Meckel root and each error correcting code;
recording the first ciphertext, the first delay information, and the first Merkel root onto the blockchain when performing the first delayed publishing encryption transaction comprises:
recording a first ciphertext, first delay information, a first Meckel root and each error correction code on a block chain when executing a first delayed publishing encryption transaction;
the step of restoring the corresponding key of the delayed publishing encryption transaction according to the public key in each successfully executed verification transaction comprises the following steps:
and restoring the secret key of the corresponding delayed publishing encryption transaction according to the public key in each successfully executed verification transaction and each error correcting code of the corresponding delayed publishing encryption transaction.
In the method shown in fig. 1, if a blockchain node does not receive any of tx _ ver _ B, tx _ ver _ C, tx _ ver _ D to verify a transaction, or a blockchain node receives tx _ ver _ B, tx _ ver _ C, tx _ ver _ D, but any of merkleothash ', merkleothiash' ″ is different from merkleothash, then the blockchain node cannot restore pwd of tx1_ enc;
the problems that may arise with the mechanism of FIG. 1 are solved according to the steps shown in the preferred embodiment described above;
take the second number as 2 for example;
in step S122, a generates 2 error correction codes code _1, code _2 according to Reed Solomon encoding rules and pub _ B, pub _ C, pub _ D, and generates merkleroothash according to pub _ B, pub _ C, pub _ D and code _1, code _ 2;
in step S123, a symmetrically encrypts the plaintext with pwd to generate a ciphertext, and generates a first delayed post encrypted transaction tx1_ enc according to the ciphertext, 1000, merklerooth, code1 and code 2;
in the execution step S124, a replaces tx1_ ori with tx1_ enc, packs tx1_ enc into block (100), and records ciphertext, 1000, merklerooth and code1, and code2 on the block chain when tx1_ enc is executed;
in the B, C, D, executing step "recovering the corresponding key of the deferred publishing encryption transaction according to the public key in each successfully executed verification transaction", where the number of successfully executed verification transactions is not less than 1, B, C, D may recover the key of tx1_ enc according to the public key in each successfully executed verification transaction, code1, and code 2;
in further embodiments, the second number may also be configured according to actual requirements, for example, configured as 1, and the same technical effect may be achieved.
In more embodiments, the Reed Solomon encoding rule can be replaced by other encoding rules according to actual requirements, for example, the Reed Solomon encoding rule is configured as a BCH encoding rule, and the same technical effect can be achieved.
The above embodiment increases the probability of successfully reducing pwd of tx1_ enc.
Preferably, the determining whether the public key in each successfully executed verification transaction is sufficient to recover the key of the corresponding deferred publishing encryption transaction includes:
determining whether the third number of successfully executed validation transactions is equal to the fourth number; and the fourth quantity is the quantity of the public keys of the Merkel root recorded for generating the corresponding delayed publishing encryption exchange.
The data delay publishing principle of the above embodiment can refer to the method shown in fig. 1, and is not described herein again.
Preferably, the calculating the second meikern root according to the public key and the meikern root path in the executed verification transaction when executing the verification transaction includes:
determining the height of a third block according to the height of the block corresponding to the packaging of the delayed publishing encrypted transaction and the delay information in the corresponding delayed publishing encrypted transaction;
judging whether the block height when receiving the verification transaction is not less than the third block height:
if yes, a second Merkel root is calculated according to the public key and the Merkel root path in the executed verification transaction when the verification transaction is executed.
In further embodiments, the operation when the block height when receiving the verification transaction is smaller than the third block height may be configured according to actual requirements, for example, configured to: updating the number of abnormal transmissions of the block link points that generated the executed validation transaction; or, configured to: updating the abnormal sending times of the blockchain node generating the executed verification transaction, and shielding other transactions generated by the blockchain node generating the executed verification transaction when the abnormal sending times reach a pre-configured numerical value; the same technical effect can be achieved.
Preferably, randomly selecting the public keys of the first number of block link points comprises:
sending PING messages to a plurality of block chain nodes;
and randomly selecting public keys of the first number of block chain link points in each block chain node returning the PONG message.
The above embodiment increases the probability of successfully reducing pwd of tx1_ enc.
Fig. 2 is a flowchart of another data delay publishing method according to an embodiment of the present invention. As shown in fig. 2, in this embodiment, the present invention provides a data delay publishing method suitable for a blockchain node, where the method includes:
s31: receiving a first delayed publishing original transaction, and storing the first delayed publishing original transaction in a transaction pool; the first delayed publishing original transaction comprises a first original text and first delayed information;
when the mining right of the first block with the first block height is obtained and the first delay publication original transaction can be packaged into the first block, sequentially executing the following steps:
s321: randomly selecting public keys of a first number of block chain nodes, and generating a first secret key according to each public key and a preset secret key generation rule;
s322: generating a first Merkel root according to each public key;
s323: symmetrically encrypting the first original text by using a first secret key to generate a first ciphertext, and generating a first delayed publishing encryption transaction according to the first ciphertext, the first delayed information and the first Merkel root;
s324: replacing the first delayed publishing original transaction with the first delayed publishing encrypted transaction, packaging the first delayed publishing encrypted transaction into a first block, and recording a first ciphertext, first delay information and a first Meckel root on a block chain when the first delayed publishing encrypted transaction is executed;
s325: respectively generating a first data set of each selected block chain node; the first data set comprises a Merker root path of a public key of a corresponding block chain node when generating a first Merker root, a first transaction hash of a first delayed publishing encryption transaction and first delay information;
s326: respectively sending each first data set to each corresponding block chain node so as to determine a second block height according to the first block height and the first delay information, and generating a first verification transaction according to the second data set and broadcasting the first verification transaction to other block chain nodes when the block height reaches the second block height; wherein the second data set comprises the held public key, the received Merkel root path in the first data set and the first transaction hash;
s331: when the verification transaction is executed, calculating to obtain a second Merkel root according to the public key and the Merkel root path in the executed verification transaction, and judging whether the second Merkel root is the same as the Merkel root recorded by the delayed publishing encryption transaction corresponding to the executed verification transaction:
if yes, go to step S332: recording the verification transaction which is successfully executed on the blockchain;
wherein, each user's user end still is used for:
judging whether the public key in each verification transaction which is successfully executed is enough to restore the corresponding secret key of the delayed publishing encryption transaction: if yes, restoring the key of the corresponding delayed publishing encrypted transaction according to the public key in each successfully executed verification transaction, and decrypting the corresponding delayed publishing encrypted transaction according to the restored key to obtain the corresponding original text.
In further embodiments, an operation that the second mekeral root is not synchronized with the mekeral root recorded by the executed verification exchange corresponding to the delayed publishing encryption exchange may be further configured according to actual requirements, for example, configured to: recording the verification transaction which fails to be executed on the blockchain; or, configured to: the same technical effect can be achieved without recording the verification transaction that fails to execute on the blockchain.
The method shown in fig. 2 is different from the method shown in fig. 1 in that in the method shown in fig. 2, the blockchain node does not need to calculate the key of the corresponding delayed publishing encrypted transaction by itself and record the key to the blockchain; when the public key in each successfully executed verification transaction is enough to restore the corresponding key of the delayed publishing encryption transaction, the user side of the user needs to restore the corresponding key of the delayed publishing encryption transaction according to the public key in each successfully executed verification transaction, and decrypt the corresponding delayed publishing encryption transaction according to the restored key to obtain the corresponding original text.
Preferably, generating the first meikerr root from the respective public keys comprises:
generating a second number of error correcting codes according to the Reed Solomon coding rule and each public key, and generating a first Meckel root according to each public key and each error correcting code;
generating a first delayed publishing encryption transaction according to the first ciphertext, the first delay information and the first Meckel root comprises the following steps:
generating a first delayed publishing encryption transaction according to the first ciphertext, the first delay information, the first Meckel root and each error correcting code;
recording the first ciphertext, the first delay information, and the first Merkel root onto the blockchain when performing the first delayed publishing encryption transaction comprises:
recording a first ciphertext, first delay information, a first Meckel root and each error correction code on a block chain when executing a first delayed publishing encryption transaction;
the step of restoring the corresponding key of the delayed publishing encryption transaction according to the public key in each successfully executed verification transaction comprises the following steps:
and restoring the secret key of the corresponding delayed publishing encryption transaction according to the public key in each successfully executed verification transaction and each error correcting code in the corresponding delayed publishing encryption transaction.
Preferably, the determining whether the public key in each successfully executed verification transaction is sufficient to recover the key of the corresponding delayed publishing transaction includes:
determining whether the third number of successfully executed validation transactions is equal to the fourth number; and the fourth quantity is the quantity of the public keys used for generating the Merkel root recorded by the corresponding delayed publishing transaction.
Preferably, the calculating the second meikern root according to the public key and the meikern root path in the executed verification transaction when executing the verification transaction includes:
determining the height of a third block according to the height of the block corresponding to the packaging of the delayed publishing encrypted transaction and the delay information in the corresponding delayed publishing encrypted transaction;
judging whether the block height when receiving the verification transaction is not less than the third block height:
if yes, a second Merkel root is calculated according to the public key and the Merkel root path in the executed verification transaction when the verification transaction is executed.
Preferably, randomly selecting the public keys of the first number of block link points comprises:
sending PING messages to a plurality of block chain nodes;
and randomly selecting public keys of the first number of block chain link points in each block chain node returning the PONG message.
Fig. 3 is a schematic structural diagram of an apparatus according to an embodiment of the present invention. As shown in fig. 3, as another aspect, the present application also provides an apparatus 400 including one or more Central Processing Units (CPUs) 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. In the RAM403, various programs and data necessary for the operation of the device 400 are also stored. The CPU401, ROM402, and RAM403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
The following components are 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.
In particular, according to an embodiment of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. 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.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present application.
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 invention. 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 and/or flowchart illustration, and combinations of blocks in the block diagrams and/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.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (12)
1. A data delay publishing method is applied to a blockchain node, and comprises the following steps:
receiving a first delayed publishing original transaction, and storing the first delayed publishing original transaction in a transaction pool; the first delayed publishing original transaction comprises a first original text and first delayed information;
when the mining right of the first block with the first block height is obtained and the first delay publishes that the original transaction can be packaged into the first block, sequentially executing the following steps:
randomly selecting public keys of a first number of block chain nodes, and generating a first secret key according to each public key and a preset secret key generation rule;
generating a first Meckel root according to each public key;
symmetrically encrypting the first original text by using the first secret key to generate a first ciphertext, and generating a first delayed publishing encryption transaction according to the first ciphertext, the first delayed information and the first Merkel root;
replacing the first delayed publishing original transaction with the first delayed publishing encrypted transaction, packaging the first delayed publishing encrypted transaction into the first block, and recording the first ciphertext, the first delay information and the first Merkel root on a block chain when the first delayed publishing encrypted transaction is executed;
respectively generating a first data set of each selected block chain node; the first data set comprises a Merker root path of a public key of the corresponding blockchain node when the first Merker root is generated, a first transaction hash of the first delayed publishing encryption transaction and the first delay information;
respectively sending each first data set to each corresponding block chain node so as to determine a second block height according to the first block height and the first delay information, and generating a first verification transaction according to the second data set and broadcasting the first verification transaction to other block chain nodes when the block height reaches the second block height; wherein the second data set comprises the held public key, the received Merkel root path in the first data set, and the first transaction hash;
when the verification transaction is executed, calculating to obtain a second Merkel root according to a public key and a Merkel root path in the executed verification transaction, and judging whether the second Merkel root is the same as the Merkel root recorded by a delayed publishing encryption transaction corresponding to the executed verification transaction:
if yes, judging whether the public key in each verification transaction which is successfully executed is enough to restore the corresponding secret key of the delayed publishing encryption transaction:
if yes, restoring a corresponding secret key for delayed publishing encrypted transaction according to the public key in each successfully executed verification transaction, and recording the restored secret key to the block chain;
the restored secret key is used for the user side of each user to decrypt the corresponding delayed publishing encryption transaction so as to obtain the corresponding original text.
2. The method of claim 1, wherein generating a first Meckel root from each of the public keys comprises:
generating a second number of error correcting codes according to a Reed Solomon coding rule and each public key, and generating a first Meckel root according to each public key and each error correcting code;
the generating of the first delayed publishing encryption transaction according to the first ciphertext, the first delay information and the first meiker root comprises:
generating a first delayed publishing encryption transaction according to the first ciphertext, the first delay information, the first Meckel root and each error correcting code;
the recording the first ciphertext, the first latency information, and the first Merkel root onto a blockchain when performing the first delayed publishing encryption transaction comprises:
recording the first ciphertext, the first latency information, the first Merkel root, and each error correction code onto a blockchain when the first delayed disclosure encryption transaction is performed;
the recovering of the corresponding key of the delayed publishing encryption transaction according to the public key in each successfully executed verification transaction comprises:
and restoring the secret key of the corresponding delayed publishing encryption transaction according to the public key in each successfully executed verification transaction and each error correcting code of the corresponding delayed publishing encryption transaction.
3. The method of claim 1, wherein determining whether the public key in each successfully performed authentication transaction is sufficient to recover the key of the corresponding deferred publication encrypted transaction comprises:
determining whether the third number of successfully executed validation transactions is equal to the fourth number; and the fourth quantity is the quantity of the public keys of the Merkel root recorded for generating the corresponding delayed publishing encryption exchange.
4. The method of claim 1, wherein computing the second mekeral root from the public key and the mekeral root path in the performed authentication transaction when performing the authentication transaction comprises:
determining the height of a third block according to the height of the block corresponding to the packaging of the delayed publishing encrypted transaction and the delay information in the corresponding delayed publishing encrypted transaction;
judging whether the block height when receiving the verification transaction is not less than the third block height:
if yes, a second Merkel root is calculated according to the public key and the Merkel root path in the executed verification transaction when the verification transaction is executed.
5. The method of claim 1, wherein said randomly choosing the public key for the first number of block link points comprises:
sending PING messages to a plurality of block chain nodes;
and randomly selecting public keys of the first number of block chain link points in each block chain node returning the PONG message.
6. A data delay publishing method is applied to a blockchain node, and comprises the following steps:
receiving a first delayed publishing original transaction, and storing the first delayed publishing original transaction in a transaction pool; the first delayed publishing original transaction comprises a first original text and first delayed information;
when the mining right of the first block with the first block height is obtained and the first delay publishes that the original transaction can be packaged into the first block, sequentially executing the following steps:
randomly selecting public keys of a first number of block chain nodes, and generating a first secret key according to each public key and a preset secret key generation rule;
generating a first Meckel root according to each public key;
symmetrically encrypting the first original text by using the first secret key to generate a first ciphertext, and generating a first delayed publishing encryption transaction according to the first ciphertext, the first delayed information and the first Merkel root;
replacing the first delayed publishing original transaction with the first delayed publishing encrypted transaction, packaging the first delayed publishing encrypted transaction into the first block, and recording the first ciphertext, the first delay information and the first Merkel root on a block chain when the first delayed publishing encrypted transaction is executed;
respectively generating a first data set of each selected block chain node; the first data set comprises a Merker root path of a public key of the corresponding blockchain node when the first Merker root is generated, a first transaction hash of the first delayed publishing encryption transaction and the first delay information;
respectively sending each first data set to each corresponding block chain node so as to determine a second block height according to the first block height and the first delay information, and generating a first verification transaction according to the second data set and broadcasting the first verification transaction to other block chain nodes when the block height reaches the second block height; wherein the second data set comprises the held public key, the received Merkel root path in the first data set, and the first transaction hash;
when the verification transaction is executed, calculating to obtain a second Merkel root according to a public key and a Merkel root path in the executed verification transaction, and judging whether the second Merkel root is the same as the Merkel root recorded by a delayed publishing encryption transaction corresponding to the executed verification transaction:
if yes, recording the verification transaction which is successfully executed on the blockchain; wherein, each user's user end still is used for:
judging whether the public key in each verification transaction which is successfully executed is enough to restore the corresponding secret key of the delayed publishing encryption transaction: if yes, restoring the key of the corresponding delayed publishing encrypted transaction according to the public key in each successfully executed verification transaction, and decrypting the corresponding delayed publishing encrypted transaction according to the restored key to obtain the corresponding original text.
7. The method of claim 6, wherein generating a first Meckel root from each of the public keys comprises:
generating a second number of error correcting codes according to a Reed Solomon coding rule and each public key, and generating a first Meckel root according to each public key and each error correcting code;
the generating of the first delayed publishing encryption transaction according to the first ciphertext, the first delay information and the first meiker root comprises:
generating a first delayed publishing encryption transaction according to the first ciphertext, the first delay information, the first Meckel root and each error correcting code;
the recording the first ciphertext, the first latency information, and the first Merkel root onto a blockchain when performing the first delayed publishing encryption transaction comprises:
recording the first ciphertext, the first latency information, the first Merkel root, and each error correction code onto a blockchain when the first delayed disclosure encryption transaction is performed;
the recovering of the corresponding key of the delayed publishing encryption transaction according to the public key in each successfully executed verification transaction comprises:
and restoring the secret key of the corresponding delayed publishing encryption transaction according to the public key in each successfully executed verification transaction and each error correcting code in the corresponding delayed publishing encryption transaction.
8. The method of claim 6, wherein determining whether the public key in each successfully performed verification transaction is sufficient to recover the corresponding key of the deferred publication transaction comprises:
determining whether the third number of successfully executed validation transactions is equal to the fourth number; and the fourth quantity is the quantity of the public keys of the Merkel root for generating the corresponding delay publishing transaction order record.
9. The method of claim 6, wherein computing the second Merkel root from the public key and the Merkel root path in the performed authentication transaction when performing the authentication transaction comprises:
determining the height of a third block according to the height of the block corresponding to the packaging of the delayed publishing encrypted transaction and the delay information in the corresponding delayed publishing encrypted transaction;
judging whether the block height when receiving the verification transaction is not less than the third block height:
if yes, a second Merkel root is calculated according to the public key and the Merkel root path in the executed verification transaction when the verification transaction is executed.
10. The method of claim 9, wherein said randomly choosing the public key for the first number of block link points comprises:
sending PING messages to a plurality of block chain nodes;
and randomly selecting public keys of the first number of block chain link points in each block chain node returning the PONG message.
11. An apparatus, characterized in that the apparatus comprises:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-10.
12. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010373079.8A CN111523894A (en) | 2020-05-06 | 2020-05-06 | Data delay publishing method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010373079.8A CN111523894A (en) | 2020-05-06 | 2020-05-06 | Data delay publishing method, device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111523894A true CN111523894A (en) | 2020-08-11 |
Family
ID=71908398
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010373079.8A Pending CN111523894A (en) | 2020-05-06 | 2020-05-06 | Data delay publishing method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111523894A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111985922A (en) * | 2020-08-26 | 2020-11-24 | 冒炜 | Information distribution method based on block chain offline payment and digital financial service platform |
| CN112381543A (en) * | 2020-12-09 | 2021-02-19 | 杭州复杂美科技有限公司 | Multiple signature transaction method, device and storage medium |
| WO2022121348A1 (en) * | 2020-12-09 | 2022-06-16 | 杭州复杂美科技有限公司 | Delayed transaction generation method, delayed transaction execution method, and device and storage medium |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100185863A1 (en) * | 2006-12-01 | 2010-07-22 | Rabin Michael O | Method and apparatus for time-lapse cryptography |
| CN108009810A (en) * | 2017-12-27 | 2018-05-08 | 光载无限（北京）科技有限公司 | A kind of Trusted Digital transaction in assets method |
| WO2018115567A1 (en) * | 2016-12-19 | 2018-06-28 | Nokia Technologies Oy | Method and apparatus for private data transfer between parties |
| KR101924026B1 (en) * | 2017-11-10 | 2018-11-30 | 부산대학교 산학협력단 | System and method for blockchain using hash-based signature scheme |
| CN109598506A (en) * | 2018-11-02 | 2019-04-09 | 克洛斯比尔有限公司 | Block chain accurately postpones the method for encryption, system, calculates equipment and computer readable storage medium |
| CA3040601A1 (en) * | 2018-11-27 | 2019-04-18 | Alibaba Group Holding Limited | System and method for information protection |
| CN110009334A (en) * | 2018-11-07 | 2019-07-12 | 阿里巴巴集团控股有限公司 | A kind of building Mei Keer tree, simple payment verification method and device |
| CN110175840A (en) * | 2019-04-19 | 2019-08-27 | 华中科技大学 | Method, client, alliance's chain and the system of light wallet mechanism are realized in alliance's chain |
| CN110300173A (en) * | 2019-06-28 | 2019-10-01 | 杭州复杂美科技有限公司 | Decentralization date storage method, verification method, equipment and storage medium |
| US20200013025A1 (en) * | 2018-07-06 | 2020-01-09 | International Business Machines Corporation | Conditional deferred transactions for blockchain |
| WO2020022599A1 (en) * | 2018-07-27 | 2020-01-30 | 박기업 | Node group managing device and computing device for configuring group key-based dual signature transaction structure in blockchain network |
| CN110930157A (en) * | 2019-11-14 | 2020-03-27 | 杭州复杂美科技有限公司 | Delayed transaction processing method, device and storage medium |
| CN110992009A (en) * | 2019-12-04 | 2020-04-10 | 杭州复杂美科技有限公司 | Delayed transaction advanced processing method, device and storage medium |
-
2020
- 2020-05-06 CN CN202010373079.8A patent/CN111523894A/en active Pending
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100185863A1 (en) * | 2006-12-01 | 2010-07-22 | Rabin Michael O | Method and apparatus for time-lapse cryptography |
| WO2018115567A1 (en) * | 2016-12-19 | 2018-06-28 | Nokia Technologies Oy | Method and apparatus for private data transfer between parties |
| KR101924026B1 (en) * | 2017-11-10 | 2018-11-30 | 부산대학교 산학협력단 | System and method for blockchain using hash-based signature scheme |
| CN108009810A (en) * | 2017-12-27 | 2018-05-08 | 光载无限（北京）科技有限公司 | A kind of Trusted Digital transaction in assets method |
| US20200013025A1 (en) * | 2018-07-06 | 2020-01-09 | International Business Machines Corporation | Conditional deferred transactions for blockchain |
| WO2020022599A1 (en) * | 2018-07-27 | 2020-01-30 | 박기업 | Node group managing device and computing device for configuring group key-based dual signature transaction structure in blockchain network |
| CN109598506A (en) * | 2018-11-02 | 2019-04-09 | 克洛斯比尔有限公司 | Block chain accurately postpones the method for encryption, system, calculates equipment and computer readable storage medium |
| CN110009334A (en) * | 2018-11-07 | 2019-07-12 | 阿里巴巴集团控股有限公司 | A kind of building Mei Keer tree, simple payment verification method and device |
| CA3040601A1 (en) * | 2018-11-27 | 2019-04-18 | Alibaba Group Holding Limited | System and method for information protection |
| CN110175840A (en) * | 2019-04-19 | 2019-08-27 | 华中科技大学 | Method, client, alliance's chain and the system of light wallet mechanism are realized in alliance's chain |
| CN110300173A (en) * | 2019-06-28 | 2019-10-01 | 杭州复杂美科技有限公司 | Decentralization date storage method, verification method, equipment and storage medium |
| CN110930157A (en) * | 2019-11-14 | 2020-03-27 | 杭州复杂美科技有限公司 | Delayed transaction processing method, device and storage medium |
| CN110992009A (en) * | 2019-12-04 | 2020-04-10 | 杭州复杂美科技有限公司 | Delayed transaction advanced processing method, device and storage medium |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111985922A (en) * | 2020-08-26 | 2020-11-24 | 冒炜 | Information distribution method based on block chain offline payment and digital financial service platform |
| CN112381543A (en) * | 2020-12-09 | 2021-02-19 | 杭州复杂美科技有限公司 | Multiple signature transaction method, device and storage medium |
| WO2022121348A1 (en) * | 2020-12-09 | 2022-06-16 | 杭州复杂美科技有限公司 | Delayed transaction generation method, delayed transaction execution method, and device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109756582B (en) | Information recording method, device, node and storage medium in block chain network | |
| CN109087101B (en) | Transaction verification method and device, storage medium and electronic equipment | |
| CN111523894A (en) | Data delay publishing method, device and storage medium | |
| US20240259328A1 (en) | Verification of data processes in a network of computing resources | |
| CN111159306B (en) | Information publishing method and device based on block chain and computer equipment | |
| JP5368637B1 (en) | Time authentication system and time authentication program | |
| US11899647B2 (en) | Documenting timestamps within a blockchain | |
| EP3260979B1 (en) | Verification of data processes in a network of computing resources | |
| D’Anvers et al. | The impact of error dependencies on Ring/Mod-LWE/LWR based schemes | |
| US8806214B2 (en) | Communication with non-repudiation and blind signatures | |
| EP3234792A1 (en) | Verification of data processes in a network of computing resources | |
| EP3057079A1 (en) | Secret parallel processing device, secret parallel processing method, and program | |
| US11750403B2 (en) | Robust state synchronization for stateful hash-based signatures | |
| EP3812997B1 (en) | Blockchain-based data processing method and apparatus, and server | |
| US11722313B2 (en) | State synchronization for post-quantum signing facilities | |
| CN114726517A (en) | Method, system and consensus node for generating random number seeds on block chain | |
| CN114640451A (en) | Method, system and consensus node for realizing distributed key generation on block chain | |
| CN110516463B (en) | Method and apparatus for generating information | |
| US12072760B2 (en) | Methods and apparatus to control execution of tasks in a computing system | |
| CN114780982A (en) | Flow business circulation method, device and system | |
| CN113794706A (en) | Data processing method and device, electronic equipment and readable storage medium | |
| CN111524012A (en) | Data delay publishing method, device and storage medium | |
| CN113132078B (en) | Block chain privacy protection method and block chain system based on homomorphism promise | |
| US20230379146A1 (en) | Securing network communications using dynamically and locally generated secret keys | |
| US10116439B2 (en) | Encrypted data computation system, device, and program |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200811 |
|
| WD01 | Invention patent application deemed withdrawn after publication |