CN110443608A - Big data justice and method for secure transactions based on block chain - Google Patents
Big data justice and method for secure transactions based on block chain Download PDFInfo
- Publication number
- CN110443608A CN110443608A CN201910591814.XA CN201910591814A CN110443608A CN 110443608 A CN110443608 A CN 110443608A CN 201910591814 A CN201910591814 A CN 201910591814A CN 110443608 A CN110443608 A CN 110443608A
- Authority
- CN
- China
- Prior art keywords
- data
- transaction
- owner
- buyer
- 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
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/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/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
-
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Abstract
The invention discloses a kind of big data justice and method for secure transactions based on block chain.The present invention carries out sufficiently large piecemeal to data and encrypts respectively, can guarantee to carry out random selection certification during fair deal in this way.In random selection verification process, probability nature has been used to guarantee that data owner will not forge data.Such as: remaining code key is disclosed using bit coin script, such buyer can obtain all code keys, and data owner can obtain corresponding bit coin.By above-mentioned technical point, it enables to data owner in the case where no third party participates in, is able to carry out autonomous, fair and safe data trade, can effectively guarantee the equity of data owner, and greatly improves the shared efficiency of big data.
Description
Technical field
The present invention relates to the payment of big data justice and block chain fields, are based especially on the big data justice and peace of block chain
Full method of commerce.
Background technique
With the fast development of internet, big data has become driving industry development key factor.Therefore big data
Opening and shares will be greatly promoted the Rational flow of data value, be conducive to the formation of the big data ecosystem.However it is current
Big data is shared to have that the following aspects, first big data share degree of opening deficiency, information island, data wall
Situations such as base, fragmentation of data and information asymmetry, largely exists；Secondly, the safety of big data opening and shares is always one
Difficult and urgent problem；Last big data opening and shares are presented that form centralization, multicenter, decentralization total at present
The situation deposited.How to make to be able to carry out autonomous, fair, safe data trade between data owner, becomes one and urgently solve
Certainly the technical issues of.
Current big data transaction is mainly based on neutralisation, and data trade is required via third party, this undoubtedly increases
The risk of data trade, reduces efficiency.Still lack a kind of data trade method for supporting autonomous justice and safety at present.
Summary of the invention
Technical problem to be solved by the invention is to provide a kind of big data justices based on block chain and Secure Transaction side
Method, it enables to data owner in the case where no third party participates in, is able to carry out autonomous, fair and safe data trade,
It can effectively guarantee the equity of data owner, and greatly improve the shared efficiency of big data.
The present invention is implemented as follows: big data justice and method for secure transactions based on block chain, comprise the following steps
It carries out:
1) data preprocessing phase: initial data to be transacted is grouped by data owner, is divided into N number of group, and
Each grouping is encrypted using different keys, obtains corresponding encrypted cipher text；Simultaneously calculation block hash, key hash with
And encrypted cipher text hash, obtain five-tuple data structure: data block, data block Hash, ciphertext blocks, key and key
hash；
2) fair exchange protocol is carried out, the specific steps are as follows:
Step 1: buyer proposes purchase data to data owner, and data owner is by whole encrypted data chunks, original
Beginning, data hash and key hash sent jointly to buyer；
Step 2: buyer carries out random selection certification to the data received；
Step 3: after buyer authenticates successfully, just by bit coin network initiate a payment transaction, the transaction it is defeated
The input that can be traded out as two kinds, is TxAccept and TxRefund respectively；
TxAccept transaction, this transaction are initiated by data owner, and it is corresponding that it necessarily requires data owner to provide
Corresponding bit coin can be transferred to the privately owned bit of oneself by signature and remaining whole keys, data owner by the transaction
On coin address；
TxRefund transaction, this is to lock the time generated jointly by data purchaser and data owner than trading
Fixed transaction, it requires while providing the common signature of data owner and buyer, within locking time, if data owner
TxAccept is not submitted to trade, it means that data owner's default abandons data trade, then TxRefund transaction comes into force,
It can default and this bit coin is transferred in the privately owned bit coin account of data purchaser；
Step 4: when data owner submits TxAccept to trade, data owner must mention in TxAccept transaction
For the remaining all keys of step 2, then data purchaser can cross the encryption key for obtaining whole at this time, that is, can be right
Acquisition initial data is decrypted in all encryption datas.
In the step two, it is as follows that buyer executes random selection verification process to the data received:
A: buyer randomly selects n (1 < < n < < N) a key hash, requests corresponding key to data owner；
B: corresponding key is sent to buyer by data owner；
C: after buyer receives counterpart keys, first verifying that corresponding key hash, such as errorless, then decryption is corresponding
Encrypted data chunk obtains initial data, judges the true and false of key according to corresponding initial data hash.
Initial data to be transacted is grouped specifically by data owner described in step 1), by initial data point
At N number of grouping, transaction is all classified into different blocks every time, and the segmentation data length of each grouping is not also identical；Its data
Structure is as follows:
A1: piecemeal size, the block number after showing segmentation share 2 bytes, longest can indicate to be divided into 65535 pieces；
A2: segmentation sequences show the block number according to the sequence in original data block, and 2 bytes indicate range 0~65535；
A3: timestamp shows the unix timestamp of data segmentation, 4 bytes；
A3: piecemeal HASH, show the hash value of the block number evidence, it is whether correct for verify data block, use 4 bytes；
A4: piecemeal length shows the length of the data block, and using 4 bytes, maximum can indicate 4394967295 bytes
Data；
A5: block data, block, length have A4 specified for storing data.
In the step two-stage, it would be desirable to randomly select n key hash, n selection at this time is needed much smaller than N, far
Greater than 1, if n selection is too small, it will increase the probability of deception, if n selection is too big, will lead to key leakage if close to N
Excessively.
(may be due to version, this formula can't see)
ΩrkiRandomly selected subscript sequence is represented, andCheating probability at this time
Are as follows: (content is not seen behind this)
In the step 3 stage, if also data owner is needed to interact with data purchaser, need to add two
To be signed jointly, detailed process is as follows:
A1: buyer generates TxPayment, and the output script of the transaction allows two kinds of input script to carry out it
It uses；The first is that buyer and owner is needed to sign jointly, is for second that signature and the step 2 of data owner is remaining
Key；At this moment, buyer generates TxPayment temporarily not to entire bit coin Web broadcast, he also needs to generate
TxRefund transaction is arranged locking time, and the signature of oneself is added in TxRefund transaction, then sends out the transaction
Give data owner；
A2: data owner checks locking time and the signature of data purchaser after receiving TxRefund transaction,
If errorless, the signature of oneself is added in TxRefund, and is sent to data purchaser；
A3: data purchaser goes out to receive from data owner complete TxRefund transaction, checks whether transaction is modified,
Whether the signature of data owner is correct, if all correct, TxPayment is broadcasted to the whole network；
A4: data owner and data purchaser wait TxPayment transaction to determine；
A5: data owner wait until TxPayment transaction determine after, using the remaining key of step step 2 and oneself
Signature generates TxAccept transaction, and to bit coin Web broadcast；
A6: after data purchaser listens to TxPayment transaction, so that it may which the input script by reading the transaction obtains
Take remaining whole keys.
The specific key technology of the present invention is summarized as follows:.
Traditional data trade is mainly embodied in and collects on delivery, in the mode of proficiency intersection number evidence, and the invention
The characteristic of bit coin transaction is utilized in ground, the code key transaction after data trade to be reduced to data encryption, therefore can guarantee number
According to transaction it is autonomous, do not need third-party platform participate under fairness and safety.
Main innovation point includes:
1, sufficiently large piecemeal is carried out to data and encrypted respectively, can guarantee to carry out during fair deal in this way
Random selection certification.
2, in random selection verification process, probability nature has been used to guarantee that it is pseudo- that data owner will not carry out data
It makes.
3, by taking bit coin as an example, remaining code key is disclosed using bit coin script, such buyer can obtain all
Code key, and data owner can obtain corresponding bit coin.
By above-mentioned technical point, it enables to data owner in the case where no third party participates in, is able to carry out autonomous, public
Gentle safe data trade can effectively guarantee the equity of data owner, and it is shared to greatly improve big data
Efficiency.
Detailed description of the invention
Fig. 1 is initial data piecemeal and ciphering process of the invention；
Fig. 2 is data preprocessing phase of the invention；
Fig. 3 is random key Qualify Phase of the invention.
Specific embodiment
The embodiment of the present invention: big data justice and method for secure transactions based on block chain comprise the following steps progress:
1) data preprocessing phase: initial data to be transacted is grouped by data owner, and to each grouping
It is encrypted using different keys, obtains corresponding encrypted cipher text；Calculation block hash, key hash and encrypted cipher text simultaneously
Hash obtains five-tuple data structure: data block, data block Hash, ciphertext blocks, key and key hash；
2) fair exchange protocol is carried out, the specific steps are as follows:
Step 1: buyer proposes purchase data to data owner, and data owner is by whole encrypted data chunks, original
Beginning, data hash and key hash sent jointly to buyer；
Step 2: buyer carries out random selection certification to the data received；
Step 3: after buyer authenticates successfully, just by bit coin network initiate a payment transaction, the transaction it is defeated
The input that can be traded out as two kinds, is TxAccept and TxRefund respectively；
TxAccept transaction, this transaction are initiated by data owner, and it is corresponding that it necessarily requires data owner to provide
Corresponding bit coin can be transferred to the privately owned bit of oneself by signature and remaining whole keys, data owner by the transaction
On coin address；
TxRefund transaction, this is to lock the time generated jointly by data purchaser and data owner than trading
Fixed transaction, it requires while providing the common signature of data owner and buyer, within locking time, if data owner
TxAccept is not submitted to trade, it means that data owner's default abandons data trade, then TxRefund transaction comes into force,
It can default and this bit coin is transferred in the privately owned bit coin account of data purchaser；
Step 4: when data owner submits TxAccept to trade, data owner must mention in TxAccept transaction
For the remaining all keys of step 2, then data purchaser can cross the encryption key for obtaining whole at this time, that is, can be right
Acquisition initial data is decrypted in all encryption datas.
In the step two, it is as follows that buyer executes random selection verification process to the data received:
A: buyer randomly selects n (1 < < n < < N) a key hash, requests corresponding key to data owner；
B: corresponding key is sent to buyer by data owner；
C: after buyer receives counterpart keys, first verifying that corresponding key hash, such as errorless, then decryption is corresponding
Encrypted data chunk obtains initial data, judges the true and false of key according to corresponding initial data hash.
Initial data to be transacted is grouped specifically by data owner described in step 1), by initial data point
At N number of grouping, transaction is all classified into different blocks every time, and the segmentation data length of each grouping is not also identical；Its data
Structure is as follows:
A1: piecemeal size, the block number after showing segmentation share 2 bytes, longest can indicate to be divided into 65535 pieces；
A2: segmentation sequences show the block number according to the sequence in original data block, and 2 bytes indicate range 0~65535；
A3: timestamp shows the unix timestamp of data segmentation, 4 bytes；
A3: piecemeal HASH, show the hash value of the block number evidence, it is whether correct for verify data block, use 4 bytes；
A4: piecemeal length shows the length of the data block, and using 4 bytes, maximum can indicate 0~4394967295 word
Save length；
A5: block data, block, length have A4 specified for storing data.
In the step two-stage, it would be desirable to randomly select n key hash, n selection at this time is needed much smaller than N, far
Greater than 1, if n selection is too small, it will increase the probability of deception, if n selection is too big, will lead to key leakage if close to N
Excessively.
Ωrki={ α1 … an|i≠j ai≠aj, 1 < < n < < N }
ΩrkiRandomly selected subscript sequence is represented, andCheating probability at this time
Are as follows:
In the step 3 stage, if also data owner is needed to interact with data purchaser, need to add two
To be signed jointly, detailed process is as follows:
A1: buyer generates TxPayment, and the output script of the transaction allows two kinds of input script to carry out it
It uses；The first is that buyer and owner is needed to sign jointly, is for second that signature and the step 2 of data owner is remaining
Key；At this moment, buyer generates TxPayment temporarily not to entire bit coin Web broadcast, he also needs to generate
TxRefund transaction is arranged locking time, and the signature of oneself is added in TxRefund transaction, then sends out the transaction
Give data owner；
A2: data owner checks locking time and the signature of data purchaser after receiving TxRefund transaction,
If errorless, the signature of oneself is added in TxRefund, and is sent to data purchaser；
A3: data purchaser goes out to receive from data owner complete TxRefund transaction, checks whether transaction is modified,
Whether the signature of data owner is correct, if all correct, TxPayment is broadcasted to the whole network；
A4: data owner and data purchaser wait TxPayment transaction to determine；
A5: data owner wait until TxPayment transaction determine after, using the remaining key of step step 2 and oneself
Signature generates TxAccept transaction, and to bit coin Web broadcast；
A6: after data purchaser listens to TxPayment transaction, so that it may which the input script by reading the transaction obtains
Take remaining whole keys.
Claims (5)
1. a kind of big data justice and method for secure transactions based on block chain, which is characterized in that comprise the following steps progress:
1) data preprocessing phase: initial data to be transacted is grouped by data owner, is divided into N number of group, and to every
A grouping is encrypted using different keys, obtains corresponding encrypted cipher text；Simultaneously calculation block hash, key hash and add
Ciphertext hash obtains five-tuple data structure: data block, data block Hash, ciphertext blocks, key and key hash；
2) fair exchange protocol is carried out, the specific steps are as follows:
Step 1: buyer proposes purchase data to data owner, and data owner is by whole encrypted data chunks, original number
Buyer is sent jointly to according to hash and key hash；
Step 2: buyer carries out random selection certification to the data received；
Step 3: after buyer authenticates successfully, a payment transaction, the output energy of the transaction are just initiated by bit coin network
The input traded as two kinds, is TxAccept and TxRefund respectively；
TxAccept transaction, this transaction are initiated by data owner, it necessarily requires data owner to provide corresponding signature
With remaining whole keys, corresponding bit coin can be transferred to the privately owned bit coin of oneself by data owner by the transaction
On location；
TxRefund transaction, this is that the time lock generated jointly by data purchaser and data owner is handed over than trading
Easily, it requires while providing the common signature of data owner and buyer, within locking time, if data owner does not have
Submit TxAccept transaction, it means that data owner's default abandons data trade, then TxRefund transaction comes into force, can write from memory
Recognize and this bit coin is transferred in the privately owned bit coin account of data purchaser；
Step 4: when data owner submits TxAccept to trade, data owner must provide step in TxAccept transaction
Rapid two remaining all keys, then data purchaser can cross the encryption key for obtaining whole at this time, that is, can be to all
Encryption data acquisition initial data is decrypted.
2. the big data justice and method for secure transactions according to claim 1 based on block chain, it is characterised in that: described
The step of two in, it is as follows that buyer executes random selection verification process to the data that receive:
A: buyer randomly selects n (1 < < n < < N) a key hash, requests corresponding key to data owner；
B: corresponding key is sent to buyer by data owner；
C: after buyer receives counterpart keys, first verifying that corresponding key hash, such as errorless, then the corresponding encryption of decryption
Data block obtains initial data, judges the true and false of key according to corresponding initial data hash.
3. the big data justice and method for secure transactions according to claim 1 based on block chain, it is characterised in that: step
1) initial data to be transacted is grouped specifically by the data owner described in, initial data is divided into N number of grouping, often
Secondary transaction is all classified into different blocks, and the segmentation data length of each grouping is not also identical；Its data structure is as follows:
A1: piecemeal size, the block number after showing segmentation share 2 bytes, longest can indicate to be divided into 65535 pieces；
A2: segmentation sequences show the block number according to the sequence in original data block, and 2 bytes indicate range 0~65535；
A3: timestamp shows the unix timestamp of data segmentation, 4 bytes；
A3: piecemeal HASH, show the hash value of the block number evidence, it is whether correct for verify data block, use 4 bytes；
A4: piecemeal length shows the length of the data block, and using 4 bytes, maximum can indicate 0~4394967295 byte long
Degree；
A5: block data, block, length have A4 specified for storing data.
4. the big data justice and method for secure transactions according to claim 2 based on block chain, it is characterised in that: in step
In the rapid two-stage, buyer carries out random selection certification to the data received, randomly selects n key hash, n, which chooses, to be needed
Much smaller than N, it is much larger than 1, if n selection is too small, it will increase the probability of deception, if n selection is too big, can lead if close to N
Fine and close key leakage is excessive.
Ωrki={ a1…an|i≠jai≠aj, 1 < < n < < N }
ΩrkiRandomly selected subscript sequence is represented, andCheating probability at this time are as follows:。
5. the big data justice and method for secure transactions according to claim 1 based on block chain, it is characterised in that: in step
In rapid three stage, if also data owner is needed to interact with data purchaser, need to sign two jointly
Name, detailed process is as follows:
A1: buyer generates TxPayment, and the output script of the transaction allows two kinds of input script to make it
With；The first is that buyer and owner is needed to sign jointly, is for second that signature and the step 2 of data owner is remaining
Key；At this moment, buyer generates TxPayment temporarily not to entire bit coin Web broadcast, he also needs to generate
TxRefund transaction is arranged locking time, and the signature of oneself is added in TxRefund transaction, then sends the transaction
To data owner；
A2: data owner checks locking time and the signature of data purchaser after receiving TxRefund transaction, if
It is errorless, then the signature of oneself is added in TxRefund, and be sent to data purchaser；
A3: data purchaser goes out to receive from data owner complete TxRefund transaction, checks whether transaction is modified, data
Whether the signature of owner is correct, if all correct, TxPayment is broadcasted to the whole network；
A4: data owner and data purchaser wait TxPayment transaction to determine；
A5: after data owner waits until that TxPayment transaction determines, the signature of step step 2 remaining key and oneself is used
TxAccept transaction is generated, and to bit coin Web broadcast；
A6: after data purchaser listens to TxPayment transaction, so that it may more than the input script by reading the transaction obtains
Under whole keys.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910591814.XA CN110443608A (en) | 2019-07-01 | 2019-07-01 | Big data justice and method for secure transactions based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910591814.XA CN110443608A (en) | 2019-07-01 | 2019-07-01 | Big data justice and method for secure transactions based on block chain |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110443608A true CN110443608A (en) | 2019-11-12 |
Family
ID=68429414
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910591814.XA Pending CN110443608A (en) | 2019-07-01 | 2019-07-01 | Big data justice and method for secure transactions based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110443608A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111680312A (en) * | 2020-06-05 | 2020-09-18 | 宗陈星 | Information processing method based on big data and block chain and network security cloud server |
| CN112926955A (en) * | 2021-03-12 | 2021-06-08 | 贵州大学 | Fairness and privacy protection big data exchange scheme |
| CN113469684A (en) * | 2021-07-16 | 2021-10-01 | 贵州大学 | Fair energy transaction mode based on alliance chain |
| CN113507482A (en) * | 2021-07-27 | 2021-10-15 | 御风科技(海南)有限公司 | Data secure transmission method, secure transaction method, system, medium, and device |
-
2019
- 2019-07-01 CN CN201910591814.XA patent/CN110443608A/en active Pending
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111680312A (en) * | 2020-06-05 | 2020-09-18 | 宗陈星 | Information processing method based on big data and block chain and network security cloud server |
| CN112926955A (en) * | 2021-03-12 | 2021-06-08 | 贵州大学 | Fairness and privacy protection big data exchange scheme |
| CN113469684A (en) * | 2021-07-16 | 2021-10-01 | 贵州大学 | Fair energy transaction mode based on alliance chain |
| CN113507482A (en) * | 2021-07-27 | 2021-10-15 | 御风科技(海南)有限公司 | Data secure transmission method, secure transaction method, system, medium, and device |
| CN113507482B (en) * | 2021-07-27 | 2023-10-10 | 御风科技(海南)有限公司 | Data security transmission method, security transaction method, system, medium and equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109347878B (en) | Decentralized data verification and data security transaction system and method | |
| US11930100B2 (en) | Fund conversion between blockchains | |
| US11637709B2 (en) | Split-key wallet access between blockchains | |
| CN110443608A (en) | Big data justice and method for secure transactions based on block chain | |
| CN110582793B (en) | Anonymity and traceability of digital property transactions on a distributed transaction consensus network | |
| US6311171B1 (en) | Symmetrically-secured electronic communication system | |
| EP3928276A1 (en) | Trusted tokenized transactions in a blockchain system | |
| CN111418184A (en) | Credible insurance letter based on block chain | |
| CN110336779B (en) | Block chain construction method and device and electronic equipment | |
| CN102184495A (en) | Network payment method and system | |
| CN111191280A (en) | Block chain transaction method based on encrypted data, electronic equipment and storage medium | |
| US11133936B1 (en) | Methods and systems for introducing self-contained intent functionality into decentralized computer networks | |
| Ray et al. | A fair-exchange e-commerce protocol with automated dispute resolution | |
| CN112801778A (en) | Federated bad asset blockchain | |
| US20220052921A1 (en) | Methods and systems for introducing self-contained intent functionality into decentralized computer networks | |
| CN111417945A (en) | Credible insurance letter based on block chain | |
| CN111433799A (en) | Credible insurance letter based on block chain | |
| CN109615376A (en) | A kind of method of commerce and device based on zero-knowledge proof | |
| Chen et al. | Toward achieving anonymous nft trading | |
| CN109377359A (en) | A kind of discounted note transaction match method based on block chain | |
| WO2020192236A1 (en) | Blind signature-based transaction method and device | |
| CN110189143B (en) | Block chain-based marketing label authenticity verification method and system | |
| CN112419021A (en) | Electronic invoice verification method, system, storage medium, computer equipment and terminal | |
| CN115713329A (en) | Data transaction method based on block chain | |
| US11538070B2 (en) | Blockchain-based system and method for peer-to-peer online advertising auction |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191112 |
|
| RJ01 | Rejection of invention patent application after publication |