CN113781073A - Subsidizing method capable of hiding real names based on matrix alliance chain - Google Patents

Subsidizing method capable of hiding real names based on matrix alliance chain Download PDF

Info

Publication number
CN113781073A
CN113781073A CN202111323417.8A CN202111323417A CN113781073A CN 113781073 A CN113781073 A CN 113781073A CN 202111323417 A CN202111323417 A CN 202111323417A CN 113781073 A CN113781073 A CN 113781073A
Authority
CN
China
Prior art keywords
node
block
transaction
chain
consensus
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.)
Granted
Application number
CN202111323417.8A
Other languages
Chinese (zh)
Other versions
CN113781073B (en
Inventor
陈龙
黄海平
杨健
王小露
黄启萌
肖甫
陈伟
薛凌妍
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN202111323417.8A priority Critical patent/CN113781073B/en
Publication of CN113781073A publication Critical patent/CN113781073A/en
Application granted granted Critical
Publication of CN113781073B publication Critical patent/CN113781073B/en
Priority to PCT/CN2022/106613 priority patent/WO2023082690A1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/018—Certifying business or products
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
    • G06F21/44—Program or device authentication
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/03—Credit; Loans; Processing thereof

Abstract

The invention provides a subsidizing method of a concealable real name based on a matrix alliance chain, which is characterized in that a plurality of behavior bodies such as public welfare agencies, enterprises, individuals, governments, supervision agencies and the like are gathered together through an alliance chain system, a matrix alliance chain is designed, a structure is optimized, an alliance is established, and real name information can be concealed by a sponsor and a receiver without influencing the transparency and authenticity of the subsidizing information, so that traceability and tracing are ensured; and (4) optimizing a consensus mechanism and promoting the behavior integrity of the sponsor. The invention gives full play to the advantages of the block chain in public service scenes and effectively protects the privacy of users.

Description

Subsidizing method capable of hiding real names based on matrix alliance chain
Technical Field
The invention relates to the technical field of alliance chains, in particular to a subsidizing method capable of hiding real names based on a matrix alliance chain.
Background
The traditional public welfare charitable organization has low information disclosure transparency, a supervision mechanism is in short position, and public trust is insufficient. The 'fund going and using condition' and 'benevolence source' of the public welfare organization are always the focus of public attention, but the conventional public welfare organization often has insufficient information disclosure and weak social supervision strength, thereby influencing the confidence and the support degree of the public welfare organization. Most of the traditional public welfare charitable organizations are not transformed by digital technology, the traditional donation flow is complicated, the technical means is backward, and the efficiency is low; meanwhile, the rapid development of Chinese economy brings about the ever-increasing public demand of the masses. In recent years, the total value of social public welfare and the number of social organizations are continuously increased, the individual donation amount keeps better acceleration, and the scale of the individual donation assets, particularly the network donation, is widely seen in the future. With the rapid development of the internet and the wide application of information technology, the network public welfare crowd-funding platform develops rapidly such as easy funding, water droplet funding, love funding and the like, but due to the open characteristics of the internet, the crowd-funding platform is difficult to effectively screen information of an initiator and a beneficiary, and problems that individual recourse persons falsely build illness states, partial platform online business processes are not in compliance, user data are abused, individual platforms are involved in illegal funding and the like are frequently generated. The method not only damages the basic rights and interests of the donors, but also weakens the trust of the masses on the network public welfare and crowd raising activities, and restricts the sustainable development of the public welfare industry. In addition, in the existing public welfare scenario, including the products of block chains and public welfare, the financial and physical subsidies of money and objects are mainly focused, and the help of service resources such as 'volunteer time', 'online courses', 'experience knowledge' and the like which can be given by people is ignored. In the process of consolidating and expanding the poverty-escaping attack and hardening result and promoting the pleasure of the country, the public welfare scene of realizing the dream of children in the country is considered, and the property and service are considered.
The block chain technology is a distributed account book technology, is commonly maintained by multiple parties, uses cryptography to ensure transmission and access safety, can realize the accounting technology of data consistent storage, difficult tampering and prevention of repudiation, has the properties of decentralization, openness and transparency, traceable information and tamper resistance, can effectively ensure the openness and transparency of public service projects, and can be used for a donor to inquire each transaction and trace the issuing information, the use condition and the like of goods and money. The block chain has great application potential as a new digital technology, the block chain is gradually applied to the social public service field at present, however, in order to better and more publicly disclose the block chain to the public, the existing public service block chain system can record complete information of a sponsor and a sponsor in the block chain, and due to the characteristic that the block chain can not be tampered, the information of a user can be permanently kept in the block chain. For privacy protection, the sponsor or sponsor should be able to request to delete or hide private data records related to themselves, i.e. the user should be able to choose real names or hide real names to participate in the records of the blockchain without affecting the public transparency and tamper resistance of the sponsored data, so as to protect the privacy and anonymity of the user. Compared with the public chain, the admission mechanism of the alliance chain is more suitable for public service scenes, and public service platforms, government regulatory departments and credit department doors which have good credit and accord with the qualification are allowed to enter to participate in consensus. However, based on the existing alliance chain system, only the subsidy transaction information is continuously recorded in the block, all the subsidy information of a certain subsidy person cannot be accurately associated, a certain specific subsidy transaction cannot be positioned to realize on-chain modification, and real-name information of the subsidy person and the subsidy person cannot be protected.
Disclosure of Invention
In order to solve the technical problems, the invention provides a subsidizing method of a concealable real name based on a matrix alliance chain, after real name registration and authentication, a sponsor can subsidize the property or service of the sponsor, and by optimizing a block structure and a chain structure, real name information stored on the block chain is allowed to be concealed without influencing the whole structure of the chain, and meanwhile, the subsidizing information can be traced and accountable, and personal privacy information is effectively protected; optimizing a consensus mechanism, introducing the matching degree of the subsidy type and the credit score of an authoritative credit department, promoting the subsidiary to implement the integrity behavior, and feeding back the loss behavior to the integrity file of a credit unit to promote the integrity subsidization.
The invention relates to a subsidizing method of a concealable real name based on a matrix alliance chain, which comprises the following steps,
s1, initializing a alliance chain system to generate public parameters, wherein participants of the alliance chain comprise a person to be helped, a supervision mechanism and a key generation center;
s2, constructing a dream block to form a transverse chain in the matrix union chain; person to be helped
Figure DEST_PATH_IMAGE001
Submitting application and subsidization information to the alliance chain system, and supervising the node
Figure 560936DEST_PATH_IMAGE002
The application and the subsidy information are audited and verified, and the dreamy transaction information issued by the subsidee is packaged
Figure DEST_PATH_IMAGE003
And generating a copy of the transaction
Figure 412830DEST_PATH_IMAGE004
The supervisory node broadcasts transaction information
Figure DEST_PATH_IMAGE005
And transaction copies
Figure 130250DEST_PATH_IMAGE004
The consensus node compares the transaction information according to a consensus mechanism
Figure 994301DEST_PATH_IMAGE003
And transaction copies
Figure 277515DEST_PATH_IMAGE004
Performing verification and sending the verified transaction information
Figure 834398DEST_PATH_IMAGE005
And transaction copies
Figure 570273DEST_PATH_IMAGE004
Writing a dream block;
s3, constructing a subsidy block to form a vertical chain in the matrix alliance chain; help people
Figure 238015DEST_PATH_IMAGE006
Finish the person who is helped
Figure 375735DEST_PATH_IMAGE001
After the subsidization, acquiring the subsidized certificate issued and endorsed by the supervision node
Figure DEST_PATH_IMAGE007
Supervision node broadcasts subsidized transactions
Figure 306782DEST_PATH_IMAGE008
And transactional copies thereof
Figure 529953DEST_PATH_IMAGE009
The consensus node proceeds with the subsidized transaction according to the consensus mechanism
Figure DEST_PATH_IMAGE010
And transactional copies thereof
Figure 735806DEST_PATH_IMAGE011
Performing verification and subsidizing the transaction after verification
Figure 728033DEST_PATH_IMAGE008
And transactional copies thereof
Figure 361140DEST_PATH_IMAGE011
Storing the data into a transaction pool; the main consensus node is based on the person under investigationIDAnd subsidized type of packagingBlocks broadcast to a blockchain network, verifying the correctness of the blocks from consensus nodes and voting, the number of votes exceeding a threshold
Figure DEST_PATH_IMAGE012
The chain can be wound;
s4 qualified person
Figure 740781DEST_PATH_IMAGE006
When the subsidy information is wanted to be hidden, the subsidy person sends out a transaction modification request to supervise the node
Figure 750325DEST_PATH_IMAGE002
After receiving the request, quickly positioning the coordinates of the block where the transaction is located
Figure 597058DEST_PATH_IMAGE013
After verifying the identity of the sponsor, a pseudo-identity is generated for the sponsor
Figure DEST_PATH_IMAGE014
And issuing a new certificate of subsidy
Figure 135487DEST_PATH_IMAGE015
After the mutual identification node passes the verification, the mutual identification node modifies the transaction information on the chain to hide the real name according to a mutual identification mechanism through the whole network broadcasting, and the sponsor can still apply for recovering the real name information from the supervision node after hiding the real name;
s5 qualified person
Figure 67671DEST_PATH_IMAGE001
When wanting to hide the subsidized information, the person to be subsidized
Figure 146486DEST_PATH_IMAGE001
After receiving the subsidization, initiating a request for deleting the subsidization release, and supervising the node
Figure 847725DEST_PATH_IMAGE002
After receiving the request, the uplink inquires the transaction data of the person to be helped, and after verifying the information of the person to be helped, the supervisory node
Figure 88214DEST_PATH_IMAGE002
And initiating a deletion transaction, and modifying the dream block after the consensus node verifies according to the consensus mechanism.
Further, the specific step of S1 is:
s1-1, each participating user generates character string associated with own identity
Figure DEST_PATH_IMAGE016
The character strings generated by the sponsor, the supervising authority and the key generation center and associated with the identity information are respectively expressed as:
Figure 976535DEST_PATH_IMAGE017
s1-2, inputting safety parameters
Figure 593462DEST_PATH_IMAGE018
Selecting addition cycle groups
Figure 414787DEST_PATH_IMAGE019
And multiplication loop group
Figure DEST_PATH_IMAGE020
And is and
Figure 295018DEST_PATH_IMAGE021
，
Figure DEST_PATH_IMAGE022
is composed of
Figure 933286DEST_PATH_IMAGE018
The large prime number of bits is the number of bits,
Figure 88323DEST_PATH_IMAGE023
into a group
Figure 764155DEST_PATH_IMAGE019
And define such anBilinear mapping
Figure DEST_PATH_IMAGE024
：
Figure 80867DEST_PATH_IMAGE025
；
S1-3, selecting random number at random by key generation center
Figure DEST_PATH_IMAGE026
As the system master key, and calculates its public key as
Figure 209360DEST_PATH_IMAGE027
Defining 6 secure hash functions, which are respectively:
Figure DEST_PATH_IMAGE028
and a pair of encryption and decryption algorithms
Figure 371351DEST_PATH_IMAGE029
，
Figure DEST_PATH_IMAGE030
Disclosure of system parameters
Figure 901690DEST_PATH_IMAGE031
And is recorded on the block chain,
Figure DEST_PATH_IMAGE032
display module
Figure 858144DEST_PATH_IMAGE033
The multiplicative group of the remaining class ring of (c),
Figure DEST_PATH_IMAGE034
which represents the public key(s),
Figure 473934DEST_PATH_IMAGE035
indicating indefinite length
Figure DEST_PATH_IMAGE036
A string of bits is then transmitted through the bit string,
Figure 705195DEST_PATH_IMAGE037
to represent
Figure DEST_PATH_IMAGE038
(ii) a Of a long bit length
Figure 821531DEST_PATH_IMAGE036
A bit string;
s1-4, the key generation center provides the identity character string according to each participated user
Figure 745624DEST_PATH_IMAGE039
Computing
Figure DEST_PATH_IMAGE040
，
Figure 583130DEST_PATH_IMAGE041
，
Figure DEST_PATH_IMAGE042
，
Figure 352503DEST_PATH_IMAGE043
And an
Figure DEST_PATH_IMAGE044
Wherein, in the step (A),
Figure 591855DEST_PATH_IMAGE045
is a public and private key pair of a user,
Figure DEST_PATH_IMAGE046
for the user block chain public key address,
Figure 421270DEST_PATH_IMAGE047
is the user's registration certificate, is generated by the private key signature of the key generation center,
Figure DEST_PATH_IMAGE048
in order to be the registration number,
Figure 480493DEST_PATH_IMAGE049
is a universal hash function and then is transmitted through a secure channel
Figure DEST_PATH_IMAGE050
And sending the data to the user.
Further, the step of S2 is:
s2-1, the person of interest
Figure 53557DEST_PATH_IMAGE001
Packaging personal registration information, dream content and type generating messages
Figure 678574DEST_PATH_IMAGE051
And calculating the digital signature thereof
Figure DEST_PATH_IMAGE052
Wherein, in the step (A),
Figure 678891DEST_PATH_IMAGE053
sending messages for current timestamps
Figure DEST_PATH_IMAGE054
To a blockchain network;
s2-2, supervision node
Figure 225410DEST_PATH_IMAGE055
Receiving the person to be helped
Figure 599235DEST_PATH_IMAGE001
Message
Figure DEST_PATH_IMAGE056
Then, first, the current timestamp is selected
Figure 547599DEST_PATH_IMAGE057
Definition of
Figure DEST_PATH_IMAGE058
Is the effective difference between the timestamp of the message and the timestamp of the received message, if
Figure 718817DEST_PATH_IMAGE059
If the message is valid, otherwise, the dialog is terminated, and then the following formula is calculated to verify the correctness of the message:
Figure DEST_PATH_IMAGE060
(ii) a If the above formula is established, receiving the message, verifying that the dream content and type of the person to be helped are correct, and returning confirmation information;
s2-3, supervision node
Figure 752632DEST_PATH_IMAGE055
Packing the patrons according to the trading format of the dream blocks
Figure 933078DEST_PATH_IMAGE001
Submitted information and generating a transaction copy, as follows:
Figure 267107DEST_PATH_IMAGE061
Figure DEST_PATH_IMAGE062
；
wherein the content of the first and second substances,
Figure 609227DEST_PATH_IMAGE005
containing personal real information of a sponsor
Figure 661497DEST_PATH_IMAGE001
And
Figure 645633DEST_PATH_IMAGE063
，
Figure 834169DEST_PATH_IMAGE004
for transaction copiesAnd the two character strings are not included,
Figure DEST_PATH_IMAGE064
is the signature of the supervising node on the transaction,
Figure 81611DEST_PATH_IMAGE065
the time is generated for the transaction,
Figure DEST_PATH_IMAGE066
the label is a label of the dream block chain and is used for positioning block coordinates and a transaction position when the block chain is edited subsequently;
s2-4, supervision node
Figure 352668DEST_PATH_IMAGE055
Broadcasting the transaction and the transaction copy, verifying the transaction and the transaction copy by the consensus node according to the consensus mechanism, and verifying the transaction and the transaction copy according to the consensus mechanism after the verification is passed
Figure 874916DEST_PATH_IMAGE066
The label is written into the dream block and an index list is established
Figure 183537DEST_PATH_IMAGE067
Saved as down-link data to a local database, wherein
Figure DEST_PATH_IMAGE068
The height of the block is used for fast positioning of the process of generating the subsidized chain, and two merkleroots are stored in the data structure of the block and are respectively
Figure 867460DEST_PATH_IMAGE069
、
Figure DEST_PATH_IMAGE070
Correspondingly, the block header will store two hash values of the previous block, and the blocks are linked by the light chain and the dark chain, so as to ensure that the block chain structure is not damaged when modifying the contents of the block chain, that is:
Figure 363163DEST_PATH_IMAGE071
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE072
which represents the current block of the video stream,
Figure 892365DEST_PATH_IMAGE073
two hash values representing the previous block,
Figure DEST_PATH_IMAGE074
a random number representing the current block is generated,
Figure 524334DEST_PATH_IMAGE075
representing the generation timestamp of the block.
Further, the step of S3 is:
s3-1, sponsor
Figure DEST_PATH_IMAGE076
Finish the person who is helped
Figure 379158DEST_PATH_IMAGE001
Funds transfer or service to a blockchain address of the mobile station, generating subsidy information
Figure 627736DEST_PATH_IMAGE077
To supervision node
Figure 491787DEST_PATH_IMAGE055
Sending a generate funding certificate request
Figure DEST_PATH_IMAGE078
，
Wherein the content of the first and second substances,
Figure 509422DEST_PATH_IMAGE079
the presentation of the sponsored content is performed,
Figure DEST_PATH_IMAGE080
representing cryptographic algorithms, supervisory nodesAfter receiving the request, executing the decryption algorithm
Figure 266638DEST_PATH_IMAGE081
To obtain
Figure DEST_PATH_IMAGE082
If and subsidizing the message
Figure 471354DEST_PATH_IMAGE083
Is directly formed by
Figure DEST_PATH_IMAGE084
Calculated value
Figure 873517DEST_PATH_IMAGE085
If they are equal, the request is confirmed to be received and the certificate of subsidy is issued
Figure DEST_PATH_IMAGE086
Wherein
Figure 480078DEST_PATH_IMAGE087
Generating time for the certificate and endorsing;
s3-2, supervision node
Figure 942284DEST_PATH_IMAGE055
Generating transactions according to the transaction format of the funded block
Figure DEST_PATH_IMAGE088
And copies of transactions
Figure 899875DEST_PATH_IMAGE089
And broadcast to the whole network, verified by the consensus node according to the consensus mechanism, and in addition, the supervision node
Figure 105729DEST_PATH_IMAGE055
And also provide subsidized objects
Figure 97956DEST_PATH_IMAGE001
Related information of
Figure DEST_PATH_IMAGE090
For block positioning;
Figure 465483DEST_PATH_IMAGE091
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE092
transaction copy
Figure 644792DEST_PATH_IMAGE089
Does not include the personal related information of the sponsor
Figure 409265DEST_PATH_IMAGE076
，
Figure 787156DEST_PATH_IMAGE093
，
Figure DEST_PATH_IMAGE094
Representing the supervisory node's signature on the transaction,
Figure 60006DEST_PATH_IMAGE095
means that the sponsor's public key is used to encrypt the corresponding certificate, and the certificate is used for receiving the certificate and then decrypting the certificate with the own private key to obtain the sponsorship certificate,
Figure DEST_PATH_IMAGE096
representing a transaction generation time;
s3-3, after the transaction and the copy verification are passed, the main consensus node will trade according to the consensus mechanism
Figure 726610DEST_PATH_IMAGE088
And copies
Figure 274266DEST_PATH_IMAGE089
Is deposited into a transaction pool and then will
Figure 241085DEST_PATH_IMAGE097
To the same person under charge within a period of time
Figure 481574DEST_PATH_IMAGE001
The subsidized transactions are packaged into blocks and broadcast to a network of block chains, the blocks are verified from consensus nodes, and votes are cast over a threshold
Figure 901054DEST_PATH_IMAGE012
Then, calculate the index
Figure DEST_PATH_IMAGE098
Positioning
Figure 986822DEST_PATH_IMAGE001
Height of the blockheightLinking the block to a corresponding subsidized chain, the height of which is defined asdepthBlock coordinates of a transaction in the matrix federation chain: (height, depth) (ii) a Similarly, there are two merkleroot values in the block data structure of the grant chain, which are respectively
Figure 808147DEST_PATH_IMAGE099
And
Figure DEST_PATH_IMAGE100
and two hash values of the previous block, and the blocks are linked by a light chain and a dark chain.
Further, the specific content of S4 is:
s4-1, sponsor
Figure 953958DEST_PATH_IMAGE076
Initiating an anonymous modification request
Figure 860734DEST_PATH_IMAGE101
Wherein
Figure DEST_PATH_IMAGE102
In order to modify the coordinates of the block where the transaction is located,
Figure 484613DEST_PATH_IMAGE103
in order to be able to use the encryption algorithm,
Figure DEST_PATH_IMAGE104
a certificate of subsidy is represented and,
Figure 157515DEST_PATH_IMAGE105
is the current timestamp;
s4-2, supervision node
Figure 5386DEST_PATH_IMAGE055
Receive to
Figure DEST_PATH_IMAGE106
First, select the current timestamp
Figure 133879DEST_PATH_IMAGE107
If, if
Figure DEST_PATH_IMAGE108
The message is valid, according to
Figure 561449DEST_PATH_IMAGE076
Query local database to obtain
Figure 91788DEST_PATH_IMAGE109
Executing a decryption algorithm
Figure DEST_PATH_IMAGE110
，
If it is
Figure 579401DEST_PATH_IMAGE111
If true, the sponsor is indicated
Figure DEST_PATH_IMAGE112
The message is correct for a legal user;
s4-3, after the message passes the verification, the supervision node
Figure 195190DEST_PATH_IMAGE113
For the person of interest
Figure DEST_PATH_IMAGE114
Generating a pseudo-identity
Figure 426451DEST_PATH_IMAGE115
And issue a new certificate of subsidy
Figure DEST_PATH_IMAGE116
Endorse in parallel, then supervise the node
Figure 545717DEST_PATH_IMAGE113
Generating new transaction data
Figure 469810DEST_PATH_IMAGE117
，
Wherein
Figure DEST_PATH_IMAGE118
Wherein
Figure 572896DEST_PATH_IMAGE119
Which represents the time at which the transaction was generated,
Figure DEST_PATH_IMAGE120
a digital signature is represented for the transaction,
Figure 76689DEST_PATH_IMAGE121
represents a chain tag; furthermore, a supervisory node
Figure 109849DEST_PATH_IMAGE113
The coordinate of the block where the transaction to be modified is located is also provided to the consensus node
Figure DEST_PATH_IMAGE122
And modifying the identity information of the request originator
Figure 673685DEST_PATH_IMAGE114
；
S4-4, recognizing according to a recognition mechanismNode-to-node transactions
Figure 529646DEST_PATH_IMAGE123
After the verification is passed, according to
Figure DEST_PATH_IMAGE124
And
Figure 102710DEST_PATH_IMAGE114
quickly inquiring the transaction to be modified and then sending the transaction to be modified
Figure 462147DEST_PATH_IMAGE088
Is replaced by
Figure 728043DEST_PATH_IMAGE123
Recalculating the value of merkleroot
Figure 71300DEST_PATH_IMAGE125
At this time, the bright chain between the block and the subsequent block is broken due to the change in the value of merkleroot, and
Figure DEST_PATH_IMAGE126
the value of (d) remains unchanged, so the dark chain maintains the integrity of the subsidized chain; if it is
Figure 182475DEST_PATH_IMAGE126
If the block is also changed, the block is indicated to be subjected to unauthorized tampering;
s4-5, qualified person
Figure 661998DEST_PATH_IMAGE114
When the real name is needed again, a modification request is sent, and the node is monitored
Figure 98796DEST_PATH_IMAGE113
Relevant endorsement content can be obtained by searching a local database, and steps S4-1 to S4-3 are carried out after identity verification to complete real name modification. When the information is subjected to false information or public welfare disputes, the information can still be checked, and traceability and accountability are ensured.
Further, the specific step of S5 is:
s5-1, the person of interest
Figure 663769DEST_PATH_IMAGE001
Initiating a delete request
Figure 844215DEST_PATH_IMAGE127
Wherein
Figure DEST_PATH_IMAGE128
The height of the dream block is the height of the dream block,
Figure 647086DEST_PATH_IMAGE129
a timestamp of the current request;
s5-2, supervision node
Figure 254784DEST_PATH_IMAGE113
Person receiving the information
Figure 304124DEST_PATH_IMAGE001
After the sent deleting request, the current time is selected first
Figure DEST_PATH_IMAGE130
If, if
Figure 757102DEST_PATH_IMAGE131
If the request is valid, then the uplink query obtains the transaction data
Figure DEST_PATH_IMAGE132
，
Computing
Figure 945638DEST_PATH_IMAGE133
If, if
Figure DEST_PATH_IMAGE134
If yes, the identity of the person to be helped is credible; otherwise, the person is illegal or
Figure 458659DEST_PATH_IMAGE135
If the value is subject to unauthorized tampering, the session is terminated;
s5-3, qualified person
Figure 998225DEST_PATH_IMAGE001
When the identity verification passes, the node is supervised
Figure 520473DEST_PATH_IMAGE113
Generating new transaction data
Figure DEST_PATH_IMAGE136
Broadcasting, and providing the height of the block to be modified
Figure 563516DEST_PATH_IMAGE137
；
S5-4, according to the consensus mechanism, after the consensus node is verified, the block to be modified is deleted, specifically, the original block is deleted
Figure DEST_PATH_IMAGE138
Is replaced by
Figure 247438DEST_PATH_IMAGE139
And recalculated
Figure DEST_PATH_IMAGE140
Due to this value change, for the dream chain, the latter block
Figure 743141DEST_PATH_IMAGE141
Current block stored therein
Figure DEST_PATH_IMAGE142
The first hash value is changed, and the second hash value is kept unchanged, so that the structure of the dream chain is kept complete; similarly, for the subsidy chain, the second hash value stored in the first subsidy block is unchanged, and the structure of the subsidy block is complete; because the transaction content on the subsidized chain does not contain the person to be subsidized
Figure 803501DEST_PATH_IMAGE001
The corresponding subsidy certificate is encrypted, only the subsidy node with the corresponding private key can see the corresponding subsidy certificate, and the subsidy person cannot be inquired by other nodes
Figure 966629DEST_PATH_IMAGE001
The related information of (2).
Further, the consensus mechanism is a practical Byzantine fault-tolerant mechanism based on multi-factor voting, and the consensus nodes are a sponsor and a helped person; the common knowledge of the common knowledge node is obtained when the transaction is issued or modified on the chain, and the common knowledge node calculates the matching degree through synthesisSDSubsidy limitSACredit rating of the sponsorCSThree-factor voting before rank selection
Figure 352611DEST_PATH_IMAGE143
The consensus node of the bit participates in consensus, each time
Figure DEST_PATH_IMAGE144
And (5) when the hour changes, reorganizing the election voting.
Further, according to the consensus mechanism, the step of verifying the consensus node is as follows:
s6-1, when the matrix alliance chain is cold-started, the supervising node
Figure 332681DEST_PATH_IMAGE113
Writing the subsidized transaction information into the founding block; the key generation center KGC distributes independent block chain addresses to each node
Figure 462311DEST_PATH_IMAGE145
Private key
Figure DEST_PATH_IMAGE146
And public key
Figure 948787DEST_PATH_IMAGE147
The public key of the sponsor is only to the monitorThe management node and the consensus node are public, the account address written into the block is public and visible, and the account address not written into the block is not displayed in the network;
s6-2, third party credit organization in supervision organization
Figure 771250DEST_PATH_IMAGE148
To newly joined subsidized node
Figure 507124DEST_PATH_IMAGE076
Credit awarding score
Figure DEST_PATH_IMAGE149
(ii) a Supervision node
Figure 909287DEST_PATH_IMAGE113
Reading sponsoring nodes
Figure 781428DEST_PATH_IMAGE076
Certificate of subsidization of
Figure 509213DEST_PATH_IMAGE150
Recording the subsidy value of the node
Figure DEST_PATH_IMAGE151
According to the type of subsidizationtypeCalculating subsidized matching degree score
Figure 466804DEST_PATH_IMAGE152
；
S6-3, when entering into the voting time, the supervision node
Figure 938237DEST_PATH_IMAGE113
Calculating a composite score for the election node
Figure DEST_PATH_IMAGE153
(ii) a Wherein the content of the first and second substances,
Figure 399305DEST_PATH_IMAGE154
，
Figure DEST_PATH_IMAGE155
is to
Figure 32412DEST_PATH_IMAGE156
The result of the normalization processing is selected before the grade sorting
Figure 477300DEST_PATH_IMAGE143
The node of the bit acts as a consensus node;
s6-4, after the first group of consensus nodes are generated, the method is carried out
Figure DEST_PATH_IMAGE157
Within the time, the consensus nodes sequentially act as the main nodes according to the ranking; master nodeSPSubsidized transaction to be validated
Figure 218335DEST_PATH_IMAGE158
Packing the information into a block, generating
Figure DEST_PATH_IMAGE159
Sending the data to other slave nodes; the next node behind the main node is a secondary main node, and is packed with the main node at the same time, and blocks generated by the main node can be sent out when the main node has errors;
s6-5, and the rest slave nodes
Figure 65068DEST_PATH_IMAGE160
After receiving the pre-prepared message sent by the main node, verifying the signature, and if the verification is passed and the block uplink is approved, sending a confirmation message
Figure DEST_PATH_IMAGE161
Forwarding to other consensus nodes, and sending if overtime or disapproval
Figure 603497DEST_PATH_IMAGE162
；
S6-6, after each consensus node receives the preparation message, when the number of the received effective preparation messages is large
Figure DEST_PATH_IMAGE163
(maximum number of malicious nodes)
Figure 535681DEST_PATH_IMAGE164
) Calculate approval
Figure DEST_PATH_IMAGE165
And disfavor
Figure 552179DEST_PATH_IMAGE166
Determining the number of tickets in the acknowledgment message
Figure DEST_PATH_IMAGE167
Value, node broadcast acknowledgement informationConfirmWhen an acknowledgement message is received
Figure 253418DEST_PATH_IMAGE168
If so, executing the request;
Figure DEST_PATH_IMAGE169
；
s6-7, if the client receives
Figure 962748DEST_PATH_IMAGE170
If the responses are the same, the request initiated by the client side is proved to have the common consensus of the whole network, otherwise, the request needs to be sent again;
Figure 913387DEST_PATH_IMAGE171
is the number of system nodes, if the maximum number of malicious nodes allowed by the system
Figure 264734DEST_PATH_IMAGE164
Then, it requires
Figure 86059DEST_PATH_IMAGE172
；
S6-8, if the malicious node is found, updating the credit score
Figure DEST_PATH_IMAGE173
Wherein, in the step (A),
Figure 231870DEST_PATH_IMAGE174
and sending the credit to a third party credit facility
Figure 138646DEST_PATH_IMAGE148
(ii) a If it is finished
Figure DEST_PATH_IMAGE175
If the node is in the round of consensus, the credit score of the node is updated to be
Figure 759596DEST_PATH_IMAGE176
。
The invention has the beneficial effects that: 1. the method is different from the traditional subsidized public welfare mode, introduces the subsidizing type in the block subsidizing transaction of the method, adds the service subsidization, provides more subsidizing ways for the masses with more enthusiasm public welfare, fully exerts the enthusiasm of the subsidiaries and helps the subsidiaries more pertinently;
2. based on the scene classification subsidy mode, the consensus nodes are selected according to the subsidy matching degree, the credit value and other factors, so that each node is facilitated to participate in consensus, the influence of the credit value on the consensus is enhanced, the advantage that the node is easier to acquire the bookkeeping right due to multiple participation in the consensus is weakened, and the fair and justice of the consensus is facilitated;
3. based on the privacy protection of the sponsor and the sponsor, the sponsor and the sponsor can select to hide the personal real name information on the alliance chain through the optimized block chain structure so as to avoid being permanently recorded by the network and permanently concerned by the public; but can still ensure that the subsidizing and subsidized information is just public and transparent and traceable, and avoid public welfare disputes caused by false behaviors such as forged information or deception; on the premise of ensuring traceability, selecting whether real-name published rights are handed back to the user;
4. establishing a matrix alliance chain, and enabling a supervision node and a consensus node to quickly locate the position of a block to be modified in a transaction through coordinate information of the block on the chain and a down-chain index list, so that the improvement of block modification efficiency is facilitated;
5. an authoritative credit department, such as a Chinese people bank, a public security bureau or a payment treasure, is introduced to participate in supervision, endorsement authentication of dreams and dreams patrons is performed, credit scoring is granted to patrons, and when the patrons have distrust or malicious behaviors in a alliance chain, the credit is recorded in an integrity file of the real world at the same time, so that integrity of the patrons is facilitated to be used, and an effective credit feedback supervision mechanism is formed;
6. through a cryptographic method, any attacker cannot acquire real subsidy information or judge the real identity through the data operation of the dreams or the dreams, and the data privacy of the dreams and the dreams is protected.
Drawings
In order that the present invention may be more readily and clearly understood, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments that are illustrated in the appended drawings.
FIG. 1 is a diagram of a model of the system of the present invention;
FIG. 2 is a block structure diagram;
FIG. 3 is a diagram of a matrix federation chain structure;
fig. 4 is a flow chart of the present invention.
Detailed Description
The important terms and constraints of the present invention are as follows:
federation chain: the block chain is a block chain type data structure which is not counterfeitable, difficult to tamper and traceable and is constructed through transparent and credible rules under a peer-to-peer network environment, and the mode of generating, accessing and using credible data is realized and managed. A federation chain generally refers to a chain formed by multiple parties after multiple entities reach a certain agreement or after a service federation is established, and members joining the federation chain need to be verified. The generation of each block is determined by all preselected nodes in common (preselected nodes participate in the consensus process), other access nodes can participate in the transaction, but no billing process is asked, and anyone else can make a qualified query through the API opened by the blockchain.
Matrix federation chain: the method comprises the steps of constructing a transverse chain (dream chain) and a longitudinal chain (subsidizing chain) in the alliance chain, wherein the transverse chain takes the height of a dream block as a transverse coordinate, the longitudinal chain takes the depth of the subsidizing block as a longitudinal coordinate, the unique position of the block in the alliance chain can be located through the block coordinate, and the practical meaning of the coordinate is a certain subsidizing behavior for a dream of a dream. This type of federation chain and block is called a "matrix federation chain" because its representational form is similar to a matrix.
A hash function: the binary value string with any length is mapped into the binary value string with fixed length, and the mapping rule is the hash algorithm. And the binary value string obtained after mapping through the original data is the hash value.
Tree: the Merkle tree is a hashed binary tree, which is a data structure used for rapid generalization and checking of large-scale data integrity. Such a binary tree contains cryptographic hash values. The term "tree" is commonly used in computer science to describe a data structure with branches.
A consensus mechanism: the consensus mechanism is that the transaction is verified and confirmed in a short time through the voting of special nodes; if several nodes with irrelevant interests can achieve consensus on a transaction, the whole network can be considered to achieve consensus on the node.
Practical Byzantine fault-tolerant algorithm: PBFT, Practical Byzantine factory Tolerance. PBFT is a practical consensus mechanism for implementing byzantine fault tolerance, where one node in the system is treated as the master node, while the other nodes are all child nodes. All nodes in the system communicate with each other, and the final goal is to achieve the consensus of data by a few principles subject to majority; PBFT requires a total number of nodes of𝑛Can accommodate at most
Figure DEST_PATH_IMAGE177
The Byzantine node has wider application in a alliance chain.
The application scene of the invention can realize the children dream in the country, and the invention can help the country to be happy. The scheme described in the present invention includes the following four entities, as shown in fig. 1.
Dreams to family: the management system is characterized in that a receiver is referred, a country child with a dream in a country commonweal scene can complete real-name registration through the help of a parent teacher or other guardians, and the dream, the dream and all the subsidy information are identified and recorded on a alliance chain after the supervision organization endorsement is authenticated; after the dream is finished or when the dream no longer needs to be subsidized, the dreams can choose to hide the name information of the dreams.
The dream enlivenment person: refers to a person of interest, which may be an individual or a group; the dreams sponsor can check colorful dreams on a alliance chain after real-name registration and authentication by a supervisory organization, property subsidization or service subsidization is selected, dreams are realized by dreams, subsidizing information is recorded on the alliance chain, and then the dreams sponsor can select whether to hide personal real-name information on the alliance chain.
A supervision mechanism: the regulatory bodies are composed of government regulatory bodies, public welfare bodies and third-party credit bodies. The third party credit institution awards credit scores according to the credit record of the sponsor but does not participate in consensus when the sponsor is authenticated by the credit institution, and the credit record is recorded in the credit department credit record when the sponsor has a loss-of-credit behavior in the alliance chain.
The key generation center: and initializing common parameters, and generating and distributing keys and registration certificates for each member in the scheme.
The invention relates to a subsidizing method of a concealable real name based on a matrix alliance chain, a scheme model diagram is shown in figure 1, a specific flow is shown in figure 4, and the subsidizing method comprises the following steps:
s1, initializing a system, generating public parameters such as a security parameter, a system public key, an encryption and decryption algorithm, a secure hash function and the like, wherein participants are dreams (children in a poor country are Zhang Ming), dream sponsors (a finite company of an enterprise 'love class' focusing on online courses), supervision agencies (including a public welfare agency 'love core Seisakun', a local civil administration department, a third party credit agency (Chinese people bank credit center) and a Key Generation Center (KGC));
s1-1, each participant generates character string associated with own identity
Figure 435428DEST_PATH_IMAGE178
The character strings which are respectively generated by the supervisors and the credit investigation center of the cooperation of Zhang Ming, love classroom company, civil administration department and 'love research' and are associated with the identity information are respectively expressed as follows:
Figure DEST_PATH_IMAGE179
；
s1-2, inputting safety parameters
Figure 486560DEST_PATH_IMAGE018
Selecting addition cycle groups
Figure 880632DEST_PATH_IMAGE019
And multiplication loop group
Figure 839361DEST_PATH_IMAGE180
And is and
Figure DEST_PATH_IMAGE181
，
Figure 369700DEST_PATH_IMAGE022
is composed of
Figure 122892DEST_PATH_IMAGE018
The large prime number of bits is the number of bits,
Figure 269840DEST_PATH_IMAGE182
into a group
Figure 501101DEST_PATH_IMAGE019
And define such a bilinear map
Figure 151525DEST_PATH_IMAGE024
：
Figure DEST_PATH_IMAGE183
；
S1-3, KGC random selection random number
Figure 810039DEST_PATH_IMAGE026
As the system master key, and calculates its public key as
Figure 444283DEST_PATH_IMAGE184
(ii) a Defining 6 secure hash functions, which are respectively:
Figure 479235DEST_PATH_IMAGE028
and a pair of encryption and decryption algorithms
Figure DEST_PATH_IMAGE185
，
Figure 718587DEST_PATH_IMAGE186
Disclosure of system parameters
Figure 813582DEST_PATH_IMAGE031
And recording to the block chain; wherein, r represents a random number,
Figure 935121DEST_PATH_IMAGE032
display module
Figure 505255DEST_PATH_IMAGE033
The multiplicative group of the remaining class ring of (c),
Figure 130272DEST_PATH_IMAGE034
which represents the public key(s),
Figure DEST_PATH_IMAGE187
indicating indefinite length
Figure 130589DEST_PATH_IMAGE036
A string of bits is then transmitted through the bit string,
Figure 473846DEST_PATH_IMAGE037
to represent
Figure 116179DEST_PATH_IMAGE188
(ii) a Of a long bit length
Figure 861282DEST_PATH_IMAGE036
A bit string; (ii) a
S1-4, the key generation center provides the identity character string according to each participated user
Figure DEST_PATH_IMAGE189
Computing
Figure 766921DEST_PATH_IMAGE040
，
Figure 597473DEST_PATH_IMAGE190
，
Figure 512340DEST_PATH_IMAGE042
，
Figure DEST_PATH_IMAGE191
And an
Figure 846369DEST_PATH_IMAGE192
Wherein, in the step (A),
Figure 454068DEST_PATH_IMAGE045
is a public and private key pair of a user,
Figure 771917DEST_PATH_IMAGE046
for the user block chain public key address,
Figure DEST_PATH_IMAGE193
is the user's registration certificate, is generated by the private key signature of the key generation center,
Figure 959316DEST_PATH_IMAGE048
in order to be the registration number,
Figure 679010DEST_PATH_IMAGE194
is a universal hash function and then is transmitted through a secure channel
Figure 457610DEST_PATH_IMAGE050
And sending the data to the user.
S2, constructing a dream block to form a transverse chain (a dream chain) in the matrix union chain; zhang ming
Figure 262755DEST_PATH_IMAGE001
Submitting personal registration information to the alliance chain system, and information of dream and service subsidization needed for being an outreachMThe civil bureau and love chips are used as supervision nodes to check the authenticity of personal information and dream of Zhangming children, and after the verification is passed, Zhangming children are packagedIDBlock chain addressAddrThereby becoming the dream content of the external officermsgType of service funding requiredtypeThe information is used as the transaction information of dream
Figure 118011DEST_PATH_IMAGE003
And generating a copy of the transaction
Figure 426633DEST_PATH_IMAGE004
(containing no Zhang Ming)IDAnd a block chain addressAddr) Broadcasting, broadcasting
Figure DEST_PATH_IMAGE195
And copies
Figure 110555DEST_PATH_IMAGE004
According to the consensus mechanism, the consensus node verifies and writes the dream block, and the block structure is shown in FIG. 2. Light and dark double chains are connected between the dream blocks to form a dream chain as shown in figure 3.
The specific implementation steps of S2 are as follows:
s2-1 Zhang ming
Figure 137417DEST_PATH_IMAGE001
Packing personal registration information, dream content and type generation message of outreach
Figure 463356DEST_PATH_IMAGE196
And calculating the digital signature thereof
Figure 626484DEST_PATH_IMAGE052
Wherein, in the step (A),
Figure 746887DEST_PATH_IMAGE053
sending messages for current timestamps
Figure 526624DEST_PATH_IMAGE054
To a blockchain network;
s2-2, civil government office and love research formed supervision node
Figure DEST_PATH_IMAGE197
Reception of Zhang Ming
Figure 125096DEST_PATH_IMAGE001
Message
Figure 142730DEST_PATH_IMAGE056
Then, first, the current timestamp is selected
Figure 965193DEST_PATH_IMAGE057
Definition of
Figure 701068DEST_PATH_IMAGE198
Is the effective difference between the timestamp of the message and the timestamp of the received message, if
Figure DEST_PATH_IMAGE199
If the message is valid, otherwise, the dialog is terminated, and then the following formula is calculated to verify the correctness of the message:
Figure 837651DEST_PATH_IMAGE060
；
if the above formula is established, receiving the message, verifying that the dream content and type of the person to be helped are correct, and returning confirmation information;
s2-3, supervision node
Figure 975371DEST_PATH_IMAGE200
Packing Zhangming according to trading format of dream block
Figure 968735DEST_PATH_IMAGE001
Submitted information
Figure 926327DEST_PATH_IMAGE003
And generating a copy of the transaction
Figure 663338DEST_PATH_IMAGE004
The following are:
Figure DEST_PATH_IMAGE201
Figure 121477DEST_PATH_IMAGE202
；
wherein the content of the first and second substances,
Figure 20163DEST_PATH_IMAGE005
containing personal truth information
Figure 730630DEST_PATH_IMAGE001
And
Figure DEST_PATH_IMAGE203
，
Figure 474595DEST_PATH_IMAGE004
to trade a copy, not including both strings,
Figure 321328DEST_PATH_IMAGE204
is the signature of the supervising node on the transaction,
Figure 656495DEST_PATH_IMAGE065
the time is generated for the transaction,
Figure 588679DEST_PATH_IMAGE066
the label is a label of the dream block chain and is used for positioning block coordinates and a transaction position when the block chain is edited subsequently;
S2-4、supervision node
Figure 401914DEST_PATH_IMAGE200
Broadcast transactions
Figure 634312DEST_PATH_IMAGE005
And copies of transactions
Figure 609221DEST_PATH_IMAGE004
According to the consensus mechanism, the consensus node verifies the transaction and the copy thereof, and the verification is carried out according to the result
Figure 559860DEST_PATH_IMAGE066
The label is written into the dream block and an index list is established
Figure 911207DEST_PATH_IMAGE067
Saved as down-link data to a local database, wherein
Figure 998111DEST_PATH_IMAGE068
The height of the block is used for fast positioning of the process of generating the subsidized chain, and two merkleroots are stored in the data structure of the block and are respectively
Figure DEST_PATH_IMAGE205
、
Figure 612764DEST_PATH_IMAGE206
Correspondingly, the block header will store two hash values of the previous block, and the blocks are linked by the light chain and the dark chain, so as to ensure that the block chain structure is not damaged when modifying the contents of the block chain, that is:
Figure DEST_PATH_IMAGE207
；
wherein the content of the first and second substances,
Figure 253960DEST_PATH_IMAGE072
which represents the current block of the video stream,
Figure 406069DEST_PATH_IMAGE073
two hash values representing the previous block,
Figure 81901DEST_PATH_IMAGE074
a random number representing the current block is generated,
Figure 929771DEST_PATH_IMAGE075
representing the generation timestamp of the block.
S3, constructing a subsidy block to form a vertical chain (subsidy chain) in the matrix alliance chain; love course company
Figure 323843DEST_PATH_IMAGE076
Zhang Ming
Figure 282572DEST_PATH_IMAGE001
Obtaining subsidy certification after subsidizing online English course free of charge
Figure 78489DEST_PATH_IMAGE007
The certificate is issued and endorsed by the civil bureau and the love chips together, and then the supervision node broadcasts the transaction
Figure 97261DEST_PATH_IMAGE208
And transactional copies thereof
Figure 713050DEST_PATH_IMAGE089
The transaction content includes course and its associated information, certificate and type, the copy does not contain course enterprise information, the consensus node verifies the subsidized transaction according to the consensus mechanism, after the verification is passed, the subsidized transaction and its copy are stored in the transaction pool, after a period of time, the main consensus node verifies the subsidized transaction and its copy according to the declared informationIDAnd the subsidized types are packaged into blocks, broadcast to the block chain network, verify the correctness of the blocks from the consensus nodes and vote that the number of tickets exceeds the threshold value
Figure 209891DEST_PATH_IMAGE012
And finally, chaining is carried out. For all assets of Zhang MingThe subsidized blocks are recorded on the subsidized chain linked to the expanded dream blocks, the structure of the subsidized blocks is shown in FIG. 2, and the structure of the subsidized chain is shown in FIG. 3.
The specific implementation steps of S3 are as follows:
s3-1, Aijie course Co
Figure 125894DEST_PATH_IMAGE076
Complete the explanation of the invention
Figure 49988DEST_PATH_IMAGE001
The block chain address of the user uses the account password of the English course resource for free to generate the subsidy information
Figure DEST_PATH_IMAGE209
，
To supervisory node
Figure 153073DEST_PATH_IMAGE055
Sending a generate funding certificate request
Figure 188025DEST_PATH_IMAGE210
，
Wherein the content of the first and second substances,
Figure 958535DEST_PATH_IMAGE079
the presentation of the sponsored content is performed,
Figure 53530DEST_PATH_IMAGE080
representing an encryption algorithm, the supervisory node executing a decryption algorithm upon receipt of a request
Figure 909490DEST_PATH_IMAGE081
To obtain
Figure 748133DEST_PATH_IMAGE082
If and subsidizing the message
Figure 373150DEST_PATH_IMAGE083
Is directly formed by
Figure 904625DEST_PATH_IMAGE084
Calculated value
Figure 979373DEST_PATH_IMAGE085
If they are equal, the request is confirmed to be received and the certificate of subsidy is issued
Figure 356128DEST_PATH_IMAGE086
Wherein
Figure 101230DEST_PATH_IMAGE087
Generating time for the certificate and endorsing; (ii) a
S3-2 supervisory node
Figure 538027DEST_PATH_IMAGE055
Generating transactions according to the transaction format of the funded block
Figure 368580DEST_PATH_IMAGE088
And copies of transactions
Figure DEST_PATH_IMAGE211
And broadcast to the whole network, verified by the consensus node according to the consensus mechanism, and in addition, the supervision node
Figure 283447DEST_PATH_IMAGE055
Also needs to provide Zhang Ming
Figure 883055DEST_PATH_IMAGE001
Related information of
Figure 490754DEST_PATH_IMAGE090
For block positioning;
Figure 543024DEST_PATH_IMAGE091
wherein the content of the first and second substances,
Figure 527160DEST_PATH_IMAGE092
transaction copy
Figure 246854DEST_PATH_IMAGE089
Enterprise related information without including love course
Figure 25455DEST_PATH_IMAGE076
，
Figure 565020DEST_PATH_IMAGE093
，
Figure 87269DEST_PATH_IMAGE094
Representing the supervisory node's signature on the transaction,
Figure 395890DEST_PATH_IMAGE212
the public key of the love course is used for encrypting the corresponding certificate, the public key is used for decrypting the love course after receiving the love course by the private key of the love course to obtain the subsidized certificate,
Figure 610971DEST_PATH_IMAGE096
representing a transaction generation time;
s3-3 transaction
Figure DEST_PATH_IMAGE213
And copies of transactions
Figure 372253DEST_PATH_IMAGE214
After the verification is passed, the main consensus node will trade according to the consensus mechanism
Figure 432613DEST_PATH_IMAGE088
And copies of transactions
Figure 126900DEST_PATH_IMAGE089
Is deposited into a transaction pool and then will
Figure 244373DEST_PATH_IMAGE097
Aim at Zhang Ming in time
Figure 492952DEST_PATH_IMAGE001
Of (2)The transaction assistance is packaged into blocks and broadcast to a block chain network, the blocks are verified from a consensus node, and a vote exceeds a threshold
Figure 622582DEST_PATH_IMAGE012
Then, calculate the index
Figure 905796DEST_PATH_IMAGE098
Positioning
Figure 462679DEST_PATH_IMAGE001
Height of the blockheightLinking the block to a corresponding subsidized chain, the height of which is defined asdepthBlock coordinates of a transaction in the matrix federation chain: (height, depth) (ii) a Similarly, there are two merkleroot values in the block data structure of the grant chain, which are respectively
Figure 198554DEST_PATH_IMAGE099
And
Figure 866295DEST_PATH_IMAGE100
and two hash values of the previous block, and the blocks are linked by a light chain and a dark chain.
S4 course of love
Figure 4016DEST_PATH_IMAGE076
When anonymous is wanted and self subsidization information is not disclosed to the outside, the course sends a transaction modification request, the request content comprises the related information of the enterprise, the coordinates of the block where the enterprise is located, and a supervision node
Figure 731800DEST_PATH_IMAGE002
After receiving the request, quickly positioning the coordinates of the block where the transaction is located
Figure DEST_PATH_IMAGE215
After the identity of the love course is checked, a pseudo identity is generated for the love course
Figure 689392DEST_PATH_IMAGE014
And issue newSubsidized certificate
Figure 160825DEST_PATH_IMAGE216
(ii) a Supervising the node according to the consensus mechanism
Figure 418631DEST_PATH_IMAGE002
Broadcasting new transaction (including information such as false identity and new certificate of sponsor) and providing coordinates of block where transaction to be modified is located
Figure DEST_PATH_IMAGE217
Modifying the transaction by the consensus node, wherein the block is
Figure 520579DEST_PATH_IMAGE218
Is changed, and
Figure 496625DEST_PATH_IMAGE126
the hidden link of the subsidized link still exists, so that the integrity of the matrix alliance link structure is ensured; similarly, if the anonymous love course wants to be named after another time, only the real identity information and the old subsidy certificate need to be provided, and the clear link repair of the subsidy link can be completed through similar steps, so that a traceable and accountable mechanism after the real name is hidden is realized.
The specific implementation steps of S4 are as follows:
s4-1 course for love
Figure 506169DEST_PATH_IMAGE076
Initiating an anonymous modification request
Figure 618482DEST_PATH_IMAGE101
Wherein
Figure 688069DEST_PATH_IMAGE102
In order to modify the coordinates of the block where the transaction is located,
Figure 885832DEST_PATH_IMAGE103
in order to be able to use the encryption algorithm,
Figure 696138DEST_PATH_IMAGE104
a certificate of subsidy is represented and,
Figure 397377DEST_PATH_IMAGE105
is the current timestamp;
s4-2, supervision node
Figure 903445DEST_PATH_IMAGE055
Receive to
Figure 322925DEST_PATH_IMAGE106
First, select the current timestamp
Figure 939851DEST_PATH_IMAGE107
If, if
Figure 761177DEST_PATH_IMAGE108
The message is valid, according to
Figure 172567DEST_PATH_IMAGE076
Query local database to obtain
Figure 344922DEST_PATH_IMAGE109
Executing a decryption algorithm
Figure 499960DEST_PATH_IMAGE110
，
If it is
Figure 175792DEST_PATH_IMAGE111
If true, it indicates love course
Figure 23662DEST_PATH_IMAGE112
The message is correct for a legal user;
s4-3, after the message passes the verification, the supervision node
Figure 417734DEST_PATH_IMAGE113
Course for love
Figure 376463DEST_PATH_IMAGE114
Generating a pseudo-identity
Figure 172381DEST_PATH_IMAGE115
And issue a new certificate of subsidy
Figure 659994DEST_PATH_IMAGE116
Endorse in parallel, then supervise the node
Figure 806941DEST_PATH_IMAGE113
Generating new transaction data
Figure 303782DEST_PATH_IMAGE117
，
Wherein
Figure 219785DEST_PATH_IMAGE118
Wherein
Figure 143879DEST_PATH_IMAGE119
Which represents the time at which the transaction was generated,
Figure 244034DEST_PATH_IMAGE120
a digital signature is represented for the transaction,
Figure 544566DEST_PATH_IMAGE121
represents a chain tag; furthermore, a supervisory node
Figure 315076DEST_PATH_IMAGE113
The coordinate of the block where the transaction to be modified is located is also provided to the consensus node
Figure 410071DEST_PATH_IMAGE122
And modifying the identity information of the request originator
Figure 266031DEST_PATH_IMAGE114
；
S4-4, identifying the node pair for transaction according to the identification mechanism
Figure 104674DEST_PATH_IMAGE123
After the verification is passed, according to
Figure 995270DEST_PATH_IMAGE124
And
Figure 261166DEST_PATH_IMAGE114
quickly inquiring the transaction to be modified and then sending the transaction to be modified
Figure 604423DEST_PATH_IMAGE088
Is replaced by
Figure 981177DEST_PATH_IMAGE123
Recalculating the value of merkleroot
Figure 460700DEST_PATH_IMAGE125
At this time, the bright chain between the block and the subsequent block is broken due to the change in the value of merkleroot, and
Figure 163077DEST_PATH_IMAGE126
the value of (d) remains unchanged, so the dark chain maintains the integrity of the subsidized chain; if it is
Figure 728051DEST_PATH_IMAGE126
If the block is also changed, the block is indicated to be subjected to unauthorized tampering;
s4-5 similarly, if love course
Figure 174075DEST_PATH_IMAGE114
The supervision node sends a modification request to want to be named again
Figure 508105DEST_PATH_IMAGE113
Related endorsement content can be obtained by searching a local database, and after the identity is checked, steps S4-1 to S4-3 are carried out to complete real name modification; when the information is subjected to false information or public welfare disputes, the information can still be checked, and traceability and accountability are ensured.
S5 Bengzhang
Figure 115804DEST_PATH_IMAGE001
When the dream is finished or the user no longer needs to fund, the user firstly initiates a deletion request when the user wants to cancel the dream release record, the request content comprises personal information and the height of the dream chain where the personal information is located, and a monitoring node
Figure 433652DEST_PATH_IMAGE113
After receiving the request, the chain inquires the well-known transaction data, verifies the personal information, initiates a deletion transaction, and modifies the dream block after passing through the common identification node verification according to the common identification mechanism.
The specific implementation steps of S5 are as follows:
s5-1 Zhang ming
Figure 417789DEST_PATH_IMAGE001
Initiating a delete request
Figure 871904DEST_PATH_IMAGE127
Wherein
Figure 650504DEST_PATH_IMAGE128
The height of the dream block is the height of the dream block,
Figure 455649DEST_PATH_IMAGE129
a timestamp of the current request;
s5-2, supervision node
Figure 974968DEST_PATH_IMAGE113
Reception of Zhang Ming
Figure 283589DEST_PATH_IMAGE001
After the sent deleting request, the current time is selected first
Figure 498670DEST_PATH_IMAGE130
If, if
Figure 525532DEST_PATH_IMAGE131
If the request is valid, then uplink inquiryObtaining transaction data
Figure 585892DEST_PATH_IMAGE132
，
Computing
Figure 14599DEST_PATH_IMAGE133
If, if
Figure 400581DEST_PATH_IMAGE134
If yes, the identity of the person to be helped is credible; otherwise, the person is illegal or
Figure 649160DEST_PATH_IMAGE135
If the value is subject to unauthorized tampering, the session is terminated;
s5-3, Benzhangming
Figure 778790DEST_PATH_IMAGE001
When the identity verification passes, the node is supervised
Figure 62004DEST_PATH_IMAGE113
Generating new transaction data
Figure 618887DEST_PATH_IMAGE136
Broadcasting, and providing the height of the block to be modified
Figure 354762DEST_PATH_IMAGE137
；
S5-4, according to the consensus mechanism, after the consensus node is verified, the block to be modified is deleted, specifically, the original block is deleted
Figure 288083DEST_PATH_IMAGE138
Is replaced by
Figure 425803DEST_PATH_IMAGE139
And recalculated
Figure 888008DEST_PATH_IMAGE140
Due to this value change, for the dream chain, the latter block
Figure DEST_PATH_IMAGE219
Current block stored therein
Figure 845600DEST_PATH_IMAGE220
The first hash value is changed, and the second hash value is kept unchanged, so that the structure of the dream chain is kept complete; similarly, for the subsidy chain, the second hash value stored in the first subsidy block is unchanged, and the structure of the subsidy block is complete; because the transaction content on the subsidized chain does not contain the Zhang Ming
Figure 51453DEST_PATH_IMAGE001
The corresponding subsidy certificate is encrypted, only the subsidy node with the corresponding private key can see the corresponding subsidy certificate, and other nodes can not inquire the declaration
Figure 309259DEST_PATH_IMAGE001
The related information of (2).
S6, implementing Practical Byzantine factory based on multifactor voting (MV-PBFT). The consensus node calculates the subsidized matching degree through synthesisSDSubsidy limitSADream patron credit ratingCSThree-factor voting before rank selection
Figure 228453DEST_PATH_IMAGE143
The consensus node of the bit participates in consensus, each time
Figure 938920DEST_PATH_IMAGE221
And (5) when the hour changes, reorganizing the election voting. Get without loss of generality
Figure DEST_PATH_IMAGE222
。
The consensus mechanism in the invention is a practical Byzantine fault-tolerant mechanism based on multi-factor voting, and the consensus nodes are sponsors and acceptorsHelping people; the common knowledge of the common knowledge node is obtained when the transaction is issued or modified on the chain, and the common knowledge node calculates the matching degree through synthesisSDSubsidy limitSACredit rating of the sponsorCSThree-factor voting before rank selection
Figure 417306DEST_PATH_IMAGE143
The consensus node of the bit participates in consensus, each time
Figure 795198DEST_PATH_IMAGE144
And (5) when the hour changes, reorganizing the election voting.
According to the consensus mechanism, the step of verifying the consensus node is that
The specific implementation steps of S6 are as follows:
s6-1, when the matrix alliance chain is cold-started, the supervising node
Figure 599206DEST_PATH_IMAGE113
Writing the subsidized transaction information into the founding block; the key generation center KGC distributes independent block chain addresses to each node
Figure 62548DEST_PATH_IMAGE145
Private key
Figure 610204DEST_PATH_IMAGE146
And public key
Figure 577023DEST_PATH_IMAGE147
The public key of the dream sponsor is only disclosed to the supervision node and the consensus node, the account address written into the block is publicly visible, and the account address not written into the block is not displayed in the network;
s6-2, third party credit agency
Figure 83091DEST_PATH_IMAGE148
For newly-added love course company
Figure 502571DEST_PATH_IMAGE076
Credit awarding score
Figure 119497DEST_PATH_IMAGE149
(percentile), read love course company
Figure 940822DEST_PATH_IMAGE076
Certificate of subsidization of
Figure 352212DEST_PATH_IMAGE223
Recording the subsidy value of the online course resource provided by the online course resource according to the market price
Figure 524567DEST_PATH_IMAGE151
(in thousand yuan), calculate subsidized matching score
Figure 414026DEST_PATH_IMAGE152
If the subsidizing type of the subsidizing node is consistent with the type required by the dreams, then
Figure DEST_PATH_IMAGE224
And on the contrary,
Figure 89858DEST_PATH_IMAGE225
at this time, the subsidized matching degree of love courses is 1;
s6-3, when entering into the voting time, the supervision node
Figure 672149DEST_PATH_IMAGE113
Calculating the comprehensive score of the election node without loss of generality
Figure DEST_PATH_IMAGE226
，
Wherein the content of the first and second substances,
Figure 532133DEST_PATH_IMAGE227
before selecting scores to rank
Figure DEST_PATH_IMAGE228
The node of the bit acts as a consensus node;
s6-4, after the first group of consensus nodes are generated, the method is carried out
Figure 694124DEST_PATH_IMAGE157
Within the time, the consensus nodes sequentially act as the main nodes according to the ranking; master nodeSPSubsidized transaction to be validated
Figure 490042DEST_PATH_IMAGE158
Packing the information into a block, generating
Figure 243234DEST_PATH_IMAGE159
Sending the data to other slave nodes; the next node behind the main node is a secondary main node, and is packed with the main node at the same time, and blocks generated by the main node can be sent out when the main node has errors;
s6-5, and the rest slave nodes
Figure 124603DEST_PATH_IMAGE160
After receiving the pre-prepared message sent by the main node, verifying the signature, and if the verification is passed and the block uplink is approved, sending a confirmation message
Figure 887022DEST_PATH_IMAGE161
Forwarding to other consensus nodes, and sending if overtime or disapproval
Figure 537446DEST_PATH_IMAGE162
；
S6-6, after each consensus node receives the preparation message, when the number of the received effective preparation messages is large
Figure 195961DEST_PATH_IMAGE163
(maximum number of malicious nodes)
Figure 830205DEST_PATH_IMAGE164
) Calculate approval
Figure 865157DEST_PATH_IMAGE165
And disfavor
Figure 635667DEST_PATH_IMAGE166
Determining the number of tickets in the acknowledgment message
Figure 465082DEST_PATH_IMAGE167
Value, node broadcast acknowledgement informationConfirmWhen an acknowledgement message is received
Figure 586622DEST_PATH_IMAGE168
If so, executing the request;
Figure 425265DEST_PATH_IMAGE169
；
s6-7, if the client receives
Figure 50281DEST_PATH_IMAGE170
If the responses are the same, the request initiated by the client side is proved to have the common consensus of the whole network, otherwise, the request needs to be sent again;
Figure 316178DEST_PATH_IMAGE171
is the number of system nodes, if the maximum number of malicious nodes allowed by the system
Figure 393855DEST_PATH_IMAGE164
Then, it requires
Figure 301768DEST_PATH_IMAGE172
；
S6-8, if the malicious node is found, updating the credit score
Figure 778361DEST_PATH_IMAGE173
Wherein, in the step (A),
Figure 480738DEST_PATH_IMAGE174
and sending the credit to a third party credit facility
Figure 45712DEST_PATH_IMAGE148
(ii) a If finished
Figure 226157DEST_PATH_IMAGE175
The wheel is in common knowledge,then the credit score of the node is updated to
Figure 825766DEST_PATH_IMAGE176
。
The above description is only a preferred embodiment of the present invention, and is not intended to limit the present invention, and all equivalent variations made by using the contents of the present specification and the drawings are within the protection scope of the present invention.

Claims (8)

1. A subsidizing method of a concealable real name based on a matrix alliance chain is characterized in that the steps of the method are as follows,
s1, initializing a alliance chain system to generate public parameters, wherein participants of the alliance chain comprise a person to be helped, a supervision mechanism and a key generation center;
s2, constructing a dream block to form a transverse chain in the matrix union chain; person to be helped
Figure 676537DEST_PATH_IMAGE001
Submitting application and subsidization information to the alliance chain system, and supervising the node
Figure 728807DEST_PATH_IMAGE002
The application and the subsidy information are audited and verified, and the dreamy transaction information issued by the subsidee is packaged
Figure 181785DEST_PATH_IMAGE003
And generating a copy of the transaction
Figure 901479DEST_PATH_IMAGE004
The supervisory node broadcasts transaction information
Figure 680080DEST_PATH_IMAGE005
And transaction copies
Figure 219645DEST_PATH_IMAGE004
The consensus node compares the transaction information according to a consensus mechanism
Figure 741894DEST_PATH_IMAGE003
And transaction copies
Figure 784936DEST_PATH_IMAGE004
Performing verification and sending the verified transaction information
Figure 734437DEST_PATH_IMAGE005
And transaction copies
Figure 495720DEST_PATH_IMAGE004
Writing a dream block;
s3, constructing a subsidy block to form a vertical chain in the matrix alliance chain; help people
Figure 87238DEST_PATH_IMAGE006
Finish the person who is helped
Figure 250366DEST_PATH_IMAGE001
After the subsidization, acquiring the subsidized certificate issued and endorsed by the supervision node
Figure 370769DEST_PATH_IMAGE007
Supervision node broadcasts subsidized transactions
Figure 881997DEST_PATH_IMAGE008
And transactional copies thereof
Figure 746048DEST_PATH_IMAGE009
The consensus node proceeds with the subsidized transaction according to the consensus mechanism
Figure 763683DEST_PATH_IMAGE010
And transactional copies thereof
Figure 586145DEST_PATH_IMAGE011
Performing verification and verifying the dataFacilitating transactions
Figure 322020DEST_PATH_IMAGE008
And transactional copies thereof
Figure 989762DEST_PATH_IMAGE011
Storing the data into a transaction pool; the main consensus node will be the person under investigationIDAnd the subsidized types are packaged into blocks, broadcast to the block chain network, verify the correctness of the blocks from the consensus nodes and vote that the number of tickets exceeds the threshold value
Figure 861903DEST_PATH_IMAGE012
The chain can be wound;
s4 qualified person
Figure 855267DEST_PATH_IMAGE006
When the subsidy information is wanted to be hidden, the subsidy person sends out a transaction modification request to supervise the node
Figure 78438DEST_PATH_IMAGE002
After receiving the request, quickly positioning the coordinates of the block where the transaction is located
Figure 549870DEST_PATH_IMAGE013
After verifying the identity of the sponsor, a pseudo-identity is generated for the sponsor
Figure 542097DEST_PATH_IMAGE014
And issuing a new certificate of subsidy
Figure 440783DEST_PATH_IMAGE015
After the verification of the consensus node is passed, modifying the transaction information on the link to hide the real name according to the consensus mechanism through the whole network broadcasting; after the real name is hidden, the sponsor can still apply for recovering the real name information from the supervision node for tracing and checking;
s5 qualified person
Figure 885671DEST_PATH_IMAGE001
When wanting to hide the subsidized information, the person to be subsidized
Figure 160794DEST_PATH_IMAGE001
After receiving the subsidization, initiating a request for deleting the subsidization release, and supervising the node
Figure 273107DEST_PATH_IMAGE002
After receiving the request, the uplink inquires the transaction data of the person to be helped, and after verifying the information of the person to be helped, the supervisory node
Figure 342694DEST_PATH_IMAGE002
And initiating a deletion transaction, and modifying the dream block after the consensus node verifies according to the consensus mechanism.
2. The subsidizing method of concealable real names based on the matrix federation chain as claimed in claim 1, wherein the specific steps of S1 are:
s1-1, each participating user generates character string associated with own identity
Figure 540457DEST_PATH_IMAGE016
The character strings generated by the sponsor, the supervising authority and the key generation center and associated with the identity information are respectively expressed as:
Figure 353692DEST_PATH_IMAGE017
s1-2, inputting safety parameters
Figure 320511DEST_PATH_IMAGE018
Selecting addition cycle groups
Figure 292491DEST_PATH_IMAGE019
And multiplication loop group
Figure 243129DEST_PATH_IMAGE020
And is and
Figure 594476DEST_PATH_IMAGE021
，
Figure 681381DEST_PATH_IMAGE022
is composed of
Figure 92771DEST_PATH_IMAGE018
The large prime number of bits is the number of bits,
Figure 265126DEST_PATH_IMAGE023
into a group
Figure 154585DEST_PATH_IMAGE019
And define such a bilinear map
Figure 95996DEST_PATH_IMAGE024
：
Figure 678287DEST_PATH_IMAGE025
；
S1-3, selecting random number at random by key generation center
Figure 72359DEST_PATH_IMAGE026
As the system master key, and calculates its public key as
Figure 31088DEST_PATH_IMAGE027
Defining 6 secure hash functions, which are respectively:
Figure 827006DEST_PATH_IMAGE028
and a pair of encryption and decryption algorithms
Figure 845777DEST_PATH_IMAGE029
，
Figure 727145DEST_PATH_IMAGE030
Disclosure of system parameters
Figure 958407DEST_PATH_IMAGE031
And is recorded on the block chain,
Figure 874410DEST_PATH_IMAGE032
display module
Figure 798504DEST_PATH_IMAGE033
The multiplicative group of the remaining class ring of (c),
Figure 432747DEST_PATH_IMAGE034
which represents the public key(s),
Figure 467700DEST_PATH_IMAGE035
indicating indefinite length
Figure 972630DEST_PATH_IMAGE036
A string of bits is then transmitted through the bit string,
Figure 64695DEST_PATH_IMAGE037
to represent
Figure 186235DEST_PATH_IMAGE038
(ii) a Of a long bit length
Figure 759299DEST_PATH_IMAGE036
A bit string;
s1-4, the key generation center provides the identity character string according to each participated user
Figure 384315DEST_PATH_IMAGE039
Computing
Figure 650212DEST_PATH_IMAGE040
，
Figure 727889DEST_PATH_IMAGE041
，
Figure 635802DEST_PATH_IMAGE042
，
Figure 115325DEST_PATH_IMAGE043
And an
Figure 817702DEST_PATH_IMAGE044
Wherein, in the step (A),
Figure 382675DEST_PATH_IMAGE045
is a public and private key pair of a user,
Figure 297542DEST_PATH_IMAGE046
for the user block chain public key address,
Figure 162730DEST_PATH_IMAGE047
is the user's registration certificate, is generated by the private key signature of the key generation center,
Figure 770429DEST_PATH_IMAGE048
in order to be the registration number,
Figure 88277DEST_PATH_IMAGE049
is a universal hash function and then is transmitted through a secure channel
Figure 806835DEST_PATH_IMAGE050
And sending the data to the user.
3. The subsidizing method of concealable real names based on the matrix federation chain as claimed in claim 1, wherein the specific content of S2 is:
s2-1, the person of interest
Figure 260950DEST_PATH_IMAGE051
Packaging personal registration information, dream content and type generating messages
Figure 305129DEST_PATH_IMAGE052
And calculating the digital signature thereof
Figure 844695DEST_PATH_IMAGE053
Wherein, in the step (A),
Figure 632522DEST_PATH_IMAGE054
sending messages for current timestamps
Figure 961652DEST_PATH_IMAGE055
To a blockchain network;
s2-2, supervision node
Figure 911153DEST_PATH_IMAGE056
Receiving the person to be helped
Figure 938015DEST_PATH_IMAGE051
Message
Figure 263954DEST_PATH_IMAGE057
Then, first, the current timestamp is selected
Figure 692661DEST_PATH_IMAGE058
Definition of
Figure 813064DEST_PATH_IMAGE059
Is the effective difference between the timestamp of the message and the timestamp of the received message, if
Figure 327222DEST_PATH_IMAGE060
If the message is valid, otherwise, the dialog is terminated, and then the following formula is calculated to verify the correctness of the message:
Figure 456852DEST_PATH_IMAGE061
；
if the above formula is established, receiving the message, verifying that the dream content and type of the person to be helped are correct, and returning confirmation information;
s2-3, supervision node
Figure 474487DEST_PATH_IMAGE062
Packing the patrons according to the trading format of the dream blocks
Figure 31370DEST_PATH_IMAGE001
Submitted information and generating a transaction copy, as follows:
Figure 32824DEST_PATH_IMAGE063
Figure 434987DEST_PATH_IMAGE064
；
wherein the content of the first and second substances,
Figure 838286DEST_PATH_IMAGE065
containing personal real information of a sponsor
Figure 566071DEST_PATH_IMAGE001
And
Figure 523662DEST_PATH_IMAGE066
，
Figure 260674DEST_PATH_IMAGE004
to trade a copy, not including both strings,
Figure 252901DEST_PATH_IMAGE067
is a label for supervising node to dealThe name of the person to be named,
Figure 151587DEST_PATH_IMAGE068
the time is generated for the transaction,
Figure 862054DEST_PATH_IMAGE069
the label is a label of the dream block chain and is used for positioning block coordinates and a transaction position when the block chain is edited subsequently;
s2-4, supervision node
Figure 137177DEST_PATH_IMAGE062
Broadcasting the transaction and the transaction copy, verifying the transaction and the transaction copy by the consensus node according to the consensus mechanism, and verifying the transaction and the transaction copy according to the consensus mechanism after the verification is passed
Figure 980981DEST_PATH_IMAGE069
The label is written into the dream block and an index list is established
Figure 50568DEST_PATH_IMAGE070
Saved as down-link data to a local database, wherein
Figure 248331DEST_PATH_IMAGE071
The height of the block is used for fast positioning of the process of generating the subsidized chain, and two merkleroots are stored in the data structure of the block and are respectively
Figure 61567DEST_PATH_IMAGE072
、
Figure 28386DEST_PATH_IMAGE073
Correspondingly, the block header will store two hash values of the previous block, and the blocks are linked by the light chain and the dark chain, so as to ensure that the block chain structure is not damaged when modifying the contents of the block chain, that is:
Figure 268874DEST_PATH_IMAGE074
wherein the content of the first and second substances,
Figure 953933DEST_PATH_IMAGE075
which represents the current block of the video stream,
Figure 570859DEST_PATH_IMAGE076
two hash values representing the previous block,
Figure 392185DEST_PATH_IMAGE077
a random number representing the current block is generated,
Figure 537995DEST_PATH_IMAGE078
representing the generation timestamp of the block.
4. The subsidizing method of concealable real names based on the matrix federation chain as claimed in claim 1, wherein the specific steps of S3 are:
s3-1, sponsor
Figure 710351DEST_PATH_IMAGE006
Finish the person who is helped
Figure 865389DEST_PATH_IMAGE001
Funds transfer or service to a blockchain address of the mobile station, generating subsidy information
Figure 541221DEST_PATH_IMAGE079
To supervision node
Figure 389091DEST_PATH_IMAGE056
Sending a generate funding certificate request
Figure 783163DEST_PATH_IMAGE080
，
Wherein the content of the first and second substances,
Figure 476313DEST_PATH_IMAGE081
the presentation of the sponsored content is performed,
Figure 537810DEST_PATH_IMAGE082
representing an encryption algorithm, the supervisory node executing a decryption algorithm upon receipt of a request
Figure 291002DEST_PATH_IMAGE083
To obtain
Figure 172370DEST_PATH_IMAGE084
If and subsidizing the message
Figure 669211DEST_PATH_IMAGE085
Is directly formed by
Figure 316705DEST_PATH_IMAGE086
Calculated value
Figure 506378DEST_PATH_IMAGE087
If they are equal, the request is confirmed to be received and the certificate of subsidy is issued
Figure 875042DEST_PATH_IMAGE088
Wherein
Figure 909995DEST_PATH_IMAGE089
Generating time for the certificate and endorsing;
s3-2, supervision node
Figure 680505DEST_PATH_IMAGE056
Generating transactions according to the transaction format of the funded block
Figure 775499DEST_PATH_IMAGE090
And copies of transactions
Figure 631460DEST_PATH_IMAGE091
And broadcast to the whole network, verified by the consensus node according to the consensus mechanism, and in addition, the supervision node
Figure 470103DEST_PATH_IMAGE056
And also provide subsidized objects
Figure 95119DEST_PATH_IMAGE001
Related information of
Figure 626595DEST_PATH_IMAGE092
For block positioning;
Figure 704272DEST_PATH_IMAGE093
wherein the content of the first and second substances,
Figure 346606DEST_PATH_IMAGE094
transaction copy
Figure 826129DEST_PATH_IMAGE095
Does not include the personal related information of the sponsor
Figure 262927DEST_PATH_IMAGE006
，
Figure 93479DEST_PATH_IMAGE096
，
Figure 273925DEST_PATH_IMAGE097
Representing the supervisory node's signature on the transaction,
Figure 139113DEST_PATH_IMAGE098
means that the sponsor's public key is used to encrypt the corresponding certificate, and the certificate is used for receiving the certificate and then decrypting the certificate with the own private key to obtain the sponsorship certificate,
Figure 746812DEST_PATH_IMAGE099
representing a transaction generation time;
s3-3, after the transaction and the copy verification are passed, the main consensus node will trade according to the consensus mechanism
Figure 533502DEST_PATH_IMAGE090
And copies
Figure 783218DEST_PATH_IMAGE095
Is deposited into a transaction pool and then will
Figure 234403DEST_PATH_IMAGE100
To the same person under charge within a period of time
Figure 13003DEST_PATH_IMAGE001
The subsidized transactions are packaged into blocks and broadcast to a network of block chains, the blocks are verified from consensus nodes, and votes are cast over a threshold
Figure 552569DEST_PATH_IMAGE012
Then, calculate the index
Figure 74817DEST_PATH_IMAGE101
Positioning
Figure 649018DEST_PATH_IMAGE001
Height of the blockheightLinking the block to a corresponding subsidized chain, the height of which is defined asdepthBlock coordinates of a transaction in the matrix federation chain: (height, depth) (ii) a Similarly, there are two merkleroot values in the block data structure of the grant chain, which are respectively
Figure 598520DEST_PATH_IMAGE102
And
Figure 890961DEST_PATH_IMAGE103
and the previous oneTwo hash values of the blocks, and the blocks are linked by a light chain and a dark chain.
5. The subsidizing method of the concealable real name based on the matrix federation chain as claimed in claim 1, wherein the specific steps of S4 are:
s4-1, sponsor
Figure 951321DEST_PATH_IMAGE006
Initiating an anonymous modification request
Figure 380028DEST_PATH_IMAGE104
Wherein
Figure 766010DEST_PATH_IMAGE105
In order to modify the coordinates of the block where the transaction is located,
Figure 14589DEST_PATH_IMAGE106
in order to be able to use the encryption algorithm,
Figure 144219DEST_PATH_IMAGE107
a certificate of subsidy is represented and,
Figure 427432DEST_PATH_IMAGE108
is the current timestamp;
s4-2, supervision node
Figure 718737DEST_PATH_IMAGE062
Receive to
Figure 720191DEST_PATH_IMAGE109
First, select the current timestamp
Figure 387932DEST_PATH_IMAGE110
If, if
Figure 791232DEST_PATH_IMAGE111
The message is valid, according to
Figure 253437DEST_PATH_IMAGE112
Query local database to obtain
Figure 476608DEST_PATH_IMAGE113
Executing a decryption algorithm
Figure 213620DEST_PATH_IMAGE114
，
If it is
Figure 202917DEST_PATH_IMAGE115
If true, the sponsor is indicated
Figure 836024DEST_PATH_IMAGE116
The message is correct for a legal user;
s4-3, after the message passes the verification, the supervision node
Figure 812070DEST_PATH_IMAGE117
For the person of interest
Figure 821614DEST_PATH_IMAGE118
Generating a pseudo-identity
Figure 933927DEST_PATH_IMAGE119
And issue a new certificate of subsidy
Figure 3514DEST_PATH_IMAGE120
Endorse in parallel, then supervise the node
Figure 201277DEST_PATH_IMAGE117
Generating new transaction data
Figure 14512DEST_PATH_IMAGE121
Wherein
Figure 715752DEST_PATH_IMAGE122
Wherein
Figure 221820DEST_PATH_IMAGE123
Which represents the time at which the transaction was generated,
Figure 641300DEST_PATH_IMAGE124
a digital signature is represented for the transaction,
Figure 258226DEST_PATH_IMAGE125
represents a chain tag; furthermore, a supervisory node
Figure 79551DEST_PATH_IMAGE117
The coordinate of the block where the transaction to be modified is located is also provided to the consensus node
Figure 490941DEST_PATH_IMAGE126
And modifying the identity information of the request originator
Figure 663297DEST_PATH_IMAGE118
；
S4-4, identifying the node pair for transaction according to the identification mechanism
Figure 818334DEST_PATH_IMAGE127
After the verification is passed, according to
Figure 759746DEST_PATH_IMAGE128
And
Figure 342037DEST_PATH_IMAGE118
quickly inquiring the transaction to be modified and then sending the transaction to be modified
Figure 736109DEST_PATH_IMAGE008
Is replaced by
Figure 694838DEST_PATH_IMAGE127
Recalculating the value of merkleroot
Figure 487826DEST_PATH_IMAGE129
At this time, the bright chain between the block and the subsequent block is broken due to the change in the value of merkleroot, and
Figure 241018DEST_PATH_IMAGE130
the value of (d) remains unchanged, so the dark chain maintains the integrity of the subsidized chain; if it is
Figure 122386DEST_PATH_IMAGE130
If the block is also changed, the block is indicated to be subjected to unauthorized tampering;
s4-5, qualified person
Figure 619227DEST_PATH_IMAGE118
When the real name is needed again, a modification request is sent, and the node is monitored
Figure 535230DEST_PATH_IMAGE117
Relevant endorsement content can be obtained by searching a local database, and steps S4-1 to S4-3 are carried out after identity verification to complete real name modification.
6. The subsidizing method of the concealable real name based on the matrix federation chain as claimed in claim 1, wherein the specific steps of S5 are:
s5-1, the person of interest
Figure 459324DEST_PATH_IMAGE001
Initiating a delete request
Figure 827988DEST_PATH_IMAGE131
Wherein
Figure 862940DEST_PATH_IMAGE132
The height of the dream block is the height of the dream block,
Figure 633450DEST_PATH_IMAGE133
a timestamp of the current request;
s5-2, supervision node
Figure 994024DEST_PATH_IMAGE117
Person receiving the information
Figure 584406DEST_PATH_IMAGE001
After the sent deleting request, the current time is selected first
Figure 423049DEST_PATH_IMAGE134
If, if
Figure 313644DEST_PATH_IMAGE135
If the request is valid, then the uplink query obtains the transaction data
Figure 579541DEST_PATH_IMAGE136
Calculating
Figure 657218DEST_PATH_IMAGE137
If, if
Figure 299552DEST_PATH_IMAGE138
If yes, the identity of the person to be helped is credible; otherwise, the person is illegal or
Figure 779075DEST_PATH_IMAGE139
If the value is subject to unauthorized tampering, the session is terminated;
s5-3, qualified person
Figure 481452DEST_PATH_IMAGE001
Identity verification deviceOutdated, supervisory node
Figure 46425DEST_PATH_IMAGE117
Generating new transaction data
Figure 223941DEST_PATH_IMAGE140
Broadcasting, and providing the height of the block to be modified
Figure 557970DEST_PATH_IMAGE141
；
S5-4, according to the consensus mechanism, after the consensus node is verified, the block to be modified is deleted, specifically, the original block is deleted
Figure 431249DEST_PATH_IMAGE142
Is replaced by
Figure 483518DEST_PATH_IMAGE143
And recalculated
Figure 733234DEST_PATH_IMAGE144
。
7. The fundation method based on the concealable real names of the matrix alliance chain as claimed in any one of claims 1 to 6, wherein the consensus mechanism is a practical Byzantine fault-tolerant mechanism based on multi-factor voting, and the consensus nodes are a sponsor and a helped person; the common knowledge of the common knowledge node is obtained when the transaction is issued or modified on the chain, and the common knowledge node calculates the matching degree through synthesisSDSubsidy limitSACredit rating of the sponsorCSThree-factor voting before rank selection
Figure 921770DEST_PATH_IMAGE145
The consensus node of the bit participates in consensus, each time
Figure 700370DEST_PATH_IMAGE146
Hour(s)And finally, reorganizing the election voting.
8. The subsidizing method of concealable real names based on the matrix federation chain as claimed in claim 7, wherein according to the consensus mechanism, the step of verifying the consensus node is:
s6-1, when the matrix alliance chain is cold-started, the supervising node
Figure 505515DEST_PATH_IMAGE117
Writing the subsidized transaction information into the founding block; the key generation center KGC distributes independent block chain addresses to each node
Figure 27763DEST_PATH_IMAGE147
Private key
Figure 601964DEST_PATH_IMAGE148
And public key
Figure 551465DEST_PATH_IMAGE149
The public key of the sponsor is only published for the supervision node and the consensus node, the account address written into the block is publicly visible, and the account address not written into the block cannot be displayed in the network;
s6-2, third party credit organization in supervision organization
Figure 578327DEST_PATH_IMAGE150
To newly joined subsidized node
Figure 904266DEST_PATH_IMAGE006
Credit awarding score
Figure 67394DEST_PATH_IMAGE151
(ii) a Supervision node
Figure 453376DEST_PATH_IMAGE117
Reading sponsoring nodes
Figure 967534DEST_PATH_IMAGE006
Certificate of subsidization of
Figure 831585DEST_PATH_IMAGE152
Recording the subsidy value of the node
Figure 380378DEST_PATH_IMAGE153
According to the type of subsidizationtypeCalculating subsidized matching degree score
Figure 671682DEST_PATH_IMAGE154
；
S6-3, when entering into the voting time, the supervision node
Figure 407557DEST_PATH_IMAGE117
Calculating a composite score for the election node
Figure 337948DEST_PATH_IMAGE155
(ii) a Wherein the content of the first and second substances,
Figure 475669DEST_PATH_IMAGE156
，
Figure 203453DEST_PATH_IMAGE157
is to
Figure 426624DEST_PATH_IMAGE158
The result of the normalization processing is selected before the grade sorting
Figure 632478DEST_PATH_IMAGE145
The node of the bit acts as a consensus node;
s6-4, after the first group of consensus nodes are generated, the method is carried out
Figure 890284DEST_PATH_IMAGE159
Within the time, the consensus nodes sequentially act as the main nodes according to the ranking; master nodeSPSubsidized transaction to be validated
Figure 788969DEST_PATH_IMAGE160
Packing the information into a block, generating
Figure 499436DEST_PATH_IMAGE161
Sending the data to other slave nodes; the next node behind the main node is a secondary main node, and is packed with the main node at the same time, and blocks generated by the main node can be sent out when the main node has errors;
s6-5, and the rest slave nodes
Figure 508981DEST_PATH_IMAGE162
After receiving the pre-prepared message sent by the main node, verifying the signature, and if the verification is passed and the block uplink is approved, sending a confirmation message
Figure 621293DEST_PATH_IMAGE163
Forwarding to other consensus nodes, and sending if overtime or disapproval
Figure 690880DEST_PATH_IMAGE164
；
S6-6, after each consensus node receives the preparation message, when the number of the received effective preparation messages is large
Figure 888644DEST_PATH_IMAGE165
Wherein
Figure 436300DEST_PATH_IMAGE166
Calculating approval for the maximum number of malicious nodes
Figure 668698DEST_PATH_IMAGE167
And disfavor
Figure 909186DEST_PATH_IMAGE168
Determining the number of tickets in the acknowledgment message
Figure 328666DEST_PATH_IMAGE169
Value, node broadcast acknowledgement informationConfirmWhen an acknowledgement message is received
Figure 945592DEST_PATH_IMAGE170
If so, executing the request;
Figure 766918DEST_PATH_IMAGE171
；
s6-7, if the client receives
Figure 178308DEST_PATH_IMAGE172
If the responses are the same, the request initiated by the client side is proved to have the common consensus of the whole network, otherwise, the request needs to be sent again;
Figure 350663DEST_PATH_IMAGE173
is the number of system nodes, if the maximum number of malicious nodes allowed by the system
Figure 73129DEST_PATH_IMAGE166
Then, it requires
Figure 280120DEST_PATH_IMAGE174
；
S6-8, if the malicious node is found, updating the credit score
Figure 862411DEST_PATH_IMAGE175
Wherein, in the step (A),
Figure 256483DEST_PATH_IMAGE176
and sending the credit to a third party credit facility
Figure 215212DEST_PATH_IMAGE150
(ii) a If finished
Figure 745550DEST_PATH_IMAGE177
If the node is in the round of consensus, the credit score of the node is updated to be
Figure 764322DEST_PATH_IMAGE178
。
CN202111323417.8A 2021-11-10 2021-11-10 Subsidizing method capable of hiding real names based on matrix alliance chain Active CN113781073B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202111323417.8A CN113781073B (en) 2021-11-10 2021-11-10 Subsidizing method capable of hiding real names based on matrix alliance chain
PCT/CN2022/106613 WO2023082690A1 (en) 2021-11-10 2022-07-20 Matrix consortium blockchain based sponsoring method capable of concealing real name

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111323417.8A CN113781073B (en) 2021-11-10 2021-11-10 Subsidizing method capable of hiding real names based on matrix alliance chain

Publications (2)

Publication Number Publication Date
CN113781073A true CN113781073A (en) 2021-12-10
CN113781073B CN113781073B (en) 2022-03-04

Family

ID=78873677

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111323417.8A Active CN113781073B (en) 2021-11-10 2021-11-10 Subsidizing method capable of hiding real names based on matrix alliance chain

Country Status (2)

Country Link
CN (1) CN113781073B (en)
WO (1) WO2023082690A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023082690A1 (en) * 2021-11-10 2023-05-19 南京邮电大学 Matrix consortium blockchain based sponsoring method capable of concealing real name
CN116846916A (en) * 2023-09-01 2023-10-03 武汉趣链数字科技有限公司 Data synchronization method, device, electronic equipment and computer readable storage medium

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116436979B (en) * 2023-06-15 2023-08-11 湖南湘江树图信息科技创新中心有限公司 Method and system for invoking external services by alliance block chain

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109389541A (en) * 2018-08-21 2019-02-26 广东工业大学 Public good fund management method based on alliance's chain
CN109615339A (en) * 2018-12-24 2019-04-12 浙江大学 Volunteer based on alliance's chain contributes integration of services public good crowd and raises system and method
CN111654363A (en) * 2020-06-18 2020-09-11 福建师范大学 Alliance chain privacy protection method based on group signature and homomorphic encryption
CN111831747A (en) * 2020-06-24 2020-10-27 西安纸贵互联网科技有限公司 Charitable donation service system and charitable donation service platform
CN111988290A (en) * 2020-08-05 2020-11-24 上海交通大学 Transaction deletion method and system under user balance privacy protection and authorization supervision
CN112100667A (en) * 2020-09-24 2020-12-18 南京邮电大学 Charity organization supervision and management method based on novel block chain structure
WO2021040134A1 (en) * 2019-08-30 2021-03-04 김태복 System for transacting donated article by using blockchain

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113781073B (en) * 2021-11-10 2022-03-04 南京邮电大学 Subsidizing method capable of hiding real names based on matrix alliance chain

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109389541A (en) * 2018-08-21 2019-02-26 广东工业大学 Public good fund management method based on alliance's chain
CN109615339A (en) * 2018-12-24 2019-04-12 浙江大学 Volunteer based on alliance's chain contributes integration of services public good crowd and raises system and method
WO2021040134A1 (en) * 2019-08-30 2021-03-04 김태복 System for transacting donated article by using blockchain
CN111654363A (en) * 2020-06-18 2020-09-11 福建师范大学 Alliance chain privacy protection method based on group signature and homomorphic encryption
CN111831747A (en) * 2020-06-24 2020-10-27 西安纸贵互联网科技有限公司 Charitable donation service system and charitable donation service platform
CN111988290A (en) * 2020-08-05 2020-11-24 上海交通大学 Transaction deletion method and system under user balance privacy protection and authorization supervision
CN112100667A (en) * 2020-09-24 2020-12-18 南京邮电大学 Charity organization supervision and management method based on novel block chain structure

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023082690A1 (en) * 2021-11-10 2023-05-19 南京邮电大学 Matrix consortium blockchain based sponsoring method capable of concealing real name
CN116846916A (en) * 2023-09-01 2023-10-03 武汉趣链数字科技有限公司 Data synchronization method, device, electronic equipment and computer readable storage medium
CN116846916B (en) * 2023-09-01 2023-12-08 武汉趣链数字科技有限公司 Data synchronization method, device, electronic equipment and computer readable storage medium

Also Published As

Publication number Publication date
WO2023082690A1 (en) 2023-05-19
CN113781073B (en) 2022-03-04

Similar Documents

Publication Publication Date Title
Hanifatunnisa et al. Blockchain based e-voting recording system design
CN109785494B (en) Traceable anonymous electronic voting method based on block chain
CN113781073B (en) Subsidizing method capable of hiding real names based on matrix alliance chain
US11481768B2 (en) System and method of generating and validating encapsulated cryptographic tokens based on multiple digital signatures
Çabuk et al. A survey on feasibility and suitability of blockchain techniques for the e-voting systems
CN109417549A (en) The method and apparatus of information proof is provided using centralization or distributed ledger
CN108650077B (en) Block chain based information transmission method, terminal, equipment and readable storage medium
US20130318619A1 (en) Encapsulated security tokens for electronic transactions
CN109274501A (en) License block chain method for secret protection based on Proxy Signature
CN110689415B (en) Public resource transaction platform management system
CN112801778B (en) Alliance type bad asset block chain system
US11250423B2 (en) Encapsulated security tokens for electronic transactions
WO2018088475A1 (en) Electronic authentication method and program
CN112199448A (en) Industrial and commercial registration method and system based on block chain
CN109919614A (en) A kind of method for protecting intelligent contract privacy using zero-knowledge proof in block chain
CN111444267A (en) Government information sharing platform and method based on block chain
CN115688191A (en) Block chain-based electronic signature system and method
CN108540447A (en) A kind of certification authentication method and system based on block chain
Sliusar et al. Blockchain technology application for electronic voting systems
CN114169888B (en) Universal type cryptocurrency custody method supporting multiple signatures
CN113094748B (en) Realization method of authenticatable anonymous E-commerce evaluation mechanism based on blockchain
CN114565485A (en) Labor contract management method and system based on block chain ipfs storage
Ramya et al. A Hybrid Proof of Stake-Trust Block Chain Model in Pervasive Social Networking for E-voting System
Kashyap et al. Immutable and Privacy Protected E-Certificate Repository on Blockchain
Bose et al. Cryptoeconomics

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant