CN117787739A - Verifiable cross-chain reputation calculation method and system, and evaluation and charging method - Google Patents
Verifiable cross-chain reputation calculation method and system, and evaluation and charging method Download PDFInfo
- Publication number
- CN117787739A CN117787739A CN202311672094.2A CN202311672094A CN117787739A CN 117787739 A CN117787739 A CN 117787739A CN 202311672094 A CN202311672094 A CN 202311672094A CN 117787739 A CN117787739 A CN 117787739A
- Authority
- CN
- China
- Prior art keywords
- polynomial
- reputation
- blockchain
- commitment
- calculation
- 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
- 238000004364 calculation method Methods 0.000 title claims abstract description 223
- 238000000034 method Methods 0.000 title claims abstract description 72
- 238000011156 evaluation Methods 0.000 title claims abstract description 18
- 238000012795 verification Methods 0.000 claims description 83
- 230000008569 process Effects 0.000 claims description 48
- 230000005540 biological transmission Effects 0.000 claims description 20
- 238000012797 qualification Methods 0.000 claims description 18
- 238000012216 screening Methods 0.000 claims description 18
- 238000010200 validation analysis Methods 0.000 claims description 18
- 238000012163 sequencing technique Methods 0.000 claims description 6
- 230000002452 interceptive effect Effects 0.000 claims description 4
- 238000004891 communication Methods 0.000 claims description 3
- 125000004122 cyclic group Chemical group 0.000 claims description 3
- 238000012946 outsourcing Methods 0.000 description 25
- 230000003993 interaction Effects 0.000 description 14
- 230000007246 mechanism Effects 0.000 description 12
- 238000010586 diagram Methods 0.000 description 10
- 238000012546 transfer Methods 0.000 description 9
- 230000008859 change Effects 0.000 description 8
- 230000005284 excitation Effects 0.000 description 8
- 238000000605 extraction Methods 0.000 description 5
- 238000012545 processing Methods 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 230000000052 comparative effect Effects 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000012544 monitoring process Methods 0.000 description 3
- CURLTUGMZLYLDI-UHFFFAOYSA-N Carbon dioxide Chemical compound O=C=O CURLTUGMZLYLDI-UHFFFAOYSA-N 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000007613 environmental effect Effects 0.000 description 2
- 230000004931 aggregating effect Effects 0.000 description 1
- 229910002092 carbon dioxide Inorganic materials 0.000 description 1
- 239000001569 carbon dioxide Substances 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 230000001052 transient effect Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
At least one embodiment of the present disclosure provides a verifiable cross-chain reputation calculation method, a reputation calculation system applied to electric vehicle charging, a reputation evaluation method and a charging method, comprising: the first block link receives and stores a first quality of service parameter sent by the service device and a second quality of service parameter sent by the service device; the second block link receives and stores the rating parameter of the service equipment sent by the service device; the third blockchain receives the first polynomial, the second polynomial and the reputation calculation polynomial, delegates promises of the first polynomial and the first polynomial to the first blockchain, and delegates promises of the second polynomial and the second polynomial to the second blockchain; the first blockchain verifies the first polynomial, calculates a consistent reputation and a plurality of first witness values according to the first quality of service parameter and the second quality of service parameter when the commitment of the first polynomial corresponds to the first polynomial, and transmits the consistent reputation and the plurality of first witness values to the third blockchain.
Description
Technical Field
Embodiments of the present disclosure relate to a verifiable cross-chain reputation calculation method, a reputation calculation system applied to electric vehicle charging, a reputation evaluation method applied to electric vehicle charging system, and a charging method of an electric vehicle.
Background
With the growing global environmental protection demands, methods for reducing resource consumption and carbon dioxide emissions are being sought in all countries of the world. Electric Vehicles (EV) have advantages of low energy consumption, clean emission, and the like, and are very friendly to the environment, so Electric vehicles are currently being developed in various countries, and environmental protection is expected to be achieved through new technologies and new energy. However, due to the lack of foundation equipment such as charging piles, development of the electric automobile industry is hindered to a certain extent. Although the speed of charging facilities in China is gradually increased in recent years, a larger gap is still reserved compared with the increase of the number of electric vehicles. In order to solve the current situation that the ratio of Charging piles to electric vehicles is low, charging Pile (CP) operators bring private Charging piles into a shared Charging system. The private charging pile is added in the sharing charging system, so that the problem of insufficient charging pile can be relieved to a certain extent. However, due to the lack of timely maintenance of the private charging pile, users often face the problem that the private charging pile is damaged and the service attitude of the charging pile owner is poor, namely the problem that the service quality is poor due to the introduction of the private charging pile. Thus, the user can be matched with the appropriate charging stake by calculating the reputation of the private charging stake.
Disclosure of Invention
The embodiment of the disclosure relates to a verifiable cross-chain reputation calculation method, a reputation calculation system applied to electric vehicle charging, a reputation evaluation method applied to electric vehicle charging system and an electric vehicle charging method, and solves the problem that complex reputation calculation needs to be conducted on information interaction for multiple times in a cross-chain manner through a cross-chain outsourcing polynomial, namely, the polynomial and a calculation result thereof are transmitted between a main chain and a sub-chain in a cross-chain manner, so that the number of times of cross-chain information transmission can be reduced, cross-chain resources are saved, interaction efficiency is improved, the problem that the polynomial is damaged and tampered possibly in the process of transmitting the outsourcing polynomial can be solved, therefore, the integrity and the correctness of polynomial calculation can be guaranteed, and a consensus node selection and excitation mechanism algorithm can guarantee the correctness of information extraction of the outsourcing polynomial in block chain calculation.
At least one embodiment of the present disclosure provides a verifiable cross-chain reputation calculation method, comprising: the first block link receives and stores a first quality of service parameter sent by the service device and a second quality of service parameter sent by the service device; the second block link receives and stores the rating parameter of the service equipment sent by the served device; a third blockchain receives a first polynomial, a second polynomial and a reputation calculation polynomial set by a service platform, generates a commitment of the first polynomial based on the first polynomial and parameters of initialization of a program for commitment calculation, generates a commitment of the second polynomial based on the second polynomial and parameters of initialization of the program for commitment calculation, commits the commitment of the first polynomial and the first polynomial to the first blockchain, and commits the commitment of the second polynomial and the second polynomial to the second blockchain; the first blockchain validating the first polynomial based on a first validation formula and a commitment of the first polynomial, calculating a consistent reputation and a plurality of first witness values from the first quality of service parameter and the second quality of service parameter when the commitment of the first polynomial corresponds to the first polynomial, and transmitting the consistent reputation and the plurality of first witness values to the third blockchain; the second blockchain validating the second polynomial based on a second validation formula and a commitment of the second polynomial, calculating a recommended reputation and a plurality of second witness values according to the rating parameters when the commitment of the second polynomial corresponds to the second polynomial, and transmitting the recommended reputation and the plurality of second witness values to the third blockchain; the third blockchain verifies the consistent reputation according to the promise of the first polynomial and a plurality of the first witness values, and when verification passes, the consistent reputation is true; and the third blockchain verifies the recommended reputation according to the promise of the second polynomial and a plurality of second witness values, and when the verification passes, the recommended reputation is true, and the third blockchain calculates reputation parameters of the service equipment based on the consistent reputation, the recommended reputation and the reputation calculation polynomial.
For example, in the reputation calculation method provided in at least one embodiment of the present disclosure, before delegating the first polynomial and the promise of the first polynomial to the first blockchain and delegating the second polynomial and the promise of the second polynomial to the second blockchain, the reputation calculation method further includes: the first blockchain compares the first quality of service parameter with the second quality of service parameter, and when the first quality of service parameter and the second quality of service parameter are the same, the transaction between the served device and the service equipment is true, and then a subsequent reputation calculation is performed.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, the process of generating the commitment of the first polynomial and the commitment of the second polynomial includes: initializing the program of commitment calculation, and the initializing process comprises: selecting two cyclic groups G and G of prime order p T So that there is a bilinear map e: g is G.fwdarw.G T Wherein the generator of group G is G, and the elliptic curve bilinear group used is Γ= (e, G) T ) The first blockchain randomly selects a plurality of secret parameters alpha i (i＜n 1 ) The second blockchain randomly selects a plurality of blocksSecret parameter beta j (j＜n 2 ) Wherein n is 1 Calculating the first polynomial F of the consistent reputation on the first blockchain 1 (x, y) the number of unit polynomials which can be decomposed, and n 1 ＝2n 2 Calculating the second polynomial F of the recommendation reputation for the second blockchain 2 (x, y) number of decomposable unit polynomials, and n 2 =2, the first polynomial F on the first blockchain 1 (x，y)＝f 1x (x)+f 1y (y)+f 1 (x, y), where f 1x (x) The highest power of t 11 ，f 1y (y) the highest power of t 12 And is f 1x (x) Generating a (t) 11 +1) tuple:is f 1y (y) generating a (t) 12 +1) tuple: />The second polynomial F on the second blockchain 2 (x，y)＝f 2x (x)+f 2y (y)+f 2 (x，y)，f 2x (x) The highest power of (t) 21 +1)，f 2y The highest power of (y) is (t 22 +1), and is f 1y (y) generating a (t) 21 +1) tuple: />Is f 2y (y) generating a (t) 22 +1) tuple: />
For example, in the reputation calculation method provided in at least one embodiment of the present disclosure, after the initializing, the method further includes: the third blockchain calculates the first polynomial F 1 F in (x, y) 1x (x) Kate commitment of (a)f 1y (y) kate promise->The third blockchain calculates the second polynomial F 2 F in (x, y) 2x (x) Kate promise->f 2y (y) kate promise- >Wherein d 1x ，d 1y ，d 2x ，d 2y Respectively f 1x (x)，f 1y (y)，f 2x (x)，f 2y The highest powers of the polynomials of (y) and are respectively equal to t 11 ，t 12 ，t 21 ，t 22 The method comprises the steps of carrying out a first treatment on the surface of the The third blockchain pair the first polynomial F 1 F in (x, y) 1 (x, y) hashing while committing C to the kate 1x And the kate promise C 1y To construct a first merck tree; the third blockchain pairs the second polynomial F 2 F in (x, y) 2 (x, y) hashing while committing C to the kate 2x And the kate promise C 2y Is hashed to construct a second merck tree.
For example, in the reputation calculation method provided in at least one embodiment of the present disclosure, after the third blockchain generates the first merck tree and the second merck tree, the method further includes: the third blockchain commits the kate to C 1x The kate promise C 1y And said first merck tree is packaged into a first message Commit 1 The first message Commit is sent to the communication device 1 And the first polynomial F 1 (x, y) sending together to the first blockchain, the third blockchain committing the kate to C 2x The kate promise C 2y And said second merck tree is packaged into a second message Commit 2 And Commit the second message 2 And the second polynomial F 2 (x, y) are sent together to the second blockchain.
For example, reputation calculator provided in at least one embodiment of the present disclosureIn the method, after the third blockchain is sent, the first blockchain verifies the first polynomial F based on the promise of the first polynomial 1 (x, y) comprising: selecting part of nodes in the first blockchain as first nodes according to the first message Commit 1 Validating said first polynomial F 1 (x, y) when the first message Commit 1 And the first polynomial F 1 (x, y) when they are identical, said first polynomial F 1 (x, y) is true and is based on the first polynomial F 1 (x, y) calculating to obtain said consistent reputation and a plurality of said first witness values; the second blockchain validating the second polynomial F based on a commitment of the second polynomial 2 (x, y) comprising: selecting part of nodes in the second blockchain as second nodes according to the second message Commit 2 Validating said second polynomial F 2 (x, y) when the second message Commit 2 And the second polynomial F 2 (x, y) when they are identical, said second polynomial F 2 (x, y) is true and is based on the second polynomial F 2 (x, y) calculating to obtain said recommended reputation and a plurality of said second witness values.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, the process of calculating the first witness value and the second witness value includes: will be guaranteed the first polynomial F 1 (x, y) and the second polynomial F 2 (x, y) said first blockchain being according to said first polynomial F, provided that said first polynomial is correct 1 (x, y) extracting the required information from the first blockchain, for the first polynomial F 1 (x, y) computing to obtain the consistent reputation, the second blockchain being in accordance with the second polynomial F 2 (x, y) extracting the required information from the second blockchain, for the second polynomial F 2 (x, y) calculating to obtain the recommendation reputation.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, the first polynomial F is 1 (x, y) and the second polynomial F 2 The (x, y) calculation includes: the saidA first blockchain and the second blockchain are respectively directed to the first polynomial F 1 (x, y) and the second polynomial F 2 (x, y) inputting the first parameter a and outputting the corresponding calculation result R a Wherein the first parameter a is the first polynomial F 1 (x, y) and the second polynomial F 2 A combination of x and y values in (x, y), wherein the first blockchain is for a unit polynomial f 1x (x)，f 1y (y) setting a function Based on the above function, the first blockchain generates the first witness values, respectivelyWherein, (F) 1xa (x)，w 1x (a))，(F 1ya (y)，w 1y (a) Respectively corresponding unit polynomials f 1x (x)，f 1y (y) Unit polynomial witnessing the second blockchain for Unit polynomial f 2x (x)，f 2y (y) set function->Based on the above function, the second witness values +_are generated separately>Wherein, (F) 2xa (x)，w 2x (a))，(F 2ya (y)，w 2y (a) Respectively corresponding unit polynomials f 2x (x)，f 2y The unity polynomial witnessing of (y).
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, the first polynomial F is 1 (x, y) and the second polynomial F 2 (x, y) further comprises: the first blockchain pairs the first polynomial F 1 Polynomial f in (x, y) 1 (x, y) and hashing the unit polynomial witness (F 1xa (x)，w 1x (a))，(F 1ya (y)，w 1y (a) Hashed and building a third merck tree, then witnessing the unit polynomial (F 1xa (x)，w 1x (a))、(F 1ya ( y )，w 1y (a) And the third merck tree into a third message CreateWitness 1 And (a, R) a ) Send to the third blockchain; the second blockchain pairs the second polynomial F 2 Polynomial f in (x, y) 2 (x, y) and hashing the unit polynomial witness (F 2xa (x)，w 2x (a))，(F 2ya (y)，w 2y (a) Hashed and building a fourth merck tree, then witnessing the unit polynomial (F 2xa (x)，w 2x (a))、(F 2ya (y)，w 2y (a) Packed with the fourth merck tree into a fourth message CreateWitness 2 And (a, R) a ) To the third blockchain.
For example, in the reputation calculation method provided in at least one embodiment of the present disclosure, the reputation calculation method further includes: the third blockchain transmitting the first polynomial F according to the first blockchain 1 (x, y) the third message CreateWitness 1 Obtaining a unit polynomial f 1x (x)，f 1y The unit polynomial witness of (y) (F 1xa (x)，w 1x (a))，(F 1ya (y)，w 1y (a) Building a fifth merck tree and according to said first polynomial F 1 (x, y) Unit polynomial commitment C 1x ，C 1y And the generator g, calculate the verification formulaAnd-> When the verification formula is established, the fifth merck tree is matched with the third message CreateWitness 1 When the third merck tree in the first message CreateWitness is equal 1 Is true; the third blockchain is according toThe second polynomial F sent by the second blockchain 2 (x, y) the fourth message CreateWitness 2 Obtaining a unit polynomial f 2x (x)，f 2y The unit polynomial witness of (y) (F 2xa (x)，w 2x (a))，(F 2ya (y)，w 2y (a) Building a sixth merck tree and according to said second polynomial F 2 (x, y) Unit polynomial commitment C 2x ，C 2y And the generator g, calculate the verification formula +.>Andwhen the verification formula is established, the sixth merck tree is matched with the fourth message CreateWitness 2 When the fourth merck tree is equal, the fourth message CreateWitness 2 Is true.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, the reputation calculation polynomial is the first polynomial F 1 (x, y) and the second polynomial F 2 (x, y) when the third message CreateWitness 1 Is true, and the fourth message CreateWitness 2 When true, the third blockchain calculating reputation parameters of the service device based on the consistent reputation, the recommendation reputation, the reputation calculation polynomial includes: substituting the first quality of service parameter into a first polynomial F 1 (x, y) calculating to obtain a consistent credit, substituting the rating parameter into the second polynomial F 2 (x, y) calculating to obtain a recommended reputation, and then adding the consistent reputation and the recommended reputation to obtain reputation parameters of the service equipment.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, the reputation calculation polynomial is the first polynomial F 1 (x, y) and the second polynomial F 2 (x, y) when the third message CreateWitness 1 Is true, and the fourth message CreateWitness 2 When the result is true, the data is displayed,the third blockchain calculating reputation parameters of the service device based on the consistent reputation, the recommended reputation, the reputation calculation polynomial includes: substituting the first quality of service parameter into a first polynomial F 1 (x, y) calculating to obtain a consistent credit, substituting the rating parameter into the second polynomial F 2 (x, y) calculating to obtain a recommended reputation, and then multiplying the consistent reputation and the recommended reputation to obtain a reputation parameter of the service equipment.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, determining the first node includes: performing qualification screening on N nodes participating in reputation calculation verification in the first blockchain, determining that the selected node can participate in the calculation and verification process of the reputation value when the reputation value of the selected node is higher than a threshold value determined by a service platform, determining and eliminating malicious nodes when the reputation value of the selected node is lower than the threshold value, determining that the number of the nodes passing qualification screening is N, and taking the N nodes passing qualification screening as the first nodes; and sequencing the reputation values of the first nodes from high to low, selecting 1 from 1 or more first nodes with highest reputation values as first computing nodes, and taking the rest (N-1) first nodes as first verification nodes, wherein N and N are natural numbers which are more than or equal to 2, and N is less than N.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, determining the second node includes: performing qualification screening on M nodes participating in reputation calculation verification in the second blockchain, determining that the selected nodes can participate in the reputation calculation and verification process when the reputation value of the selected nodes is higher than a threshold value determined by a service platform, determining and eliminating malicious nodes when the reputation value of the selected nodes is lower than the threshold value, determining that the number of the nodes passing qualification screening is M, and taking the M nodes passing qualification screening as the second nodes; and sequencing the reputation values of the second nodes from high to low, selecting 1 from 1 or more second nodes with highest reputation values as second calculation nodes, and taking the rest (M-1) second nodes as second verification nodes, wherein M and M are natural numbers which are more than or equal to 2, and M is less than M.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, as the complexity of the first polynomial and the second polynomial becomes larger, the time consumption and the space consumption of the reputation calculation are substantially unchanged.
For example, in the reputation calculation method provided in at least one embodiment of the present disclosure, the first quality of service parameter sent by the served device and the second quality of service parameter sent by the serving device each include efficiency of a service, timeliness of the service, and cost performance of the service.
At least one embodiment of the present disclosure also provides a reputation computing system applied to electric vehicle charging, comprising: the system comprises a multi-chain computing platform, a service platform and charging equipment, wherein the multi-chain computing platform comprises a first block chain and a second block chain which are mutually independent, and a third block chain which performs data transmission and interactive verification with the first block chain and the second block chain; the first blockchain is configured to receive and store a first quality of service parameter sent by a user of the electric vehicle and a second quality of service parameter sent by the charging device; the second blockchain is configured to receive and store rating parameters sent by the electric vehicle user for the charging device; the third blockchain is configured to receive a first polynomial, a second polynomial, and a reputation calculation polynomial set by a service platform, generate a commitment of the first polynomial based on the first polynomial and parameters of initialization of the program for the commitment calculation, generate a commitment of the second polynomial based on the second polynomial and parameters of initialization of the program for the commitment calculation, delegate the commitment of the first polynomial and the first polynomial to the first blockchain, and delegate the commitment of the second polynomial and the second polynomial to the second blockchain; the first blockchain is further configured to validate the first polynomial based on a first validation formula and a commitment of the first polynomial, calculate a consistent reputation and a plurality of first witness values from the first quality of service parameter and the second quality of service parameter when the commitment of the first polynomial corresponds to the first polynomial, and transmit the consistent reputation and the plurality of first witness values to the third blockchain; the second blockchain is further configured to validate the second polynomial based on a second validation formula and a commitment of the second polynomial, calculate a recommended reputation and a plurality of second witness values from the rating parameters when the commitment of the second polynomial corresponds to the second polynomial, and transmit the recommended reputation and the plurality of second witness values to the third blockchain; the third blockchain is further configured to verify the consistent reputation according to a commitment of the first polynomial and a plurality of the first witness values, the consistent reputation being true when verification passes; and verifying the recommended reputation according to the promise of the second polynomial and a plurality of second witness values, wherein the recommended reputation is true when verification passes, and the third blockchain calculates reputation parameters of the charging device based on the consistent reputation, the recommended reputation and the reputation calculation polynomial.
The present disclosure also provides, in at least one embodiment, a reputation evaluation method applied to an electric vehicle charging system, including: the first block link receives and stores a first quality of service parameter sent by a user of the electric vehicle and a second quality of service parameter sent by the private charging equipment; a second block link receives and stores rating parameters of the private charging equipment sent by the electric vehicle user; a third blockchain receives a first polynomial, a second polynomial and a reputation calculation polynomial set by a service platform, generates a commitment of the first polynomial based on the first polynomial and parameters of initialization of a program for commitment calculation, generates a commitment of the second polynomial based on the second polynomial and parameters of initialization of the program for commitment calculation, commits the commitment of the first polynomial and the first polynomial to the first blockchain when determining that the first quality of service parameter and the second quality of service parameter are consistent, and commits the commitment of the second polynomial and the commitment of the second polynomial to the second blockchain; the first blockchain validating the first polynomial based on a first validation formula and a commitment of the first polynomial, calculating a consistent reputation and a plurality of first witness values from the first quality of service parameter and the second quality of service parameter when the commitment of the first polynomial corresponds to the first polynomial, and transmitting the consistent reputation and the plurality of first witness values to the third blockchain; the second blockchain validating the second polynomial based on a second validation formula and a commitment of the second polynomial, calculating a recommended reputation and a plurality of second witness values according to the rating parameters when the commitment of the second polynomial corresponds to the second polynomial, and transmitting the recommended reputation and the plurality of second witness values to the third blockchain; the third blockchain verifies the consistent reputation according to the promise of the first polynomial and a plurality of the first witness values, and when verification passes, the consistent reputation is true; and the third blockchain verifies the recommendation reputation according to the promise of the second polynomial and a plurality of second witness values, and when the verification passes, the recommendation reputation is true, and the third blockchain calculates reputation parameters of the private charging equipment based on the consistent reputation, the recommendation reputation and the reputation calculation polynomial.
At least one embodiment of the present disclosure also provides a charging method of an electric vehicle, including: the electric vehicle to be charged sends a service request to a service platform, the service platform sends a request for inquiring the credit of the private charging equipment to a multi-chain computing platform, the multi-chain computing platform returns the recommended credit of the private charging equipment to the service platform, and then the service platform sends service authentication to the recommended private charging equipment.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings of the embodiments will be briefly described below, and it is apparent that the drawings in the following description relate only to some embodiments of the present disclosure, not to limit the present disclosure.
FIG. 1 is a flow chart of a verifiable cross-chain reputation calculation method provided by at least one embodiment of the present disclosure;
FIG. 2 is a schematic diagram of a verifiable cross-chain reputation calculation method provided by at least one embodiment of the present disclosure;
FIG. 3 is a schematic diagram of yet another verifiable cross-chain reputation calculation method provided by at least one embodiment of the present disclosure;
FIG. 4 is a schematic diagram of a computing process of a multi-chain computing platform provided in accordance with at least one embodiment of the present disclosure;
FIG. 5 is a comparative graph of a reputation computed time performance evaluation provided by at least one embodiment of the present disclosure;
FIG. 6 is a comparative graph of a spatial performance evaluation of reputation computation provided in accordance with at least one embodiment of the present disclosure;
FIG. 7 is a diagram of a cross-chain transmission polynomial and a guaranteed time overhead as a function of the degree of the polynomial provided in accordance with at least one embodiment of the present disclosure;
FIG. 8 is a schematic diagram of the variation of time overhead of cross-chain transmission computation results and witness with polynomial degree provided by at least one embodiment of the present disclosure; and
fig. 9 is a flowchart of a charging method of an electric vehicle according to at least one embodiment of the present disclosure.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present disclosure. It will be apparent that the described embodiments are some, but not all, of the embodiments of the present disclosure. All other embodiments, which can be made by one of ordinary skill in the art without the need for inventive faculty, are within the scope of the present disclosure, based on the described embodiments of the present disclosure.
Unless defined otherwise, technical or scientific terms used in this disclosure should be given the ordinary meaning as understood by one of ordinary skill in the art to which this disclosure belongs. The terms "first," "second," and the like, as used in this disclosure, do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that elements or items preceding the word are included in the element or item listed after the word and equivalents thereof, but does not exclude other elements or items. The terms "connected" or "connected," and the like, are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect.
Reputation is a common service assessment scheme and is receiving extensive attention from many scholars. At present, most of information for calculating the credit of the private charging pile by an operator comes from a third party sharing charging platform, and the method effectively solves the problem of calculating the credit of the private charging pile, but is easily influenced by single point failure and central spoofing.
Based on the characteristics that the blockchain is not tamperable and multiparty accounting is performed, the blockchain is introduced to solve the problems of single point failure and central spoofing in an accounting model. However, calculating the reputation value of the private charging stake requires storing and recalling a large amount of information, such as identity information, billing information, and rating information. If the information is stored in time order on the same blockchain, they will be interactively stored, which may lead to inefficient queries. That is, the scheme of reputation computation based on the same blockchain, while solving the problem of single point failure, also presents a challenge of inefficient storage and querying. Although query efficiency may be improved by adding pointer indexes to the same type of data, challenges are presented in that the block structure is complex and incompatible with current blockchain platforms, making the establishment, verification and determination of blocks more difficult. Thus, information classification may be considered to be stored on multiple chains, but reputation needs to be calculated in a cross-chain mode.
The cross-chain computing reputation faces the problems of correctness verification, integrity verification and efficiency guarantee, identity information, charging information and evaluation information can be stored on a plurality of blockchains in a classified mode, and then a corresponding cross-chain safety scheme is designed to guarantee the safety and accuracy of information transfer among different blockchains. However, when such information delivery schemes are used to calculate reputation, multiple interactions of information between different blockchains are involved. The degree of information interaction increases linearly with increasing complexity of the reputation polynomial. Thus, the method of storing information classifications on multiple chains is not applicable to complex cross-chain reputation calculations that require multiple invocations of information.
The inventor of the disclosure proposes a verifiable cross-chain reputation calculation method capable of adopting polynomial promise, solves the problem that complex reputation calculation needs to perform information interaction for multiple times in a cross-chain manner through a cross-chain outsourcing polynomial, namely, the polynomial and a calculation result thereof are transferred between a main chain and a sub-chain in a cross-chain manner, so that the number of times of transferring the cross-chain information is reduced, the cross-chain resource is saved, the interaction efficiency is improved, and meanwhile, the problem that the polynomial is damaged and tampered possibly encountered in the outsourcing polynomial transfer process can be solved, so that the completeness and the correctness of polynomial calculation can be ensured. Moreover, the consensus node selection and excitation mechanism algorithm can ensure the correctness of information extraction when the outsourcing polynomial is calculated on the blockchain.
However, due to the different common scope of different blockchains, the correctness of the outsourced polynomials transferred across the chains and their calculation results is difficult to verify. Moreover, because the computation and use of the outsourcing polynomial are not on the same blockchain, the blockchain using the computation result cannot determine whether the outsourcing polynomial computation process is complete. In addition, because the information between different blockchains cannot be directly verified, verification information needs to be carried across chains, and if the information to be checked is too much, the efficiency of the checking is reduced. The verifiable cross-chain reputation computing method adopting polynomial promise also brings three challenges of correctness verification and efficiency verification of cross-chain information transmission and cross-chain outsourcing polynomial computing process. Therefore, the inventor of the present disclosure herein devised an efficient, verifiable charging pile reputation calculation scheme based on polynomial outsourcing to solve the problems of correctness verification of the above-described cross-chain information transfer, integrity verification and efficiency verification of the cross-chain outsourcing polynomial calculation process. In the embodiment of the disclosure, regardless of the complexity of the polynomial of the cross-chain reputation calculation, the integrity and the correctness of the cross-chain information can be ensured by only transmitting the polynomial and the promise and witness of the corresponding polynomial, so that the cross-chain resource is saved, and the query efficiency is improved. The polynomial commitment consisting of the Kate commitment and the Merkle tree is used in the scheme, so that the correctness and the integrity of the polynomial calculation result and the process in the cross-chain operation process are ensured.
Blockchain technology is a method for storing, transmitting and proving data, which is decentralized and resides in a distributed structure, and blocks (Block) can replace the current dependence of the Internet on a central server, for example, all data changes or transaction items can be recorded on a cloud system, so that self-proving of the data in data transmission is realized theoretically.
Each chunk is a container data structure that is contained in the blockchain, aggregating data, and consists of a chunk header containing metadata followed by a long string of transaction data that make up the body of the chunk. The block specifically comprises: a block size field, typically 4 bytes; a block header field, typically 80 bytes; a transaction counter field, typically 1-9 bytes, recording the number of transactions; transaction fields, typically of variable length, record transaction details.
The chunk header consists of three sets of metadata, the first set of metadata being a set of data referencing the parent chunk hash value, which is used to connect the chunk with the previous chunk in the blockchain. The second set of metadata includes difficulty, time stamp, and Number used once only (simply "Nonce"). The third set of metadata is the merck (Merkle) root (a data structure that is used to efficiently summarize all transactions in a block). For example, the block header may include the following fields: (1) a version field, typically 4 bytes; (2) A parent block hash value field, typically 32 bytes, for referencing the hash value of the parent block (i.e., the previous block) in the blockchain; (3) A Merkle root field for recording the hash value of the Merkle root of the transaction in the block; (4) A timestamp field, typically a 4 field, for identifying the approximate time of the block generation, which may be accurate to seconds; (5) The Nonce field is a counter (e.g., a random number) for the workload certification algorithm.
Each chunk may reference the previous chunk by its "parent chunk hash value field" of its chunk header. That is, each chunk header contains the hash value of its parent chunk. Also, each block has only one parent block, but there may be multiple child blocks temporarily. The case where multiple sub-blocks occur in a block is referred to as "blockchain forking. The blockchain bifurcation indicates a transient state, eventually only one sub-block will become part of the blockchain.
A blockchain is a data structure that is linked sequentially from back to front by blocks, each block pointing to a previous block. It may be stored as a file containing non-relative records or in a simple database. The blockchain can be seen as a stack, with the blockchain height representing the distance between the block and the head block and the top or top representing the most current block. Encrypting (e.g., secure hash algorithm (Secure Hash Algorithm, abbreviated as "SHA")) each chunk header may generate a hash value. The corresponding block in the blockchain can be identified by this hash value, i.e. the hash value is used to construct a hash pointer, and accordingly the blockchain can be regarded as a linked list using hash pointers. Currently, commonly used SHA algorithms include SHA256 algorithm.
Blockchains can be generally divided into public chains, alliance chains, and private chains according to access rights. The public chain refers to a blockchain which can be accessed by anyone according to a protocol and participates in consensus; the alliance chain refers to a block chain of which the consensus process is controlled by a preselected node; a private chain refers to a blockchain in which all rights are in and under the discretionary control of an organization.
For the entire blockchain network, the goal that needs to be achieved is that all devices agree to a certain information and update it into the total shared ledger. To this end, a consensus mechanism is introduced in the blockchain network. Typical algorithms in the consensus mechanism include, for example, proof Of Work ("PoW"), proof Of equity ("PoS"), proof Of stock authority ("DPoS"), distributed consistency algorithms, thereby enabling the consensus mechanism Of blockchains and the allocation Of accounting rights in blockchain networks.
A smart contract is a piece of executable code stored in a blockchain (e.g., a blockchain node in a blockchain network) that specifies the execution conditions of the smart contract and the business processing logic, i.e., the conditions under which the smart contract is started and how the received business processing request is processed after the start of the smart contract. Typically, smart contracts, once written by a user and released to the blockchain, cannot be edited or modified any more. For example, execution operations of the smart contract may be triggered based on events. For example, execution of a smart contract may be recorded as a transaction on the blockchain and recorded in the blockchain.
In summary, the working process of the blockchain network may include the following seven processes: transaction generation, transaction broadcasting, node calculation, acquisition of accounting rights, accounting rights broadcasting, receiving of block, verification of block and accounting completion. The seven processes are respectively described as follows:
1) Transaction generation: a user (comprising an intelligent contract) sends a transaction request at a node of a blockchain network to generate a new transaction;
2) Transaction broadcast: when a new transaction is generated, the node broadcasts the transaction information in the blockchain network, and other nodes in the blockchain network all receive the transaction information;
3) Node calculation: the node which receives the transaction information calculates through a consensus algorithm, and decides which node obtains the accounting right aiming at the transaction information through the calculation result;
4) Acquiring accounting rights: according to different consensus algorithms, one of the nodes will acquire the accounting right, e.g. in case of using PoW, the node that calculates the hash value meeting the requirements fastest will acquire the accounting right;
5) Billing right broadcast: the node for acquiring the accounting right packs the transaction to construct a new block, and then broadcasts the new block to all nodes in the blockchain network;
6) Verification block: the node receiving the broadcast information verifies the transaction information contained in the new block, and after confirming the validity, the node receives the block and links the new block at the tail of the block chain of each version;
7) And (3) finishing accounting: after all nodes accept the new block, the update of the blockchain is realized, and the nodes in the blockchain network wait for the generation of the next transaction.
For example, blockchains may be applied in a variety of fields, such as in electric vehicle charging systems, to enable decentralization, information non-tampering, multi-node collective maintainability, openness, privacy protection, etc., to provide trusted transaction information data.
At least one embodiment of the present disclosure provides a verifiable cross-chain reputation calculation method, comprising: the first block link receives and stores a first quality of service parameter sent by the service device and a second quality of service parameter sent by the service device; the second block link receives and stores the rating parameter of the service equipment sent by the service device; the third blockchain receives a first polynomial, a second polynomial and a reputation calculation polynomial set by the service platform, generates a commitment of the first polynomial based on the first polynomial and parameters of initialization of the program for commitment calculation, generates a commitment of the second polynomial based on the second polynomial and parameters of initialization of the program for commitment calculation, commits the first polynomial and the commitment of the first polynomial to the first blockchain, and commits the second polynomial and the commitment of the second polynomial to the second blockchain; the first blockchain verifies the first polynomial based on the first verification formula and the promise of the first polynomial, calculates a consistent reputation and a plurality of first witness values according to the first quality of service parameter and the second quality of service parameter when the promise of the first polynomial corresponds to the first polynomial, and transmits the consistent reputation and the plurality of first witness values to the third blockchain; the second blockchain verifies the second polynomial based on the second verification formula and the promise of the second polynomial, calculates a recommendation reputation and a plurality of second witness values according to the rating parameter when the promise of the second polynomial corresponds to the second polynomial, and transmits the recommendation reputation and the plurality of second witness values to the third blockchain; the third blockchain verifies the consistent reputation according to the promise of the first polynomial and the plurality of first witness values, and when the verification passes, the consistent reputation is true; the third blockchain verifies the recommended reputation according to the promise of the second polynomial and the second witness values, and when the verification is passed, the recommended reputation is true, and the third blockchain calculates reputation parameters of the service equipment based on the consistent reputation, the recommended reputation and the reputation calculation polynomials. The verifiable cross-chain reputation calculation method can reduce the times of cross-chain information transmission, save cross-chain resources, improve interaction efficiency, and solve the problems of polynomial damage and tampering possibly encountered in the process of outsourcing polynomial transmission, so that the completeness and correctness of polynomial calculation can be ensured. Moreover, the consensus node selection and excitation mechanism algorithm can ensure the correctness of information extraction when the outsourcing polynomial is calculated on the blockchain.
For example, in embodiments of the present disclosure, the communication connection between the served device, the serving apparatus, the serving platform, the first blockchain, the second blockchain, and the third blockchain is implemented via a network, e.g., the network may be a single network, or a combination of at least two different networks. For example, the network may include, but is not limited to, one or a combination of several of a local area network, a wide area network, a public network, a private network, and the like. For example, the served device may be an electric vehicle and the corresponding service equipment may be a charging pile. The service platform may be a terminal device used by a charging service provider (EVSP), for example, for scheduling reasonable charging times in advance for EV users, matching appropriate charging piles, etc. The user of the served device may send a request to the service platform using a cell phone, a computer, an electric vehicle, etc., or an application program on a cell phone, a computer, an electric vehicle, etc., but embodiments of the present disclosure are not limited thereto.
For example, fig. 1 is a flowchart of a verifiable cross-chain reputation calculation method according to at least one embodiment of the present disclosure, and as shown in fig. 1, the verifiable cross-chain reputation calculation method includes steps S101 to S108.
In step S101, the first block link receives and stores the first quality of service parameter sent by the service device and the second quality of service parameter sent by the service device.
For example, in one example, the served device is an electric vehicle and the corresponding service equipment is a charging stake. After the charging stake completes the charging service to the electric vehicle, a user of the electric vehicle sends a first quality of service parameter to the first blockchain, and the charging stake sends a second quality of service parameter to the first blockchain. The first quality of service parameter may be a charging efficiency, a charging time, a timeliness of charging, a charging cost, and the like, which are transmitted to the first blockchain by the electric vehicle. The second quality of service parameter may be a charging efficiency, a charging time, a timeliness of charging, a charging cost, and the like, which are sent by the charging stake to the first blockchain.
Step S102, the second block link receives and stores the rating parameter of the service equipment sent by the service device.
For example, the rating parameter may be a rating of the charging stake by a user of the electric vehicle, e.g., the rating parameter may be excellent, good, general, pass, fail, etc. The rating parameter may allow for more reference to subsequent vehicles to be charged.
Step S103, the third blockchain receives the first polynomial, the second polynomial and the credit calculation polynomial set by the service platform, generates a commitment of the first polynomial based on the first polynomial and the parameters of the initialization of the program for commitment calculation, generates a commitment of the second polynomial based on the second polynomial and the parameters of the initialization of the program for commitment calculation, commits the commitment of the first polynomial and the first polynomial to the first blockchain, and commits the commitment of the second polynomial and the second polynomial to the second blockchain.
For example, the first blockchain is a monitor chain, the second blockchain is a rating chain, and the third blockchain is a reputation chain.
For example, the reputation calculation polynomial may be a sum or product of the first polynomial and the second polynomial. The commitment of the first polynomial is used to validate the first polynomial and calculate a subsequent consistent reputation. The commitment of the second polynomial is used to validate the second polynomial and calculate a subsequent recommendation reputation.
Step S104, the first blockchain verifies the first polynomial based on the first verification formula and the promise of the first polynomial, calculates consistent reputation and a plurality of first witness values according to the first quality of service parameter and the second quality of service parameter when the promise of the first polynomial corresponds to the first polynomial, and transmits the consistent reputation and the plurality of first witness values to the third blockchain.
For example, when the commitment of the first polynomial corresponds to the first polynomial based on the first validation formula, then the explanatory data is matched, a next calculation may be performed, the first quality of service parameter and the second quality of service parameter substituted to calculate a consistent reputation and a plurality of first witness values, and the consistent reputation and the plurality of first witness values transmitted to the third blockchain.
Step S105, the second blockchain verifies the second polynomial based on the second verification formula and the promise of the second polynomial, calculates a recommended reputation and a plurality of second witness values according to the rating parameter when the promise of the second polynomial corresponds to the second polynomial, and transmits the recommended reputation and the plurality of second witness values to the third blockchain.
For example, when the commitment of the second polynomial corresponds to the second polynomial based on the second validation formula, then the explanation data is matched, a next calculation may be performed, the rating parameter substituted to calculate the recommendation reputation and the plurality of second witness values, and the recommendation reputation and the plurality of second witness values transmitted to the third blockchain.
Step S106, the third blockchain verifies the consistent reputation according to the promise of the first polynomial and the first witness values, and when the verification passes, the consistent reputation is true.
For example, when the validation formula passes and the merck tree is consistent, the consistent reputation is true; when the validation formula fails or the merck tree is inconsistent, the consistent reputation is false.
In step S107, the third blockchain verifies the recommendation reputation according to the promise of the second polynomial and the second witness values, and when the verification is passed, the recommendation reputation is true.
For example, when the verification formula passes and the merck tree is consistent, the consistent reputation is true; when the validation formula fails or the merck tree is inconsistent, the consistent reputation is false.
Step S108, the third blockchain calculates reputation parameters of the service equipment based on the consistent reputation, the recommended reputation and the reputation calculation polynomial.
For example, in one example, the reputation calculation polynomial is a first polynomial F 1 (x, y) and a second polynomial F 2 And (x, y). When the reputation parameter of the service equipment is calculated, the first service quality parameter and the rating parameter are respectively used as a first polynomial F 1 (x, y) and a second polynomial F 2 And (x, y) inputting to calculate the values of the consistent reputation and the recommended reputation, and then adding the consistent reputation and the recommended reputation to obtain the reputation parameters of the service equipment.
For example, in another example, the reputation calculation polynomial is a first polynomial F 1 (x, y) and a second polynomial F 2 (x, y). When the reputation parameter of the service equipment is calculated, the first service quality parameter and the rating parameter are respectively used as a first polynomial F 1 (x, y) and a second polynomial F 2 And (x, y) inputting to calculate the values of the consistent reputation and the recommended reputation, and multiplying the consistent reputation and the recommended reputation to obtain the reputation parameters of the service equipment.
For example, fig. 2 is a schematic diagram of a verifiable cross-chain reputation calculation method according to at least one embodiment of the present disclosure, fig. 2 illustrates a served device as an electric vehicle and a serving device as a charging pile, and in one example shown in fig. 2, a service platform is responsible for processing and receiving requests for charging the electric vehicle and the charging pile and information interaction between the two. The charging stake may provide charging service to the electric vehicle after being authorized. The first, second and third blockchains form a multi-chain computing platform that is equivalent to the back end of the service platform. In addition, after charging the stake of charging is accomplished, charging the subassembly that is responsible for detecting second quality of service parameter on the stake and uploading the data of monitoring to the first blockchain of multiplex computing platform. The electric vehicle needs to upload two sets of data: and the first service quality parameter monitored by the monitoring component on the electric vehicle and the evaluation of the charging pile after confirming the actual transaction. In the cross-chain efficient calculation model of charging pile reputation, a third blockchain is responsible for distributing polynomial calculation functions of consistent reputation and recommended reputation, and entrusts the two polynomial calculation functions to a first blockchain and a second blockchain respectively. The first and second blockchains are responsible for extracting information on the blockchains to compute the delegated polynomial, and after computation of the two polynomial computation functions is completed, these results are passed to the third blockchain for computation of the final reputation value.
For example, as shown in fig. 2, an electric vehicle to be charged, for example, an electric vehicle sends a service request to a service platform, that is, a request for initiating charging, the service platform sends a request for inquiring the reputation of a private charging device to a multi-chain computing platform, the multi-chain computing platform returns the reputation of a recommended private charging device to the service platform, then the service platform sends service authentication to the recommended private charging device, that is, initiates charging authentication so that the electric vehicle and the private charging device are matched, and then negotiates to complete the charging process. The electric automobile uploads the first quality of service parameter and the rating parameter to the multi-chain computing platform after charging is completed, and the private charging equipment uploads the second quality of service parameter to the multi-chain computing platform after charging is completed. The multi-chain computing platform is composed of a first block chain, a second block chain and a third block chain, wherein the first block chain receives and stores a first quality of service parameter sent by an electric vehicle to be charged after charging and a second quality of service parameter sent by private charging equipment; the second block link receives and stores rating parameters of private charging equipment sent by the electric vehicle to be charged; the third blockchain receiving service platform sets a first polynomial, a second polynomial, and a reputation calculation polynomial, generates a commitment of the first polynomial based on the first polynomial and parameters of initialization of the program for commitment calculation, generates a commitment of the second polynomial based on the second polynomial and parameters of initialization of the program for commitment calculation, delegates the commitments of the first polynomial and the first polynomial to the first blockchain, and delegates the commitments of the second polynomial and the second polynomial to the second blockchain. According to the embodiment of the disclosure, the first quality of service parameter and the second quality of service parameter are stored in the first blockchain, the rating parameter is stored in the second blockchain, and the consistent credit and the recommended credit are respectively entrusted to the first blockchain and the second blockchain for calculation, so that the times of cross-chain information transmission are reduced, the cross-chain resources are saved, the interaction efficiency is improved, the problems of polynomial damage and tampering possibly encountered in the polynomial transmission process can be solved, and the completeness and the correctness of polynomial calculation can be ensured.
For example, in computing the reputation of a charging stake on a multi-chain computing platform, the following attacks may be encountered: (1) Polynomial attack, in the process of calculating by the multi-chain computing platform, in order to improve the score of the charging pile or reduce the score of other people, the charging pile can attack the first polynomial and/or the second polynomial, so that the calculation of the charging pile changes towards the direction beneficial to the charging pile. If the modified first polynomial and/or the modified second polynomial are used as outsourcing polynomials to participate in calculation, the credit of the charging pile is greatly influenced; 2) And calculating result attack, and after the calculation is completed, the first block chain and the second block chain send the result back to the third block chain for credit calculation. If the result is unfavorable for a certain charging pile, the charging pile may falsify the calculation result for its own benefit; 3) After the first polynomial and the second polynomial are respectively outsourced to the first block chain and the second block chain, if nodes on the corresponding first block chain are communicated with the charging pile, unreal data are used for participating in calculation of the first polynomial, the result of the first polynomial is affected, and then the data attack is initiated, or nodes on the corresponding second block chain are communicated with the charging pile, unreal data are used for participating in calculation of the second polynomial, the result of the second polynomial is affected, and then the data attack is initiated. For the three attacks described above, embodiments of the present disclosure enable verifiable, verifiable and efficient interactive verification of cross-chain transfer information correctness, computational process integrity.
For example, the information transferred across the chain mainly includes a first polynomial, a second polynomial and its calculation result, and verifiability of the two parts is ensured by the promise of the first polynomial and the first polynomial proof of the calculation result, and the promise of the second polynomial and the second polynomial proof, respectively. If the first polynomial, the second polynomial or the calculation result is falsified or tampered by an attacker in the cross-chain process, the first polynomial, the second polynomial or the calculation result is discovered in the verification process.
For example, embodiments of the present disclosure ensure verifiability of computational process integrity by generating proof of unity polynomials and multi-element mixed polynomials. If a portion of the first polynomial or the second polynomial is missing or is miscalculated, verification may be performed by a prover of the corresponding polynomial portion.
For example, embodiments of the present disclosure reduce the number of times of cross-chain information transfer, save cross-chain resources, and improve the efficiency of interactions by storing a first quality of service parameter and a second quality of service parameter in a first blockchain, storing a rating parameter in a second blockchain, and delegating a consistent reputation and a recommended reputation to the first blockchain and the second blockchain, respectively, thereby guaranteeing the efficiency of first polynomial and second polynomial verification by transferring a round of commitment and attestation throughout the chain.
For example, fig. 3 is a schematic diagram of yet another verifiable cross-chain reputation calculation method according to at least one embodiment of the present disclosure, and fig. 3 illustrates a service device as an electric vehicle and a service device as a charging pile. For example, as shown in fig. 3, before delegating the first polynomial and the commitment of the first polynomial to the first blockchain and delegating the second polynomial and the commitment of the second polynomial to the second blockchain, further comprising: the first blockchain compares the first quality of service parameter to the second quality of service parameter, and when the first quality of service parameter and the second quality of service parameter are the same, the transaction between the served device and the serving equipment is authentic, and then a subsequent reputation calculation is performed. Specifically, before charging the electric vehicle, the reputation of each charging post needs to be requested from the service platform, so that the user of the electric vehicle selects an appropriate charging post for authorized charging. After the charging is completed, the data monitoring component of the charging pile and the data monitoring software of the electric automobile upload the actually monitored data c and e to the first blockchain, and the intelligent contract on the first blockchain is responsible for comparing the monitored data c and e. If the quality of service parameters of the two data are the same, it is indicated that the charging transaction is authentic. Otherwise, the transaction is interpreted as a fake transaction that needs to be discarded. After confirming the authenticity of the transaction, the electric automobile is invited to evaluate various quality parameters of the charging service, and the evaluation is uploaded to the second blockchain.
For example, as shown in FIG. 3, the final reputation value calculated by the model consists essentially of both the consistent reputation value calculated by the first blockchain and the recommended reputation value calculated by the second blockchain. Thus, in the calculation of the reputation value, the first polynomial, the second polynomial and the reputation calculation polynomial are respectively denoted as F 1 (x，y)，F 2 (x, y), F (x, y). Wherein F is 1 (x, y) is responsible for consistent reputation, F 2 (x, y) is responsible for recommending reputation and F (x, y) is responsible for calculation of final reputation parameters. The intelligent contracts on the first and second blockchains respectively receive the first polynomial F 1 (x, y) and a second polynomial F 2 After (x, y), the appropriate node is selected to perform the function calculation. The selected node obtains data and polynomial functions from the first and second blockchains, respectively, and corresponding smart contracts. The result R of the calculated first polynomial/second polynomial is then calculated i (i=1, 2) and proof W generated by this calculation process i Encryption is sent to the corresponding smart contract on the first blockchain or the second blockchain, and the corresponding smart contract then forwards the results to the smart contract on the third blockchain. After the intelligent contract decrypts the transferred information, the proving party W i For result R i And (5) performing verification. If the verification is successful, the smart contract will use R i The total reputation parameter is calculated from F (x, y).
For example, for a complex reputation function composed of different types of polynomials, it may be split into a unit polynomial and a polynomial mixture. For a unit polynomial, the Kate commitment may be employed to make it verifiable. For a multi-element hybrid polynomial, a Merkel tree may be employed to make it verifiable.
For example, FIG. 4 is a schematic diagram illustrating a computing process of a multi-chain computing platform according to at least one embodiment of the present disclosure, and in conjunction with FIGS. 3 and 4, it is necessary to calculate the total reputation parameterInformation on different blockchains is called, so that when the total reputation parameter is calculated, a function calculation formula of consistent reputation and recommended reputation is respectively outsourced to the first blockchain and the second blockchain, and data required by each reputation calculation is extracted according to the formula. After the calculation is completed, the consistent reputation and the recommended reputation are sent onto a third blockchain to calculate the total reputation parameter. In this scenario, assume that the calculation formula of the total reputation parameter is F (x, y) =f 1 (x，y)+F 2 (x，y)，F 1 (x, y) is a first polynomial to calculate a consistent reputation, F 2 (x, y) is a second polynomial that computes a recommendation reputation.
For example, in conjunction with fig. 3 and 4, a first polynomial F is generated 1 Commitment of (x, y) and second polynomial F 2 The process of commitment of (x, y) includes: initializing a program of commitment calculation, wherein the initializing process comprises the following steps: selecting two cyclic groups G and G of prime order p T So that there is a bilinear map e: g is G.fwdarw.G T Wherein the generator of group G is G, and the elliptic curve bilinear group used is Γ= (e, G) T ) The first blockchain randomly selects a plurality of secret parameters a i (i＜n 1 ) The second blockchain randomly selects a plurality of secret parameters beta j (j＜n 2 ) Wherein n is 1 First polynomial F for computing consistent reputation on first blockchain 1 (x, y) the number of unit polynomials which can be decomposed, and n 1 ＝2，n 2 Calculating a second polynomial F of recommendation reputation for a second blockchain 2 (x, y) number of decomposable unit polynomials, and n 2 =2, the first polynomial F on the first blockchain 1 (x，y)＝f 1x (x)+f 1y (y)+f 1 (x, y), where f 1x (x) The highest power of t 11 ，f 1y (y) the highest power of t 12 And is f 1x (x) Generating a (t) 11 +1) tuple:is f 1y (y) generating a (t) 12 +1) tuple: />Second polynomial F on second blockchain 2 (x，y)＝f 2x (x)+f 2y (y)+f 2 (x，y)，f 2x (x) The highest power of (t) 21 +1)，f 2y The highest power of (y) is (t 22 +1), and is f 1y (y) generating a (t) 21 +1) tuple: / >Is f 2y (y) generating a (t) 22 +1) tuple: />The first blockchain and the second blockchain disclose these tuples and destroy alpha i And beta j 。
For example, in the reputation calculation method provided in at least one embodiment of the present disclosure, after initializing, the method further includes: third blockchain computing first polynomial F 1 F in (x, y) 1x (x) Kate commitment of (a)f 1y (y) kate promise->Third blockchain computing second polynomial F 2 F in (x, y) 2x (x) Kate promise-> f 2y (y) kate promise->Wherein d 1x ，d 1y ，d 2x ，d 2y Respectively f 1x (x)，f 1y (y)，f 2x (x)，f 2y The highest powers of the polynomials of (y) and are respectively equal to t 11 ，t 12 ，t 21 ，t 22 The method comprises the steps of carrying out a first treatment on the surface of the Third blockchain vs. first polynomial F 1 F in (x, y) 1 (x, y) hashing while committing to kate C 1x And kate promise C 1y To construct a first merck tree comprising the root node H (commit (F) 1 (x, y)); third blockchain vs. second polynomial F 2 F in (x, y) 2 (x, y) hashing while committing to kate C 2x And kate promise C 2y To construct a second merck tree comprising the root node H (commit (F) 2 (x，y)))。
For example, in the reputation calculation method provided in at least one embodiment of the present disclosure, after the third blockchain generates the first merck tree and the second merck tree, the method further includes: the third blockchain commits kate to C 1x Kate promise C 1y And the first merck tree into a first message Commit 1 Commit of the first message 1 And a first polynomial F 1 (x, y) together to the first blockchain, the third blockchain commits kate to C 2x Kate promise C 2y And a second merck tree into a second message Commit 2 And Commit the second message 2 And a second polynomial F 2 (x, y) are sent together to the second blockchain.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, an encryption polynomial F to be used for reputation calculation i (x, y) and polynomial commitment Commit i Delegated to its corresponding blockchain. The compute nodes on the corresponding blockchain will then verify the corresponding polynomial and polynomial commitments to ensure that the post-delegation-of-chain polynomial is correct. The correctness of the first polynomial may be verified by bringing the first polynomial into promise of the first polynomial, and the correctness of the second polynomial may be verified by bringing the second polynomial into promise of the second polynomial.
For example, after the third blockchain is sent, the first blockchain validates the first polynomial F based on the commitment of the first polynomial 1 (x, y), specifically including: selecting part of nodes in the first blockchain as first nodes according to a first message Commit 1 VerificationFirst polynomial F 1 (x, y) when the first message Commit 1 And a first polynomial F 1 When (x, y) are consistent, a first polynomial F 1 (x, y) is true and is based on a first polynomial F 1 (x, y) computing to obtain a consistent reputation and a plurality of first witness values; the second blockchain validating the second polynomial F based on the promise of the second polynomial 2 (x, y), specifically including: selecting part of nodes in the second blockchain as second nodes according to the second message Commit 2 Validating the second polynomial F 2 (x, y) when the second message Commit 2 And a second polynomial F 2 When (x, y) are consistent, the second polynomial F 2 (x, y) is true and is based on a second polynomial F 2 (x, y) calculating to obtain a recommended reputation and a plurality of second witness values.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, the process of calculating a first witness value and a second witness value includes: will be in the assurance of the first polynomial F 1 (x, y) and a second polynomial F 2 On the premise that (x, y) is correct, the first blockchain is according to a first polynomial F 1 (x, y) extracting the required information from the first blockchain for the first polynomial F 1 (x, y) computing to obtain a consistent reputation, the second blockchain being in accordance with a second polynomial F 2 (x, y) extracting the required information from the second blockchain for the second polynomial F 2 (x, y) calculation to obtain a recommendation reputation.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, for a first polynomial F 1 (x, y) and a second polynomial F 2 The (x, y) calculation includes: the first and second blockchains are directed to a first polynomial F, respectively 1 (x, y) and a second polynomial F 2 (x, y) inputting the first parameter a and outputting the corresponding calculation result R a Wherein the first parameter a is a first polynomial F 1 (x, y) and a second polynomial F 2 A combination of x and y values in (x, y), wherein the first blockchain is for a unit polynomial f 1x (x)，f 1y (y) setting a functionBased on the above function, the first blockchain generates first witness values ++>Wherein, (F) 1xa (x)，w 1x (a))，(F 1ya (y)，w 1y (a) Respectively corresponding unit polynomials f 1x (x)，f 1y Witnessing the unit polynomial of (y), the second blockchain witnessing the unit polynomial f 2x (x)，f 2y (y) set function-> Based on the above function, second witness values +.> Wherein, (F) 2xa (x)，w 2x (a))，(F 2ya (y)，w 2y (a) Respectively corresponding unit polynomials f 2x (x)，f 2y The unity polynomial witnessing of (y).
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, for a first polynomial F 1 (x, y) and a second polynomial F 2 (x, y) further comprises: first blockchain to first polynomial F 1 Polynomial f in (x, y) 1 (x, y) and hashing the unit polynomial witness (F 1xa (x)，w 1x (a))，(F 1ya (y)，w 1y (a) Hashed and building a third merck tree, then witnessing the unit polynomial (F 1xa (x)，w 1x (a))、(F 1ya (y)，w 1y (a) Packaging with a third merck tree into a third message CreateWitness 1 And (a, R) a ) Send to a third blockchain; second blockchain vs. second polynomial F 2 Polynomial f in (x, y) 2 (x, y) and hashing the unit polynomial witness (F 2xa (x)，w 2x (a))，(F 2ya ( y )，w 2y (a) Hashed and building a fourth merck tree, then witnessing the unit polynomial (F 2xa (x)，w 2x (a))、(F 2ya (y)，w 2y (a) Packed with a fourth merck tree into a fourth message CreateWitness 2 And (a, R) a ) To the third blockchain.
For example, in the reputation calculation method provided in at least one embodiment of the present disclosure, the reputation calculation method further includes: the third blockchain transmitting a first polynomial F according to the first blockchain 1 Third message CreateWitness of (x, y) 1 Obtaining a unit polynomial f 1x (x)，f 1y Unit polynomial witness of (y) (F 1xa (x)，w 1x (a))，(F 1ya (y)，w 1y (a) Building a fifth merck tree and according to a first polynomial F 1 (x, y) Unit polynomial commitment C 1x ，C 1y And generating element g, calculating a verification formula And->When the verification formula is established, the fifth merck tree and the third message CreateWitness 1 When the third merck tree in the list is equal, the third message CreateWitness 1 Is true; third blockchain sends second polynomial F according to second blockchain 2 Fourth message CreateWitness of (x, y) 2 Obtaining a unit polynomial f 2x (x)，f 2y Unit polynomial witness of (y) (F 2xa (x)，w 2x (a))，(F 2ya (y)，w 2y (a) Building a sixth merck tree and according to a second polynomial F 2 (x, y) Unit polynomial commitment C 2x ，C 2y And generating element g, calculating verification formula +.>And-> When the verification formula is established, the sixth merck tree and the fourth message CreateWitness 2 When the fourth merck tree is equal, the fourth message CreateWitness 2 Is true.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, the reputation calculation polynomial is a first polynomial F 1 (x, y) and a second polynomial F 2 (x, y) when the third message CreateWitness 1 Is true, and the fourth message CreateWitness 2 When true, the third blockchain calculates reputation parameters of the service device based on the consistent reputation, the recommended reputation, and the reputation calculation polynomial, including: substituting the first quality of service parameter into the first polynomial F 1 (x, y) calculating to obtain consistent credit, substituting the rating parameter into the second polynomial F 2 (x, y) calculating to obtain a recommended reputation, and then adding the consistent reputation and the recommended reputation to obtain reputation parameters of the service equipment.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, the reputation calculation polynomial is a first polynomial F 1 (x, y) and a second polynomial F 2 (x, y) when the third message CreateWitness 1 Is true, and the fourth message CreateWitness 2 When true, the third blockchain calculates reputation parameters of the service device based on the consistent reputation, the recommended reputation, and the reputation calculation polynomial, including: substituting the first quality of service parameter into the first polynomial F 1 (x, y) calculating to obtain consistent credit, substituting the rating parameter into the second polynomial F 2 (x, y) calculating to obtain a recommended reputation, and multiplying the consistent reputation and the recommended reputation to obtain reputation parameters of the service equipment.
For example, in a reputation calculation method provided by at least one embodiment of the present disclosure, a first polynomial F is used 1 (x, y) after being sent to the first blockchain, and the second polynomial F 2 After (x, y) is sent to the second blockchain, asThe embodiment of the disclosure designs a node selection and excitation mechanism algorithm. The node selection part in the excitation mechanism algorithm can ensure that the selected calculation nodes are reliable, and the excitation mechanism can excite each node to perform real calculation and judgment. In the incentive mechanism algorithm, all nodes can be divided into two types, one is a computing node, and the other is a verification node. The computing node is the highest-credit node in all nodes, and the rest nodes are verification nodes.
For example, in an embodiment of the present disclosure, the process of determining the first node includes: performing qualification screening on N nodes participating in reputation calculation verification in a first blockchain, determining that the selected node can participate in the calculation and verification process of the reputation value when the reputation value of the selected node is higher than a threshold value determined by a service platform, determining and eliminating malicious nodes when the reputation value of the selected node is lower than the threshold value, determining that the number of nodes passing qualification screening is N, and taking the N nodes passing qualification screening as the first node; and sequencing the reputation values of the first nodes from high to low, selecting 1 from 1 or more first nodes with highest reputation values as first computing nodes, and taking the rest (N-1) first nodes as first verification nodes, wherein N and N are natural numbers which are more than or equal to 2, and N is less than N.
For example, in an embodiment of the present disclosure, the process of determining the second node includes: performing qualification screening on M nodes participating in reputation calculation verification in the second blockchain, determining that the selected node can participate in the calculation and verification process of the reputation value when the reputation value of the selected node is higher than a threshold value determined by a service platform, determining and eliminating malicious nodes when the reputation value of the selected node is lower than the threshold value, determining that the number of nodes passing qualification screening is M, and taking the M nodes passing qualification screening as the second node; and sequencing the reputation values of the second nodes from high to low, selecting 1 second node from 1 or more second nodes with highest reputation values as second calculation nodes, and taking the rest (M-1) second nodes as second verification nodes, wherein M and M are natural numbers which are more than or equal to 2, and M is less than M.
For example, security analysis of verifiable cross-chain reputation calculation methods includes: polynomial attacks, forgery attacks, security analysis of data attacks during computation and transmission.
For example, for defending against polynomial attacks: in the process of polynomial outsourcing, if the polynomial is destroyed in the cross-chain transmission process, polynomial attack is easy to be caused, namely, the destroyed polynomial acts on the corresponding blockchain. The embodiment of the disclosure provides a verifiable polynomial F of a commit () function pair outsourcing in a cross-chain reputation calculation method i (x, y) generating a polynomial commitment Commit i Wherein i is 1 or 2,F i (x, y) and Commit i Together to its corresponding blockchain. In the process of cross-chain transfer of polynomials, if one of the unit polynomials f iy (y) destroyed and tampered to become f iz (z). Its corresponding Kate commitment will be given by C iy Becomes C iz . The rest of the authentication process is as follows: h (C) ix +C iz )≠H(C ix +C iy )，H(commit(F i (x，z)))≠H(commit(F i (x, y)). If a polynomial f is mixed by a plurality of elements i (xy) destroyed or tampered with as f i (xz), then H (f) i (xz))≠H(f i (xy))，H(commit(F i (x，z)))≠H(commit(F i (x，y)))。
For example, for defending against compute result attacks: polynomial F when the first and second blockchains complete i Calculation of (x, y) and calculation result (a, R a ) Returning to the third blockchain, where i is 1 or 2 and a is polynomial F i Input of (x, y), R a Is the result of the calculation when the input value is a, if the calculation result is polynomial F in the course of transmission i (x, y) is tampered with by an attacker as (b, R) b ) The verification process is proven to be error-prone. The specific verification process is as follows: first, a unit polynomial portion is verified. If (F) ixb ，w ix (b))≠(F ixa ，w ix (a) Or%F iyb ，w iy (b))≠(F iya ，w iy (a) It can be judged that the result is tampered with during transmission. If (F) ixb ，w ix (b))＝(F ixa ，w ix (a) Continuing to verify H (f) ib (x, y)) is equal to H (f) ia (x, y)). If not, the calculation result is proved to be tampered. Whether a unit polynomial partial change or a multi-hybrid polynomial partial change, H (witness (F) ia (x，y)))≠H(witness(F ib (x, y)), i.e., createWitness (), may be resistant to forgery attacks.
For example, for defending against data attack attacks: when polynomial F i (x, y) (i=1 for the first polynomial and i=2 for the second polynomial) to the corresponding blockchain, if the computing node uses unrealistic data to participate in the computation, the verifying node may determine that the computation is incorrect in order to increase its reputation. After determining the computational error of the computational node, the computational node will be penalized by the reputation score minus 2P score, i.e., the computational node penalizing is twice that of the verification node. In addition, if the calculation is correct, the actual value rewards will be obtained. Thus, under normal circumstances, the nodes will use the real data to calculate in order to avoid penalties and rewards.
For example, in the reputation calculation method provided in at least one embodiment of the present disclosure, since the embodiment of the present disclosure adopts a scheme of combining polynomial commitments with Merkle trees, not only the goal of polynomial outsourcing cross-chain calculation is satisfied, but also the time and space requirements are satisfied, and as the complexity of the first polynomial and the second polynomial becomes larger, the time consumption and the space consumption of reputation calculation are basically unchanged.
For example, FIG. 5 is a comparative graph of a reputation computed time performance evaluation provided by at least one embodiment of the present disclosure. As shown in fig. 5, fig. 5 only compares the scheme in an embodiment of the present disclosure with the time of homomorphic encryption scheme, since Merkle tree technology cannot meet the design goals of computational completeness and verifiability in the polynomial outsourcing cross-chain process. For example, (a) in fig. 5 shows that the time consumption of each format varies with the increase of the degree of the binary polynomial. Fig. 5 (b) shows that the time consumption of each format varies with the increase of the degree of the ternary polynomial. Fig. 5 (c) shows that the time consumption of each format varies with the increase of the degree of the quaternary polynomial. As can be seen from fig. 5, under the same conditions, the scheme in the embodiment of the present disclosure processes the same polynomial much less time than homomorphic encryption, and the time consumption of homomorphic encryption increases significantly with the increase in polynomial complexity. The time consumption of the scheme in the embodiments of the present disclosure does not vary much when the complexity of the processed polynomial increases compared to the homomorphic encryption scheme.
For example, FIG. 6 is a comparison graph of spatial performance evaluation of a reputation calculation provided in accordance with at least one embodiment of the present disclosure. As shown in fig. 6, the space consumption of the merck tree, homomorphic encryption, and the scheme in the embodiments of the present disclosure in processing polynomials are compared. For example, (a) in fig. 6 shows the change in space consumption of each scheme as the degree of the binary polynomial increases. Fig. 6 (b) shows the change in space consumption per format as the number of the ternary polynomial increases. Fig. 6 (c) shows a change in space consumption per format as the number of the quaternary polynomial increases. As can be seen from fig. 6, regardless of how complex the polynomial is, the order of space consumption to process the same polynomial is always homomorphically encrypted over the merck tree, which is larger than the scheme in the embodiments of the present disclosure, under the same conditions. Moreover, the space consumption of homomorphic encryption and the merck tree both increase with increasing polynomial complexity, whereas the space consumption of the scheme in embodiments of the present disclosure does not change with increasing polynomial complexity.
For example, fig. 7 is a schematic diagram of a change in time overhead of a cross-chain transmission polynomial and commitment with respect to a degree of the polynomial according to at least one embodiment of the present disclosure, and fig. 8 is a schematic diagram of a change in time overhead of a cross-chain transmission calculation result and witness with respect to a degree of the polynomial according to at least one embodiment of the present disclosure, as shown in fig. 7 and 8, as the complexity of the polynomial increases, the time of cross-chain information transfer increases slightly. This increased time overhead is due in part to the increasing complexity of the polynomial itself, and the Kate commitment of the unit polynomial and the Merkle tree of the hybrid polynomial that result as the polynomial complexity increases.
For example, in the reputation calculation method provided in at least one embodiment of the present disclosure, the first quality of service parameter sent by the service device and the second quality of service parameter sent by the service device each include efficiency of the service, timeliness of the service, and cost performance of the service, but embodiments of the present disclosure are not limited thereto and may be other service parameters.
At least one embodiment of the present disclosure also provides a reputation computing system applied to electric vehicle charging, comprising: the system comprises a multi-chain computing platform, a service platform and charging equipment, wherein the multi-chain computing platform comprises a first block chain and a second block chain which are mutually independent, and a third block chain which performs data transmission and interactive verification with both the first block chain and the second block chain; the first blockchain is configured to receive and store a first quality of service parameter transmitted by a user of the electric vehicle and a second quality of service parameter transmitted by the charging device; the second blockchain is configured to receive and store rating parameters sent by a user of the electric vehicle for the charging device; the third blockchain is configured to receive the first polynomial, the second polynomial, and the reputation calculation polynomial set by the service platform, generate a commitment of the first polynomial based on the first polynomial and parameters of initialization of the commitment calculation program, generate a commitment of the second polynomial based on the second polynomial and parameters of initialization of the commitment calculation program, delegate the commitment of the first polynomial and the first polynomial to the first blockchain, and delegate the commitment of the second polynomial and the second polynomial to the second blockchain; the first blockchain is further configured to validate the first polynomial based on the first validation formula and the commitment of the first polynomial, calculate a consistent reputation and a plurality of first witness values from the first quality of service parameter and the second quality of service parameter when the commitment of the first polynomial corresponds to the first polynomial, and transmit the consistent reputation and the plurality of first witness values to the third blockchain; the second blockchain is further configured to verify the second polynomial based on the second verification formula and the commitment of the second polynomial, calculate a recommendation reputation and a plurality of second witness values from the rating parameter when the commitment of the second polynomial corresponds to the second polynomial, and transmit the recommendation reputation and the plurality of second witness values to the third blockchain; the third blockchain is further configured to verify the consistent reputation based on the commitment of the first polynomial and the plurality of first witness values, the consistent reputation being true when the verification passes; and verifying the recommended reputation according to the commitment of the second polynomial and the plurality of second witness values, the recommended reputation being true when the verification passes, the third blockchain calculating reputation parameters of the charging device based on the consistent reputation, the recommended reputation and the reputation calculation polynomial.
For example, the functions of the first, second and third blockchains, the calculation of the consistent reputation, the recommended reputation and the reputation parameters of the charging device may be described in the above related description, and will not be described again.
The present disclosure also provides, in at least one embodiment, a reputation evaluation method applied to an electric vehicle charging system, including: the first block link receives and stores a first quality of service parameter sent by a user of the electric vehicle and a second quality of service parameter sent by the private charging equipment; the second block link receives and stores rating parameters of private charging equipment sent by the electric vehicle user; the third blockchain receives a first polynomial, a second polynomial and a reputation calculation polynomial set by the service platform, generates a commitment of the first polynomial based on the first polynomial and the initialized parameters of the program for commitment calculation, generates a commitment of the second polynomial based on the second polynomial and the initialized parameters of the program for commitment calculation, commits the commitments of the first polynomial and the first polynomial to the first blockchain when determining that the first quality of service parameter and the second quality of service parameter are consistent, and commits the commitments of the second polynomial and the second polynomial to the second blockchain; the first blockchain verifies the first polynomial based on the first verification formula and the promise of the first polynomial, calculates a consistent reputation and a plurality of first witness values according to the first quality of service parameter and the second quality of service parameter when the promise of the first polynomial corresponds to the first polynomial, and transmits the consistent reputation and the plurality of first witness values to the third blockchain; the second blockchain verifies the second polynomial based on the second verification formula and the promise of the second polynomial, calculates a recommendation reputation and a plurality of second witness values according to the rating parameter when the promise of the second polynomial corresponds to the second polynomial, and transmits the recommendation reputation and the plurality of second witness values to the third blockchain; the third blockchain verifies the consistent reputation according to the promise of the first polynomial and the plurality of first witness values, and when the verification passes, the consistent reputation is true; the third blockchain verifies the recommended reputation according to the promise of the second polynomial and the second witness values, and when the verification is passed, the recommended reputation is true, and the third blockchain calculates reputation parameters of the private charging equipment based on the consistent reputation, the recommended reputation and the reputation calculation polynomial.
For example, in the process of the reputation evaluation method applied to the electric vehicle charging system, reference may be made to the description of the verifiable cross-chain reputation calculation method, that is, the verifiable cross-chain reputation calculation method is applied to an application scenario of the electric vehicle and the private charging device, and specific details are not repeated herein.
According to the reputation evaluation method applied to the electric vehicle charging system, the problem that complex reputation calculation needs to be conducted on information interaction for multiple times in a cross-chain mode is solved through the cross-chain outsourcing polynomial, namely, the polynomial and calculation results thereof are transferred between a main chain and a sub-chain in a cross-chain mode, the times of the cross-chain information transfer can be reduced, cross-chain resources are saved, interaction efficiency is improved, the problem that the polynomial is damaged and tampered possibly in the outsourcing polynomial transfer process can be solved, therefore the integrity and the correctness of polynomial calculation can be guaranteed, and the accuracy of information extraction of the outsourcing polynomial in the block chain calculation process can be guaranteed through a consensus node selection and excitation mechanism algorithm.
At least one embodiment of the present disclosure further provides a charging method of an electric vehicle, for example, fig. 9 is a flowchart of a charging method of an electric vehicle provided by at least one embodiment of the present disclosure, and as shown in fig. 9, the charging method of an electric vehicle includes steps S201 to S204.
Step S201: the electric vehicle to be charged sends a service request to a service platform;
for example, a user of an electric vehicle to be charged may send a request to a service platform using a cell phone, a computer, an electric vehicle, etc., or an application on a cell phone, a computer, an electric vehicle, etc.
Step S202: the service platform sends a request for inquiring the credit of the private charging equipment to the multi-chain computing platform;
for example, the service platform sends a request to the multi-chain computing platform to find a private charging device that matches the electric vehicle to be charged according to the reputation of the private charging device stored in the multi-chain computing platform.
Step S203: the multi-chain computing platform returns the credit of the recommended private charging equipment to the service platform;
step S204: the service platform sends service authentication to the recommended private charging equipment.
For example, the charging method of the electric vehicle can accurately select corresponding private charging equipment for the electric vehicle to be charged, so that charging efficiency and cost performance are improved.
The verifiable cross-chain reputation calculation method, the reputation calculation system applied to electric vehicle charging, the reputation evaluation method applied to the electric vehicle charging system and the electric vehicle charging method provided by at least one embodiment of the present disclosure have at least the following beneficial technical effects: the problem that complex reputation calculation needs to perform information interaction for multiple times in a cross-chain manner is solved through a cross-chain outsourcing polynomial, namely, the number of times of cross-chain information transmission can be reduced, cross-chain resources are saved, interaction efficiency is improved, meanwhile, the problem that the outsourcing polynomial is damaged and tampered in the transmission process of the outsourcing polynomial can be solved, and therefore the integrity and the correctness of polynomial calculation can be guaranteed, and in addition, the accuracy of information extraction of the outsourcing polynomial in the block chain calculation can be guaranteed through a consensus node selection and excitation mechanism algorithm.
The following points need to be described:
(1) The drawings of the embodiments of the present disclosure relate only to the structures related to the embodiments of the present disclosure, and other structures may refer to the general design.
(2) In the drawings for describing embodiments of the present disclosure, the thickness of layers or regions is exaggerated or reduced for clarity, i.e., the drawings are not drawn to actual scale.
(3) The embodiments of the present disclosure and features in the embodiments may be combined with each other to arrive at a new embodiment without conflict.
The foregoing is merely specific embodiments of the disclosure, but the scope of the disclosure is not limited thereto, and the scope of the disclosure should be determined by the claims.
Claims (19)
1. A verifiable cross-chain reputation calculation method, comprising:
the first block link receives and stores a first quality of service parameter sent by the service device and a second quality of service parameter sent by the service device;
the second block link receives and stores the rating parameter of the service equipment sent by the served device;
a third blockchain receives a first polynomial, a second polynomial and a reputation calculation polynomial set by a service platform, generates a commitment of the first polynomial based on the first polynomial and parameters of initialization of a program for commitment calculation, generates a commitment of the second polynomial based on the second polynomial and parameters of initialization of the program for commitment calculation, commits the commitment of the first polynomial and the first polynomial to the first blockchain, and commits the commitment of the second polynomial and the second polynomial to the second blockchain;
The first blockchain validating the first polynomial based on a first validation formula and a commitment of the first polynomial, calculating a consistent reputation and a plurality of first witness values from the first quality of service parameter and the second quality of service parameter when the commitment of the first polynomial corresponds to the first polynomial, and transmitting the consistent reputation and the plurality of first witness values to the third blockchain;
the second blockchain validating the second polynomial based on a second validation formula and a commitment of the second polynomial, calculating a recommended reputation and a plurality of second witness values according to the rating parameters when the commitment of the second polynomial corresponds to the second polynomial, and transmitting the recommended reputation and the plurality of second witness values to the third blockchain;
the third blockchain verifies the consistent reputation according to the promise of the first polynomial and a plurality of the first witness values, and when verification passes, the consistent reputation is true; and the third blockchain verifies the recommended reputation according to the promise of the second polynomial and a plurality of second witness values, and when the verification passes, the recommended reputation is true, and the third blockchain calculates reputation parameters of the service equipment based on the consistent reputation, the recommended reputation and the reputation calculation polynomial.
2. The reputation calculation method of claim 1, wherein prior to delegating the first polynomial and the commitment of the first polynomial to the first blockchain and delegating the second polynomial and the commitment of the second polynomial to the second blockchain, further comprising: the first blockchain compares the first quality of service parameter with the second quality of service parameter, and when the first quality of service parameter and the second quality of service parameter are the same, the transaction between the served device and the service equipment is true, and then a subsequent reputation calculation is performed.
3. The reputation calculation method of claim 2, wherein generating the commitment of the first polynomial and the commitment of the second polynomial comprises: initializing the program of commitment calculation, and the initializing process comprises:
selecting two cyclic groups G and G of prime order p T So that there is a bilinear map e: g is G.fwdarw.G T Wherein the generator of group G is G, and the elliptic curve bilinear group used is Γ= (e, G) T ) The first blockchain randomly selects a plurality of secret parameters a i (i＜n 1 ) The second blockchain randomly selects a plurality of secret parameters beta j (j＜n 2 ) Wherein n is 1 Calculating the first polynomial F of the consistent reputation on the first blockchain 1 (x, y) the number of unit polynomials which can be decomposed, and n 1 ＝2，n 2 Calculating the second polynomial F of the recommendation reputation for the second blockchain 2 (x, y) number of decomposable unit polynomials, and n 2 =2, the first polynomial F on the first blockchain 1 (x，y)＝f 1x (x)+f 1y (y)+f 1 (x, y), where f 1x (x) The highest power of t 11 ，f 1y (y) the highest power of t 12 And is f 1x (x) Generating a (t) 11 +1) tuple:is f 1y (y) generating a (t) 12 +1) tuple: />The second polynomial F on the second blockchain 2 (x，y)＝f 2x (x)+f 2y (y)+f 2 (x，y)，f 2x (x) The highest power of (t) 21 +1)，f 2y The highest power of (y) is (t 22 +1), and is f 1y (y) generating a (t) 21 +1) tuple: />Is f 2y (y) generating a (t) 22 +1) tuple: />
4. The reputation calculation method of claim 3, wherein after the initializing, further comprising:
the third blockchain calculates the first polynomial F 1 F in (x, y) 1x (x) Kate commitment of (a)f 1y (y) kate promise->
The third blockchain calculates the second polynomial F 2 F in (x, y) 2x (x) Kate commitment of (a) f 2y (y) kate promise->Wherein d 1x ，d 1y ，d 2x ，d 2y Respectively f 1x (x)，f 1y (y)，f 2x (x)，f 2y The highest powers of the polynomials of (y) and are respectively equal to t 11 ，t 12 ，t 21 ，t 22 ；
The third blockchain pair the first polynomial F 1 F in (x, y) 1 (x, y) hashing while committing C to the kate 1x And the kate promise C 1y To construct a first merck tree;
the third blockchain pairs the second polynomial F 2 F in (x, y) 2 (x, y) hashing while committing C to the kate 2x And the kate promise C 2y Is hashed to construct a second merck tree.
5. The reputation calculation method of claim 4, wherein after the third blockchain generates the first and second merck trees, further comprising:
the third blockchain commits the kate to C 1x The kate promise C 1y And said first merck tree is packaged into a first message Commit 1 The first message Commit is sent to the communication device 1 And the first polynomial F 1 (x, y) sending together to the first blockchain, the third blockchain committing the kate to C 2x The kate promise C 2y And said second merck tree is packaged into a second message Commit 2 And Commit the second message 2 And the second polynomial F 2 (x, y) are sent together to the second blockchain.
6. The reputation calculation method of claim 5, wherein after the third blockchain has been sent, the first blockchain verifies the first polynomial F based on a commitment of the first polynomial 1 (x, y) comprising: selecting part of nodes in the first blockchain as first nodes according to the first message Commit 1 Validating said first polynomial F 1 (x, y) when the first message Commit 1 And the first polynomial F 1 (x, y) when they are identical, said first polynomial F 1 (x, y) is true and is based on the first polynomial F 1 (x, y) calculating to obtain said consistent reputation and a plurality of said first witness values;
the second blockchain validating the second polynomial F based on a commitment of the second polynomial 2 (x, y) comprising: selecting part of nodes in the second blockchain as second nodes according to the second message Commit 2 Validating said second polynomial F 2 (x, y) when the second message Commit 2 And the second polynomial F 2 (x, y) when they are identical, said second polynomial F 2 (x, y) is true and is based on the second polynomial F 2 (x, y) calculating to obtain said recommended reputation and a plurality of said second witness values.
7. The reputation calculation method of claim 6, wherein the first is calculatedThe process of witness values and the second witness value includes: will be guaranteed the first polynomial F 1 (x, y) and the second polynomial F 2 (x, y) said first blockchain being according to said first polynomial F, provided that said first polynomial is correct 1 (x, y) extracting the required information from the first blockchain, for the first polynomial F 1 (x, y) computing to obtain the consistent reputation, the second blockchain being in accordance with the second polynomial F 2 (x, y) extracting the required information from the second blockchain, for the second polynomial F 2 (x, y) calculating to obtain the recommendation reputation.
8. The reputation calculation method of claim 7, wherein for the first polynomial F 1 (x, y) and the second polynomial F 2 The (x, y) calculation includes: the first blockchain and the second blockchain are respectively directed to the first polynomial F 1 (x, y) and the second polynomial F 2 (x, y) inputting the first parameter a and outputting the corresponding calculation result R a Wherein the first parameter a is the first polynomial F 1 (x, y) and the second polynomial F 2 A combination of x and y values in (x, y), wherein the first blockchain is for a unit polynomial f 1x (x)，f 1y (y) setting a function Based on the above function, the first blockchain generates the first witness values, respectivelyWherein, (F) 1xa (x)，w 1x (a))，(F 1ya (y)，w 1y (a) Respectively corresponding unit polynomials f 1x (x)，f 1y (y) Unit polynomial witnessing the second blockchain for Unit polynomial f 2x (x)，f 2y (y) setting a function/>Based on the above function, the second witness values +_are generated separately>Wherein, (F) 2xa (x)，w 2x (a))，(F 2ya (y)，w 2y (a) Respectively corresponding unit polynomials f 2x (x)，f 2y The unity polynomial witnessing of (y).
9. The reputation calculation method of claim 8, wherein for the first polynomial F 1 (x, y) and the second polynomial F 2 (x, y) further comprises:
the first blockchain pairs the first polynomial F 1 Polynomial f in (x, y) 1 (x, y) and hashing the unit polynomial witness (F 1xa (x)，w 1x (a))，(F 1ya (y)，w 1y (a) Hashed and building a third merck tree, then witnessing the unit polynomial (F 1xa (x)，w 1x (a))、(F 1ya (y)，w 1y (a) And the third merck tree into a third message CreateWitness 1 And (a, R) a ) Send to the third blockchain;
the second blockchain pairs the second polynomial F 2 Polynomial f in (x, y) 2 (x, y) and hashing the unit polynomial witness (F 2xa (x)，w 2x (a))，(F 2ya (y)，w 2y (a) Hashed and building a fourth merck tree, then witnessing the unit polynomial (F 2xa (x)，w 2x (a))、(F 2ya (y)，w 2y (a) Packed with the fourth merck tree into a fourth message CreateWitness 2 And (a, R) a ) To the third blockchain.
10. The reputation calculation method of claim 9, further comprising:
The third blockchain transmitting the first polynomial F according to the first blockchain 1 (x, y) the third message CreateWitness 1 Obtaining a unit polynomial f 1x (x)，f 1y The unit polynomial witness of (y) (F 1xa (x)，w 1x (a))，(F 1ya (y)，w 1y (a) Building a fifth merck tree and according to said first polynomial F 1 (x, y) Unit polynomial commitment C 1x ，C 1y And the generator g, calculate the verification formula Andwhen the verification formula is established, the fifth merck tree is matched with the third message CreateWitness 1 When the third merck tree in the first message CreateWitness is equal 1 Is true;
the third blockchain transmitting the second polynomial F according to the second blockchain 2 (x, y) the fourth message CreateWitness 2 Obtaining a unit polynomial f 2x (x)，f 2y The unit polynomial witness of (y) (F 2xa (x)，w 2x (a))，(F 2ya (y)，w 2y (a) Building a sixth merck tree and according to said second polynomial F 2 (x, y) Unit polynomial commitment C 2x ，C 2y And the generator g, calculate the verification formula Andwhen the verification formula is established, the sixth merck tree is matched with the fourth message CreateWitness 2 When the fourth merck tree is equal, the fourth message CreateWitness 2 Is true.
11. The reputation calculation method of any of claims 6-10, wherein the reputation calculation polynomial is the first polynomial F 1 (x, y) and the second polynomial F 2 (x, y) when the third message CreateWitness 1 Is true, and the fourth message CreateWitness 2 When true, the third blockchain calculating reputation parameters of the service device based on the consistent reputation, the recommendation reputation, the reputation calculation polynomial includes: substituting the first quality of service parameter into a first polynomial F 1 (x, y) calculating to obtain a consistent credit, substituting the rating parameter into the second polynomial F 2 (x, y) calculating to obtain a recommended reputation, and then adding the consistent reputation and the recommended reputation to obtain reputation parameters of the service equipment.
12. The reputation calculation method of any of claims 6-10, wherein the reputation calculation polynomial is the first polynomial F 1 (x, y) and the second polynomial F 2 (x, y) when the third message CreateWitness 1 Is true, and the fourth message CreateWitness 2 When true, the third blockchain calculating reputation parameters of the service device based on the consistent reputation, the recommendation reputation, the reputation calculation polynomial includes: substituting the first quality of service parameter into a first polynomial F 1 (x, y) calculating to obtain a consistent credit, substituting the rating parameter into the second polynomial F 2 (x, y) calculating to obtain a recommended reputation, and then multiplying the consistent reputation and the recommended reputation to obtain a reputation parameter of the service equipment.
13. The reputation calculation method of claim 6, wherein determining the first node comprises:
performing qualification screening on N nodes participating in reputation calculation verification in the first blockchain, determining that the selected node can participate in the calculation and verification process of the reputation value when the reputation value of the selected node is higher than a threshold value determined by a service platform, determining and eliminating malicious nodes when the reputation value of the selected node is lower than the threshold value, determining that the number of the nodes passing qualification screening is N, and taking the N nodes passing qualification screening as the first nodes;
and sequencing the reputation values of the first nodes from high to low, selecting 1 from 1 or more first nodes with highest reputation values as first computing nodes, and taking the rest (N-1) first nodes as first verification nodes, wherein N and N are natural numbers which are more than or equal to 2, and N is less than N.
14. The reputation calculation method of claim 6, wherein determining the second node comprises:
performing qualification screening on M nodes participating in reputation calculation verification in the second blockchain, determining that the selected nodes can participate in the reputation calculation and verification process when the reputation value of the selected nodes is higher than a threshold value determined by a service platform, determining and eliminating malicious nodes when the reputation value of the selected nodes is lower than the threshold value, determining that the number of the nodes passing qualification screening is M, and taking the M nodes passing qualification screening as the second nodes;
and sequencing the reputation values of the second nodes from high to low, selecting 1 from 1 or more second nodes with highest reputation values as second calculation nodes, and taking the rest (M-1) second nodes as second verification nodes, wherein M and M are natural numbers which are more than or equal to 2, and M is less than M.
15. The reputation calculation method of claim 1, wherein the time consumption and space consumption of the reputation calculation are substantially unchanged as the complexity of the first and second polynomials increases.
16. The reputation calculation method of claim 1 wherein,
the first service quality parameter sent by the served device and the second service quality parameter sent by the serving device all comprise service efficiency, service timeliness and service cost performance.
17. A reputation computing system for use in charging an electric vehicle, comprising: a multi-chain computing platform, a service platform and a charging device, wherein,
the multi-chain computing platform comprises a first block chain and a second block chain which are independent of each other, and a third block chain which performs data transmission and interactive verification with both the first block chain and the second block chain;
the first blockchain is configured to receive and store a first quality of service parameter sent by a user of the electric vehicle and a second quality of service parameter sent by the charging device;
the second blockchain is configured to receive and store rating parameters sent by the electric vehicle user for the charging device;
the third blockchain is configured to receive a first polynomial, a second polynomial, and a reputation calculation polynomial set by a service platform, generate a commitment of the first polynomial based on the first polynomial and parameters of initialization of the program for the commitment calculation, generate a commitment of the second polynomial based on the second polynomial and parameters of initialization of the program for the commitment calculation, delegate the commitment of the first polynomial and the first polynomial to the first blockchain, and delegate the commitment of the second polynomial and the second polynomial to the second blockchain;
The first blockchain is further configured to validate the first polynomial based on a first validation formula and a commitment of the first polynomial, calculate a consistent reputation and a plurality of first witness values from the first quality of service parameter and the second quality of service parameter when the commitment of the first polynomial corresponds to the first polynomial, and transmit the consistent reputation and the plurality of first witness values to the third blockchain;
the second blockchain is further configured to validate the second polynomial based on a second validation formula and a commitment of the second polynomial, calculate a recommended reputation and a plurality of second witness values from the rating parameters when the commitment of the second polynomial corresponds to the second polynomial, and transmit the recommended reputation and the plurality of second witness values to the third blockchain;
the third blockchain is further configured to verify the consistent reputation according to a commitment of the first polynomial and a plurality of the first witness values, the consistent reputation being true when verification passes; and verifying the recommended reputation according to the promise of the second polynomial and a plurality of second witness values, wherein the recommended reputation is true when verification passes, and the third blockchain calculates reputation parameters of the charging device based on the consistent reputation, the recommended reputation and the reputation calculation polynomial.
18. A reputation evaluation method applied to an electric vehicle charging system comprises the following steps:
the first block link receives and stores a first quality of service parameter sent by a user of the electric vehicle and a second quality of service parameter sent by the private charging equipment;
a second block link receives and stores rating parameters of the private charging equipment sent by the electric vehicle user;
a third blockchain receives a first polynomial, a second polynomial and a reputation calculation polynomial set by a service platform, generates a commitment of the first polynomial based on the first polynomial and parameters of initialization of a program for commitment calculation, generates a commitment of the second polynomial based on the second polynomial and parameters of initialization of the program for commitment calculation, commits the commitment of the first polynomial and the first polynomial to the first blockchain when determining that the first quality of service parameter and the second quality of service parameter are consistent, and commits the commitment of the second polynomial and the commitment of the second polynomial to the second blockchain;
the first blockchain validating the first polynomial based on a first validation formula and a commitment of the first polynomial, calculating a consistent reputation and a plurality of first witness values from the first quality of service parameter and the second quality of service parameter when the commitment of the first polynomial corresponds to the first polynomial, and transmitting the consistent reputation and the plurality of first witness values to the third blockchain;
The second blockchain validating the second polynomial based on a second validation formula and a commitment of the second polynomial, calculating a recommended reputation and a plurality of second witness values according to the rating parameters when the commitment of the second polynomial corresponds to the second polynomial, and transmitting the recommended reputation and the plurality of second witness values to the third blockchain;
the third blockchain verifies the consistent reputation according to the promise of the first polynomial and a plurality of the first witness values, and when verification passes, the consistent reputation is true; and the third blockchain verifies the recommendation reputation according to the promise of the second polynomial and a plurality of second witness values, and when the verification passes, the recommendation reputation is true, and the third blockchain calculates reputation parameters of the private charging equipment based on the consistent reputation, the recommendation reputation and the reputation calculation polynomial.
19. A charging method of an electric vehicle, comprising:
the electric vehicle to be charged sends a service request to a service platform, the service platform sends a request for inquiring the credit of the private charging equipment to a multi-chain computing platform, the multi-chain computing platform returns the recommended credit of the charging equipment to the service platform, and then the service platform sends service authentication to the recommended private charging equipment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311672094.2A CN117787739A (en) | 2023-12-07 | 2023-12-07 | Verifiable cross-chain reputation calculation method and system, and evaluation and charging method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311672094.2A CN117787739A (en) | 2023-12-07 | 2023-12-07 | Verifiable cross-chain reputation calculation method and system, and evaluation and charging method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117787739A true CN117787739A (en) | 2024-03-29 |
Family
ID=90382382
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311672094.2A Pending CN117787739A (en) | 2023-12-07 | 2023-12-07 | Verifiable cross-chain reputation calculation method and system, and evaluation and charging method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117787739A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190172026A1 (en) * | 2017-12-02 | 2019-06-06 | Alchemy Limited LLC | Cross blockchain secure transactions |
| CN111241114A (en) * | 2020-01-07 | 2020-06-05 | 中国科学院信息工程研究所 | Intelligent service transaction block chain credit management method and system combining transaction and consensus |
| CN112134869A (en) * | 2020-09-16 | 2020-12-25 | 北方工业大学 | Cloud service examination system and examination method based on block chain |
| CN112818388A (en) * | 2021-01-25 | 2021-05-18 | 北方工业大学 | Cloud service privacy protection credit system based on block chain |
| CN113553380A (en) * | 2021-07-23 | 2021-10-26 | 东北大学 | Reputation-behavior association-oriented data traceability system with double block chains |
| WO2022095780A1 (en) * | 2020-11-06 | 2022-05-12 | 深圳前海微众银行股份有限公司 | Bft-based blockchain consensus method and device |
| US20230179435A1 (en) * | 2021-12-06 | 2023-06-08 | Blocky, Inc. | System and method for creating and maintaining immutability, agreement and availability of data |
-
2023
- 2023-12-07 CN CN202311672094.2A patent/CN117787739A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190172026A1 (en) * | 2017-12-02 | 2019-06-06 | Alchemy Limited LLC | Cross blockchain secure transactions |
| CN111241114A (en) * | 2020-01-07 | 2020-06-05 | 中国科学院信息工程研究所 | Intelligent service transaction block chain credit management method and system combining transaction and consensus |
| CN112134869A (en) * | 2020-09-16 | 2020-12-25 | 北方工业大学 | Cloud service examination system and examination method based on block chain |
| WO2022095780A1 (en) * | 2020-11-06 | 2022-05-12 | 深圳前海微众银行股份有限公司 | Bft-based blockchain consensus method and device |
| CN112818388A (en) * | 2021-01-25 | 2021-05-18 | 北方工业大学 | Cloud service privacy protection credit system based on block chain |
| CN113553380A (en) * | 2021-07-23 | 2021-10-26 | 东北大学 | Reputation-behavior association-oriented data traceability system with double block chains |
| US20230179435A1 (en) * | 2021-12-06 | 2023-06-08 | Blocky, Inc. | System and method for creating and maintaining immutability, agreement and availability of data |
Non-Patent Citations (2)
| Title |
|---|
| YUNHUA HE，ETC.: "A Cross-Chain Trusted Reputation Scheme for a Shared Charging Platform Based on Blockchain", IEEE INTERNET OF THINGS JOURNAL, vol. 9, no. 11, 30 June 2021 (2021-06-30) * |
| 刘昊哲;李莎莎;吕伟龙;魏松杰;: "基于信誉度的主从多链区块链共识机制", 南京理工大学学报, no. 03, 30 June 2020 (2020-06-30) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110599261B (en) | Electric automobile safety electric power transaction and excitation system based on energy source block chain | |
| CN111914027B (en) | Block chain transaction keyword searchable encryption method and system | |
| Wang et al. | A survey on consensus mechanisms and mining strategy management in blockchain networks | |
| Chen et al. | Secure electricity trading and incentive contract model for electric vehicle based on energy blockchain | |
| Garg et al. | An efficient blockchain-based hierarchical authentication mechanism for energy trading in V2G environment | |
| Li et al. | A consortium blockchain-enabled secure and privacy-preserving optimized charging and discharging trading scheme for electric vehicles | |
| CN110046894B (en) | Erasure code-based block chain establishing method capable of reconstructing groups | |
| Cai et al. | Towards private, robust, and verifiable crowdsensing systems via public blockchains | |
| CN103259650A (en) | Fair and rational multi-secret sharing method for honest participants | |
| CN112651830B (en) | Block chain consensus method applied to power resource sharing network | |
| Zhang et al. | Cycledger: A scalable and secure parallel protocol for distributed ledger via sharding | |
| Wang et al. | Blockchain-based dynamic energy management mode for distributed energy system with high penetration of renewable energy | |
| Zhao et al. | Fuzzy identity-based dynamic auditing of big data on cloud storage | |
| Zhang et al. | Model of decentralized cross-chain energy trading for power systems | |
| CN114422146A (en) | Anonymous sorting method for block chain main nodes | |
| Liu et al. | A blockchain-based cross-domain authentication management system for IoT devices | |
| Liu et al. | Enhanced proof-of-benefit: A secure blockchain-enabled EV charging system | |
| Zhang et al. | A lightweight privacy preserving scheme of charging and discharging for electric vehicles based on consortium blockchain in charging service company | |
| Sakho et al. | Privacy protection issues in blockchain technology | |
| Li et al. | Cryptoeconomics: Economic Mechanisms Behind Blockchains | |
| Zhou et al. | Consensus Mechanism of Blockchain Based on PoR with Data Deduplication. | |
| Dong et al. | DAON: A decentralized autonomous oracle network to provide secure data for smart contracts | |
| CN117787739A (en) | Verifiable cross-chain reputation calculation method and system, and evaluation and charging method | |
| Arya et al. | Blockchain: Basics, applications, challenges and opportunities | |
| CN111695798B (en) | Block chain-based public officer assessment system |
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 |