Publicly Certifiable Randomness Beacon for Multi-Party Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing certified randomness protocols are limited to interactions between a single classical party and a quantum party, failing to allow multiple classical parties, some of whom may not be honest, to jointly agree on a certifiably random string, and public randomness beacons require trust in non-compromised sources.
Innovation Solution
A distributed randomness protocol is selected by classical parties, generating a random string which is verified by classical parties and used by a quantum party with a quantum randomness source to execute a certified randomness protocol, ensuring the randomness of the output, and a publicly-certifiable randomness beacon publishes blocks of randomness with certification information for verification by consumers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If existing certified randomness protocols are used with a single classical party and quantum party, then the protocol complexity is low, but multiple classical parties cannot jointly agree on a certifiably random string
Solution Approach 1:
The protocol is segmented into distinct phases: a classical distributed randomness generation phase among multiple classical parties, followed by a quantum certification phase. This segmentation allows each phase to be optimized independently - the classical phase handles multi-party coordination while the quantum phase provides certification, resolving the contradiction between multi-party adaptability and protocol complexity.
Solution Approach 2:
A quantum party acts as an intermediary between multiple classical parties and the quantum randomness source. The quantum party receives random strings from classical parties, executes certified randomness protocols with the quantum source, and returns certified randomness. This intermediary structure enables multi-party participation while maintaining manageable complexity through clear role separation.
2Reliability
If public randomness beacons are used, then randomness can be published regularly, but trust in non-compromised sources is required
Solution Approach 1:
The patent replaces the mechanical trust-based system with a quantum-certified verification system. Instead of relying on trust in source integrity, the system uses quantum mechanical properties (superposition, entanglement) to generate certifiable randomness that can be verified through mathematical proofs, eliminating the need for trust while maintaining reliability.
Solution Approach 2:
The system implements feedback through certification information that is published alongside randomness blocks. This certification data allows consumers to verify the randomness quality by checking quantum protocol execution evidence, creating a closed-loop verification system that enhances reliability without requiring blind trust.
3Reliability
If quantum randomness source is used with multiple classical parties, then guaranteed randomness can be achieved, but the system complexity increases
Solution Approach 1:
The system segments functionality between classical infrastructure (handling party coordination and random string generation) and quantum components (providing certified randomness). This segmentation allows the reliable quantum randomness guarantee to be achieved while keeping overall system complexity manageable through clear separation of concerns and specialized component design.
Data Source
AI summary
A method may include: selecting, by a plurality of classical parties, each of the classical parties using a classical party computer program, a distributed randomness protocol; generating, by the plurality of classical parties, a random string using the selected distributed randomness protocol; providing, by one of the classical parties, the random string to a quantum party, wherein the quantum party executes a quantum party computer program in communication with a quantum randomness source; executing, by the quantum party, a certified randomness protocol with the quantum randomness source using the random string as an input; receiving, by the quantum party, quantum randomness comprising a sequence of random bits from the quantum randomness source; and verifying, by the classical parties, that the random string was randomly selected, and that the quantum randomness is a valid output of the certified randomness protocol using the random string as input.