CN113781073B - 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
CN113781073B
CN113781073B CN202111323417.8A CN202111323417A CN113781073B CN 113781073 B CN113781073 B CN 113781073B CN 202111323417 A CN202111323417 A CN 202111323417A CN 113781073 B CN113781073 B CN 113781073B
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.)
Active
Application number
CN202111323417.8A
Other languages
Chinese (zh)
Other versions
CN113781073A (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

Landscapes

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

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 100002_DEST_PATH_IMAGE001
Submitting an application subsidy to a federation chain systemInformation, supervision node
Figure 840206DEST_PATH_IMAGE002
The application and the subsidy information are audited and verified, and the dreamy transaction information issued by the subsidee is packaged
Figure 100002_DEST_PATH_IMAGE003
And generating a copy of the transaction
Figure 579492DEST_PATH_IMAGE004
The supervisory node broadcasts transaction information
Figure 860169DEST_PATH_IMAGE005
And transaction copies
Figure 749628DEST_PATH_IMAGE004
The consensus node compares the transaction information according to a consensus mechanism
Figure 815673DEST_PATH_IMAGE003
And transaction copies
Figure 397964DEST_PATH_IMAGE004
Performing verification and sending the verified transaction information
Figure 667402DEST_PATH_IMAGE005
And transaction copies
Figure 626131DEST_PATH_IMAGE004
Writing a dream block;
s3, constructing a subsidy block to form a vertical chain in the matrix alliance chain; help people
Figure 156470DEST_PATH_IMAGE006
Finish the person who is helped
Figure 34296DEST_PATH_IMAGE001
After the subsidization, acquiring the subsidized certificate issued and endorsed by the supervision node
Figure 915664DEST_PATH_IMAGE007
Supervision node broadcasts subsidized transactions
Figure 803984DEST_PATH_IMAGE008
And transactional copies thereof
Figure DEST_PATH_IMAGE009
The consensus node proceeds with the subsidized transaction according to the consensus mechanism
Figure 47883DEST_PATH_IMAGE010
And transactional copies thereof
Figure 706398DEST_PATH_IMAGE011
Performing verification and subsidizing the transaction after verification
Figure 950429DEST_PATH_IMAGE008
And transactional copies thereof
Figure 250960DEST_PATH_IMAGE011
Storing the data into a transaction pool; the main consensus node is based on the person under investigationIDAnd the subsidized type will fund the transaction
Figure 880524DEST_PATH_IMAGE012
And copies
Figure 975519DEST_PATH_IMAGE013
Packing into blocks, broadcasting to a blockchain network, verifying the correctness of the blocks from the consensus nodes and voting, the number of votes exceeding a threshold
Figure 205381DEST_PATH_IMAGE014
The chain can be wound;
s4 qualified person
Figure 44024DEST_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 262516DEST_PATH_IMAGE002
After receiving the request, quickly positioning the coordinates of the block where the transaction is located
Figure 528412DEST_PATH_IMAGE015
After verifying the identity of the sponsor, a pseudo-identity is generated for the sponsor
Figure 100002_DEST_PATH_IMAGE016
And issuing a new certificate of subsidy
Figure 950297DEST_PATH_IMAGE017
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 982844DEST_PATH_IMAGE001
When wanting to hide the subsidized information, the person to be subsidized
Figure 462367DEST_PATH_IMAGE001
After receiving the subsidization, initiating a request for deleting the subsidization release, and supervising the node
Figure 7487DEST_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 838040DEST_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 100002_DEST_PATH_IMAGE018
Generated by patrons, regulatory agencies, key generation centersThe character strings associated with the identity information are respectively represented as:
Figure 611961DEST_PATH_IMAGE019
s1-2, inputting safety parameters
Figure 555777DEST_PATH_IMAGE020
Selecting addition cycle groups
Figure DEST_PATH_IMAGE021
And multiplication loop group
Figure 756951DEST_PATH_IMAGE022
And is and
Figure 809221DEST_PATH_IMAGE023
，
Figure 100002_DEST_PATH_IMAGE024
is composed of
Figure 370521DEST_PATH_IMAGE020
The large prime number of bits is the number of bits,
Figure 214849DEST_PATH_IMAGE025
into a group
Figure 993449DEST_PATH_IMAGE021
And define such a bilinear map
Figure 100002_DEST_PATH_IMAGE026
：
Figure 877223DEST_PATH_IMAGE027
；
S1-3, selecting random number at random by key generation center
Figure DEST_PATH_IMAGE028
As the system master key, and calculates its public key as
Figure 258526DEST_PATH_IMAGE029
Defining 6 secure hash functions, which are respectively:
Figure 567147DEST_PATH_IMAGE030
and a pair of encryption and decryption algorithms
Figure 630830DEST_PATH_IMAGE031
，
Figure 657692DEST_PATH_IMAGE032
Disclosure of system parameters
Figure 100002_DEST_PATH_IMAGE033
And is recorded on the block chain,
Figure 577106DEST_PATH_IMAGE034
display module
Figure 881180DEST_PATH_IMAGE035
The multiplicative group of the remaining class ring of (c),
Figure 1583DEST_PATH_IMAGE036
which represents the public key(s),
Figure 640374DEST_PATH_IMAGE037
indicating indefinite length
Figure DEST_PATH_IMAGE038
A string of bits is then transmitted through the bit string,
Figure 238846DEST_PATH_IMAGE039
to represent
Figure DEST_PATH_IMAGE040
Of a long bit length
Figure 99224DEST_PATH_IMAGE038
A bit string;
s1-4, the key generation center provides the identity character string according to each participated user
Figure 46320DEST_PATH_IMAGE041
Computing
Figure 782195DEST_PATH_IMAGE042
，
Figure 100002_DEST_PATH_IMAGE043
，
Figure 794144DEST_PATH_IMAGE044
，
Figure 931864DEST_PATH_IMAGE045
And an
Figure 784283DEST_PATH_IMAGE046
Wherein, in the step (A),
Figure 7454DEST_PATH_IMAGE047
is a public and private key pair of a user,
Figure DEST_PATH_IMAGE048
for the user block chain public key address,
Figure 56050DEST_PATH_IMAGE049
is the user's registration certificate, is generated by the private key signature of the key generation center,
Figure 172911DEST_PATH_IMAGE050
in order to be the registration number,
Figure 71597DEST_PATH_IMAGE051
is a universal hash function and then is transmitted through a secure channel
Figure DEST_PATH_IMAGE052
And sending the data to the user.
Further, the step of S2 is:
s2-1, the person of interest
Figure 126271DEST_PATH_IMAGE001
Packaging personal registration information, dream content and type generating messages
Figure 260449DEST_PATH_IMAGE053
And calculating the digital signature thereof
Figure DEST_PATH_IMAGE054
Wherein, in the step (A),
Figure 215505DEST_PATH_IMAGE055
sending messages for current timestamps
Figure DEST_PATH_IMAGE056
To a blockchain network;
s2-2, supervision node
Figure 753934DEST_PATH_IMAGE057
Receiving the person to be helped
Figure 76330DEST_PATH_IMAGE001
Message
Figure 623986DEST_PATH_IMAGE058
Then, first, the current timestamp is selected
Figure 466172DEST_PATH_IMAGE059
Definition of
Figure 706660DEST_PATH_IMAGE060
Is the effective difference between the timestamp of the message and the timestamp of the received message, if
Figure 516353DEST_PATH_IMAGE061
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 867700DEST_PATH_IMAGE062
(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 954605DEST_PATH_IMAGE057
Packing the patrons according to the trading format of the dream blocks
Figure 734037DEST_PATH_IMAGE001
Submitted information and generating a transaction copy, as follows:
Figure 640813DEST_PATH_IMAGE063
Figure DEST_PATH_IMAGE064
；
wherein the content of the first and second substances,
Figure 123747DEST_PATH_IMAGE005
containing personal real information of a sponsor
Figure 940524DEST_PATH_IMAGE001
And
Figure 257236DEST_PATH_IMAGE065
，
Figure 775942DEST_PATH_IMAGE004
to trade a copy, not including both strings,
Figure 469091DEST_PATH_IMAGE066
is the signature of the supervising node on the transaction,
Figure 904490DEST_PATH_IMAGE067
the time is generated for the transaction,
Figure 657682DEST_PATH_IMAGE068
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 663684DEST_PATH_IMAGE057
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 894945DEST_PATH_IMAGE068
The label is written into the dream block and an index list is established
Figure 420736DEST_PATH_IMAGE069
Saved as down-link data to a local database, wherein
Figure 344829DEST_PATH_IMAGE070
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 100002_DEST_PATH_IMAGE071
、
Figure 572548DEST_PATH_IMAGE072
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 100002_DEST_PATH_IMAGE073
wherein the content of the first and second substances,
Figure 450243DEST_PATH_IMAGE074
which represents the current block of the video stream,
Figure 100002_DEST_PATH_IMAGE075
two hash values representing the previous block,
Figure 814229DEST_PATH_IMAGE076
a random number representing the current block is generated,
Figure 100002_DEST_PATH_IMAGE077
representing the generation timestamp of the block.
Further, the step of S3 is:
s3-1, sponsor
Figure 253431DEST_PATH_IMAGE078
Finish the person who is helped
Figure 109392DEST_PATH_IMAGE001
Funds transfer or service to a blockchain address of the mobile station, generating subsidy information
Figure 100002_DEST_PATH_IMAGE079
To supervision node
Figure 275931DEST_PATH_IMAGE002
Sending a generate funding certificate request
Figure 274849DEST_PATH_IMAGE080
，
Wherein the content of the first and second substances,
Figure 100002_DEST_PATH_IMAGE081
the presentation of the sponsored content is performed,
Figure 275166DEST_PATH_IMAGE082
representing an encryption algorithm, the supervisory node executing a decryption algorithm upon receipt of a request
Figure 100002_DEST_PATH_IMAGE083
To obtain
Figure 946319DEST_PATH_IMAGE084
If and subsidizing the message
Figure DEST_PATH_IMAGE085
Is directly formed by
Figure 198440DEST_PATH_IMAGE086
Calculated value
Figure 802596DEST_PATH_IMAGE087
If they are equal, the request is confirmed to be received and the certificate of subsidy is issued
Figure 239394DEST_PATH_IMAGE088
Wherein
Figure 184128DEST_PATH_IMAGE089
Generating time for the certificate and endorsing;
s3-2, supervision node
Figure 98994DEST_PATH_IMAGE002
Generating transactions according to the transaction format of the funded block
Figure 823237DEST_PATH_IMAGE012
And copies of transactions
Figure 430936DEST_PATH_IMAGE013
And broadcast to the whole network, verified by the consensus node according to the consensus mechanism, and in addition, the supervision node
Figure 358572DEST_PATH_IMAGE002
And also provide subsidized objects
Figure 77129DEST_PATH_IMAGE001
Related information of
Figure 655878DEST_PATH_IMAGE090
For block positioning;
Figure 700057DEST_PATH_IMAGE091
，
wherein the content of the first and second substances,
Figure 100002_DEST_PATH_IMAGE092
transaction copy
Figure 82366DEST_PATH_IMAGE013
Does not include the personal related information of the sponsor
Figure 604614DEST_PATH_IMAGE093
，
Figure 100002_DEST_PATH_IMAGE094
，
Figure 772290DEST_PATH_IMAGE095
Representing the supervisory node's signature on the transaction,
Figure 100002_DEST_PATH_IMAGE096
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 65999DEST_PATH_IMAGE097
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 951916DEST_PATH_IMAGE012
And copies
Figure 543434DEST_PATH_IMAGE013
Is deposited into a transaction pool and then will
Figure 100002_DEST_PATH_IMAGE098
To the same person under charge within a period of time
Figure 549305DEST_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 669708DEST_PATH_IMAGE014
Then, calculate the index
Figure 308500DEST_PATH_IMAGE099
Positioning
Figure 438130DEST_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 100002_DEST_PATH_IMAGE100
And
Figure 799972DEST_PATH_IMAGE101
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 481489DEST_PATH_IMAGE078
Initiating an anonymous modification request
Figure 217364DEST_PATH_IMAGE102
Wherein
Figure 993428DEST_PATH_IMAGE103
In order to modify the coordinates of the block where the transaction is located,
Figure 396727DEST_PATH_IMAGE104
in order to be able to use the encryption algorithm,
Figure 124512DEST_PATH_IMAGE105
a certificate of subsidy is represented and,
Figure 100002_DEST_PATH_IMAGE106
is the current timestamp;
s4-2, supervision node
Figure 675579DEST_PATH_IMAGE002
Receive to
Figure 22378DEST_PATH_IMAGE107
First, select the current timestamp
Figure 280184DEST_PATH_IMAGE108
If, if
Figure 37924DEST_PATH_IMAGE109
The message is valid, according to
Figure 748391DEST_PATH_IMAGE078
Query local database to obtain
Figure 149415DEST_PATH_IMAGE105
Executing a decryption algorithm
Figure 100002_DEST_PATH_IMAGE110
If, if
Figure 730569DEST_PATH_IMAGE111
If true, the sponsor is indicated
Figure 924790DEST_PATH_IMAGE078
The message is correct for a legal user;
s4-3, after the message passes the verification, the supervision node
Figure 856974DEST_PATH_IMAGE002
For the person of interest
Figure 545575DEST_PATH_IMAGE078
Generating a pseudo-identity
Figure 100002_DEST_PATH_IMAGE112
And issue a new certificate of subsidy
Figure 105870DEST_PATH_IMAGE113
Endorse in parallel, then supervise the node
Figure 100002_DEST_PATH_IMAGE114
Generating new transaction data
Figure 189101DEST_PATH_IMAGE115
，
Wherein
Figure 100002_DEST_PATH_IMAGE116
Wherein
Figure 467636DEST_PATH_IMAGE117
Which represents the time at which the transaction was generated,
Figure 100002_DEST_PATH_IMAGE118
a digital signature is represented for the transaction,
Figure 163190DEST_PATH_IMAGE119
represents a chain tag; furthermore, a supervisory node
Figure 250095DEST_PATH_IMAGE002
The coordinate of the block where the transaction to be modified is located is also provided to the consensus node
Figure 100002_DEST_PATH_IMAGE120
And modifying the identity information of the request originator
Figure 989381DEST_PATH_IMAGE078
；
S4-4, identifying the node pair for transaction according to the identification mechanism
Figure 896157DEST_PATH_IMAGE121
After the verification is passed, according to
Figure 425096DEST_PATH_IMAGE120
And
Figure 366507DEST_PATH_IMAGE078
quickly inquiring the transaction to be modified and then sending the transaction to be modified
Figure 73432DEST_PATH_IMAGE012
Is replaced by
Figure 467505DEST_PATH_IMAGE121
Recalculating the value of merkleroot
Figure 100002_DEST_PATH_IMAGE122
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 504862DEST_PATH_IMAGE123
the value of (d) remains unchanged, so the dark chain maintains the integrity of the subsidized chain; if it is
Figure 425413DEST_PATH_IMAGE123
If the block is also changed, the block is indicated to be subjected to unauthorized tampering;
s4-5, qualified person
Figure 100002_DEST_PATH_IMAGE124
When the real name is needed again, a modification request is sent, and the node is monitored
Figure 21349DEST_PATH_IMAGE002
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 902717DEST_PATH_IMAGE001
Initiating deletionRemove request
Figure 399557DEST_PATH_IMAGE125
Wherein
Figure 100002_DEST_PATH_IMAGE126
The height of the dream block is the height of the dream block,
Figure 456506DEST_PATH_IMAGE127
a timestamp of the current request;
s5-2, supervision node
Figure 505234DEST_PATH_IMAGE002
Person receiving the information
Figure 873898DEST_PATH_IMAGE001
After the sent deleting request, the current time is selected first
Figure 100002_DEST_PATH_IMAGE128
If, if
Figure 757452DEST_PATH_IMAGE129
If the request is valid, then the uplink query obtains the transaction data
Figure 100002_DEST_PATH_IMAGE130
，
Computing
Figure 855859DEST_PATH_IMAGE131
If, if
Figure 100002_DEST_PATH_IMAGE132
If yes, the identity of the person to be helped is credible; otherwise, the person is illegal or
Figure 295061DEST_PATH_IMAGE133
If the value is subject to unauthorized tampering, the session is terminated;
S5-3. as the person being helped
Figure 10076DEST_PATH_IMAGE001
When the identity verification passes, the node is supervised
Figure 848719DEST_PATH_IMAGE114
Generating new transaction data
Figure 100002_DEST_PATH_IMAGE134
Broadcasting, and providing the height of the block to be modified
Figure 316479DEST_PATH_IMAGE135
；
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_IMAGE136
Is replaced by
Figure 441429DEST_PATH_IMAGE137
And recalculated
Figure DEST_PATH_IMAGE138
Due to this value change, for the dream chain, the latter block
Figure 863315DEST_PATH_IMAGE139
Current block stored therein
Figure DEST_PATH_IMAGE140
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 833545DEST_PATH_IMAGE001
Is encrypted, the corresponding certificate of subsidization is encryptedOnly the subsidizing node with the corresponding private key can see the private key, and other nodes can not inquire the person to be subsidized
Figure 686969DEST_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 123767DEST_PATH_IMAGE141
The consensus node of the bit participates in consensus, each time
Figure DEST_PATH_IMAGE142
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 547795DEST_PATH_IMAGE114
Writing the subsidized transaction information into the founding block; the key generation center KGC distributes independent block chain addresses to each node
Figure 338027DEST_PATH_IMAGE143
Private key
Figure DEST_PATH_IMAGE144
And public key
Figure 672057DEST_PATH_IMAGE145
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 DEST_PATH_IMAGE146
To newly joined subsidized node
Figure 873231DEST_PATH_IMAGE093
Credit awarding score
Figure 33823DEST_PATH_IMAGE147
(ii) a Supervision node
Figure 17959DEST_PATH_IMAGE114
Reading sponsoring nodes
Figure 596708DEST_PATH_IMAGE093
Certificate of subsidization of
Figure DEST_PATH_IMAGE148
Recording the subsidy value of the node
Figure 719516DEST_PATH_IMAGE149
According to the type of subsidizationtypeCalculating subsidized matching degree score
Figure DEST_PATH_IMAGE150
；
S6-3, when entering into the voting time, the supervision node
Figure 852557DEST_PATH_IMAGE114
Calculating a composite score for the election node
Figure 374805DEST_PATH_IMAGE151
(ii) a Wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE152
，
Figure 520310DEST_PATH_IMAGE153
is to
Figure DEST_PATH_IMAGE154
The result of the normalization processing is selected before the grade sorting
Figure 63287DEST_PATH_IMAGE141
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 355728DEST_PATH_IMAGE155
Within the time, the consensus nodes sequentially act as the main nodes according to the ranking; master nodeSPSubsidized transaction to be validated
Figure DEST_PATH_IMAGE156
Packing the information into a block, generating
Figure 760296DEST_PATH_IMAGE157
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 DEST_PATH_IMAGE158
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 782479DEST_PATH_IMAGE159
Forwarding to other consensus nodes, and sending if overtime or disapproval
Figure DEST_PATH_IMAGE160
；
S6-6, after each consensus node receives the preparation message, when the number of the received effective preparation messages is large
Figure 745624DEST_PATH_IMAGE161
(maximum number of malicious nodes)
Figure DEST_PATH_IMAGE162
) Calculate approval
Figure 587678DEST_PATH_IMAGE163
And disfavor
Figure DEST_PATH_IMAGE164
Determining the number of tickets in the acknowledgment message
Figure 61516DEST_PATH_IMAGE165
Value, node broadcast acknowledgement informationConfirmWhen an acknowledgement message is received
Figure DEST_PATH_IMAGE166
If so, executing the request;
Figure 938205DEST_PATH_IMAGE167
；
s6-7, if the client receives
Figure DEST_PATH_IMAGE168
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 72252DEST_PATH_IMAGE169
is the number of system nodes, if the maximum number of malicious nodes allowed by the system
Figure 932761DEST_PATH_IMAGE162
Then, it requires
Figure DEST_PATH_IMAGE170
；
S6-8, if the malicious node is found, updating the credit score
Figure 334923DEST_PATH_IMAGE171
Wherein, in the step (A),
Figure DEST_PATH_IMAGE172
and sending the comment to a third partyBy means of mechanisms
Figure 816851DEST_PATH_IMAGE146
(ii) a If it is finished
Figure 403690DEST_PATH_IMAGE173
If the node is in the round of consensus, the credit score of the node is updated to be
Figure DEST_PATH_IMAGE174
。
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 469604DEST_PATH_IMAGE175
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 DEST_PATH_IMAGE176
Zhang Ming, love classroom company, civil administration department and loveThe character strings which are respectively generated by the cooperative supervisor and the credit investigation center and are associated with the identity information are respectively expressed as follows:
Figure 534512DEST_PATH_IMAGE019
；
s1-2, inputting safety parameters
Figure 526739DEST_PATH_IMAGE020
Selecting addition cycle groups
Figure 35212DEST_PATH_IMAGE021
And multiplication loop group
Figure 11258DEST_PATH_IMAGE177
And is and
Figure DEST_PATH_IMAGE178
，
Figure 614278DEST_PATH_IMAGE024
is composed of
Figure 840772DEST_PATH_IMAGE020
The large prime number of bits is the number of bits,
Figure 910359DEST_PATH_IMAGE179
into a group
Figure 967177DEST_PATH_IMAGE021
And define such a bilinear map
Figure DEST_PATH_IMAGE180
：
Figure 124620DEST_PATH_IMAGE181
；
S1-3, KGC random selection random number
Figure DEST_PATH_IMAGE182
As the system master key, and calculates its public key as
Figure 419335DEST_PATH_IMAGE183
(ii) a Defining 6 secure hash functions, which are respectively:
Figure DEST_PATH_IMAGE184
and a pair of encryption and decryption algorithms
Figure 502566DEST_PATH_IMAGE185
，
Figure 187625DEST_PATH_IMAGE186
Disclosure of system parameters
Figure 538972DEST_PATH_IMAGE033
And recording to the block chain; wherein, r represents a random number,
Figure 484932DEST_PATH_IMAGE034
display module
Figure 896321DEST_PATH_IMAGE035
The multiplicative group of the remaining class ring of (c),
Figure 678464DEST_PATH_IMAGE036
which represents the public key(s),
Figure 833502DEST_PATH_IMAGE037
indicating indefinite length
Figure 633967DEST_PATH_IMAGE038
A string of bits is then transmitted through the bit string,
Figure 481838DEST_PATH_IMAGE039
to represent
Figure 249811DEST_PATH_IMAGE040
Of a long bit length
Figure 942961DEST_PATH_IMAGE038
A bit string;
s1-4, the key generation center provides the identity character string according to each participated user
Figure DEST_PATH_IMAGE187
Computing
Figure 332354DEST_PATH_IMAGE042
，
Figure 695333DEST_PATH_IMAGE188
，
Figure 576701DEST_PATH_IMAGE044
，
Figure 198176DEST_PATH_IMAGE189
And an
Figure 114179DEST_PATH_IMAGE190
Wherein, in the step (A),
Figure 38273DEST_PATH_IMAGE047
is a public and private key pair of a user,
Figure 515259DEST_PATH_IMAGE048
for the user block chain public key address,
Figure DEST_PATH_IMAGE191
is the user's registration certificate, is generated by the private key signature of the key generation center,
Figure 143687DEST_PATH_IMAGE050
in order to be the registration number,
Figure 914197DEST_PATH_IMAGE192
is a universal hash function and then is transmitted through a secure channel
Figure 884558DEST_PATH_IMAGE052
And sending the data to the user.
S2 building dream blocks to form matrixTransverse chains in union chains (fantasy chains); zhang ming
Figure 474939DEST_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 703795DEST_PATH_IMAGE003
And generating a copy of the transaction
Figure 328812DEST_PATH_IMAGE004
(containing no Zhang Ming)IDAnd a block chain addressAddr) Broadcasting, broadcasting
Figure DEST_PATH_IMAGE193
And copies
Figure 455029DEST_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 657340DEST_PATH_IMAGE001
Packing personal registration information, dream content and type generation message of outreach
Figure 34095DEST_PATH_IMAGE194
And calculating the digital signature thereof
Figure 388984DEST_PATH_IMAGE054
Wherein, in the step (A),
Figure 91361DEST_PATH_IMAGE055
sending messages for current timestamps
Figure DEST_PATH_IMAGE195
To a blockchain network;
s2-2, civil government office and love research formed supervision node
Figure 249810DEST_PATH_IMAGE002
Reception of Zhang Ming
Figure 430255DEST_PATH_IMAGE001
Message
Figure 138186DEST_PATH_IMAGE058
Then, first, the current timestamp is selected
Figure 745885DEST_PATH_IMAGE059
Definition of
Figure 188367DEST_PATH_IMAGE196
Is the effective difference between the timestamp of the message and the timestamp of the received message, if
Figure DEST_PATH_IMAGE197
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 516712DEST_PATH_IMAGE198
；
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 705248DEST_PATH_IMAGE002
Packing Zhangming according to trading format of dream block
Figure 608482DEST_PATH_IMAGE001
Submitted information
Figure 148047DEST_PATH_IMAGE003
And generating a copy of the transaction
Figure 44197DEST_PATH_IMAGE004
The following are:
Figure DEST_PATH_IMAGE199
Figure 946294DEST_PATH_IMAGE200
；
wherein the content of the first and second substances,
Figure 161374DEST_PATH_IMAGE005
containing personal truth information
Figure 188236DEST_PATH_IMAGE001
And
Figure DEST_PATH_IMAGE201
，
Figure 592804DEST_PATH_IMAGE004
to trade a copy, not including both strings,
Figure 880566DEST_PATH_IMAGE202
is the signature of the supervising node on the transaction,
Figure 532127DEST_PATH_IMAGE067
the time is generated for the transaction,
Figure 889028DEST_PATH_IMAGE068
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 DEST_PATH_IMAGE203
Broadcast transactions
Figure 612133DEST_PATH_IMAGE005
And copies of transactions
Figure 895347DEST_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 452230DEST_PATH_IMAGE068
The label is written into the dream block and an index list is established
Figure 797892DEST_PATH_IMAGE069
Saved as down-link data to a local database, wherein
Figure 731213DEST_PATH_IMAGE204
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 993567DEST_PATH_IMAGE205
、
Figure DEST_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 304375DEST_PATH_IMAGE207
；
wherein the content of the first and second substances,
Figure 527546DEST_PATH_IMAGE208
which represents the current block of the video stream,
Figure DEST_PATH_IMAGE209
two hash values representing the previous block,
Figure 326874DEST_PATH_IMAGE210
a random number representing the current block is generated,
Figure 460047DEST_PATH_IMAGE211
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 358733DEST_PATH_IMAGE093
Zhang Ming
Figure 193833DEST_PATH_IMAGE001
Obtaining subsidy certification after subsidizing online English course free of charge
Figure 672219DEST_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 424012DEST_PATH_IMAGE212
And transactional copies thereof
Figure 228020DEST_PATH_IMAGE013
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 550417DEST_PATH_IMAGE014
And finally, chaining is carried out. For all the sponsors of the blogged dream, the subsidy blocks are recordedOn the linked grant chain, the grant block structure is shown in FIG. 2, and the grant chain structure is shown in FIG. 3.
The specific implementation steps of S3 are as follows:
s3-1, Aijie course Co
Figure 98073DEST_PATH_IMAGE093
Complete the explanation of the invention
Figure 940258DEST_PATH_IMAGE213
The block chain address of the user uses the account password of the English course resource for free to generate the subsidy information
Figure 446326DEST_PATH_IMAGE214
，
To supervisory node
Figure 865806DEST_PATH_IMAGE215
Sending a generate funding certificate request
Figure DEST_PATH_IMAGE216
，
Wherein the content of the first and second substances,
Figure 76208DEST_PATH_IMAGE081
the presentation of the sponsored content is performed,
Figure 271434DEST_PATH_IMAGE217
representing an encryption algorithm, the supervisory node executing a decryption algorithm upon receipt of a request
Figure 682824DEST_PATH_IMAGE083
To obtain
Figure 714234DEST_PATH_IMAGE084
If and subsidizing the message
Figure DEST_PATH_IMAGE218
Is directly formed by
Figure 338114DEST_PATH_IMAGE219
Calculated value
Figure 154891DEST_PATH_IMAGE087
If they are equal, the request is confirmed to be received and the certificate of subsidy is issued
Figure 2761DEST_PATH_IMAGE088
Wherein
Figure 521467DEST_PATH_IMAGE089
Generating time for the certificate and endorsing;
s3-2 supervisory node
Figure 214617DEST_PATH_IMAGE002
Generating transactions according to the transaction format of the funded block
Figure 118857DEST_PATH_IMAGE012
And copies of transactions
Figure DEST_PATH_IMAGE220
And broadcast to the whole network, verified by the consensus node according to the consensus mechanism, and in addition, the supervision node
Figure 606470DEST_PATH_IMAGE002
Also needs to provide Zhang Ming
Figure 878051DEST_PATH_IMAGE001
Related information of
Figure 374892DEST_PATH_IMAGE221
For block positioning;
Figure 900682DEST_PATH_IMAGE091
；
wherein the content of the first and second substances,
Figure 559196DEST_PATH_IMAGE222
transaction copy
Figure 193440DEST_PATH_IMAGE013
Enterprise related information without including love course
Figure 353026DEST_PATH_IMAGE093
，
Figure 123536DEST_PATH_IMAGE094
，
Figure 320994DEST_PATH_IMAGE095
Representing the supervisory node's signature on the transaction,
Figure DEST_PATH_IMAGE223
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 36009DEST_PATH_IMAGE097
representing a transaction generation time;
s3-3 transaction
Figure 874652DEST_PATH_IMAGE224
And copies of transactions
Figure 109455DEST_PATH_IMAGE225
After the verification is passed, the main consensus node will trade according to the consensus mechanism
Figure 640931DEST_PATH_IMAGE012
And copies of transactions
Figure 718608DEST_PATH_IMAGE013
Is deposited into a transaction pool and then will
Figure 485576DEST_PATH_IMAGE098
Aim at Zhang Ming in time
Figure 230678DEST_PATH_IMAGE001
The subsidized transactions are packaged into blocks and broadcast toA block chain network, verifying the block from the consensus node, voting for exceeding a threshold
Figure 41377DEST_PATH_IMAGE014
Then, calculate the index
Figure 606350DEST_PATH_IMAGE099
Positioning
Figure 52375DEST_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 511038DEST_PATH_IMAGE100
And
Figure 118737DEST_PATH_IMAGE101
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 46373DEST_PATH_IMAGE226
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 30509DEST_PATH_IMAGE002
After receiving the request, quickly positioning the coordinates of the block where the transaction is located
Figure DEST_PATH_IMAGE227
After the identity of the love course is checked, a pseudo identity is generated for the love course
Figure 78100DEST_PATH_IMAGE016
And issuing a new certificate of subsidy
Figure 122279DEST_PATH_IMAGE228
(ii) a According to the consensus mechanism, the supervision node broadcasts a new transaction (including information such as the pseudo-identity and new certificate of the sponsor) and provides the coordinates of the block where the transaction to be modified is located
Figure DEST_PATH_IMAGE229
Modifying the transaction by the consensus node, wherein the block is
Figure 504588DEST_PATH_IMAGE230
Is changed, and
Figure 417049DEST_PATH_IMAGE231
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 725671DEST_PATH_IMAGE093
Initiating an anonymous modification request
Figure 550538DEST_PATH_IMAGE232
Wherein
Figure DEST_PATH_IMAGE233
In order to modify the coordinates of the block where the transaction is located,
Figure 46242DEST_PATH_IMAGE234
in order to be able to use the encryption algorithm,
Figure 496815DEST_PATH_IMAGE235
a certificate of subsidy is represented and,
Figure 659943DEST_PATH_IMAGE106
is the current timestamp;
s4-2, supervision node
Figure 419826DEST_PATH_IMAGE002
Receive to
Figure DEST_PATH_IMAGE236
First, select the current timestamp
Figure 527459DEST_PATH_IMAGE108
If, if
Figure 391510DEST_PATH_IMAGE237
The message is valid, according to
Figure DEST_PATH_IMAGE238
Query local database to obtain
Figure 18932DEST_PATH_IMAGE239
Executing a decryption algorithm
Figure 575815DEST_PATH_IMAGE240
，
If it is
Figure 701903DEST_PATH_IMAGE241
If true, it indicates love course
Figure 369645DEST_PATH_IMAGE242
The message is correct for a legal user;
s4-3, after the message passes the verification, the supervision node
Figure 507365DEST_PATH_IMAGE002
Course for love
Figure 614910DEST_PATH_IMAGE124
Generating a pseudo-identity
Figure 838081DEST_PATH_IMAGE112
And issue a new certificate of subsidy
Figure 168568DEST_PATH_IMAGE113
Endorse in parallel, then supervise the node
Figure 426374DEST_PATH_IMAGE002
Generating new transaction data
Figure 200426DEST_PATH_IMAGE115
，
Wherein
Figure 645314DEST_PATH_IMAGE116
Wherein
Figure 779492DEST_PATH_IMAGE117
Which represents the time at which the transaction was generated,
Figure 891805DEST_PATH_IMAGE118
a digital signature is represented for the transaction,
Figure 69714DEST_PATH_IMAGE119
represents a chain tag; furthermore, a supervisory node
Figure 533057DEST_PATH_IMAGE002
The coordinate of the block where the transaction to be modified is located is also provided to the consensus node
Figure 80713DEST_PATH_IMAGE120
And modifying the identity information of the request originator
Figure 437745DEST_PATH_IMAGE124
；
S4-4, identifying the node pair for transaction according to the identification mechanism
Figure 412654DEST_PATH_IMAGE121
After the verification is passed, according to
Figure 973079DEST_PATH_IMAGE243
And
Figure 324426DEST_PATH_IMAGE124
quickly inquiring the transaction to be modified and then sending the transaction to be modified
Figure 411331DEST_PATH_IMAGE012
Is replaced by
Figure 947354DEST_PATH_IMAGE121
Recalculating the value of merkleroot
Figure 854131DEST_PATH_IMAGE122
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 117491DEST_PATH_IMAGE123
the value of (d) remains unchanged, so the dark chain maintains the integrity of the subsidized chain; if it is
Figure 324481DEST_PATH_IMAGE123
If the block is also changed, the block is indicated to be subjected to unauthorized tampering;
s4-5 similarly, if love course
Figure 765827DEST_PATH_IMAGE124
The supervision node sends a modification request to want to be named again
Figure 159899DEST_PATH_IMAGE114
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 118628DEST_PATH_IMAGE001
Finish the dream, or need no more subsidization, want to cancel the dream issueWhen recording is distributed, a deletion request is firstly initiated, the request content comprises personal information and the height of the dream chain where the personal information is located, and a supervision node
Figure 789911DEST_PATH_IMAGE114
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 543104DEST_PATH_IMAGE001
Initiating a delete request
Figure 549106DEST_PATH_IMAGE125
Wherein
Figure 780367DEST_PATH_IMAGE126
The height of the dream block is the height of the dream block,
Figure 804693DEST_PATH_IMAGE127
a timestamp of the current request;
s5-2, supervision node
Figure 994366DEST_PATH_IMAGE002
Reception of Zhang Ming
Figure 487664DEST_PATH_IMAGE001
After the sent deleting request, the current time is selected first
Figure 522616DEST_PATH_IMAGE128
If, if
Figure 902913DEST_PATH_IMAGE129
If the request is valid, then the uplink query obtains the transaction data
Figure 997908DEST_PATH_IMAGE130
，
Computing
Figure 978502DEST_PATH_IMAGE131
If, if
Figure 285987DEST_PATH_IMAGE132
If yes, the identity of the person to be helped is credible; otherwise, the person is illegal or
Figure 364799DEST_PATH_IMAGE133
If the value is subject to unauthorized tampering, the session is terminated;
s5-3, Benzhangming
Figure 630696DEST_PATH_IMAGE001
When the identity verification passes, the node is supervised
Figure 583739DEST_PATH_IMAGE114
Generating new transaction data
Figure 226073DEST_PATH_IMAGE134
Broadcasting, and providing the height of the block to be modified
Figure 830230DEST_PATH_IMAGE244
；
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 532607DEST_PATH_IMAGE136
Is replaced by
Figure 471482DEST_PATH_IMAGE137
And recalculated
Figure 651927DEST_PATH_IMAGE138
Due to this value change, for the dream chain, the latter block
Figure DEST_PATH_IMAGE245
Current block stored therein
Figure 845011DEST_PATH_IMAGE246
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 452710DEST_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 380346DEST_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 364482DEST_PATH_IMAGE141
The consensus node of the bit participates in consensus, each time
Figure DEST_PATH_IMAGE247
And (5) when the hour changes, reorganizing the election voting. Get without loss of generality
Figure 677652DEST_PATH_IMAGE248
。
The consensus mechanism in the invention is a practical Byzantine fault-tolerant mechanism based on multi-factor voting, and the consensus nodes are a sponsor and a helped person; issuing transactions or modifying transactions on the chain requires obtaining consensus of consensus nodes, which are matched by comprehensive computationDegree of rotationSDSubsidy limitSACredit rating of the sponsorCSThree-factor voting before rank selection
Figure 564574DEST_PATH_IMAGE141
The consensus node of the bit participates in consensus, each time
Figure 369719DEST_PATH_IMAGE142
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 891968DEST_PATH_IMAGE114
Writing the subsidized transaction information into the founding block; the key generation center KGC distributes independent block chain addresses to each node
Figure 325223DEST_PATH_IMAGE143
Private key
Figure 540304DEST_PATH_IMAGE144
And public key
Figure 176952DEST_PATH_IMAGE145
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 502892DEST_PATH_IMAGE146
For newly-added love course company
Figure 790653DEST_PATH_IMAGE249
Credit awarding score
Figure 911056DEST_PATH_IMAGE147
(percentile), read love course company
Figure 690793DEST_PATH_IMAGE249
Certificate of subsidization of
Figure 928746DEST_PATH_IMAGE250
Recording the subsidy value of the online course resource provided by the online course resource according to the market price
Figure 946380DEST_PATH_IMAGE149
(in thousand yuan), calculate subsidized matching score
Figure 627897DEST_PATH_IMAGE150
If the subsidizing type of the subsidizing node is consistent with the type required by the dreams, then
Figure 363772DEST_PATH_IMAGE251
And on the contrary,
Figure 641301DEST_PATH_IMAGE252
at this time, the subsidized matching degree of love courses is 1;
s6-3, when entering into the voting time, the supervision node
Figure 44600DEST_PATH_IMAGE253
Calculating the comprehensive score of the election node without loss of generality
Figure DEST_PATH_IMAGE254
，
Wherein the content of the first and second substances,
Figure 365860DEST_PATH_IMAGE255
before selecting scores to rank
Figure DEST_PATH_IMAGE256
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 437633DEST_PATH_IMAGE155
Within the time, the consensus nodes sequentially act as the main nodes according to the ranking; master nodeSPSubsidized transaction to be validated
Figure 909066DEST_PATH_IMAGE156
Packing the information into a block, generating
Figure 25927DEST_PATH_IMAGE157
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 924612DEST_PATH_IMAGE158
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 510446DEST_PATH_IMAGE159
Forwarding to other consensus nodes, and sending if overtime or disapproval
Figure 519990DEST_PATH_IMAGE160
；
S6-6, after each consensus node receives the preparation message, when the number of the received effective preparation messages is large
Figure 491357DEST_PATH_IMAGE161
(maximum number of malicious nodes)
Figure 560944DEST_PATH_IMAGE162
) Calculate approval
Figure 867029DEST_PATH_IMAGE163
And disfavor
Figure 945844DEST_PATH_IMAGE164
Determining the number of tickets in the acknowledgment message
Figure 912663DEST_PATH_IMAGE165
Value, node broadcast acknowledgement informationConfirmWhen an acknowledgement message is received
Figure 12206DEST_PATH_IMAGE166
If so, executing the request;
Figure 697265DEST_PATH_IMAGE257
；
s6-7, if the client receives
Figure 923978DEST_PATH_IMAGE168
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 10883DEST_PATH_IMAGE169
is the number of system nodes, if the maximum number of malicious nodes allowed by the system
Figure 281327DEST_PATH_IMAGE162
Then, it requires
Figure 188103DEST_PATH_IMAGE170
；
S6-8, if the malicious node is found, updating the credit score
Figure 717043DEST_PATH_IMAGE171
Wherein, in the step (A),
Figure 392875DEST_PATH_IMAGE172
and sending the credit to a third party credit facility
Figure 240745DEST_PATH_IMAGE146
(ii) a If finished
Figure 759451DEST_PATH_IMAGE173
If the node is in the round of consensus, the credit score of the node is updated to be
Figure 452600DEST_PATH_IMAGE174
。
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; the key generation center is used for initializing public parameters, generating and distributing keys and registering certificates for each member in the scheme;
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 906794DEST_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 274321DEST_PATH_IMAGE004
The supervisory node broadcasts transaction information
Figure DEST_PATH_IMAGE005
And transaction copies
Figure 188050DEST_PATH_IMAGE004
Consensus jointPoint-to-point transaction information based on consensus mechanisms
Figure 994332DEST_PATH_IMAGE003
And transaction copies
Figure 333741DEST_PATH_IMAGE004
Performing verification and sending the verified transaction information
Figure 809853DEST_PATH_IMAGE005
And transaction copies
Figure 742037DEST_PATH_IMAGE004
Writing a dream block; wherein the content of the first and second substances,
Figure 352010DEST_PATH_IMAGE003
containing personal real information of a sponsor
Figure 256512DEST_PATH_IMAGE001
And
Figure 559317DEST_PATH_IMAGE006
，
Figure 415016DEST_PATH_IMAGE004
being a copy of the transaction and not containing both strings, the transaction
Figure 828680DEST_PATH_IMAGE003
And transaction copies
Figure 322109DEST_PATH_IMAGE004
The two hash roots are obtained by respectively hashing, correspondingly, two hash values of a previous block are stored in a block head, and the blocks are linked by a light chain and a dark chain and used for modifying the content of the block chain, so that the block chain structure can still be ensured not to be damaged;
s3, constructing a subsidy block to form a vertical chain in the matrix alliance chain; help people
Figure DEST_PATH_IMAGE007
Finish the person who is helped
Figure 202340DEST_PATH_IMAGE001
After the subsidization, acquiring the subsidized certificate issued and endorsed by the supervision node
Figure 171433DEST_PATH_IMAGE008
Supervision node broadcasts subsidized transactions
Figure 998575DEST_PATH_IMAGE009
And transactional copies thereof
Figure DEST_PATH_IMAGE010
The consensus node proceeds with the subsidized transaction according to the consensus mechanism
Figure 704101DEST_PATH_IMAGE009
And transactional copies thereof
Figure 551971DEST_PATH_IMAGE010
Performing verification and subsidizing the transaction after verification
Figure 680464DEST_PATH_IMAGE009
And transactional copies thereof
Figure 639193DEST_PATH_IMAGE010
Storing the data into a transaction pool; the main consensus node is based on the person under investigationIDAnd the subsidized type will fund the transaction
Figure 903952DEST_PATH_IMAGE009
And copies
Figure 594827DEST_PATH_IMAGE010
Packing into blocks, broadcasting to a blockchain network, verifying correctness of the blocks from consensus nodes and votingTicket number exceeding threshold
Figure 538513DEST_PATH_IMAGE011
The chain can be wound; wherein the transaction copies
Figure 471571DEST_PATH_IMAGE010
Does not include the personal related information of the sponsor
Figure 184312DEST_PATH_IMAGE007
And
Figure DEST_PATH_IMAGE012
to trade
Figure 46089DEST_PATH_IMAGE009
And transaction copies
Figure 352437DEST_PATH_IMAGE010
The two hash roots are obtained by respectively hashing, correspondingly, two hash values of a previous block are stored in a block head, and the blocks are linked by a light chain and a dark chain and used for modifying the content of the block chain, so that the block chain structure can still be ensured not to be damaged;
s4 qualified person
Figure 449706DEST_PATH_IMAGE007
When the subsidy information is wanted to be hidden, the subsidy person sends out a transaction modification request to supervise the node
Figure 157899DEST_PATH_IMAGE013
After receiving the request, quickly positioning the coordinates of the block where the transaction is located
Figure DEST_PATH_IMAGE014
Height is the block height of the transverse chain corresponding to the block, and depth is the block height of the longitudinal chain corresponding to the block; after verifying the identity of the sponsor, a pseudo-identity is generated for the sponsor
Figure 960550DEST_PATH_IMAGE015
And issuing a new certificate of subsidy
Figure DEST_PATH_IMAGE016
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 285353DEST_PATH_IMAGE001
When wanting to hide the subsidized information, the person to be subsidized
Figure 186312DEST_PATH_IMAGE001
After the subsidization is accepted, initiating a request for deleting the subsidization release and supervising the node
Figure 483433DEST_PATH_IMAGE017
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 483750DEST_PATH_IMAGE017
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 DEST_PATH_IMAGE018
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 528804DEST_PATH_IMAGE019
s1-2, inputting safety parameters
Figure DEST_PATH_IMAGE020
Selecting addition cycle groups
Figure 639979DEST_PATH_IMAGE021
And multiplication loop group
Figure DEST_PATH_IMAGE022
And is and
Figure 322765DEST_PATH_IMAGE023
，
Figure DEST_PATH_IMAGE024
is composed of
Figure 228404DEST_PATH_IMAGE020
The large prime number of bits is the number of bits,
Figure 855694DEST_PATH_IMAGE025
into a group
Figure 269096DEST_PATH_IMAGE021
And define such a bilinear map
Figure DEST_PATH_IMAGE026
：
Figure 478491DEST_PATH_IMAGE027
；
S1-3, selecting random number at random by key generation center
Figure 882928DEST_PATH_IMAGE028
As a system master key, andcalculate its public key as
Figure DEST_PATH_IMAGE029
Defining 6 secure hash functions, which are respectively:
Figure 574678DEST_PATH_IMAGE030
and a pair of encryption and decryption algorithms
Figure DEST_PATH_IMAGE031
，
Figure 496498DEST_PATH_IMAGE032
Disclosure of system parameters
Figure DEST_PATH_IMAGE033
And is recorded on the block chain,
Figure 419454DEST_PATH_IMAGE034
display module
Figure DEST_PATH_IMAGE035
The multiplicative group of the remaining class ring of (c),
Figure 666896DEST_PATH_IMAGE036
which represents the public key(s),
Figure DEST_PATH_IMAGE037
indicating indefinite length
Figure 191417DEST_PATH_IMAGE038
A string of bits is then transmitted through the bit string,
Figure DEST_PATH_IMAGE039
to represent
Figure 182506DEST_PATH_IMAGE040
Of a long bit length
Figure 553445DEST_PATH_IMAGE038
A bit string;
s1-4, the key generation center provides the identity character string according to each participated user
Figure DEST_PATH_IMAGE041
Computing
Figure 643892DEST_PATH_IMAGE042
，
Figure DEST_PATH_IMAGE043
，
Figure 201912DEST_PATH_IMAGE044
，
Figure DEST_PATH_IMAGE045
And an
Figure 495228DEST_PATH_IMAGE046
Wherein, in the step (A),
Figure DEST_PATH_IMAGE047
is a public and private key pair of a user,
Figure 127197DEST_PATH_IMAGE048
for the user block chain public key address,
Figure DEST_PATH_IMAGE049
is the user's registration certificate, is generated by the private key signature of the key generation center,
Figure 716442DEST_PATH_IMAGE050
in order to be the registration number,
Figure DEST_PATH_IMAGE051
as a universal hash functionThen through a secure channel will
Figure 699441DEST_PATH_IMAGE052
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 2, wherein the specific content of S2 is:
s2-1, the person of interest
Figure 999710DEST_PATH_IMAGE001
Packaging personal registration information, dream content and type generating messages
Figure DEST_PATH_IMAGE053
And calculating the digital signature thereof
Figure 486186DEST_PATH_IMAGE054
Wherein, in the step (A),
Figure DEST_PATH_IMAGE055
sending messages for current timestamps
Figure 511911DEST_PATH_IMAGE056
To a blockchain network;
s2-2, supervision node
Figure 310103DEST_PATH_IMAGE017
Receiving the person to be helped
Figure 712265DEST_PATH_IMAGE001
Message
Figure DEST_PATH_IMAGE057
Then, first, the current timestamp is selected
Figure 551783DEST_PATH_IMAGE058
Definition of
Figure DEST_PATH_IMAGE059
Is the effective difference between the timestamp of the message and the timestamp of the received message, if
Figure 748409DEST_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 DEST_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 643684DEST_PATH_IMAGE017
Packing the patrons according to the trading format of the dream blocks
Figure 583958DEST_PATH_IMAGE001
Submitted information and generating a transaction copy, as follows:
Figure 638502DEST_PATH_IMAGE062
Figure DEST_PATH_IMAGE063
；
wherein the content of the first and second substances,
Figure 510424DEST_PATH_IMAGE005
containing personal real information of a sponsor
Figure 892995DEST_PATH_IMAGE001
And
Figure 964856DEST_PATH_IMAGE064
，
Figure 749273DEST_PATH_IMAGE004
to trade a copy, not including both strings,
Figure DEST_PATH_IMAGE065
is the signature of the supervising node on the transaction,
Figure 22122DEST_PATH_IMAGE066
the time is generated for the transaction,
Figure DEST_PATH_IMAGE067
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 187262DEST_PATH_IMAGE017
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 797235DEST_PATH_IMAGE067
The label is written into the dream block and an index list is established
Figure 498475DEST_PATH_IMAGE068
Saved as down-link data to a local database, wherein
Figure DEST_PATH_IMAGE069
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 145488DEST_PATH_IMAGE070
、
Figure DEST_PATH_IMAGE071
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 96126DEST_PATH_IMAGE072
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE073
which represents the current block of the video stream,
Figure 414850DEST_PATH_IMAGE074
two hash values representing the previous block,
Figure DEST_PATH_IMAGE075
a random number representing the current block is generated,
Figure 705017DEST_PATH_IMAGE076
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 3, wherein the specific steps of S3 are:
s3-1, sponsor
Figure 54090DEST_PATH_IMAGE007
Finish the person who is helped
Figure 23183DEST_PATH_IMAGE001
Funds transfer or service to a blockchain address of the mobile station, generating subsidy information
Figure DEST_PATH_IMAGE077
To supervision node
Figure 381483DEST_PATH_IMAGE017
Sending a generate funding certificate request
Figure 759112DEST_PATH_IMAGE078
，
Wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE079
the presentation of the sponsored content is performed,
Figure 544666DEST_PATH_IMAGE080
representing an encryption algorithm, the supervisory node executing a decryption algorithm upon receipt of a request
Figure DEST_PATH_IMAGE081
To obtain
Figure 142000DEST_PATH_IMAGE082
If and subsidizing the message
Figure DEST_PATH_IMAGE083
Is directly formed by
Figure 303991DEST_PATH_IMAGE084
Calculated value
Figure 162226DEST_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 876936DEST_PATH_IMAGE087
Generating time for the certificate and endorsing;
s3-2, supervision node
Figure 695987DEST_PATH_IMAGE017
Generating transactions according to the transaction format of the funded block
Figure 989565DEST_PATH_IMAGE009
And copies of transactions
Figure 577672DEST_PATH_IMAGE010
And broadcast to the whole network, verified by the consensus node according to the consensus mechanism, and in addition, the supervision node
Figure 564083DEST_PATH_IMAGE017
And also provide subsidized objects
Figure 870431DEST_PATH_IMAGE001
Related information of
Figure DEST_PATH_IMAGE088
For block positioning;
Figure 872759DEST_PATH_IMAGE089
，
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE090
transaction copy
Figure 846532DEST_PATH_IMAGE010
Does not include the personal related information of the sponsor
Figure 3843DEST_PATH_IMAGE007
，
Figure 594225DEST_PATH_IMAGE012
，
Figure 104972DEST_PATH_IMAGE091
Representing the supervisory node's signature on the transaction,
Figure DEST_PATH_IMAGE092
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 697365DEST_PATH_IMAGE093
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 25578DEST_PATH_IMAGE009
And copies
Figure 40938DEST_PATH_IMAGE010
Is deposited into a transaction pool and then will
Figure DEST_PATH_IMAGE094
To the same person under charge within a period of time
Figure 152114DEST_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 693954DEST_PATH_IMAGE011
Then, calculate the index
Figure 68434DEST_PATH_IMAGE095
Positioning
Figure 430146DEST_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 As such, subsidizeTwo merkleroot values are stored in the block data structure of the chain, and are respectively
Figure DEST_PATH_IMAGE096
And
Figure 312389DEST_PATH_IMAGE097
and two hash values of the previous block, 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 4, wherein the specific steps of S4 are:
s4-1, sponsor
Figure DEST_PATH_IMAGE098
Initiating an anonymous modification request
Figure 380839DEST_PATH_IMAGE099
Wherein
Figure DEST_PATH_IMAGE100
In order to modify the coordinates of the block where the transaction is located,
Figure 457379DEST_PATH_IMAGE101
in order to be able to use the encryption algorithm,
Figure DEST_PATH_IMAGE102
a certificate of subsidy is represented and,
Figure 978490DEST_PATH_IMAGE103
is the current timestamp;
s4-2, supervision node
Figure DEST_PATH_IMAGE104
Receive to
Figure 670284DEST_PATH_IMAGE105
First, select the current timestamp
Figure DEST_PATH_IMAGE106
If, if
Figure 593240DEST_PATH_IMAGE107
The message is valid, according to
Figure DEST_PATH_IMAGE108
Query local database to obtain
Figure 840682DEST_PATH_IMAGE109
Executing a decryption algorithm
Figure DEST_PATH_IMAGE110
，
If it is
Figure 849089DEST_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 338714DEST_PATH_IMAGE104
For the person of interest
Figure 850598DEST_PATH_IMAGE113
Generating a pseudo-identity
Figure DEST_PATH_IMAGE114
And issue a new certificate of subsidy
Figure 268941DEST_PATH_IMAGE115
Endorse in parallel, then supervise the node
Figure DEST_PATH_IMAGE116
Generating new transaction data
Figure 499065DEST_PATH_IMAGE117
Wherein
Figure DEST_PATH_IMAGE118
Wherein
Figure 792381DEST_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 424351DEST_PATH_IMAGE121
represents a chain tag; furthermore, a supervisory node
Figure 810333DEST_PATH_IMAGE104
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 793332DEST_PATH_IMAGE113
；
S4-4, identifying the node pair for transaction according to the identification mechanism
Figure 719700DEST_PATH_IMAGE123
After the verification is passed, according to
Figure DEST_PATH_IMAGE124
And
Figure 206176DEST_PATH_IMAGE113
quickly inquiring the transaction to be modified and then sending the transaction to be modified
Figure 199278DEST_PATH_IMAGE125
Is replaced by
Figure 997469DEST_PATH_IMAGE123
Recalculating the value of merkleroot
Figure DEST_PATH_IMAGE126
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 868474DEST_PATH_IMAGE127
the value of (d) remains unchanged, so the dark chain maintains the integrity of the subsidized chain; if it is
Figure DEST_PATH_IMAGE128
If the block is also changed, the block is indicated to be subjected to unauthorized tampering;
s4-5, qualified person
Figure 740615DEST_PATH_IMAGE113
When the real name is needed again, a modification request is sent, and the node is monitored
Figure 406082DEST_PATH_IMAGE104
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 5, wherein the specific steps of S5 are:
s5-1, the person of interest
Figure 425991DEST_PATH_IMAGE129
Initiating deletionRemove request
Figure DEST_PATH_IMAGE130
Wherein
Figure 882378DEST_PATH_IMAGE131
The height of the dream block is the height of the dream block,
Figure DEST_PATH_IMAGE132
a timestamp of the current request;
s5-2, supervision node
Figure 343447DEST_PATH_IMAGE133
Person receiving the information
Figure 914236DEST_PATH_IMAGE001
After the sent deleting request, the current time is selected first
Figure DEST_PATH_IMAGE134
If, if
Figure 93545DEST_PATH_IMAGE135
If the request is valid, then the uplink query obtains the transaction data
Figure 368669DEST_PATH_IMAGE136
Computing
Figure DEST_PATH_IMAGE137
If, if
Figure 182779DEST_PATH_IMAGE138
If yes, the identity of the person to be helped is credible; otherwise, the person is illegal or
Figure DEST_PATH_IMAGE139
If the value is subject to unauthorized tampering, the session is terminated;
s5-3, qualified person
Figure 721207DEST_PATH_IMAGE001
When the identity verification passes, the node is supervised
Figure 715708DEST_PATH_IMAGE104
Generating new transaction data
Figure 466626DEST_PATH_IMAGE140
Broadcasting, and providing the height of the block to be modified
Figure DEST_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 902287DEST_PATH_IMAGE142
Is replaced by
Figure DEST_PATH_IMAGE143
And recalculated
Figure 844573DEST_PATH_IMAGE144
。
7. The subsidizing method of concealable real names based on the matrix alliance chain as claimed in claim 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 DEST_PATH_IMAGE145
The consensus node of the bit participates in consensus, each time
Figure 998474DEST_PATH_IMAGE146
And (5) when the hour changes, 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 677717DEST_PATH_IMAGE133
Writing the subsidized transaction information into the founding block; the key generation center KGC distributes independent block chain addresses to each node
Figure DEST_PATH_IMAGE147
Private key
Figure 967884DEST_PATH_IMAGE148
And public key
Figure DEST_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 582536DEST_PATH_IMAGE150
To newly joined subsidized node
Figure 925530DEST_PATH_IMAGE007
Credit awarding score
Figure DEST_PATH_IMAGE151
(ii) a Supervision node
Figure 549410DEST_PATH_IMAGE133
Reading sponsoring nodes
Figure 287558DEST_PATH_IMAGE007
Certificate of subsidization of
Figure 807533DEST_PATH_IMAGE152
Recording the subsidy value of the node
Figure DEST_PATH_IMAGE153
According to the type of subsidizationtypeCalculating subsidized matching degree score
Figure 670446DEST_PATH_IMAGE154
；
S6-3, when entering into the voting time, the supervision node
Figure 425913DEST_PATH_IMAGE133
Calculating a composite score for the election node
Figure DEST_PATH_IMAGE155
(ii) a Wherein the content of the first and second substances,
Figure 195067DEST_PATH_IMAGE156
，
Figure DEST_PATH_IMAGE157
is to
Figure 620363DEST_PATH_IMAGE158
The result of the normalization processing is selected before the grade sorting
Figure 298469DEST_PATH_IMAGE145
The node of the bit acts as a consensus node;
s6-4, first consensusAfter the node is produced, at
Figure DEST_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 264151DEST_PATH_IMAGE160
Packing the information into a block, generating
Figure DEST_PATH_IMAGE161
And 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 383417DEST_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, confirming the message
Figure DEST_PATH_IMAGE163
Sending to other consensus nodes, and sending if overtime or disapproval
Figure 540466DEST_PATH_IMAGE164
；
S6-6, after each consensus node receives the preparation message, when the number of the received effective preparation messages is large
Figure DEST_PATH_IMAGE165
Wherein
Figure 377972DEST_PATH_IMAGE166
Calculating approval for the maximum number of malicious nodes
Figure DEST_PATH_IMAGE167
And disfavor
Figure 616187DEST_PATH_IMAGE168
Determining the number of tickets in the acknowledgment message
Figure DEST_PATH_IMAGE169
Value, node broadcast acknowledgement informationConfirmWhen an acknowledgement message is received
Figure 589959DEST_PATH_IMAGE170
If so, executing the request;
Figure DEST_PATH_IMAGE171
；
s6-7, if the client receives
Figure 652331DEST_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 DEST_PATH_IMAGE173
is the number of system nodes, if the maximum number of malicious nodes allowed by the system is
Figure 711553DEST_PATH_IMAGE166
Then, it requires
Figure 487880DEST_PATH_IMAGE174
；
S6-8, if the malicious node is found, updating the credit score
Figure DEST_PATH_IMAGE175
Wherein, in the step (A),
Figure 581737DEST_PATH_IMAGE176
and sending the credit to a third party credit facility
Figure 909951DEST_PATH_IMAGE150
(ii) a If it is finished
Figure DEST_PATH_IMAGE177
If the node is in the round of consensus, the credit score of the node is updated to be
Figure 627109DEST_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 CN113781073A (en) 2021-12-10
CN113781073B true 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)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113988849B (en) * 2021-11-02 2024-05-17 山东大学 System and method for modifying traceable modifiable blockchain
CN113781073B (en) * 2021-11-10 2022-03-04 南京邮电大学 Subsidizing method capable of hiding real names based on matrix alliance chain
CN116436979B (en) * 2023-06-15 2023-08-11 湖南湘江树图信息科技创新中心有限公司 Method and system for invoking external services by alliance block chain
CN116701549A (en) * 2023-06-21 2023-09-05 黑龙江禹桥科技开发有限公司 Big data multi-scale fusion supervision system and method based on blockchain
CN116980189B (en) * 2023-07-19 2024-06-28 苏州大学 Malicious node detection method for sharded alliance chain
CN116846916B (en) * 2023-09-01 2023-12-08 武汉趣链数字科技有限公司 Data synchronization method, device, electronic equipment and computer readable storage medium

Citations (5)

* 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
CN111831747A (en) * 2020-06-24 2020-10-27 西安纸贵互联网科技有限公司 Charitable donation service system and charitable donation service platform
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 (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111654363B (en) * 2020-06-18 2023-12-29 福建师范大学 Group signature and homomorphic encryption-based alliance chain privacy protection method
CN111988290B (en) * 2020-08-05 2022-10-14 上海交通大学 Transaction deletion method and system under user balance privacy protection and authorization supervision
CN113781073B (en) * 2021-11-10 2022-03-04 南京邮电大学 Subsidizing method capable of hiding real names based on matrix alliance chain

Patent Citations (5)

* 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
CN111831747A (en) * 2020-06-24 2020-10-27 西安纸贵互联网科技有限公司 Charitable donation service system and charitable donation service platform
CN112100667A (en) * 2020-09-24 2020-12-18 南京邮电大学 Charity organization supervision and management method based on novel block chain structure

Also Published As

Publication number Publication date
CN113781073A (en) 2021-12-10
WO2023082690A1 (en) 2023-05-19

Similar Documents

Publication Publication Date Title
CN113781073B (en) Subsidizing method capable of hiding real names based on matrix alliance chain
Hanifatunnisa et al. Blockchain based e-voting recording system design
CN109785494B (en) Traceable anonymous electronic voting method based on block chain
Wang et al. A blockchain based privacy-preserving incentive mechanism in crowdsensing applications
US11481768B2 (en) System and method of generating and validating encapsulated cryptographic tokens based on multiple digital signatures
CN108650077B (en) Block chain based information transmission method, terminal, equipment and readable storage medium
US10410213B2 (en) Encapsulated security tokens for electronic transactions
CN109417549A (en) The method and apparatus of information proof is provided using centralization or distributed ledger
Ma et al. Blockchain-based mechanism for fine-grained authorization in data crowdsourcing
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
CN112199448A (en) Industrial and commercial registration method and system based on block chain
CN114549194A (en) Right asset management service platform based on block chain and implementation method thereof
WO2018088475A1 (en) Electronic authentication method and program
CN109919614A (en) A kind of method for protecting intelligent contract privacy using zero-knowledge proof in block chain
Jonathan et al. Security issues and vulnerabilities on a blockchain system: A review
US20240187259A1 (en) Method and apparatus for generating, providing and distributing a trusted electronic record or certificate based on an electronic document relating to a user
Sliusar et al. Blockchain technology application for electronic voting systems
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
CN114169888A (en) Universal type multi-signature supporting encryption currency custody method
Bizarro et al. Blockchain Explained and Implications for Accountancy
Ramya et al. A Hybrid Proof of Stake-Trust Block Chain Model in Pervasive Social Networking for E-voting System

Legal Events

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