WO2023070831A1 - Procédé et dispositif de confirmation de bloc - Google Patents

Procédé et dispositif de confirmation de bloc Download PDF

Info

Publication number
WO2023070831A1
WO2023070831A1 PCT/CN2021/135349 CN2021135349W WO2023070831A1 WO 2023070831 A1 WO2023070831 A1 WO 2023070831A1 CN 2021135349 W CN2021135349 W CN 2021135349W WO 2023070831 A1 WO2023070831 A1 WO 2023070831A1
Authority
WO
WIPO (PCT)
Prior art keywords
priority
transaction
nodes
blockchain
decrypted
Prior art date
Application number
PCT/CN2021/135349
Other languages
English (en)
Chinese (zh)
Inventor
李昊轩
严强
王朝阳
廖飞强
贺双洪
李辉忠
张开翔
范瑞彬
Original Assignee
深圳前海微众银行股份有限公司
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 深圳前海微众银行股份有限公司 filed Critical 深圳前海微众银行股份有限公司
Publication of WO2023070831A1 publication Critical patent/WO2023070831A1/fr

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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management

Definitions

  • Embodiments of the present invention relate to the field of financial technology (Fintech), and in particular to a block confirmation method and device.
  • Fetech financial technology
  • each blockchain node in the blockchain network competes to complete the block confirmation process through computing power. Specifically, by setting up a proof-of-work mechanism to determine which node in the blockchain network will complete the block confirmation process, that is, to determine which node will perform the block operation and send the block As a block on the chain. Among them, the relationship between each blockchain node in the blockchain network is equal, and they all participate in the process of competing block confirmation with an equal identity, and the computing power of each blockchain node is the same.
  • the proof-of-work mechanism is to hash a certain transaction in the respective transaction pool with a random number generated by itself, requiring the first number of digits of the calculated hash value to be 0, such as the first 6 digits is 0, that is, 000000. Then, each blockchain node in the blockchain network performs relevant hash operations according to the proof-of-work mechanism, and keeps looking for random numbers that meet the requirements. If a certain blockchain node finds out a random number that meets the requirements, The transaction, random number and hash value can be uploaded to the chain so that other blockchain nodes in the blockchain network can perform consensus verification. Other blockchain nodes only need to add the random number to the transaction for hashing.
  • Embodiments of the present invention provide a block confirmation method and device, which are used to complete the process of block confirmation through priority nodes first, so as to effectively improve the efficiency of block chaining.
  • the embodiment of the present invention provides a block confirmation method, which is applicable to a block chain network with m block chain nodes, and the method includes:
  • the client determines k blockchain nodes from the m blockchain nodes as priority nodes;
  • the client generates a first confusion factor based on the public keys of the k priority nodes
  • the client generates a first priority commitment based on the first confusion factor and the transaction
  • the client generates a first priority transaction based on the first priority commitment and a hash value of the transaction, and sends the first priority transaction to the blockchain network.
  • the technical solution in the present invention designates some blockchain nodes as priority nodes, so that when the computing capabilities of each blockchain node in the blockchain network are the same or close to each other, the priority nodes designated by the client have a great Probability can be the first to complete the block confirmation process, so it can save the time spent in the block confirmation process, thereby effectively improving the efficiency of block chaining.
  • the client can determine k blockchain nodes as priority nodes from the m blockchain nodes, and generate the first confusion factor based on the public keys of the k priority nodes.
  • the first priority transaction is sent to the block chain network, and a block chain node (such as a priority node) in the block chain network can take the lead in recovering the transaction through the first priority commitment in the first priority transaction.
  • a block chain node such as a priority node
  • the priority node Even if the computing power of each blockchain node is different, the priority node has a great probability to be the first to pass the first priority in the first priority transaction. Promise to restore the transaction, so as to quickly complete the block confirmation process, which can effectively improve the efficiency of block chaining.
  • the client since the client does not directly send the transaction to the blockchain network, but uses the first obfuscation factor to obfuscate the transaction, and sends the hash value of the transaction and the first priority commitment obtained after the obfuscation to Blockchain network, so the risk of transaction data leakage can be avoided, which can help ensure the privacy and security of transaction data.
  • the client generates a first confusion factor based on the public keys of the k priority nodes, including:
  • the public keys of the k priority nodes are generated through a bilinear mapping algorithm to generate the first confusion factor
  • the client generates a first priority transaction based on the first priority commitment and the hash value of the transaction, including:
  • the client performs a hash operation on the transaction to generate a hash value of the transaction
  • the client generates the first priority transaction according to the first priority commitment and the hash value of the transaction.
  • this solution adopts Set different numbers of priority nodes to specify the process of completing block confirmation with a high probability through the priority nodes.
  • the number k of priority nodes specified by the client is 2
  • the public keys of the two priority nodes are used to generate the first confusion factor through the bilinear mapping algorithm, and the first confusion factor is used to confuse the The transaction to be processed, that is, the first priority commitment generated by the first confusion factor and the transaction.
  • the first priority transaction corresponding to when the number k of designated priority nodes is 2 is generated through the first priority commitment and the hash value of the transaction.
  • the first priority commitment is used as a voucher for each blockchain node consensus to confirm the transaction, and a certain blockchain node (such as a priority node) in the blockchain network can first decrypt the transaction through the first priority commitment, In this way, under the premise of ensuring that a certain transaction that the client needs to process is not disclosed, only a certain blockchain node in the blockchain network can first decrypt the transaction through the first priority commitment, thereby preventing the transaction from being tampered with or be stolen.
  • the client generates a first confusion factor based on the public keys of the k priority nodes, including:
  • the client determines a first priority placeholder based on an elliptic curve, and passes the first priority placeholder and the public keys of the k priority nodes through a double line A property mapping algorithm that generates the first confusion factor;
  • the client generates a first priority transaction based on the first priority commitment and the hash value of the transaction, including:
  • the client performs a hash operation on the transaction to generate a hash value of the transaction
  • the client generates the first priority transaction according to the first priority commitment, the first priority placeholder, and the hash value of the transaction.
  • the first priority placeholder is determined through the elliptic curve, and the first priority placeholder is used as A priority node is the dot field element of the cooperative operation in the bilinear mapping algorithm. Then the public key of one priority node and the first priority placeholder are used to generate the first confusion factor through the bilinear mapping algorithm, and the first confusion factor is used to confuse the transaction that the client needs to process, that is, through the first A confounding factor and the transaction generate the first priority commitment. Then, the first priority transaction corresponding to when the number k of designated priority nodes is 1 is generated through the first priority commitment and the hash value of the transaction.
  • the first priority commitment is used as a voucher for each blockchain node consensus to confirm the transaction, and a certain blockchain node (such as a priority node) in the blockchain network can first decrypt the transaction through the first priority commitment, In this way, under the premise of ensuring that a certain transaction that the client needs to process is not disclosed, only a certain blockchain node in the blockchain network can first decrypt the transaction through the first priority commitment, thereby preventing the transaction from being tampered with or be stolen.
  • the client determines two unequal second priority placeholders and third priority placeholders based on elliptic curves, and uses the second priority placeholder and the third priority placeholder
  • the third priority placeholder generates a second confusion factor through a bilinear mapping algorithm
  • the client generates a second priority commitment based on the second confusion factor and the transaction
  • the client generates the second priority transaction according to the second priority commitment, the second priority placeholder, the third priority placeholder, and the hash value of the transaction, and sends the A second priority transaction is sent to the blockchain network.
  • the client when the number k of priority nodes designated by the client is 0, that is, the client does not designate a priority node. At this time, in order not to let others easily know whether the client has designated priority nodes or not The number of priority nodes specified by the client is used to better conceal the identity of the priority nodes, and in order to cooperate with the dot field operation in the bilinear mapping algorithm, it will be realized by generating two unequal priority placeholders. Specifically, two unequal second priority placeholders and third priority placeholders are determined through elliptic curves, and the second priority placeholder and the third priority placeholder are used as double The dot-field element of the fit operation in the linear mapping algorithm.
  • the second priority commitment is used as a voucher for each blockchain node consensus to confirm the transaction, and a certain blockchain node (such as a priority node) in the blockchain network can first decrypt the transaction through the second priority commitment, In this way, under the premise of ensuring that a certain transaction that the client needs to process is not disclosed, only a certain blockchain node in the blockchain network can first decrypt the transaction through the second priority commitment, thereby preventing the transaction from being tampered with or be stolen.
  • the client generates a first priority commitment based on the first confusion factor and the transaction, including:
  • the client uses the first confusion factor and the transaction to generate a first priority commitment through an elliptic curve dot domain multiplication algorithm.
  • the client uses the elliptic curve point field multiplication algorithm to process the first obfuscation factor and the transaction, so that the transaction can be obfuscated, and the first priority commitment that meets the requirements of not disclosing transaction information is generated, and This can avoid the risk of leakage of a certain transaction information that the client needs to process, and help ensure the privacy and security of the transaction.
  • the embodiment of the present invention provides a block confirmation method, which is suitable for a blockchain network with m blockchain nodes, and the method includes:
  • the blockchain node For any one of the m blockchain nodes, when the blockchain node detects the first priority transaction, it generates a first decrypted segment based on the private key of the blockchain node;
  • the first priority transaction is generated by the client based on the first priority commitment and the hash value of the transaction;
  • the first priority commitment is generated by the client based on the first confusion factor and the transaction;
  • the first The confusion factor is generated by the client based on the public keys of the k priority nodes determined by the client from the m blockchain nodes;
  • the blockchain node generates a first decrypted transaction according to the first decrypted fragment and the first priority commitment in the first priority transaction through a bilinear mapping algorithm
  • the block chain node When the block chain node determines that the hash value of the first decrypted transaction is equal to the hash value of the transaction in the first priority transaction, it packs the first decrypted transaction into a block and uploads it to the chain.
  • the block chain node when the block chain node detects the first priority transaction, the block chain node can try to decrypt the client through the elements contained in the first priority transaction.
  • the blockchain node generates the first decryption segment based on its own private key, and uses the first decryption segment and the first priority commitment in the first priority transaction through the bilinear mapping algorithm to generate the first decryption transaction , and then determine whether the blockchain node has successfully decrypted the transaction by judging whether the hash value of the first decrypted transaction is equal to the hash value of the transaction, so as to determine whether it is executed by the blockchain node
  • the block generation operation for the transaction that is, after other blockchain nodes successfully reach a consensus on the first decrypted transaction, the blockchain node packages the first decrypted transaction into a block and uploads it to the chain.
  • the priority node can have a great probability to be the first to pass the first priority transaction when the computing power of each blockchain node in the blockchain network is the same or close.
  • the client since the client sends to the blockchain network the hash value of the transaction and the first-priority transaction formed by the obfuscated first-priority commitment, it does not directly send the transaction to the blockchain network, so the transaction can be avoided. There is a risk of data leakage, which can help ensure the privacy and security of transaction data.
  • the blockchain node when the blockchain node detects the first priority transaction, it generates a first decrypted segment based on the private key of the blockchain node, including:
  • the private key of the block chain node is generated through a number field inversion algorithm to generate the first decryption private key
  • the block chain node obtains the public keys of the m block chain nodes from the block chain, and for the public key of any block chain node, according to the first decryption private key and the block chain
  • the public key of the node is used to generate the first decrypted fragment.
  • any blockchain node decrypts the The method used in the transaction is also different.
  • the blockchain node when k is determined to be 2 by the number of elements contained in the first priority transaction, the blockchain node adopts the transaction decryption processing method corresponding to k being 2, that is, by The public key of any blockchain node and the first decryption private key generated by its own private key to generate the first decryption segment.
  • the first decrypted fragment is used to assist the blockchain node to decrypt a first decrypted transaction, and the blockchain node will judge whether the hash value of the decrypted first decrypted transaction is equal to the hash value of the transaction To determine whether the blockchain node has successfully decrypted the transaction, and after the equality is determined, the decrypted first decrypted transaction will be packaged into a block and synchronized to other blockchain nodes for consensus verification.
  • the blockchain node when the blockchain node detects the first priority transaction, it generates a first decrypted segment based on the private key of the blockchain node, including:
  • the private key of the block chain node is generated through a number field inversion algorithm to generate a first decryption private key
  • the blockchain node obtains a first priority placeholder from the first priority transaction, and generates the first decryption segment according to the first decryption private key and the first priority placeholder.
  • the blockchain node when k is determined to be 1 by the number of elements contained in the first priority transaction, the blockchain node adopts the transaction decryption processing method corresponding to k being 1, that is, The first decryption fragment is generated by using the first decryption private key generated according to the first priority placeholder in the first priority transaction and its own private key.
  • the first decrypted fragment is used to assist the blockchain node to decrypt a first decrypted transaction, and the blockchain node will judge whether the hash value of the decrypted first decrypted transaction is equal to the hash value of the transaction To determine whether the blockchain node has successfully decrypted the transaction, and after the equality is determined, the decrypted first decrypted transaction will be packaged into a block and synchronized to other blockchain nodes for consensus verification.
  • the blockchain node When the blockchain node detects the second priority transaction, it obtains two unequal second priority placeholders and third priority placeholders from the second priority transaction; The number of elements included indicates that k is 0;
  • the block chain node generates a second decryption fragment according to the second priority placeholder and the third priority placeholder;
  • the blockchain node generates a second decrypted transaction according to the second decrypted fragment and the second priority commitment in the second priority transaction through a bilinear mapping algorithm
  • the block chain node When the block chain node determines that the hash value of the second decrypted transaction is equal to the hash value of the transaction in the second priority transaction, it packs the second decrypted transaction into a block and uploads it to the chain.
  • the blockchain node when k is determined to be 0 by the number of elements contained in the second priority transaction, the blockchain node adopts the transaction decryption processing method corresponding to k being 0, that is, Generate the second decryption fragment through the second priority placeholder and the third priority placeholder in the second priority transaction, and pass the second decryption fragment and the second priority commitment in the second priority transaction through the double line property mapping algorithm to generate a second decrypted transaction. Then, judge whether the hash value of the second decrypted transaction is equal to the hash value of the transaction to judge whether the block chain node has successfully decrypted the transaction, so as to determine whether the block chain node performs the The block production operation for this transaction.
  • the blockchain node packs the second decrypted transaction and the hash value of the second decrypted transaction into a block, and synchronizes the block to other blockchain nodes for consensus Verification, if it is determined that the consensus is successful, the block will be uploaded to the chain.
  • the block chain node determines that the hash values of the first decrypted transactions corresponding to the m block chain nodes are not equal to the hash values of the transactions in the first priority transaction, from the block chain Obtain the public keys of m block chain nodes, and for the public key of any block chain node, use the public key of the block chain node through the number field inversion algorithm to generate the first decryption public key;
  • the block chain node generates a third decrypted segment based on the first decrypted public key
  • the blockchain node generates a third decrypted transaction according to the third decrypted fragment and the first priority commitment in the first priority transaction through a bilinear mapping algorithm
  • the block chain node When the block chain node determines that the hash value of the third decrypted transaction is equal to the hash value of the transaction in the first priority transaction, it packs the third decrypted transaction into a block and uploads it to the chain.
  • any block chain node when the block chain node determines that the hash value of each first decrypted transaction corresponding to the m block chain nodes is not equal to the hash value of the transaction, it can pass another A decryption method to decrypt the transaction. That is, the blockchain node processes the public key of any blockchain node through a number field inversion algorithm, generates a first decryption public key, and generates a third decryption segment based on the first decryption public key. Then, the third decrypted transaction is generated through the third decrypted fragment and the first priority commitment in the first priority transaction.
  • the blockchain node packs the third decrypted transaction and the hash value of the third decrypted transaction into a block, and synchronizes the block to other blockchain nodes for consensus Verification, if it is determined that the consensus is successful, the block will be uploaded to the chain.
  • an embodiment of the present invention provides a block confirmation device, which is suitable for a blockchain network with m blockchain nodes, and the device includes:
  • a determination unit configured to determine k blockchain nodes from the m blockchain nodes as priority nodes for any transaction
  • the first processing unit is configured to generate a first confusion factor based on the public keys of k priority nodes; generate a first priority commitment based on the first confusion factor and the transaction; and generate a first priority commitment based on the first priority commitment and the The hash value of the transaction generates a first priority transaction, and sends the first priority transaction to the blockchain network.
  • the embodiment of the present invention provides a block confirmation device, which is suitable for a blockchain network with m blockchain nodes, and the device includes:
  • a generating unit configured to generate a first decrypted segment based on the private key of the blockchain node when a first priority transaction is detected for any one of the m blockchain nodes;
  • the first priority transaction is generated by the client based on the first priority commitment and the hash value of the transaction;
  • the first priority commitment is generated by the client based on the first confusion factor and the transaction;
  • the first confusion The factor is generated by the client based on the public keys of k priority nodes determined by the client from the m blockchain nodes;
  • the second processing unit is configured to generate a first decrypted transaction according to the first decrypted fragment and the first priority commitment in the first priority transaction through a bilinear mapping algorithm; when determining the first decrypted transaction When the hash value of is equal to the hash value of the transaction in the first priority transaction, the first decrypted transaction is packaged as a block and uploaded to the chain.
  • an embodiment of the present invention provides a computing device, including at least one processor and at least one memory, wherein the memory stores a computer program, and when the program is executed by the processor, the processing The device implements the block confirmation method described in any of the above first aspect or the above second aspect.
  • an embodiment of the present invention provides a computer-readable storage medium, which stores a computer program executable by a computing device, and when the program runs on the computing device, the computing device executes the above-mentioned first aspect or the block confirmation method described in any of the above-mentioned second aspects.
  • FIG. 1 is a schematic flow diagram of a block confirmation method provided by an embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of a block confirmation device provided by an embodiment of the present invention.
  • FIG. 3 is a schematic structural diagram of another block confirmation device provided by an embodiment of the present invention.
  • FIG. 4 is a schematic structural diagram of a computing device provided by an embodiment of the present invention.
  • Block It is the basic unit of the process blockchain, consisting of a block header containing metadata and a block body containing transaction data. Among them, the block header mainly includes the hash of the parent block.
  • a block in the blockchain consists of a block header and a block body.
  • the block header mainly includes the block height h, the hash of the previous block, etc.
  • the block body mainly stores transaction data.
  • G1 is an additive cyclic group with generator P and order p
  • G2 is a multiplicative cyclic group with the same order as G1
  • a and b are elements in Z p * (prime cyclic group of order p).
  • Elliptic curve group A group is a set of a series of elements satisfying certain algebraic operations in cryptography, and an elliptic curve group is a set of elements constructed based on elliptic curve cryptography.
  • uppercase letters such as G1 and G2 represent points on the elliptic curve, that is, point field elements, and point field elements have additive properties, such as G1+G2.
  • a lowercase letter, such as a represents a scalar, that is, an element of a number field, and an element of a number field has the properties of operations such as addition, multiplication, and power, such as a*b, a ⁇ b, a+b, etc.
  • Fig. 1 exemplarily shows the flow of a block confirmation method provided by an embodiment of the present invention, and the flow can be executed by a block confirmation device.
  • the block confirmation method is applicable to a blockchain network with m blockchain nodes.
  • the process specifically includes:
  • Step 101 for any transaction, the client determines k blockchain nodes from the m blockchain nodes as priority nodes.
  • the priority node when the client uploads a certain transaction to the blockchain network for processing, in order to realize that the computing power of each blockchain node is the same or close, the priority node can be the first to complete the block confirmation.
  • the process can be realized by the client specifying a part of blockchain nodes as priority nodes.
  • k blockchain nodes can be selected from m blockchain nodes in the blockchain network as priority nodes.
  • the client specifies priority The number of nodes is 0, 1 or 2, etc. For example, if the number of designated priority nodes is 2, the client can randomly select 2 blockchain nodes from m blockchain nodes as priority node.
  • the m blockchain nodes can be sorted according to their respective computing capabilities from large to small, and the top 2 blocks can be selected from the sorted m blockchain nodes Chain nodes act as priority nodes.
  • m and k are integers, and k ⁇ m.
  • the client when the client uploads a certain transaction to the blockchain network for processing, it can designate 2 blockchain nodes as priority nodes, then it can start from Among the 10 blockchain nodes in the blockchain network, 2 blockchain nodes are selected as priority nodes and added to the priority queue.
  • the client can designate a blockchain node as a priority node, and then select a blockchain node from the 10 blockchain nodes in the blockchain network as a priority node and add it to the priority queue.
  • the client can designate 0 blockchain nodes as priority nodes, then select 0 blockchain nodes from the 10 blockchain nodes in the blockchain network as priority nodes and add them to the priority queue.
  • Step 102 the client generates a first confusion factor based on the public keys of the k priority nodes.
  • Step 103 the client generates a first priority commitment based on the first confusion factor and the transaction.
  • Step 104 the client generates a first priority transaction based on the first priority commitment and the hash value of the transaction.
  • Step 105 the client sends the first priority transaction to the blockchain network.
  • the client determines that the number k of priority nodes is 2
  • the public keys of the k priority nodes are passed through a bilinear mapping algorithm to generate a first confusion factor, which is used to confuse the client
  • the client will not directly upload the transaction to the blockchain network, which can avoid the risk of transaction data leakage, which can help ensure the privacy and security of transaction data.
  • the first confusion factor and the transaction are passed through the elliptic curve point field multiplication algorithm to generate the first priority commitment.
  • the transaction to be processed by the client is hashed to generate the hash value of the transaction , and according to the first priority commitment and the hash value of the transaction, generate the first priority transaction, and send the first priority transaction to the blockchain network.
  • set hash algorithm such as Message-Digest Algorithm 5 (Message-Digest Algorithm 5, MD5) or SHA256 algorithm, etc.
  • the first priority commitment is used as a voucher for each blockchain node consensus to confirm the transaction, and a certain blockchain node in the blockchain network can first decrypt the transaction through the first priority commitment, so as to ensure that no leakage Under the premise of a certain transaction that the client needs to process, only a certain blockchain node in the blockchain network can first decrypt the transaction through the first priority commitment, so as to prevent the transaction from being tampered with or stolen.
  • a certain blockchain node in the blockchain network such as blockchain node 1
  • a client initiates a certain transaction (such as transaction tx), it will first select 2 blockchain nodes from the 5 blockchain nodes as priority nodes, such as selecting blockchain node 1 and blockchain node 1.
  • Node 3 is the priority node.
  • the public key of the two blockchain nodes can be obtained from the blockchain through any blockchain node in the blockchain network.
  • Node 2 sends a request to obtain the public key of blockchain node 1 and the public key of blockchain node 3.
  • blockchain node 2 After receiving the request, blockchain node 2 obtains the public key of blockchain node 1 from the blockchain pk1 and the public key pk3 of the blockchain node 3, and send the public key pk1 of the blockchain node 1 and the public key pk3 of the blockchain node 3 to the client.
  • the first priority commitment P is used as a voucher for node transaction confirmation.
  • the hash value h is used as a factor to verify the correctness of the node transaction confirmation process.
  • a first priority transaction (P, h) is generated, and the first priority transaction (P, h) is sent to the blockchain network.
  • the client determines that the number k of priority nodes is 1, it determines the first priority placeholder based on the elliptic curve, and uses the first priority placeholder and the public keys of the k priority nodes through bilinear mapping Algorithm to generate the first confusion factor, which is used to confuse the transactions that the client needs to process, so that the client will not directly upload the transaction to the blockchain network, which can avoid the risk of transaction data leakage. This can help ensure the privacy and security of transaction data. Then the first confusion factor and the transaction are passed through the elliptic curve point field multiplication algorithm to generate the first priority commitment.
  • the transaction to be processed by the client is hashed to generate the hash value of the transaction , and generate a first priority transaction according to the first priority commitment, the first priority placeholder and the hash value of the transaction, and send the first priority transaction to the blockchain network.
  • the set hash algorithm such as Message-Digest Algorithm 5 (Message-Digest Algorithm 5, MD5) or SHA256 algorithm, etc.
  • the first priority commitment is used as a voucher for each blockchain node consensus to confirm the transaction, and a certain blockchain node in the blockchain network can first decrypt the transaction through the first priority commitment, so as to ensure that no leakage Under the premise of a certain transaction that the client needs to process, only a certain blockchain node in the blockchain network can first decrypt the transaction through the first priority commitment, so as to prevent the transaction from being tampered with or stolen.
  • a client initiates a certain transaction (such as transaction tx), it will first obtain Select one blockchain node as the priority node among the nodes, for example, select blockchain node 1 as the priority node.
  • the public key of the 1 blockchain node can be obtained from the blockchain through any blockchain node in the blockchain network.
  • Node 3 sends a request to obtain the public key of blockchain node 1.
  • blockchain node 3 obtains the public key of blockchain node 1 from the blockchain and sends the blockchain node 1's public key is sent to the client.
  • the first priority commitment P is used as a voucher for node transaction confirmation.
  • the hash value h is used as a factor to verify the correctness of the node transaction confirmation process. Then, according to the first priority placeholder R, the hash value h of the transaction tx and the first priority commitment P, the first priority transaction (P, h, R) is generated, and the first priority transaction (P, h, R) sent to the blockchain network.
  • the client determines that the number k of priority nodes is 0, it determines two unequal second priority placeholders and third priority placeholders based on the elliptic curve, and uses the second priority placeholder and the third priority placeholder
  • the priority placeholder uses a bilinear mapping algorithm to generate a second confusion factor, which is used to confuse the transaction that the client needs to process, so that the client will not directly upload the transaction to the blockchain network, The risk of leakage of transaction data can be avoided, thereby helping to ensure the privacy and security of transaction data.
  • a second priority commitment is generated.
  • the transaction to be processed by the client is hashed to generate the hash value of the transaction , and generate a second priority transaction according to the second priority commitment, the second priority placeholder, the third priority placeholder and the hash value of the transaction, and send the second priority transaction to the blockchain network.
  • the set hash algorithm such as Message-Digest Algorithm 5 (Message-Digest Algorithm 5, MD5) or SHA256 algorithm, etc.
  • the second priority commitment is used as a certificate for each blockchain node to confirm the transaction by consensus, and a certain blockchain node in the blockchain network can first decrypt the transaction through the second priority commitment, so as to ensure that it is not leaked Under the premise of a certain transaction that the client needs to process, only a certain blockchain node in the blockchain network can first decrypt the transaction through the second priority commitment, so as to prevent the transaction from being tampered with or stolen.
  • a client initiates a certain transaction (such as transaction tx), it will first obtain Among the nodes, 0 blockchain nodes are selected as priority nodes, that is, the client does not specify a priority node. At this time, in order not to let others easily know whether the client has a designated priority node or not to let others easily know the number of priority nodes designated by the client, so as to better hide the identity of the priority node, and in order to cooperate with the bilinear mapping algorithm Dotfield operations in will be implemented by generating two unequal precedence placeholders.
  • the second priority placeholder Ra and the third priority placeholder Rb are used as dot field elements for cooperative operation in the bilinear mapping algorithm when there are 0 priority nodes.
  • the second priority commitment P is used as a voucher for node transaction confirmation.
  • the hash value h is used as a factor to verify the correctness of the node transaction confirmation process. Then, generate a second priority transaction (P, h, Ra, Rb) according to the second priority placeholder Ra, the third priority placeholder Rb, the hash value h of the transaction tx and the second priority commitment P, And send the second priority transaction (P, h, Ra, Rb) to the blockchain network.
  • Step 106 for any one of the m blockchain nodes, when the blockchain node detects the first priority transaction, generate a first decryption based on the private key of the blockchain node Fragmentation.
  • Step 107 the blockchain node generates a first decrypted transaction according to the first decrypted segment and the first priority commitment in the first priority transaction through a bilinear mapping algorithm.
  • Step 108 when the block chain node determines that the hash value of the first decrypted transaction is equal to the hash value of the transaction in the first priority transaction, pack the first decrypted transaction into a block for execution winding.
  • the blockchain node when the blockchain node detects the first priority transaction, the blockchain node can try to decrypt the customer A certain transaction that the terminal needs to process. Since the client can specify a different number of priority nodes, the elements contained in the generated priority transactions are also different, so any blockchain node uses the elements contained in the priority transaction to decrypt the transaction. The approach is also different.
  • any blockchain node when the blockchain node determines that k is 2 through the number of elements contained in the first priority transaction, it adopts the transaction decryption processing method corresponding to k being 2, that is, the The private key of the blockchain node generates the first decryption private key through the number field inversion algorithm, and obtains the public keys of m blockchain nodes from the blockchain, and for the public key of any blockchain node, According to the first decrypted private key and the public key of the block chain node, a first decrypted segment is generated, and the first decrypted segment is used to assist the block chain node to decrypt the first decrypted transaction.
  • the first decryption fragment and the first priority commitment in the first priority transaction through the bilinear mapping algorithm to generate the first decryption transaction, and judge whether the hash value of the first decryption transaction is consistent with the hash value of the transaction Values are equal to determine whether the blockchain node has successfully decrypted the transaction, so as to determine whether the blockchain node performs the block generation operation for the transaction. That is, after it is determined that the hash value of the first decrypted transaction is equal to the hash value of the transaction, the first decrypted transaction and the hash value of the first decrypted transaction are packaged into a block, and the block is The block is synchronized to other blockchain nodes for consensus verification. If it is determined that the consensus of other blockchain nodes is successful, the block will be uploaded to the chain.
  • a set hash algorithm such as MD5 or SHA256 algorithm
  • Step f the blockchain node 1 determines whether the hash value h' of the first decrypted transaction tx_try is equal to the hash value h of the transaction in the first priority transaction. If it is determined that they are equal, the first decrypted transaction tx_try and the hash value h' of the first decrypted transaction tx_try can be packaged into a block, and the block is synchronized to other blockchain nodes for consensus verification. If the consensus of each blockchain node is successful, the block will be uploaded to the chain.
  • the blockchain node that executes the specific process of the above transaction decryption processing method is in the priority queue, that is, the blockchain node is the priority node, then the specific process of executing the above transaction decryption processing method must be successful
  • the decrypted transaction that is, the first decrypted transaction obtained through decryption is the transaction that the client needs to process. Assuming that there are m blockchain nodes in the blockchain network, the transaction can be successfully decrypted after an average of m/2 attempts.
  • the blockchain node that executes the specific process of the above-mentioned transaction decryption processing method is not in the priority queue, that is, the blockchain node is not a priority node, then the blockchain node continues to traverse the public key list pk_list.
  • the other public key pkj is any public key taken out in sequence in the public key list pk_list.
  • tx_try P*T
  • the blockchain node when the blockchain node determines that k is 1 through the number of elements contained in the first priority transaction, it adopts the transaction decryption processing method corresponding to k being 1, that is, the block
  • the private key of the block chain node generates the first decryption private key through the number field inversion algorithm, and obtains the first priority placeholder from the first priority transaction, and according to the first decryption private key and the first priority placeholder symbol to generate a first decrypted segment, and the first decrypted segment is used to assist the block chain node to decrypt the first decrypted transaction.
  • the first decryption fragment and the first priority commitment in the first priority transaction through the bilinear mapping algorithm to generate the first decryption transaction, and judge whether the hash value of the first decryption transaction is consistent with the hash value of the transaction Values are equal to determine whether the blockchain node has successfully decrypted the transaction, so as to determine whether the blockchain node performs the block generation operation for the transaction. That is, after it is determined that the hash value of the first decrypted transaction is equal to the hash value of the transaction, the first decrypted transaction and the hash value of the first decrypted transaction are packaged into a block, and the block is The block is synchronized to other blockchain nodes for consensus verification.
  • the block will be uploaded to the chain.
  • the number k of priority nodes is 1, if the block chain node determines that it has not successfully decrypted the transaction through the above method, and determines the first decrypted transaction corresponding to the other m-1 block chain nodes If the hash value and the hash value of the transaction are not equal, another transaction decryption processing method can be used for processing.
  • the public keys of m blockchain nodes are obtained from the blockchain, and for the public key of any blockchain node, the public key of the blockchain node is generated through the number field inversion algorithm to generate the first
  • the public key is decrypted, and a third decrypted segment is generated based on the first decrypted public key and the first priority placeholder in the first priority transaction.
  • a third decryption transaction is generated, and then it is judged whether the hash value of the third decryption transaction is consistent with the hash value of the transaction Values are equal to determine whether the blockchain node has successfully decrypted the transaction, so as to determine whether the blockchain node performs the block generation operation for the transaction. That is, after the equality is determined, the blockchain node packs the third decrypted transaction and the hash value of the third decrypted transaction into a block, and synchronizes the block to other blockchain nodes for consensus Verification, if it is determined that the consensus is successful, the block will be uploaded to the chain.
  • a set hash algorithm such as MD5 or SHA256 algorithm
  • Step e the blockchain node 1 determines whether the hash value h' of the first decrypted transaction tx_try is equal to the hash value h of the transaction in the first priority transaction. If it is determined that they are equal, the first decrypted transaction tx_try and the hash value h' of the first decrypted transaction tx_try can be packaged into a block, and the block is synchronized to other blockchain nodes for consensus verification. If the consensus of each block chain node is successful, the block will be uploaded to the chain, and at the same time, it will be determined as the priority node and the operation will be terminated. If it is determined that they are not equal, step f is performed.
  • Step f the blockchain node 1 determines whether there are other blockchain nodes synchronizing the block for the transaction, and if so, performs a hash operation on the decrypted transaction in the block through the set hash operation to determine the Decrypt the hash value of the transaction, and verify whether the hash value of the decrypted transaction is equal to the hash value of the transaction in the block. If it is determined that they are equal, the operation is terminated. If it is determined that they are not equal, step g is performed.
  • the number field inversion algorithm ie, the elliptic curve point field inverse element algorithm
  • a set hash algorithm such as MD5 or SHA256 algorithm
  • Step 1 the blockchain node 1 determines whether the hash value h' of the first decrypted transaction tx_try is equal to the hash value h of the transaction in the first priority transaction. If it is determined that they are equal, the third decrypted transaction tx_try and the hash value h' of the third decrypted transaction tx_try can be packaged into a block, and the block is synchronized to other blockchain nodes for consensus verification. If the consensus of each blockchain node is successful, the block will be uploaded to the chain.
  • step h re-execute step h to step l until the correct tx_try is synchronized by other blockchain nodes, or until the hash value h' of the third decrypted transaction tx_try and the hash value h' of the first priority transaction are successfully obtained
  • the hash values h of the transactions are equal.
  • the blockchain node that executes the specific process of the above transaction decryption processing method is in the priority queue, that is, the blockchain node is the priority node, then only one time is required to execute the specific process of the above transaction decryption processing method.
  • the transaction can be successfully decrypted during the process, that is, the first decrypted transaction obtained by decryption is the transaction that the client needs to process. If the blockchain node that performs the specific process of the above transaction decryption processing method is not in the priority queue, assuming that there are m blockchain nodes in the blockchain network, it will take m/2 attempts on average to successfully decrypt the transaction.
  • the blockchain node when the blockchain node determines that k is 0 through the number of elements contained in the second priority transaction, it adopts the transaction decryption processing method corresponding to k being 0, that is, from the second Two unequal second priority placeholders and third priority placeholders are obtained in the priority transaction, and a second decryption fragment is generated according to the second priority placeholder and the third priority placeholder.
  • the blockchain node packs the second decrypted transaction and the hash value of the second decrypted transaction into a block, and synchronizes the block to other blockchain nodes for consensus Verification, if it is determined that the consensus is successful, the block will be uploaded to the chain.
  • a set hash algorithm such as MD5 or SHA256 algorithm
  • Step d the block chain node 1 determines whether the hash value h" of the second decrypted transaction tx_try is equal to the hash value h" of the transaction in the second priority transaction. If it is determined to be equal, the second decrypted transaction can be tx_try and the hash value h” of the second decrypted transaction tx_try are packaged into a block, and the block is synchronized to other blockchain nodes for consensus verification. If it is determined that the consensus of other blockchain nodes is successful, the block Go to the chain. If it is determined that they are not equal, it will prompt that the transaction is abnormal and terminate the transaction.
  • the above-mentioned embodiment shows that, since the relationship of each blockchain node in the blockchain network of the prior art solution is equal, and the computing power of each blockchain node is the same, the block confirmation algorithm involved in this prior art solution It is also aimed at each blockchain node in a peer-to-peer relationship, so it cannot support the block confirmation process with priority node requirements (that is, specifying some blockchain nodes to process transactions first). With the same computing power, no node can complete the block confirmation process first, so it takes a long time for each blockchain node to confirm the block through the workload proof mechanism, resulting in low efficiency of block chaining.
  • the technical solution in the present invention designates some blockchain nodes as priority nodes, so that when the computing capabilities of each blockchain node in the blockchain network are the same or close to each other, the priority nodes designated by the client have a great Probability can be the first to complete the block confirmation process, so it can save the time spent in the block confirmation process, thereby effectively improving the efficiency of block chaining.
  • the client can determine k blockchain nodes as priority nodes from the m blockchain nodes, and generate the first confusion factor based on the public keys of the k priority nodes.
  • the first priority transaction is sent to the block chain network, and a block chain node (such as a priority node) in the block chain network can take the lead in recovering the transaction through the first priority commitment in the first priority transaction.
  • a block chain node such as a priority node
  • the priority node Even if the computing power of each blockchain node is different, the priority node has a great probability to be the first to pass the first priority in the first priority transaction. Promise to restore the transaction, so as to quickly complete the block confirmation process, which can effectively improve the efficiency of block chaining.
  • the client since the client does not directly send the transaction to the blockchain network, but uses the first obfuscation factor to obfuscate the transaction, and sends the hash value of the transaction and the first priority commitment obtained after the obfuscation to Blockchain network, so the risk of transaction data leakage can be avoided, which can help ensure the privacy and security of transaction data.
  • FIG. 2 exemplarily shows a block confirmation device provided by an embodiment of the present invention, and the device can execute the flow of the block confirmation method.
  • the block confirmation method is applicable to a blockchain network with m blockchain nodes.
  • the device includes:
  • the determination unit 201 is configured to determine k blockchain nodes from the m blockchain nodes as priority nodes for any transaction;
  • the first processing unit 202 is configured to generate a first confusion factor based on the public keys of the k priority nodes; generate a first priority commitment based on the first confusion factor and the transaction; and generate a first priority commitment based on the first priority commitment and the The hash value of the transaction is used to generate a first priority transaction, and the first priority transaction is sent to the block chain network.
  • the first processing unit 202 is specifically configured to:
  • the public keys of the k priority nodes are passed through a bilinear mapping algorithm to generate the first confusion factor
  • the first processing unit 202 is specifically used for:
  • the first priority transaction is generated according to the first priority commitment and the hash value of the transaction.
  • the first processing unit 202 is specifically configured to:
  • the first processing unit 202 is specifically used for:
  • the first priority transaction is generated according to the first priority commitment, the first priority placeholder, and the hash value of the transaction.
  • the first processing unit 202 is further configured to:
  • the first processing unit 202 is specifically configured to:
  • FIG. 3 exemplarily shows another block confirmation device provided by an embodiment of the present invention, and the device can execute the flow of the block confirmation method.
  • the block confirmation method is applicable to a blockchain network with m blockchain nodes.
  • the device includes:
  • the generating unit 301 is configured to generate a first decrypted segment based on the private key of the blockchain node for any one of the m blockchain nodes when the first priority transaction is detected;
  • the first priority transaction is generated by the client based on the first priority commitment and the hash value of the transaction;
  • the first priority commitment is generated by the client based on the first confusion factor and the transaction;
  • the first The confusion factor is generated by the client based on the public keys of the k priority nodes determined by the client from the m blockchain nodes;
  • the second processing unit 302 is configured to use a bilinear mapping algorithm to generate a first decrypted transaction according to the first decrypted fragment and the first priority commitment in the first priority transaction; When the hash value of the transaction is equal to the hash value of the transaction in the first priority transaction, the first decrypted transaction is packed into a block and uploaded to the chain.
  • the generating unit 301 is specifically configured to:
  • the private key of the blockchain node is passed through a number field inversion algorithm to generate a first decryption private key
  • the generating unit 301 is specifically configured to:
  • the private key of the blockchain node is passed through a number field inversion algorithm to generate a first decryption private key
  • the second processing unit 302 is further configured to:
  • the second decrypted transaction is packaged into a block and uploaded to the chain.
  • the second processing unit 302 is further configured to:
  • m blocks are obtained from the blockchain
  • the public key of the chain node, and for the public key of any blockchain node, the public key of the blockchain node is passed through the number field inversion algorithm to generate the first decryption public key;
  • the third decrypted transaction is packaged into a block and uploaded to the chain.
  • the embodiment of the present invention also provides a computing device, as shown in FIG. 4 , including at least one processor 401 and a memory 402 connected to the at least one processor.
  • the specific connection medium between the processor 401 and the memory 402, the bus connection between the processor 401 and the memory 402 in FIG. 4 is taken as an example.
  • the bus can be divided into address bus, data bus, control bus and so on.
  • the memory 402 stores instructions that can be executed by at least one processor 401, and at least one processor 401 can execute the steps included in the aforementioned block confirmation method by executing the instructions stored in the memory 402.
  • the processor 401 is the control center of the computing device, which can use various interfaces and lines to connect various parts of the computing device, by running or executing instructions stored in the memory 402 and calling data stored in the memory 402, thereby realizing data deal with.
  • the processor 401 may include one or more processing units, and the processor 401 may integrate an application processor and a modem processor.
  • the call processor mainly handles issuing instructions. It can be understood that the foregoing modem processor may not be integrated into the processor 401 .
  • the processor 401 and the memory 402 can be implemented on the same chip, and in some embodiments, they can also be implemented on independent chips.
  • the processor 401 can be a general processor, such as a central processing unit (CPU), a digital signal processor, an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array or other programmable logic devices, discrete gates or transistors Logic devices and discrete hardware components can implement or execute the methods, steps and logic block diagrams disclosed in the embodiments of the present invention.
  • a general purpose processor may be a microprocessor or any conventional processor or the like.
  • the steps of the method disclosed in the embodiment of the block confirmation method can be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules in the processor.
  • the memory 402 can be used to store non-volatile software programs, non-volatile computer-executable programs and modules.
  • Memory 402 can include at least one type of storage medium, for example, can include flash memory, hard disk, multimedia card, card memory, random access memory (Random Access Memory, RAM), static random access memory (Static Random Access Memory, SRAM), Programmable Read Only Memory (PROM), Read Only Memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Magnetic Memory, Disk , CD, etc.
  • Memory 402 is, but is not limited to, any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
  • the memory 402 in the embodiment of the present invention may also be a circuit or any other device capable of implementing a storage function, and is used for storing program instructions and/or data.
  • an embodiment of the present invention also provides a computer-readable storage medium, which stores a computer program executable by a computing device, and when the program is run on the computing device, the computing device Execute the steps of the block confirmation method described above.
  • the embodiments of the present invention may be provided as methods, systems, or computer program products. Accordingly, the present invention can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to operate in a specific manner, such that the instructions stored in the computer-readable memory produce an article of manufacture comprising instruction means, the instructions
  • the device realizes the function specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Computer Security & Cryptography (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne un procédé et un dispositif de confirmation de bloc. Le procédé comprend les étapes suivantes : pour toute transaction, un client détermine k nœuds de chaîne de blocs parmi m nœuds de chaîne de blocs à titre de nœuds prioritaires (101) ; génère un premier facteur de confusion sur la base de clés publiques des k nœuds prioritaires (102) ; génère un premier engagement prioritaire sur la base du premier facteur de confusion et de la transaction (103) ; génère une première transaction prioritaire sur la base du premier engagement prioritaire et d'une valeur de hachage de la transaction (104) ; et envoie la première transaction prioritaire à un réseau de chaîne de blocs (105). Dans ce cas, à condition que les capacités de calcul des nœuds de chaîne de blocs soient identiques ou à peu près, les nœuds prioritaires spécifiés par le client ont une forte probabilité de récupérer en premier la transaction au moyen du premier engagement prioritaire figurant dans la première transaction prioritaire, de manière à achever rapidement le processus de confirmation de bloc, ce qui permet d'améliorer efficacement l'efficacité de mise en chaîne du bloc. De plus, le client confond la transaction au moyen du premier facteur de confusion et envoie ensuite la transaction confondue au réseau de chaîne de blocs, de telle sorte que la sécurité de confidentialité des données de transaction peut être garantie.
PCT/CN2021/135349 2021-10-27 2021-12-03 Procédé et dispositif de confirmation de bloc WO2023070831A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111254334.8A CN113706150B (zh) 2021-10-27 2021-10-27 一种区块确认方法及装置
CN202111254334.8 2021-10-27

Publications (1)

Publication Number Publication Date
WO2023070831A1 true WO2023070831A1 (fr) 2023-05-04

Family

ID=78647086

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/135349 WO2023070831A1 (fr) 2021-10-27 2021-12-03 Procédé et dispositif de confirmation de bloc

Country Status (2)

Country Link
CN (1) CN113706150B (fr)
WO (1) WO2023070831A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113706150B (zh) * 2021-10-27 2022-02-08 深圳前海微众银行股份有限公司 一种区块确认方法及装置

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180097614A1 (en) * 2016-09-30 2018-04-05 Intel Corporation Cascading multivariate quadratic identification schemes for chain of trust
CN109359974A (zh) * 2018-08-30 2019-02-19 阿里巴巴集团控股有限公司 区块链交易方法及装置、电子设备
CN111709738A (zh) * 2020-05-18 2020-09-25 杜晓楠 区块链系统中隐藏交易金额的方法、计算机可读存储介质和区块链系统
CN112383389A (zh) * 2021-01-08 2021-02-19 索信达(北京)数据技术有限公司 一种区块链随机数生成方法及系统
US20210258164A1 (en) * 2017-03-15 2021-08-19 NuID, Inc. Methods and systems for universal storage and access to user-owned credentials for trans-institutional digital authentication
CN113706150A (zh) * 2021-10-27 2021-11-26 深圳前海微众银行股份有限公司 一种区块确认方法及装置

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB201715423D0 (en) * 2017-09-22 2017-11-08 Nchain Holdings Ltd Computer-implemented system and method
RU2719423C1 (ru) * 2018-11-27 2020-04-17 Алибаба Груп Холдинг Лимитед Система и способ защиты информации
CN109840771A (zh) * 2019-04-01 2019-06-04 西安电子科技大学 一种基于同态加密的区块链隐私保护系统及其方法
US11036872B2 (en) * 2019-07-25 2021-06-15 Sap Se Privacy-preserving sum-based consistency checks for blockchains
US11373171B2 (en) * 2020-01-22 2022-06-28 Mastercard International Incorporated Method and system for prevention of lost currency in blockchain networks to missing wallets
CN112365252A (zh) * 2020-07-31 2021-02-12 深圳市网心科技有限公司 基于账户模型的隐私交易方法、装置及相关设备

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180097614A1 (en) * 2016-09-30 2018-04-05 Intel Corporation Cascading multivariate quadratic identification schemes for chain of trust
US20210258164A1 (en) * 2017-03-15 2021-08-19 NuID, Inc. Methods and systems for universal storage and access to user-owned credentials for trans-institutional digital authentication
CN109359974A (zh) * 2018-08-30 2019-02-19 阿里巴巴集团控股有限公司 区块链交易方法及装置、电子设备
CN111709738A (zh) * 2020-05-18 2020-09-25 杜晓楠 区块链系统中隐藏交易金额的方法、计算机可读存储介质和区块链系统
CN112383389A (zh) * 2021-01-08 2021-02-19 索信达(北京)数据技术有限公司 一种区块链随机数生成方法及系统
CN113706150A (zh) * 2021-10-27 2021-11-26 深圳前海微众银行股份有限公司 一种区块确认方法及装置

Also Published As

Publication number Publication date
CN113706150A (zh) 2021-11-26
CN113706150B (zh) 2022-02-08

Similar Documents

Publication Publication Date Title
CN111082934B (zh) 基于可信执行环境的跨域安全多方计算的方法及装置
WO2021238527A1 (fr) Procédé et appareil de génération de signature numérique, dispositif informatique, et support de stockage
CN110391900B (zh) 基于sm2算法的私钥处理方法、终端及密钥中心
KR101999188B1 (ko) 비밀 공유를 위한 타원 곡선 암호를 사용하는 개인용 장치 보안
CN111181720A (zh) 基于可信执行环境的业务处理方法及装置
CN110881063B (zh) 一种隐私数据的存储方法、装置、设备及介质
US11616636B2 (en) Hash updating methods and apparatuses of blockchain integrated station
CN110033266B (zh) 区块链中实现隐私保护的方法、节点和存储介质
WO2022078398A1 (fr) Procédé et système de traitement de transaction de sous-compte à base de chaîne de blocs, dispositif et support
CN111080296B (zh) 一种基于区块链系统的验证方法及装置
CN110601855B (zh) 一种根证书管理方法、装置及电子设备、存储介质
CN110351297B (zh) 一种应用于区块链的验证方法及装置
CN113326525B (zh) 一种基于智能合约的数据处理方法及装置
CN111639362B (zh) 区块链中实现隐私保护的方法、节点和存储介质
CN110716724B (zh) 基于fpga实现隐私区块链的方法及装置
CN111523889B (zh) 多重签名实现方法、装置、设备和存储介质
WO2023070831A1 (fr) Procédé et dispositif de confirmation de bloc
CN112287366A (zh) 数据加密方法、装置、计算机设备和存储介质
CN115834064B (zh) 一种安全多方计算方法、装置、系统、设备及存储介质
JP2016157055A (ja) 暗号化システム、認証システム、暗号化装置、復号装置、認証子生成装置、検証装置、暗号化方法、認証方法
CN112487464A (zh) 一种基于区块链的加密数据分享方法及装置
CN111460463B (zh) 电子存证保存和公证方法、装置、设备及存储介质
CN117155549A (zh) 密钥分发方法、装置、计算机设备和存储介质
CN115118411B (zh) 链下多方可信计算方法、装置、设备及存储介质
CN115361198A (zh) 解密方法、加密方法、装置、计算机设备和存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21962174

Country of ref document: EP

Kind code of ref document: A1