CN106779975B - Tamper-proof method of reputation information based on block chain - Google Patents
Tamper-proof method of reputation information based on block chain Download PDFInfo
- Publication number
- CN106779975B CN106779975B CN201710020031.7A CN201710020031A CN106779975B CN 106779975 B CN106779975 B CN 106779975B CN 201710020031 A CN201710020031 A CN 201710020031A CN 106779975 B CN106779975 B CN 106779975B
- Authority
- CN
- China
- Prior art keywords
- block
- credit
- reputation
- head
- blocks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0609—Buyer or seller confidence or verification
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Abstract
The invention discloses a tamper-proof method of credit information based on a block chain, which is characterized by comprising the following steps: 1, establishing a credit block chain for storing credit information; when the transaction system is in transaction, the user provides the block to the transaction system, and the transaction system calculates the credit value of the block. And after the transaction system finishes the transaction, the transaction information is returned to the credit block chain, and the credit block chain constructs a new block. 2 when constructing a new block, check if there are forks in this reputation block chain and remove forks that may exist in the reputation block chain. The invention can truly record the credit information of the merchant, and the credit information can not be changed. Therefore, the intangible reputation can be effectively converted into a tangible and unalterable reputation value, so that the reputation of the merchant is more real and reliable.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a tamper-proof method for reputation information based on a block chain.
Background
The internet is a great milestone in the historical development of human beings, and greatly promotes the progress and development of the human society. With the continuous development of networks, more and more users make purchases and money transactions through the networks. Due to the nature of the network itself, merchant reputation information is easily tampered with and not discovered. Users typically only have a passive choice to trust the seller when receiving service. Business reputation is an intangible asset of an enterprise, having its value. Namely, the business reputation means a good social comprehensive evaluation obtained by an operator through fair competition and honest operation. The reputation of a business not only directly affects the purchasing behavior of customers in a certain area, but also causes a concomitant effect. One-to-ten and one-to-hundred-to-ten, which is an advertisement, the group effect generated by a certain range of consumers or users is a promotion effect that any advertisement cannot replace. The credit information of the merchant is recorded and can not be changed, and the intangible credit degree is converted into a tangible and unalterable credit value, so that the competition of enterprises is facilitated, users can trust the merchant actively, and the credit risk is avoided.
Now take panning net as an example. The levels of the Taobao stores are divided into a red heart, a diamond, a blue crown and a golden crown, the level of each store corresponds to the number of commodities sold by a seller, and each time a baby is sold, the reputation of each good-rated store is increased by one point according to the corresponding evaluation of a consumer. People mentally believe that a high-creditworthiness store is their first choice. But there is a brushing reputation phenomenon. The credit is refreshed in various ways such as cashback, buyer threat, hirer billing and the like. Some criminals even invade the computer information system of the express company, modify the express data information, and make false transaction records for a certain online shopping website to 'drill' and promote the credit rating. Although the intangible reputation is converted into a tangible reputation value, the reputation value is changeable, and false information may exist.
Currently, only some shopping websites have reputation levels, and most enterprises cannot see the reputation information. The national enterprise credit information publicizing system can only inquire the information of registration, approval, annual report, administrative penalty, spot check result, abnormal operation state and the like of market main bodies, and cannot directly see the credit information of enterprises.
Disclosure of Invention
The invention aims to solve the defects of the prior art and provides a tamper-proof method of reputation information based on a block chain, so that the reputation information of a merchant can be recorded in a distributed and real manner, and the reputation information can not be changed, and therefore, the intangible reputation can be effectively converted into a tangible and unchangeable reputation value, and the reputation of the merchant is more real and reliable.
The invention adopts the following technical scheme for solving the technical problems:
the invention relates to a tamper-proof method of credit information based on a block chain, which is applied to a transaction system in which a plurality of buyers and sellers participate, and any seller is marked as a credit user u; the method is characterized by comprising the following steps:
step one, establishing a reputation block chain for storing the reputation information:
step 1.1, establishing an initial block of the reputation block chain;
making the block head of the initial block be the ID of a credit user u; making the block body of the initial block be the time for constructing the initial block; making the block tail of the initial block be the encryption information of the block head and the block body of the initial block;
step 1.2, defining a variable i, and initializing i to be 1; taking the initial block as an ith block;
step 1.3, assuming that the credit user u provides the ith block to the trading system; the transaction system calculates an ith credit value of the credit user u by using the first i blocks;
step 1.4, any buyer judges whether to carry out transaction according to the ith credit value of the credit user u, if so, the transaction system obtains the ith transaction information of the credit user u; otherwise, returning to the step 1.4;
step 1.5, establishing the (i + 1) th block of the reputation block chain;
making the block head of the (i + 1) th block be the address of the ith block; making the block main body of the (i + 1) th block be the ith transaction information; making the block tail of the (i + 1) th block be the encryption information of the block head and the block body of the (i + 1) th block;
step two, removing possible forks in the reputation block chain:
step 2.1, traversing the credit block chain of the credit user u to obtain the addresses of the predecessor blocks and successor blocks of all the blocks and the number m of all the blocks in the credit block chain;
step 2.2, defining a variable j, and initializing j to be 1;
step 2.3, judging whether the jth block in the credit block chain of the credit user u has the addresses of 2 subsequent blocks; if yes, executing step 2.4; otherwise, after j +1 is assigned to j, returning to step 2.3 until j equals m, and executing step 2.8;
step 2.4, marking 2 subsequent blocks of the jth block as a block α and a block β respectively, and marking 2 blocks without subsequent blocks as a block lambda and a block gamma, judging whether the block α is the block lambda, if so, indicating that the block α is a fork, and changing the block head of the block α into the address of the block gamma, and making the block tail of the block α be the encrypted information of the block head and the block main body of the block α, otherwise, executing the step 2.5;
step 2.5, judging whether the block α is a block gamma, if so, indicating that the block α is a bifurcation, changing the block head of the block α into the address of a block lambda, and enabling the block tail of the block α to be the encrypted information of the block head and the block body of the block α, otherwise, executing step 2.6;
step 2.6, judging whether the block β is a block lambda, if so, indicating that the block β is a bifurcation, changing the block head of the block β into the address of a block gamma, and enabling the block tail of the block β to be the encrypted information of the block head and the block body of the block β, otherwise, executing the step 2.7;
step 2.7, representing that the block β is forked, and changing the block head of the block β into the address of a block lambda, and making the block tail of the block β be the encryption information of the block head and the block body of the block β;
and 2.8, assigning m to i, and returning to the step 1.3.
Compared with the prior art, the invention has the beneficial effects that:
1. the invention puts each transaction information of the user in a block through a block chain-based technology to form a credit block chain, the transaction system calculates the current credit value of the user through the block provided by the user, and the distributed storage of block chain data and the distributed record of the data ensure that the data information of the credit block chain cannot be changed, thereby effectively converting the intangible credit degree into a tangible and unalterable credit value.
2. The invention removes the possible bifurcation in the credit block chain when each block is constructed, and points the block head of the bifurcated block to the last block of the credit block chain, thereby solving the bifurcation phenomenon in the credit block chain, and solving the problem that a user considers that the latest transaction credit value is not good, thereby providing a historically better one-time transaction credit value.
3. According to the invention, the block tail of each block is the encrypted information of the transaction information through the block chain-based technology, so that the detailed content of each transaction of a user can not be checked at will, thus various private data are protected, and the data security is improved.
4. Each transaction in the credit block chain is connected with two adjacent blocks in series through a cryptography method, so that the context of each transaction can be traced, the transaction system can trace the blocks of the previous transactions generated by the user according to the blocks provided by the user, and the latest credit value of the user can be calculated.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2a is a first condition of the present invention occurring during bifurcation;
FIG. 2b is a second condition of the present invention occurring during bifurcation;
FIG. 2c is a third condition of the present invention occurring during bifurcation;
fig. 2d shows a fourth situation occurring when the present invention is branched.
Detailed Description
In the embodiment, as shown in fig. 1, a tamper-proof method based on reputation information of a blockchain is applied to a transaction system in which a plurality of buyers and sellers (i.e., reputation blockchain users) participate. Where each user has a chain of reputation blocks. Recording any seller as a reputation user u; the block chain is a chain structure formed by using blocks as basic structures, wherein the blocks are composed of block heads, block bodies and block tails. The block main body comprises transaction time, transaction objects, evaluation scores and evaluation contents; the block header contains address information of the previous block; the block trailer is the encryption information for the block header and the block body. The specific tamper-proofing method is carried out according to the following steps:
step one, establishing a reputation block chain for storing reputation information:
step 1.1, establishing an initial block of a credit block chain;
making the block head of the initial block be the ID of the credit user u; making the block body of the initial block be the time for constructing the initial block; making the block tail of the initial block be the encryption information of the block head and the block body of the initial block; in this embodiment, the block header and the block body of the initial block are encrypted by using the SHA256 algorithm.
Step 1.2, defining a variable i, and initializing i to be 1; taking the initial block as the ith block;
step 1.3, assuming that a reputation user u provides the ith block to a trading system; the trading system calculates an ith credit value of the credit user u by using the first i blocks;
in this embodiment, the transaction system obtains the block provided by the reputation user u through the interface of the reputation block chain, and the transaction system sequentially traces back the transactions generated by the previous i blocks from the block head of the ith block, so as to calculate the ith reputation value of the reputation user u. Since the block is provided by the user, there may be one transaction reputation value that the user considers the latest transaction reputation value to be poor, thus providing a historically better one transaction reputation value. This forms a bifurcation on the reputation block chain. It is necessary to remove any possible bifurcation in the chain of reputation blocks every time a block is created, step two.
Step 1.4, any buyer judges whether to carry out transaction according to the ith credit value of the credit user u, if so, the transaction system obtains the ith transaction information of the credit user u; otherwise, returning to the step 1.4; in this embodiment, the buyer decides whether to trade according to the user reputation value.
Step 1.5, establishing an i +1 block of a credit block chain;
making the block head of the (i + 1) th block be the address of the ith block; making the block main body of the (i + 1) th block as the ith transaction information; making the block tail of the (i + 1) th block be the encryption information of the block head and the block main body of the (i + 1) th block; in this embodiment, the block header and the block body of the (i + 1) th block are encrypted by using the SHA256 algorithm.
Step two, removing possible forks in the reputation block chain:
step 2.1, traversing the credit block chain of the credit user u to obtain the addresses of the predecessor blocks and successor blocks of all the blocks and the number m of all the blocks in the credit block chain; in this embodiment, a data structure corresponding to all blocks is initialized, including Addri＝addressi，NextAddriNull, where the address of the ith block is indicated, whether the block has been accessed is indicated, and the address of the block next to the ith block in the corresponding block chain is indicated. Wherein AddriIndicating the address of the ith block, NextAddriIndicating the address of the next block to the ith block in the corresponding block chain. Storing Addr for each block by traversing all blocks of the entire reputation block chaini，NextAddriThe value of (3) changes the unidirectional block chain into a bidirectional block chain, and traverses the whole credit block chain to obtain the addresses of the predecessor blocks and successor blocks of all blocks and the number m of all blocks in the credit block chain;
step 2.2, defining a variable j, and initializing j to be 1;
step 2.3, judging whether the jth block in the credit block chain of the credit user u has the addresses of 2 subsequent blocks; if yes, executing step 2.4; otherwise, after j +1 is assigned to j, returning to step 2.3 until j equals m, and executing step 2.8; in this embodiment, if two subsequent blocks exist for one block, a bifurcation occurs. At this point, the fork of the reputation block chain needs to be processed. The forked block is placed at the end of the reputation block chain backbone.
Step 2.4, marking 2 subsequent blocks of the jth block as a block α and a block β respectively, and marking 2 blocks without subsequent blocks as a block lambda and a block gamma, judging whether the block α is the block lambda, if so, indicating that the block α is a fork, and changing the block head of the block α into the address of the block gamma, and making the block tail of the block α be the encrypted information of the block head and the block main body of the block α, otherwise, executing the step 2.5;
in this embodiment, the longest chain is considered as the main chain by determining which chain is the main chain for α, β, λ and γ, and there are four determination results, step 2.4, step 2.5, step 2.6, step 2.7, the case shown in step 2.4 is shown in fig. 2 a. the user should provide the transaction system with the information of block 6, but block 2 is provided, so a fork occurs after block 2. at this time, the block header of block 3' should be changed to the address of block 6 and the block header and block body of block 3 should be encrypted again by SHA256 algorithm.
Step 2.5, as shown in fig. 2b, determining whether block α is block γ, if yes, indicating that block α is bifurcated, and changing the block head of block α to the address of block λ, making the block end of block α be the encryption information of the block head and block body of block α, otherwise, performing step 2.6;
step 2.6, as shown in fig. 2c, determines whether block β is block λ, if yes, it indicates that block β is bifurcated, and changes the block head of block β to the address of block γ, and makes the block end of block β be the encryption information of the block head and block body of block β, otherwise, step 2.7 is executed.
Step 2.7, as shown in FIG. 2d, indicates that block β is forked and changes the block head of block β to the address of block λ, and makes the block end of block β be the encryption information of the block head and block body of block β;
and 2.8, assigning m to i, and returning to the step 1.3.
Claims (1)
1. A tamper-proof method of reputation information based on a block chain is applied to a transaction system in which a plurality of buyers and sellers participate, and any seller is marked as a reputation user u; the method is characterized by comprising the following steps:
step one, establishing a reputation block chain for storing the reputation information:
step 1.1, establishing an initial block of the reputation block chain;
making the block head of the initial block be the ID of a credit user u; making the block body of the initial block be the time for constructing the initial block; making the block tail of the initial block be the encryption information of the block head and the block body of the initial block;
step 1.2, defining a variable i, and initializing i to be 1; taking the initial block as an ith block;
step 1.3, assuming that the credit user u provides the ith block to the trading system; the transaction system calculates an ith credit value of the credit user u by using the first i blocks;
step 1.4, any buyer judges whether to carry out transaction according to the ith credit value of the credit user u, if so, the transaction system obtains the ith transaction information of the credit user u; otherwise, returning to the step 1.4;
step 1.5, establishing the (i + 1) th block of the reputation block chain;
making the block head of the (i + 1) th block be the address of the ith block; making the block main body of the (i + 1) th block be the ith transaction information; making the block tail of the (i + 1) th block be the encryption information of the block head and the block body of the (i + 1) th block;
step two, removing possible forks in the reputation block chain:
step 2.1, traversing the credit block chain of the credit user u to obtain the addresses of the predecessor blocks and successor blocks of all the blocks and the number m of all the blocks in the credit block chain;
step 2.2, defining a variable j, and initializing j to be 1;
step 2.3, judging whether the jth block in the credit block chain of the credit user u has the addresses of 2 subsequent blocks; if yes, executing step 2.4; otherwise, after j +1 is assigned to j, returning to step 2.3 until j equals m, and executing step 2.8;
step 2.4, marking 2 subsequent blocks of the jth block as a block α and a block β respectively, and marking 2 blocks without subsequent blocks as a block lambda and a block gamma, judging whether the block α is the block lambda, if so, indicating that the block α is a fork, and changing the block head of the block α into the address of the block gamma, and making the block tail of the block α be the encrypted information of the block head and the block main body of the block α, otherwise, executing the step 2.5;
step 2.5, judging whether the block α is a block gamma, if so, indicating that the block α is a bifurcation, changing the block head of the block α into the address of a block lambda, and enabling the block tail of the block α to be the encrypted information of the block head and the block body of the block α, otherwise, executing step 2.6;
step 2.6, judging whether the block β is a block lambda, if so, indicating that the block β is a bifurcation, changing the block head of the block β into the address of a block gamma, and enabling the block tail of the block β to be the encrypted information of the block head and the block body of the block β, otherwise, executing the step 2.7;
step 2.7, representing that the block β is forked, and changing the block head of the block β into the address of a block lambda, and making the block tail of the block β be the encryption information of the block head and the block body of the block β;
and 2.8, assigning m to i, and returning to the step 1.3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710020031.7A CN106779975B (en) | 2017-01-11 | 2017-01-11 | Tamper-proof method of reputation information based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710020031.7A CN106779975B (en) | 2017-01-11 | 2017-01-11 | Tamper-proof method of reputation information based on block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106779975A CN106779975A (en) | 2017-05-31 |
| CN106779975B true CN106779975B (en) | 2020-06-26 |
Family
ID=58947869
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710020031.7A Active CN106779975B (en) | 2017-01-11 | 2017-01-11 | Tamper-proof method of reputation information based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106779975B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI632507B (en) * | 2017-06-03 | 2018-08-11 | 蔡政育 | Product traceability code outputting system |
| CN107507006A (en) * | 2017-08-11 | 2017-12-22 | 杭州秘猿科技有限公司 | A kind of common recognition bifurcated processing method based on license chain |
| CN108510254B (en) * | 2018-02-09 | 2020-11-20 | 北京欧链科技有限公司 | Chain bidirectional block chain structure, data processing method and device |
| CN108512649B (en) * | 2018-02-09 | 2021-09-10 | 北京欧链科技有限公司 | Processing method and device for reverse hash link of block chain |
| CN108494560A (en) * | 2018-03-15 | 2018-09-04 | 南京智格电力科技有限公司 | A kind of security service chain-circuit system based on decentralization design |
| CN109242666A (en) * | 2018-06-28 | 2019-01-18 | 平安科技（深圳）有限公司 | Personal reference method, apparatus and computer equipment are obtained based on block chain |
| CN109284333A (en) * | 2018-08-31 | 2019-01-29 | 中国信息通信研究院 | Industrial chain data maintaining method and platform based on block chain |
| CN109300036B (en) * | 2018-09-14 | 2020-08-14 | 百度在线网络技术（北京）有限公司 | Bifurcation regression method and device of block chain network |
| CN110415008B (en) * | 2018-10-23 | 2021-08-10 | 腾讯科技（深圳）有限公司 | Credit data management method, device, node equipment, storage medium and system |
| CN109816323A (en) * | 2018-12-12 | 2019-05-28 | 上海点融信息科技有限责任公司 | Transaction auditing method, calculating equipment, storage medium for block chain network |
| CN113269572B (en) * | 2021-07-01 | 2023-12-12 | 广西师范大学 | Credibility-based blockchain agricultural product traceability trusted data uploading method |
| CN113553380B (en) * | 2021-07-23 | 2023-07-28 | 东北大学 | Reputation-behavior association-oriented data tracing system for double-block chain |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105761143A (en) * | 2016-02-01 | 2016-07-13 | 上海凭安网络科技有限公司 | Multi-party co-construction credit record method based on block chains |
| CN106097074A (en) * | 2016-06-20 | 2016-11-09 | 深圳市淘淘谷信息技术有限公司 | A kind of block chain realizes the monitoring and managing method of business transaction record |
| CN106228344A (en) * | 2016-07-28 | 2016-12-14 | 杭州云象网络技术有限公司 | A kind of electronic government affairs system building method based on block chain technology |
| CN106230808A (en) * | 2016-07-28 | 2016-12-14 | 杭州云象网络技术有限公司 | A kind of personal credit information system method based on block chain technology |
| CN106250721A (en) * | 2016-07-28 | 2016-12-21 | 杭州云象网络技术有限公司 | A kind of electronic copyright protection method based on block chain |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102339445A (en) * | 2010-07-23 | 2012-02-01 | 阿里巴巴集团控股有限公司 | Method and system for evaluating credibility of network trade user |
-
2017
- 2017-01-11 CN CN201710020031.7A patent/CN106779975B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105761143A (en) * | 2016-02-01 | 2016-07-13 | 上海凭安网络科技有限公司 | Multi-party co-construction credit record method based on block chains |
| CN106097074A (en) * | 2016-06-20 | 2016-11-09 | 深圳市淘淘谷信息技术有限公司 | A kind of block chain realizes the monitoring and managing method of business transaction record |
| CN106228344A (en) * | 2016-07-28 | 2016-12-14 | 杭州云象网络技术有限公司 | A kind of electronic government affairs system building method based on block chain technology |
| CN106230808A (en) * | 2016-07-28 | 2016-12-14 | 杭州云象网络技术有限公司 | A kind of personal credit information system method based on block chain technology |
| CN106250721A (en) * | 2016-07-28 | 2016-12-21 | 杭州云象网络技术有限公司 | A kind of electronic copyright protection method based on block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106779975A (en) | 2017-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106779975B (en) | Tamper-proof method of reputation information based on block chain | |
| US20220245626A1 (en) | Computer-implemented system and method for generating and extracting user related data stored on a blockchain | |
| TWI780433B (en) | A method and device for constructing and predicting an isolated forest model based on federated learning | |
| US20220253858A1 (en) | System and method for analyzing transaction nodes using visual analytics | |
| US20180189753A1 (en) | Infrastructure for obligation management and validation | |
| CN110599165B (en) | Credit system construction method based on block chaining currency sky destruction | |
| CN108737114A (en) | A kind of endorsement method and device of the block catenary system based on quantum key distribution | |
| CN109034795B (en) | Credit barter platform based on block chain | |
| CN109816323A (en) | Transaction auditing method, calculating equipment, storage medium for block chain network | |
| Karimov et al. | An examination of trust assurances adopted by top internet retailers: unveiling some critical determinants | |
| Nasser | Valuation for startups—9 methods explained | |
| CN105279682A (en) | Transaction information processing method and apparatus for commodity object | |
| CN103839165A (en) | CBC business integrity management system | |
| Yang et al. | A reliable e-commerce business model using blockchain based product grading system | |
| Ketzenberg et al. | How ‘buy online, pick up in-store’gives retailers an edge | |
| Wang et al. | Revealing key non-financial factors for online credit-scoring in e-financing | |
| Ramkumar et al. | Quality enhanced framework through integration of blockchain with supply chain management | |
| CN104517177A (en) | Digital framework for business model innovation | |
| US20150149343A1 (en) | Self-aware token | |
| CN109685527B (en) | Method, device, system and computer storage medium for detecting merchant false transaction | |
| CN103927660A (en) | Credit system based on CCEE9000 credit system certification standards | |
| CN105488684A (en) | Method and apparatus for determining recommendation relationship in trading system | |
| CN109801131A (en) | Credit system data processing method and credit system data processing system | |
| Chia-Yu et al. | Applying block-chain technology for commodity authenticity | |
| KR102479166B1 (en) | open market system of ship supplies for chinese-speaking country |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |