Non-Interactive Distributed RSA Signature Generation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional distributed RSA signature generation methods in ad-hoc networks require interaction among nodes, leading to potential information leakage and security issues, especially in environments with dynamic topology and lack of central authority.
Innovation Solution
A non-interactive distributed RSA signature generation method using a Maximum Distance Separable (MDS) code, where nodes generate shares and partial signatures without direct interaction, utilizing an MDS code to distribute key information and generate RSA signatures with a fewer number of nodes, ensuring security and validity through witness verification.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional distributed RSA signature generation methods are used, then RSA signature can be generated in ad-hoc network, but interaction among nodes causes information leakage and security issues
Solution Approach 1:
The patent segments the RSA signature generation process into independent node operations. Each node independently computes its partial signature using local secret shares and the message hash, without requiring interaction with other nodes. The final signature is obtained by combining these independent partial signatures, eliminating information leakage risks while maintaining security.
Solution Approach 2:
The patent applies preliminary action by pre-distributing secret shares to nodes during key generation, and pre-computing the message hash function before signature generation. This allows nodes to independently compute partial signatures without real-time interaction, preventing information leakage while ensuring secure signature generation.
2Adaptability or versatility
If polynomial interpolation method is used for secret sharing, then secret can be shared among nodes, but at least t nodes must simultaneously exist and interact
Solution Approach 1:
The patent segments the secret sharing mechanism into independent node operations. Instead of requiring t nodes to simultaneously interact for polynomial interpolation, each node independently uses its pre-distributed secret share to compute a partial signature. This eliminates the need for simultaneous node presence and interaction while maintaining secret sharing security.
Solution Approach 2:
Each node performs self-service by independently computing its partial signature using its own secret share and the message hash, without requiring service from other nodes. This eliminates interaction requirements while preserving the adaptability of secret sharing in dynamic ad-hoc networks.
3Device complexity
If dealer node function is centralized, then key management is simplified, but single point of failure and reduced reliability occur
Solution Approach 1:
The patent segments the dealer node's key management function into distributed operations. Instead of a centralized dealer node, each network node independently holds secret shares and can independently compute partial signatures. This distributes the trust model, eliminating single points of failure while maintaining key management functionality through the combination of distributed partial signatures.
Data Source
AI summary
A distributed Rivest Shamir Adleman (RSA) signature generation method in an ad-hoc network and a signature generation node are provided, including steps for distributing key information to a plurality of nodes using an RSA parameter and a maximum distance separable (MDS) code, in a dealer node, generating a partial signature using the key information and transmitting the generated partial signature to a signature generation node, in the plurality of nodes, and generating an RSA signature using the partial signature, in the signature generation node, wherein the RSA signature is generated using the partial signature, received from a fewer number of nodes than the entire plurality of nodes.