CN112116473A - Cross-chain notary mechanism evaluation system and platform - Google Patents

Cross-chain notary mechanism evaluation system and platform Download PDF

Info

Publication number
CN112116473A
CN112116473A CN202010986845.8A CN202010986845A CN112116473A CN 112116473 A CN112116473 A CN 112116473A CN 202010986845 A CN202010986845 A CN 202010986845A CN 112116473 A CN112116473 A CN 112116473A
Authority
CN
China
Prior art keywords
node
module
evaluation
information
credit
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
Application number
CN202010986845.8A
Other languages
Chinese (zh)
Inventor
张绍华
戴炳荣
宋俊典
杨琳
李超
旷志光
刘丰源
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SHANGHAI DEVELOPMENT CENTER OF COMPUTER SOFTWARE TECHNOLOGY
Original Assignee
SHANGHAI DEVELOPMENT CENTER OF COMPUTER SOFTWARE TECHNOLOGY
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by SHANGHAI DEVELOPMENT CENTER OF COMPUTER SOFTWARE TECHNOLOGY filed Critical SHANGHAI DEVELOPMENT CENTER OF COMPUTER SOFTWARE TECHNOLOGY
Priority to CN202010986845.8A priority Critical patent/CN112116473A/en
Publication of CN112116473A publication Critical patent/CN112116473A/en
Pending legal-status Critical Current

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
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • 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/64—Protecting data integrity, e.g. using checksums, certificates or 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G06Q20/401—Transaction verification
    • G06Q20/4016—Transaction verification involving fraud or risk level assessment in transaction processing

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • General Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Bioethics (AREA)
  • Computing Systems (AREA)
  • Health & Medical Sciences (AREA)
  • Data Mining & Analysis (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer Hardware Design (AREA)
  • Software Systems (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Technology Law (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention relates to a cross-chain notary mechanism evaluation system based on an improved pagerank algorithm, which comprises a broadcasting board module, a node module, a data storage module and a credit sequencing module. The broadcast board module is used for displaying voting content, evaluation content and notice information; the node module is used for filling voting information and verifying the node; the data storage module is used for storing node information and voting information. And the credit ordering module is used for evaluating the node credit based on an improved pagerank algorithm. The invention can solve the problem that the credit of the notary is lack of supervision in the existing block chain cross-chain notary mechanism.

Description

Cross-chain notary mechanism evaluation system and platform
Technical Field
The invention relates to the technical field of block chains, in particular to a cross-chain notary mechanism evaluation system and a cross-chain notary mechanism evaluation platform based on an improved pagerank algorithm.
Background
With the development of block chain technology, the advantages of decentralization, traceability and non-falsification are being applied in more and more fields. But the blockchain itself has many problems, such as it is also limited by factors of throughput, network isolation, supervision, etc. Among these problems, the problem of network isolation is particularly serious, and each blockchain is usually independent and cannot communicate directly with each other. Therefore, when information interaction between blockchains is required, the requirement of cross-chain is also caused.
According to the difference of the block chain bottom layer technology, cross-chain information interaction can be divided into isomorphic cross-chains and heterogeneous cross-chains, and the bottom layer technologies of the isomorphic chains are consistent, and the difference is that the application and the data are different; and the bottom layer technologies such as consensus algorithm and security mechanism between heterogeneous chains are different. The consensus algorithm such as etherhouse is based on POS mechanism as distinguished from POW consensus mechanism in bitcoin. The cross-chain interaction between homogeneous chains is simple, and the cross-chain interaction between heterogeneous chains needs specific technical auxiliary support.
Notary mechanisms (Notary schemes), also called witness mechanisms. It is substantially similar to transactions now conducted by banks. The core idea is that chain A, B exists, which is heterogeneous chain, and information interaction cannot be directly performed, and a trusted third party C is responsible for message passing between chains A, B, provided that the trusted third party C can be accepted A, B at the same time. The notary mechanism has the advantage of being able to support a variety of different heterogeneous chains, but it has the disadvantage of being too centralized.
The notary mechanism mode can only support the exchange of assets at present, and the atomicity and the safety of the asset exchange are completely guaranteed by a centralized exchange, so that a large centralized risk exists. The scheme of multiple signatures and distributed signatures developed by iteration at present weakens the characteristics of centralized components and improves the system security from various angles.
In the cross-chain project applying the notary mechanism, the interbedder project realizes cross-chain of different heterogeneous chains by the notary mechanism in the early development, the subsequent development combines the Hash locking technology to realize cross-chain interaction, and the cordia project can realize that two transaction parties can freely select the notary. Either approach requires that the participant notary be trusted.
Disclosure of Invention
The embodiment of the invention provides a cross-chain notary mechanism evaluation model or system based on an improved pagerank algorithm, which is used for solving the problem that notary credit is lack of supervision in a cross-chain notary mechanism.
In one embodiment of the present invention, a cross-chain notary mechanism evaluation system comprises,
the broadcast board module is used for displaying voting content, an evaluation process and notice information;
the node module is used for filling voting information and verifying the node;
the data storage module is used for storing the node information and the voting information;
and the credit ordering module evaluates the node credit by adopting an improved pagerank algorithm.
In order to solve the credibility problem of the notary, the embodiment of the invention provides a cross-link notary evaluation system or model based on an improved Pagerank algorithm, credit degrees of notary nodes are ranked based on evaluation of other notary nodes and historical transaction evaluation of the nodes, and the nodes with the ranked credit degrees are removed to ensure the credit degree of the whole system.
Due to the adoption of the technical scheme, compared with the prior art, the invention has the following advantages and positive effects: according to the cross-link notary evaluation model based on the improved Pagerank algorithm, credit degree sequencing is carried out on notary nodes based on other notary node evaluation and the node historical transaction evaluation, and the nodes with the ranked credit degrees are removed to ensure the integral credit degree of the system. The method provided by the invention can effectively solve the problem of lack of credit supervision of the notary in a cross-chain notary mechanism.
Drawings
The above and other objects, features and advantages of exemplary embodiments of the present invention will become readily apparent from the following detailed description read in conjunction with the accompanying drawings. Several embodiments of the invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which:
FIG. 1 is a flow chart of an improved pagerank-based cross-chain notary evaluation model according to one embodiment of the invention.
FIG. 2 is a flow diagram of a cross-chain notary mechanism evaluation system in accordance with one of the embodiments of the invention.
Detailed Description
In accordance with one or more embodiments, as shown in FIG. 2. A cross-chain notary mechanism evaluation system based on an improved pagerank algorithm comprises a broadcasting board module, a node module, a data storage module and a credit ordering module. The broadcast board module is used for displaying voting content, evaluation content and notice information; the node module is used for filling voting information and verifying the node; the data storage module is used for storing node information and voting information. And the credit ordering module is used for evaluating the node credit based on an improved pagerank algorithm.
The broadcast board module is a module for displaying voting content, evaluation content and notice information. The voting content comprises the information of node voting, the signature of a voter and the signature of a broadcast board; the evaluation process comprises evaluation content and an evaluation result; the advertisement information includes the addresses of the nodes participating in the voting and the voting start and end times.
The node module is used for filling in voting information and verifying the node. The system comprises a node login verification module and an information filling module.
The data storage module is used for storing the node information and the voting information. Contains the data generated by each step, and each data is provided with a signature by the generator.
The credit ordering module is used for carrying out credit ordering on the nodes participating in generating the block. The invention evaluates the node credit based on the improved pagerank algorithm. All the operation steps in the module are displayed on the broadcast board. The pageank algorithm is a method used by google research for web importance assessment. The core idea is to calculate the scores of the pages by using the condition that the web pages are linked to other pages and the other pages are linked to the page, and rank the scores.
When ranking web page importance using the pagerank algorithm, two preconditions are generally assumed:
1. the quantity assumes: assuming that there is a web page, if there are a large number of links connected to it, it is very important to indicate this page; a node in this context, given the large number of other nodes to which it is connected, indicates that the node is very trusted.
2. The quality assumption is that: in the internet, the content quality of each webpage is uneven, and if a high-quality page is connected with the webpage, the weight transmitted to the webpage is high; similarly, if a node with high trust level trusts the node, the weight transferred to the node is high.
Based on the two assumptions, when the algorithm evaluates the page rank based on the following formula, the weight of each page is given the same value, and then the score of each page is updated through continuous recursive iterative calculation until the page score is stable.
Figure BDA0002689539750000031
Wherein L (v) represents the out-chain quantity of the web page v, PR (v) represents the PageRank value of the web page v, and BuRepresenting an in-chain set of web pages u.
However, in the real internet, there is a case where many pages are not connected to any other page, that is, the number of outgoing links of this page is 0, and such a page is called an isolated web page. Based on the problem, google corporation revises the original PageRank calculation formula, introduces a damping coefficient d (damping factor) to the original formula, and according to experiments, the damping coefficient is generally 0.85. The coefficient is the probability that a user jumps from the node to other nodes after using the node at a certain time. If the damping coefficient is 0.15, indicating that the user is not jumping to another node through the node, the improved pagerank algorithm is calculated according to the following formula:
Figure BDA0002689539750000041
according to one or more embodiments, the improvement of the Pagerank algorithm is that the historical transaction information for each node has an inherent impact on its credit evaluation. If the node A is higher than the node B in transaction processing efficiency and user feedback evaluation, the node A and the node B are supposed to be linked in the forward direction; the less negative transaction information, the higher the weight that node a should assign to node B. As shown in fig. 1.
The steps for calculating the credit of node A, B are given below:
1. establishing a set of transaction processing efficiency, user feedback and negative transaction information of the node historical transaction information;
Figure BDA0002689539750000042
2. determining the position weight of the overall evaluation of the user, and calculating the transaction processing efficiency, the user feedback and the negative transaction information:
Figure BDA0002689539750000043
3. and calculating the user feedback evaluation value by the following calculation formula:
Figure BDA0002689539750000044
Qpeoplerepresenting a node overall user feedback evaluation value;
weightpeoplefeeding back the weight on behalf of the node user;
gradejrepresenting the user's historical rating.
4. Calculating the transaction processing efficiency value by the following calculation formula:
Figure BDA0002689539750000051
Qtimea representative node transaction processing efficiency value;
weighttimetransaction processing weights on behalf of the nodes;
timejrepresenting the node transaction processing time.
5. And calculating the evaluation value of the node negative message, wherein the calculation formula is as follows:
Qreverse＝weightreverse*number (7)
Qreverserepresenting the evaluation value of the node negative message;
weightreverseevaluating the weight of the negative message of the representative node;
number represents the number of node negative message evaluations.
6. Finally, obtaining the node transaction processing efficiency, user feedback and negative transaction information evaluation value;
A＝{Qpeople,Qtime,Qreverse} (8)
7. the node M, N similarity is calculated by using a VSM (vector space model), namely:
Figure BDA0002689539750000052
8. the improved pagerank algorithm is finally shown as the formula:
Figure BDA0002689539750000053
if a certain node has no historical transaction information:
PMN＝0 (9)
compared with the traditional block chain cross-chain notary mechanism, the cross-chain notary evaluation model based on the improved Pagerank algorithm effectively solves the problem of lack of credit supervision of notaries in the cross-chain notary mechanism. The whole system provided by the invention fully considers the characteristics of the block chain service and can play a great effect in various service scenes.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention essentially or partially contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (9)

1. A cross-chain notary mechanism evaluation system is characterized in that the evaluation system comprises,
the broadcast board module is used for displaying voting content, an evaluation process and notice information;
the node module is used for filling voting information and verifying the node;
the data storage module is used for storing the node information and the voting information;
and the credit ordering module is used for evaluating the credit of the nodes.
2. The system of claim 1, wherein the credit ranking module evaluates node credits using a pagerank algorithm.
3. The cross-chain notary mechanism evaluation system of claim 1 wherein, in said broadcast board module,
the voting content comprises the information of node voting, the signature of a voter and the signature of a broadcast board;
the evaluation process comprises evaluation content and an evaluation result;
the advertisement information includes the addresses of the nodes participating in the voting and the voting start and end times.
4. The system of claim 1, wherein the node modules comprise a node login verification module and an information filling module.
5. A cross-chain notary mechanism evaluation system as claimed in claim 1 wherein said data storage module contains data generated by said broadcast board module, node module, data storage module and credit sequencing module, each data being signed by its generator.
6. The system of claim 1, wherein the credit ranking module evaluates the node credit based on a modified pagerank algorithm, and all the operation steps in the module are displayed on a broadcast board.
7. The cross-chain notary mechanism evaluation system of claim 6 wherein the improved pagerank algorithm has a calculation formula as shown in formula (2),
Figure FDA0002689539740000011
wherein L (v) represents the out-link quantity of the web page v, PR (v) represents the PageRank value of the web page v, and BuAnd d is a damping coefficient, and N is a positive integer.
8. The cross-chain notary mechanism evaluation system of claim 7 wherein,
assuming node a and a forward link node B to node a, the step of calculating the credit at node A, B includes:
s101, establishing a set of transaction processing efficiency, user feedback and negative transaction information of node historical transaction information;
Figure FDA0002689539740000021
s102, determining the position weight of the overall evaluation of the user, and calculating the transaction processing efficiency, the user feedback and the negative transaction information:
Figure FDA0002689539740000022
s103, calculating a user feedback evaluation value, wherein the calculation formula is as follows:
Figure FDA0002689539740000023
Qpeoplerepresenting node overall user feedback evaluation value, weightpeopleRepresenting node user feedback weights, gradesjRepresenting the historical evaluation value of the user,
s104, calculating the transaction processing efficiency value, wherein the calculation formula is as follows:
Figure FDA0002689539740000024
Qtimea representative node transaction processing efficiency value; weighttimeTransaction processing weights on behalf of the nodes; timejTransaction processing time on behalf of a node;
s105, calculating the evaluation value of the node negative message, wherein the calculation formula is as follows:
Qreverse＝weightreverse*number (7)
Qreverserepresenting the evaluation value of the node negative message; weightreverseEvaluating the weight of the negative message of the representative node; the number represents the evaluation number of the node negative messages;
s106, obtaining node transaction processing efficiency, user feedback and negative transaction information evaluation values;
A＝{Qpeople,Qtime,Qreverse} (8)
s107, calculating the similarity of the node M, N by using the VSM vector space model, that is:
Figure FDA0002689539740000031
s108, obtaining an improved pagerank algorithm as follows:
Figure FDA0002689539740000032
if a node has no historical transaction information
PMN＝0 (9)。
9. A cross-chain notary mechanism evaluation platform is characterized by comprising a server, wherein the server is provided with a memory; and
a processor coupled to the memory, the processor configured to execute instructions stored in the memory, the processor to:
the voting content, the evaluation process and the notice information are displayed through a broadcast board module;
voting information is filled in and verified for the nodes through the node module;
storing the node information and the voting information through a data storage module;
and evaluating the credit degree of the node through a credit ordering module.
CN202010986845.8A 2020-09-18 2020-09-18 Cross-chain notary mechanism evaluation system and platform Pending CN112116473A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010986845.8A CN112116473A (en) 2020-09-18 2020-09-18 Cross-chain notary mechanism evaluation system and platform

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010986845.8A CN112116473A (en) 2020-09-18 2020-09-18 Cross-chain notary mechanism evaluation system and platform

Publications (1)

Publication Number Publication Date
CN112116473A true CN112116473A (en) 2020-12-22

Family

ID=73801398

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010986845.8A Pending CN112116473A (en) 2020-09-18 2020-09-18 Cross-chain notary mechanism evaluation system and platform

Country Status (1)

Country Link
CN (1) CN112116473A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113242131A (en) * 2021-04-22 2021-08-10 卓尔智联(武汉)研究院有限公司 Block chain cross-chain method and device, electronic equipment and storage medium
WO2023088136A1 (en) * 2021-11-16 2023-05-25 中兴通讯股份有限公司 Cross-blockchain method, device, and readable storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102890702A (en) * 2012-07-19 2013-01-23 中国人民解放军国防科学技术大学 Internet forum-oriented opinion leader mining method
CN105138558A (en) * 2015-07-22 2015-12-09 山东大学 User access content-based real-time personalized information collection method
CN108460158A (en) * 2018-03-28 2018-08-28 天津大学 Differentiation Web page sequencing method based on PageRank
CN111090891A (en) * 2020-03-23 2020-05-01 卓尔智联(武汉)研究院有限公司 Notary selection method and notary selection system based on block chain

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102890702A (en) * 2012-07-19 2013-01-23 中国人民解放军国防科学技术大学 Internet forum-oriented opinion leader mining method
CN105138558A (en) * 2015-07-22 2015-12-09 山东大学 User access content-based real-time personalized information collection method
CN108460158A (en) * 2018-03-28 2018-08-28 天津大学 Differentiation Web page sequencing method based on PageRank
CN111090891A (en) * 2020-03-23 2020-05-01 卓尔智联(武汉)研究院有限公司 Notary selection method and notary selection system based on block chain

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
戴炳荣: "基于改进PageRank 算法的跨链公证人机制评价模型", 《计算机工程》, pages 26 - 31 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113242131A (en) * 2021-04-22 2021-08-10 卓尔智联(武汉)研究院有限公司 Block chain cross-chain method and device, electronic equipment and storage medium
CN113242131B (en) * 2021-04-22 2023-10-24 卓尔智联(武汉)研究院有限公司 Block chain crossing method and device, electronic equipment and storage medium
WO2023088136A1 (en) * 2021-11-16 2023-05-25 中兴通讯股份有限公司 Cross-blockchain method, device, and readable storage medium

Similar Documents

Publication Publication Date Title
US11966894B2 (en) Apparatus for cryptographic resource transfer based on quantitative assessment regarding non-fungible tokens
US20190370813A1 (en) Decentralized safeguard against fraud
US11126659B2 (en) System and method for providing a graph protocol for forming a decentralized and distributed graph database
Marti et al. Limited reputation sharing in P2P systems
Babaioff et al. On bitcoin and red balloons
US10594480B2 (en) Efficient proof of knowledge of arbitrarily large data which remains unexposed
Eskandari et al. Sok: Oracles from the ground truth to market manipulation
US20190236298A1 (en) Proof-of-approval distributed ledger
CN107317672A (en) A kind of light weight terminating machine block catenary system
US20210029137A1 (en) Predictive fraud analysis system for data transactions
CN108347483B (en) Decentralized computing system based on double-layer network
US20230281583A1 (en) Systems and Methods for the Facilitation of Blockchains
WO2023279059A2 (en) Distributed ledgers with ledger entries containing redactable payloads
KR102374539B1 (en) Real estate investment brokerage processing server based on security token and operating method thereof
CN112116473A (en) Cross-chain notary mechanism evaluation system and platform
CN112118138B (en) System and method for realizing block chain consensus mechanism
CN111090891B (en) Notary selection method and notary selection system based on block chain
US20230043223A1 (en) Methods for Securely Adding Data to a Blockchain Using Dynamic Time Quanta and Version Authentication
Marti Trust and reputation in peer-to-peer networks
CN110176998A (en) A kind of common recognition method, apparatus, equipment and the storage medium of proof of work
Ma et al. Fundamentals of Smart Contract Security
CN111222885B (en) Data processing request endorsement method and device, computer equipment and storage medium
CN111581280A (en) Service processing method, device and storage medium based on block chain
US20220393892A1 (en) Composite Cryptographic Systems with Variable Configuration Parameters and Memory Bound Functions
CN111260468B (en) Block chain-based data operation method, related equipment and storage medium

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