Anti-quantum distributed asynchronous random beacon method and system

Through the asynchronous verified secret sharing method and Merkel tree verification that resists quantum, the security problem of random beacon systems in asynchronous networks and quantum computing environments is solved, and the efficient generation and verification of exposed random numbers in distributed systems is realized to ensure the security of the system and the ability to resist quantum attacks.

CN120433920APending Publication Date: 2025-08-05INST OF SOFTWARE - CHINESE ACAD OF SCI
0 Cites 2 Cited by

Patent Information

Application Number
CN202510484898.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2024-04-19
Filing Date
2025-04-17
Publication Date
2025-08-05

AI Technical Summary

Technical Problem

Existing random beacon systems have security dependencies in centralized and distributed environments, especially under threats from asynchronous networks and quantum computing, which are difficult to ensure security and reliability.

Method used

The asynchronous verified secret sharing method that is resistant to quantum is used to generate public random numbers through the distribution and reconstruction stages, and the Merkel tree and reliable broadcasting protocol are used to combine the asynchronous common subset protocol to ensure security consensus and validity verification among nodes, and resist quantum computing attacks.

Benefits of technology

The security of distributed generation of exposed random numbers is realized under an asynchronous network, avoiding single point failures, and resisting quantum computing attacks, ensuring the security and reliability of the system.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The invention relates to an anti-quantum distributed asynchronous random beacon method and system. The method comprises: a distribution stage of executing an anti-quantum asynchronous verifiable secret sharing method; an asynchronous common subset protocol is executed, distribution nodes corresponding to received effective secret shares serve as input, and a node set i with the size of t is consensus; executing a reconstruction stage of the anti-quantum asynchronous verifiable secret sharing method, reconstructing the secret value of each node in the set I, and if the reconstructed secret value is invalid, rejecting the node from the set I; and outputting the XOR sum of the secret values of the nodes in the set I as a public random number. According to the method, distributed generation of public random numbers is supported, the single-point fault problem is avoided, the system security can be ensured in an asynchronous network, and quantum computer attacks can be resisted.
Need to check novelty before this filing date? Find Prior Art