Adaptive transaction processing mechanism compatible with elliptic curve and anti-quantum signature

Abstract

The invention discloses a self-adaptive transaction processing mechanism compatible with an elliptic curve and anti-quantum signature, which is characterized in that the signature type of a transaction is adaptively and dynamically selected according to the size of a transaction data list in a transaction request, and when the size of the transaction data list meets the minimum required quantity of the elliptic curve, the signature type of the transaction is dynamically selected; the signature information comprises a V value, an R value and an S value in the elliptic curve signature; and when the size of the transaction data list meets the minimum anti-quantum required quantity, the signature information comprises a public key of an anti-quantum signature. The mechanism can package a transaction structure supporting a heterogeneous signature according to signature information of a transaction, the transaction structure comprises signature information and unsigned data, and a signature verification algorithm can be selected according to the type of the heterogeneous signature. The self-adaptive transaction processing mechanism can be compatible with elliptic curve signature and anti-quantum signature, forward compatibility with an existing block chain system is ensured, and transition of signature algorithms of different types is supported.

Description

Technical Field

[0001] The present invention relates to the field of blockchain technology, and in particular to an adaptive transaction processing mechanism compatible with elliptic curves and anti-quantum signatures. Background Art

[0002] As a decentralized ledger technology, blockchain has shown broad application prospects in many fields such as finance, supply chain, and the Internet of Things. Blockchain relies on cryptography to ensure the security, authenticity, and non-repudiation of data. Currently, most blockchain systems use elliptic curve signatures to ensure the security of transactions. Elliptic curve signatures have good computing performance and short key length, and have been applied to mainstream blockchain platforms such as Bitcoin and Ethereum.

[0003] However, with the development of quantum computing technology, cryptographic algorithms for traditional mathematical problems (such as discrete logarithm problems and integer factorization problems) will face the threat of quantum computers. Quantum computers can effectively solve these problems in polynomial time through quantum algorithms such as Shor's algorithm, and traditional elliptic curve signatures will face the threat of being cracked by quantum computing. In order to cope with this potential threat, quantum-resistant signatures came into being. Quantum-resistant signatures rely on mathematical problems that are difficult for quantum computers to crack, such as those based on lattice problems, hash functions, coding theory, etc. They have high computational complexity and can resist attacks from quantum computing, which is sufficient to provide security for the system.

[0004] The existing work mainly studies the design of blockchain systems that support quantum-resistant signatures. The academic community mainly studies it from two aspects: contract application and system design. In terms of application, the BIT team realized the user's quantum-resistant cryptographic migration through smart contracts. In terms of system design, the BIT team proposed a quantum-resistant blockchain system that supports on-chain and off-chain collaboration, solving the performance problem of transaction processing. The BIT team also proposed a quantum-resistant blockchain system architecture that supports algorithm pluggability and supports dynamic parameter adjustment of multiple quantum-resistant cryptographic algorithms. Rahul Saha et al. proposed a quantum-resistant decentralized consensus for blockchains. The scheme uses a lattice with polynomials for identity encryption and uses aggregate signatures to reach consensus, which can ensure its efficiency and applicability in quantum-resistant blockchain applications. Muhammed F. Esgin et al. designed MatRiCT, a blockchain confidential transaction ring signature protocol based on the quantum-resistant (module) lattice assumption. The proof length of the protocol is about two orders of magnitude shorter than that of existing quantum-resistant proposals and can be effectively extended to large anonymity sets.

[0005] At present, there are also some quantum-resistant proposals for typical blockchain systems in the industry. For example, Bitcoin Post-Quantum is an experimental branch of the Bitcoin main blockchain, which uses a quantum-resistant digital signature scheme. Ethereum 3.0 considers incorporating quantum-resistant components such as zk-STARKs (zero-knowledge scalable transparent knowledge argument). Blockchain platforms such as Abelian propose to use lattice-based quantum-resistant cryptographic systems to prevent quantum attacks. Corda has tested quantum-resistant algorithms such as SPHINCS.

[0006] In the process of implementing the technical method of the embodiment of the present invention, the inventor of this patent found at least the following technical problems in the prior art: Most of the above research focuses on building quantum-resistant blockchain systems. When quantum-resistant signatures are gradually used, blockchain systems need to be compatible to support the transition of different types of signature algorithms. Existing blockchain systems usually only support a single signature algorithm. For example, Bitcoin and Ethereum mainly use elliptic curve signatures, which ignores the transitional needs of the current system. It has not yet considered how to gradually introduce quantum-resistant signature capabilities without stopping the operation of the blockchain system and clearing the transaction and data history of the blockchain system, and ensure forward compatibility with existing blockchain systems.

[0007] The present invention aims to provide a solution that is compatible with both elliptic curves and quantum-resistant signatures. Summary of the invention

[0008] The embodiment of the present invention provides an adaptive transaction processing mechanism compatible with elliptic curves and quantum-resistant signatures, so as to provide a solution compatible with both elliptic curves and quantum-resistant signatures.

[0009] On the one hand, an embodiment of the present invention provides an adaptive transaction processing mechanism compatible with elliptic curves and quantum-resistant signatures, wherein the transaction construction part thereof includes: After receiving the transaction request from the user, process the user data; Determine whether the size of the transaction data list in the transaction request meets the minimum quantity requirement of the corresponding signature type, thereby determining whether the transaction uses a quantum-resistant signature or an elliptic curve signature; When a transaction uses a quantum-resistant signature, the transaction data is constructed according to the format of the quantum-resistant protocol, which includes three data fields: unsigned transaction, signed transaction, and public key; and when a transaction uses an elliptic curve signature, the transaction data is constructed according to the elliptic curve protocol, which includes four data fields: unsigned transaction, V value, R value, and S value; After the transaction data is serialized and encapsulated, the serialized data is sent to the blockchain network.

[0010] Optionally, after sending the serialized data to the blockchain network, a deserialization part is also included, specifically including: Calculate the data field length of the transaction data list in the transaction request; Parse the transaction deserialization structure according to the data field length; Encapsulate the parsed transaction deserialization structure into the transaction data structure; Add transaction data to the transaction pool.

[0011] Optionally, parsing the transaction deserialization structure according to the data field length specifically includes: Determine whether the data field length is equal to 3; When the data field length is equal to 3, the transaction deserialization structure is parsed according to the quantum-resistant signature; when the data field length is not equal to 3, the transaction deserialization structure is parsed according to the elliptic curve signature.

[0012] Optionally, after adding the transaction data to the transaction pool, a block verification part is also included, specifically including: Select a transaction set from the transaction pool; Check the signature information field of each transaction; Verify that the signature of each transaction is correct until all transactions in the transaction set are traversed; Construct new blocks for all verified transactions.

[0013] Optionally, the checking of the signature information field of each transaction is specifically: Check that the signature information field of each transaction is valid and that the signer is authorized to make the transaction.

[0014] Optionally, the verification of whether the signature of each transaction is correct specifically includes: When a transaction uses a quantum-resistant signature, the public key in the transaction is used to verify that the signature is correct; When a transaction uses an elliptic curve signature, the V, R, and S values ​​in the transaction are used to calculate the public key, and then the public key is used to verify whether the signature is correct.

[0015] Optionally, after verifying whether the signature of each transaction is correct, the following steps are further included: When the signature verification of a transaction fails, the transaction is deleted.

[0016] On the other hand, an embodiment of the present invention further provides a transaction structure compatible with elliptic curves and quantum-resistant signatures, the structure of which includes: Transaction information, including unsigned data and signature information fields; when the data list size of the transaction data is 4, it means that the transaction is constructed using the elliptic curve protocol, and the signature information field includes the V value, R value, and S value in the elliptic curve signature; when the data list size of the transaction data is 3, it means that the transaction is constructed using the quantum-resistant protocol, and the signature information field includes the public key of the quantum-resistant signature; Hash value, which represents the fixed-length output value obtained by performing a hash function operation on the transaction data and is used for transaction aggregation; Serialized encoding size refers to the size of the transaction data after serialization encoding to ensure data consistency and integrity.

[0017] Optionally, the unsigned data is basic information of the transaction, including at least one of the following information: sender address, receiver address, transaction amount, transaction time, transfer amount, sending account, and receiving account.

[0018] One or more technical solutions provided in the embodiments of the present invention have at least the following technical effects or advantages: The adaptive transaction processing mechanism compatible with elliptic curves and quantum-resistant signatures provided by the present invention can adaptively process transaction data of various signature types. In the process of transitioning the blockchain system to quantum-resistant cryptography, it can be compatible with elliptic curve signatures and quantum-resistant signatures. Without stopping the operation of the blockchain system and clearing the transaction and data history of the blockchain system, quantum-resistant signatures can be successfully introduced, ensuring forward compatibility with existing blockchain systems, supporting the transition of different types of signature algorithms, realizing seamless upgrades of the blockchain system, and ensuring the stability and scalability of the blockchain system. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] Figure 1 It is a schematic diagram of a transaction structure compatible with elliptic curves and quantum-resistant signatures in one embodiment of the present invention; Figure 2 This is a flow chart of the transaction construction part of a transaction processing mechanism compatible with elliptic curves and anti-quantum signatures in one embodiment of the present invention; Figure 3 This is a flow chart of the deserialization part of a transaction processing mechanism compatible with elliptic curves and quantum-resistant signatures in one embodiment of the present invention; Figure 4 This is a flowchart of the block verification part of the transaction processing mechanism compatible with elliptic curves and quantum-resistant signatures in one embodiment of the present invention. DETAILED DESCRIPTION

[0020] The embodiment of the present invention provides an adaptive transaction processing mechanism compatible with elliptic curves and anti-quantum signatures, and is used to provide a solution that is compatible with both elliptic curves and anti-quantum signatures.

[0021] First, the terms that appear in the specification will be explained respectively.

[0022] (1) Blockchain Blockchain is a distributed ledger technology that is used to record transactions and data and form a decentralized database system. Its underlying ledger adopts a chain structure, and each block (non-genesis block) can only reference one previous block.

[0023] (2) Transactions Transactions record any actions or events that occur between users, such as transfers, voting, contract signing, etc. Each block contains multiple transaction data.

[0024] (3) Elliptic Curve Signature Elliptic Curve Digital Signature Algorithm (ECDSA) is a digital signature algorithm based on elliptic curve cryptography (ECC). It combines public key cryptography and hash functions to verify the integrity of messages and the authenticity of their sources. It relies on an asymmetric encryption mechanism of private and public keys, and the process can be divided into two steps: signing and verification.

[0025] (4) Quantum-resistant signature Quantum-resistant signature refers to a digital signature algorithm designed to target the computing threats brought by quantum computers. With the continuous development of quantum computing technology, traditional digital signature algorithms (such as RSA, ECC, etc.) face the risk of being cracked by quantum algorithms (such as Shor's algorithm). Its algorithms are mainly based on lattice problems, hash functions, coding theory and other problems that are difficult to solve on quantum computers.

[0026] In order to better understand the above-mentioned adaptive transaction processing mechanism compatible with elliptic curves and anti-quantum signatures, the following will be described in detail in conjunction with the drawings and specific implementation methods of the specification. Obviously, the embodiments described in the present invention are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0027] In a blockchain system, transaction data usually contains multiple types of information, such as the sender and receiver's addresses, transaction amount, timestamp, signature, etc. The type and length of this information may vary depending on the transaction type or signature algorithm. Therefore, a transaction processing mechanism that can adaptively handle these differences is needed. The present invention provides an adaptive transaction processing mechanism that is compatible with elliptic curves and quantum-resistant signatures, which aims to ensure that the blockchain system can flexibly handle two different types of signature transactions, elliptic curve signatures and quantum-resistant signatures, while maintaining the stability and security of the system.

[0028] An adaptive transaction processing mechanism that is compatible with elliptic curves and anti-quantum signatures mainly involves three parts: transaction construction, deserialization, and block verification.

[0029] 1. Transaction structure like Figure 2 As shown, a transaction construction part of an adaptive transaction processing mechanism compatible with elliptic curves and anti-quantum signatures includes the following steps.

[0030] (1) After receiving a transaction request from a user, process the user data. Specifically, when a user initiates a transaction request through an application or API, the blockchain system begins to process the user data provided by the user after receiving the transaction request.

[0031] (2) Determine whether the size of the transaction data list in the transaction request meets the minimum number requirement of the corresponding signature type, thereby determining whether the transaction uses a quantum-resistant signature or an elliptic curve signature. Specifically, the blockchain system determines whether the transaction uses an elliptic curve signature by determining whether the size of the transaction data list in the transaction request meets the minimum number requirement of the elliptic curve, that is, when the size of the transaction data list in the transaction request is 4, the blockchain system determines whether the transaction uses an elliptic curve signature; the blockchain system determines whether the size of the transaction data list in the transaction request meets the minimum number requirement of quantum resistance, that is, when the size of the transaction data list in the transaction request is 3, the blockchain system determines whether the transaction uses a quantum-resistant signature.

[0032] (3) When a transaction uses a quantum-resistant signature, the transaction data is constructed according to the format of the quantum-resistant protocol, and the format of the quantum-resistant protocol includes three data fields, namely, unsigned transaction, signed transaction, and public key; and when a transaction uses an elliptic curve signature, the transaction data is constructed according to the elliptic curve protocol, and the format of the elliptic curve protocol includes four data fields, namely, unsigned transaction, V value, R value, and S value.

[0033] (4) After the transaction data is serialized and encapsulated, the serialized data is sent to the blockchain network. Specifically, after the above information is organized into a list, it is serialized and encapsulated, and the serialized data is sent to the blockchain network for verification and processing by other nodes.

[0034] (II) Deserialization part like Figure 3 As shown, a deserialization part of an adaptive transaction processing mechanism compatible with elliptic curves and anti-quantum signatures includes the following steps.

[0035] (1) Calculate the data field length of the transaction data list in the transaction request. Specifically, after receiving the serialized data, the blockchain system analyzes the serialized data and calculates the data field length L of the serialized data.

[0036] (2) Parse the transaction deserialization structure according to the data field length. Specifically, first determine whether the data field length L is equal to 3; when the data field length L is equal to 3, it means that the data is organized in the format of anti-quantum signature, and the transaction deserialization structure is parsed according to the anti-quantum signature; and when the data field length L is not equal to 3, it means that the data is organized in the format of elliptic curve signature, and the transaction deserialization structure is parsed according to the elliptic curve signature.

[0037] (3) Encapsulate the parsed transaction deserialization structure into the transaction data structure. The transaction data structure is compatible with elliptic curves and quantum-resistant signatures, and its structure includes: Transaction information, including unsigned data and signature information fields; when the data list size of the transaction data is 4, it means that the transaction is constructed using the elliptic curve protocol, and the signature information field includes the V value, R value, and S value in the elliptic curve signature; when the data list size of the transaction data is 3, it means that the transaction is constructed using the quantum-resistant protocol, and the signature information field includes the public key of the quantum-resistant signature; Hash value, which represents the fixed-length output value obtained by performing a hash function operation on the transaction data and is used for transaction aggregation; Serialized encoding size refers to the size of the transaction data after serialization encoding to ensure data consistency and integrity.

[0038] The unsigned data is the basic information of the transaction, including at least one of the following information: sender address, receiver address, transaction amount, transaction time, transfer amount, sending account, and receiving account.

[0039] (4) Add the transaction data to the transaction pool. Specifically, the transaction data will be added to the transaction pool in the blockchain system, waiting to be packaged by the blockchain system.

[0040] (III) Block verification part like Figure 4 As shown, a block verification part of an adaptive transaction processing mechanism compatible with elliptic curves and anti-quantum signatures includes the following steps.

[0041] (1) Selecting a transaction set from the transaction pool. Specifically, the blockchain system selects a group of transactions from the transaction pool as a transaction set and prepares to package these transactions into a new block.

[0042] (2) Check the signature information field of each transaction. Specifically, for each transaction, the blockchain system first checks the signature to see if the signature information field of each transaction is valid and whether the signer has the right to conduct the transaction.

[0043] (3) Verify that the signature of each transaction is correct until all transactions in the transaction set are traversed. Specifically, when a transaction uses a quantum-resistant signature, the public key in the transaction is used to verify that the signature is correct. When a transaction uses an elliptic curve signature, the public key is calculated using the V value, R value, and S value in the transaction, and then the public key is used to verify that the signature is correct. The blockchain system will perform the signature verification process on all selected transactions until all transactions are verified.

[0044] (4) Construct a new block for all verified transactions. Specifically, the blockchain system will package all verified transactions into a new block and perform consensus calculations on it.

[0045] It should be noted that after verifying whether the signature of each transaction is correct in step (3), it also includes: when the signature verification of the transaction fails, deleting the transaction.

[0046] Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims

1. An adaptive transaction processing mechanism compatible with elliptic curves and quantum-resistant signatures, characterized in that: The transaction structure includes: After receiving the transaction request from the user, process the user data; Determine whether the size of the transaction data list in the transaction request meets the minimum quantity requirement of the corresponding signature type, thereby determining whether the transaction uses a quantum-resistant signature or an elliptic curve signature; When a transaction uses a quantum-resistant signature, the transaction data is constructed according to the format of the quantum-resistant protocol, which includes three data fields: unsigned transaction, signed transaction, and public key; and when a transaction uses an elliptic curve signature, the transaction data is constructed according to the elliptic curve protocol, which includes four data fields: unsigned transaction, V value, R value, and S value; After the transaction data is serialized and encapsulated, the serialized data is sent to the blockchain network.

2. The mechanism according to claim 1, characterized in that After sending the serialized data to the blockchain network, a deserialization part is also included, specifically including: Calculate the data field length of the transaction data list in the transaction request; Parse the transaction deserialization structure according to the data field length; Encapsulate the parsed transaction deserialization structure into the transaction data structure; Add transaction data to the transaction pool.

3. The mechanism according to claim 2, characterized in that The parsing of the transaction deserialization structure according to the data field length specifically includes: Determine whether the data field length is equal to 3; When the data field length is equal to 3, the transaction deserialization structure is parsed according to the quantum-resistant signature; when the data field length is not equal to 3, the transaction deserialization structure is parsed according to the elliptic curve signature.

4. The mechanism according to claim 2, characterized in that After adding the transaction data to the transaction pool, the block generation and signature verification part is also included, which specifically includes: Select a transaction set from the transaction pool; Check the signature information field of each transaction; Verify that the signature of each transaction is correct until all transactions in the transaction set are traversed; Construct new blocks for all verified transactions.

5. The mechanism according to claim 4, characterized in that The signature information field of each transaction is checked, specifically: Check that the signature information field of each transaction is valid and that the signer is authorized to make the transaction.

6. The mechanism of claim 4, wherein: Verifying whether the signature of each transaction is correct specifically includes: When a transaction uses a quantum-resistant signature, the public key in the transaction is used to verify that the signature is correct; When a transaction uses an elliptic curve signature, the V, R, and S values ​​in the transaction are used to calculate the public key, and then the public key is used to verify whether the signature is correct.

7. The mechanism of claim 4, wherein: After verifying whether the signature of each transaction is correct, it also includes: When the signature verification of a transaction fails, the transaction is deleted.

8. A transaction structure compatible with elliptic curves and quantum-resistant signatures, comprising: Transaction information, including unsigned data and signature information fields; when the data list size of the transaction data is 4, it means that the transaction is constructed using the elliptic curve protocol, and the signature information field includes the V value, R value, and S value in the elliptic curve signature; when the data list size of the transaction data is 3, it means that the transaction is constructed using the quantum-resistant protocol, and the signature information field includes the public key of the quantum-resistant signature; Hash value, which represents the fixed-length output value obtained by performing a hash function operation on the transaction data and is used for transaction aggregation; Serialized encoding size refers to the size of the transaction data after serialization encoding to ensure data consistency and integrity.

9. The transaction structure according to claim 8, characterized in that: The unsigned data is the basic information of the transaction, including at least one of the following information: sender address, receiver address, transaction amount, transaction time, transfer amount, sending account, and receiving account.

Images