Pseudo-Random Number Generation via Commitment Protocol
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional methods for generating cryptographically secure random numbers in decentralized transaction systems, such as those using proof of work and state channels, face challenges in security and communication overhead, making them unsuitable for secure interaction and increasing the risk of participant unreachability in distributed applications.
Innovation Solution
A method utilizing a commitment and disclosure protocol within trust-free channels, where participants commit to values without disclosing them initially, allowing secure random number generation without additional communication steps, leveraging complete information-theoretic security by ensuring no participant attacks the system, and enabling pseudo-random number generation in any sequence, even in non-turn-based systems.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional methods for generating cryptographically secure random numbers are used in decentralized transaction systems, then security is improved, but communication overhead and system complexity increase
Solution Approach 1:
The patent applies preliminary action by having participants commit to values in advance through cryptographic commitment schemes before the random number generation is actually needed. This allows the random number generation to be initiated early in the transaction process, with the actual values being revealed and combined later, thereby avoiding last-minute communication overhead while maintaining security.
Solution Approach 2:
The patent introduces an intermediary approach by using cryptographic commitment schemes as a mediator between participants. Instead of direct communication for random number generation, participants interact through committed values that are verified by the system, reducing the need for complex multi-party communication protocols while maintaining cryptographic security.
2Reliability
If trust-free channel constructs are used for secure interaction, then security is improved, but additional communication steps and expenses are required
Solution Approach 1:
The patent merges the random number generation process with the existing state channel operations. By integrating the commitment and revelation of random values into the regular state updates and challenge-response mechanisms of state channels, the system achieves secure random number generation without requiring separate communication steps or additional trust-free channel constructs.
Solution Approach 2:
The patent makes the state channel protocol multi-functional by enabling it to serve both as a secure communication channel and as a random number generation mechanism. The same cryptographic primitives and communication infrastructure used for state channel operations are leveraged to generate cryptographically secure random numbers, eliminating the need for dedicated random number generation protocols.
3Reliability
If additional communication steps are added for secure random number generation, then security is improved, but system continuity and participant reachability are worsened
Solution Approach 1:
The patent uses preliminary action by having participants commit to their random values early in the process. This allows the system to proceed with other operations while the commitments are being verified and processed, maintaining system continuity without waiting for all communication steps to complete. The actual random number is derived once commitments are in place, avoiding delays in critical path operations.
Data Source
AI summary
A method for generating a pseudo-random number sequence. In the method: in a data structure managed on the state channel, each of the participants commits to at least a number of at first hidden values that corresponds to the number of participants, each of the participants in the data structure respectively repeatedly discloses the values last committed to by that participant, in the stated number, and commits to the same number of further at first hidden values, a member of the sequence is determined by a relation that includes, for each of the participants, at least one of the values disclosed by this participant.