Quantum-safe blockchain consensus generation

Quantum-safe blockchain consensus generation

Mainly proposes a new system and method to ensure real-time quantum-safe computing and consensus in a blockchain environment. The following is a summary of the core points of the paper:

Quantum-safe blockchain consensus system:

System composition: The system consists of multiple licensed verification servers that act as distributed participants and jointly create and hide common randomization until it is used by participants.

Randomization process: Each participant is assigned a unique polynomial with a common maximum degree and is allowed to select and send a random value to all other participants, hiding the details of the random value.

Consensus mechanism: By sharing symmetric keys and recovering these keys after each consensus round, participants build a quantum-safe consensus protocol that works under a Byzantine fault-tolerant (BFT) architecture.

Random coin generation in consensus rounds:

Coin generation: In each consensus round, common random coins are generated from the shares of at least one honest participant, and the newly created coins are locked using a blockchain consensus protocol based on asynchronous Byzantine fault tolerance (aBFT).

Coin verification: At the end of the round, the locked common random coins are used to verify the transaction and the secret is revealed to all participants.

Smart Contract Execution:

Finite State Machine (FSM): Smart contracts are represented as finite state machines with hidden logic and executed through a multi-party computation (MPC) protocol to protect the privacy of the contract's business logic.

Secret Sharing: The coefficients of the contract are distributed to participants through a secret sharing scheme, and the participants perform the calculation without knowing the specific logic.

Input Mixing: Before executing the contract logic, the secret input is mixed through MPC to hide the permutation relationship between input and output.

Zero Knowledge Proof (ZKP):

ZKP Generation: A method for generating zero-knowledge proofs in MPC is proposed, which does not require the use of quantum-sensitive cryptographic functions.

ZKP Verification: The generated ZKP can prove the correctness of the calculation result without leaking the input information.

Performance Optimization:

Concurrent Preprocessing: The preparation of random numbers, secret sharing, and nested hash values ​​is accelerated through concurrent preprocessing to support repeated consensus processes.

Low Latency and High Throughput: Compared with existing quantum-sensitive competitors, the proposed method performs well in terms of latency and throughput, especially when the number of participants is moderate.

System security and privacy:

Quantum resistance: All components in the system are designed to be quantum-safe to resist attacks from quantum computers.

Privacy protection: Privacy of transactions and contract execution is protected through multi-party computation and secret sharing techniques.

Dynamic consensus committee member selection:

Committee reconfiguration: Dynamic selection and replacement between consensus committee members is allowed to ensure the continuous operation and security of the system.

Wait-free bootstrapping: A wait-free bootstrapping mechanism is proposed to start the system in an asynchronous network.

These points outline the main features and advantages of the quantum-safe blockchain consensus system and smart contract execution method proposed in the paper, including its system composition, randomization process, consensus mechanism, smart contract execution method, zero-knowledge proof generation and verification, performance optimization measures, system security and privacy protection mechanism, and dynamic consensus committee member selection strategy.