Distributed RSA Signature Generation in Ad-Hoc Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional distributed RSA signature generation methods in ad-hoc networks require interaction among nodes, which can lead to security issues and inefficiencies, especially in dynamic topologies where simultaneous communication is challenging and central authority control is lacking.
Innovation Solution
A distributed Rivest Shamir Adleman (RSA) signature generation method using a maximum distance separable (MDS) code and a random symmetric matrix to distribute key share information, allowing for secure RSA signature generation without interaction among nodes, and enabling new nodes to participate in the network without dealer node involvement.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional distributed RSA signature generation methods are used in ad-hoc networks, then RSA signature generation can be achieved, but interaction among nodes is required which leads to security issues and inefficiencies
Solution Approach 1:
The patent segments the RSA signature generation process into independent key share distributions using MDS codes. Each node receives a separate key share that can be used independently without requiring interaction with other nodes during signature generation, thus resolving the contradiction between security and operational simplicity.
Solution Approach 2:
The patent performs preliminary key share distribution using MDS codes before the actual signature generation is needed. This preliminary action ensures that all necessary key components are already distributed and available locally at each node, eliminating the need for real-time interaction during critical signature operations and enhancing both security and efficiency.
2Reliability
If polynomial interpolation is used for secret sharing in ad-hoc networks, then key distribution can be achieved, but at least t nodes must exist simultaneously which causes communication overhead and interaction
Solution Approach 1:
The patent changes the mathematical parameter from polynomial interpolation to MDS code-based secret sharing. This parameter change allows key shares to be distributed and used independently without requiring t nodes to be simultaneously present, reducing communication overhead and system complexity while maintaining reliable key distribution.
3Reliability
If a central certification authority is used for key management, then key security can be ensured, but the system becomes dependent on central authority control which reduces adaptability in ad-hoc networks
Solution Approach 1:
The patent extracts the key management function from a central certification authority and distributes it across all nodes in the ad-hoc network using MDS code-based secret sharing. Each node holds a key share that collectively provides the same security level as a central authority, thereby eliminating central dependence and enhancing adaptability to dynamic network conditions.
Solution Approach 2:
The patent enables the ad-hoc network to self-manage its own key distribution and signature generation without external central authority intervention. Through distributed MDS code-based key shares, the network autonomously maintains security and adapts to topology changes, improving both versatility and reliability.
Data Source
AI summary
A distributed Rivest Shamir Adleman (RSA) signature generation method in an ad-hoc network and a node of an ad-hoc network. The distributed RSA signature generation method in an ad-hoc network includes distributing key share information, which is generated using a maximum distance separable (MDS) code and a random symmetric matrix, to a plurality of nodes; generating, in a fewer number of nodes than the plurality of nodes, a partial signature using the distributed key share information; transmitting the partial signature to a signature generation node; and generating an RSA signature using the partial signature, in the signature generation node.