Computer implemented system and method for sharing a common secret
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods are limited in sharing a common secret among more than two nodes, particularly in cryptography for secure communication, and lack versatility beyond cryptocurrency applications.
Innovation Solution
A method for sharing a common secret among a plurality of nodes using asymmetric cryptography key pairs, where each node determines a common secret based on its private and public keys, and shares encrypted portions to reach a threshold number, enabling secure communication and efficient recovery.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a common secret is shared among multiple nodes using traditional methods, then secure communication can be established, but the system complexity increases significantly when more than two nodes are involved
Solution Approach 1:
The patent divides the common secret into multiple shares distributed across different nodes. Each node holds a portion of the secret (share), and the complete secret can be reconstructed by combining sufficient shares. This segmentation reduces the complexity of managing secrets among multiple nodes, as each node only needs to manage its own share rather than coordinating complex key exchanges with all other nodes.
Solution Approach 2:
The patent introduces a threshold mechanism that acts as an intermediary rule for secret reconstruction. The threshold specifies the minimum number of shares required to reconstruct the common secret, providing a clear and simple governance rule that simplifies the system's operational complexity while maintaining security among multiple nodes.
2Ease of operation
If individual secrets are shared openly among nodes, then communication can be simplified, but privacy and security are compromised
Solution Approach 1:
The patent segments the common secret into multiple shares that are distributed among nodes. Each share is encrypted and can only be decrypted with the corresponding private key. This allows nodes to communicate and process information collectively while maintaining individual privacy, as no single node possesses the complete secret without authorization.
Solution Approach 2:
The patent applies local quality by assigning different levels of access to different nodes based on their role and authorization. Nodes can locally process and utilize their specific shares for authorized operations, while the complete secret remains inaccessible to any single node or unauthorized group, thus maintaining both operational simplicity and security.
3Reliability
If a threshold number of shares is required to access the common secret, then security is enhanced, but the complexity of managing and tracking shares increases
Solution Approach 1:
The patent implements self-service by allowing nodes to autonomously manage their own shares and participate in the threshold verification process without requiring centralized coordination. Each node can independently determine whether it possesses sufficient shares to reconstruct the secret, and the verification process is performed locally at each node, reducing the complexity of centralized share management.
Solution Approach 2:
The patent uses parameter changes by establishing a threshold parameter that defines the minimum number of shares required for access. This single parameter simplifies the security policy and makes it easy to manage, as the threshold value can be configured once and then automatically governs access control for all subsequent operations, reducing ongoing management complexity.
Data Source
AI summary
A method of sharing a first common secret among a plurality of nodes (A, B, C) for enabling secure communication for blockchain transactions comprises: determining, a first node (A) a plurality of second common secrets (SAPC, SAPB), wherein each second common secret is common to first node and a second node (B), determined at first node based on a first private key of first node and a first public key of second node (PC, PB) determined at the second node based on the first private key of the second node (SB, SC) and the first public key of the first node (PA). A third common secret (SBPC, SCPB) common to the second node (B) and a third node (C) is determined for the second node. The method comprises encrypting, at the first node, shares of first common secret known to the first node, and sending encrypted shares to second nodes.