Decentralized Node Validation via Gossip Algorithm
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for validating digital signatures in peer-to-peer networks are inefficient, relying on central authorities, requiring high computational costs, or limited in accuracy, and fail to provide personalized trust scores, leading to issues with node validation and reputation management.
Innovation Solution
A computer-implemented method using a gossip algorithm that allows nodes in a peer-to-peer network to locally calculate and validate trust scores based on direct and indirect endorsement connections, enabling decentralized reputation management without a central authority, and providing transitive, personalized, and robust trust scores.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a central authority is used to validate digital signatures, then validation reliability is improved, but system complexity and single point of failure risk increase
Solution Approach 1:
The patent segments the centralized validation function into distributed validation capabilities across multiple nodes. Each node independently validates digital signatures using its own stored validation data, eliminating the need for a single central authority while maintaining validation reliability through distributed consensus.
Solution Approach 2:
The patent extracts the validation authority from a central entity and distributes it to network nodes. Validation data is extracted from centralized storage and distributed to nodes, allowing them to perform independent validation without relying on a central point of control.
2Extent of automation
If blockchain technology is used for validation, then decentralization is achieved, but computational cost increases due to proof of work requirements
Solution Approach 1:
The patent uses lightweight validation data structures that can be quickly created and discarded, replacing the heavy computational requirements of blockchain proof-of-work. Nodes validate signatures using efficient cryptographic verification rather than energy-intensive consensus mechanisms.
Solution Approach 2:
The patent replaces the mechanical proof-of-work system with a more efficient cryptographic verification mechanism. Instead of requiring computational puzzles to be solved, nodes directly verify digital signatures using public key cryptography, dramatically reducing computational costs while maintaining decentralization.
3Productivity
If digital reputation system is used, then validation efficiency is improved, but dependency on central server remains
Solution Approach 1:
The patent enables nodes to perform self-validation using locally stored validation data and cryptographic keys. Each node independently verifies digital signatures without needing to query a central server, achieving both efficiency and decentralization simultaneously.
4Reliability
If OpenPGP/GnuPGP protocols are used for validation, then basic trust validation is achieved, but accuracy is limited by number of jumps between nodes
Solution Approach 1:
The patent adds a new dimension to trust validation by incorporating validation data from multiple independent sources and time points. Instead of relying solely on the number of cryptographic jumps, the system evaluates trust through multiple dimensions including node reputation, validation history, and cross-verification from different paths, significantly improving validation accuracy.
Data Source
Figure 1~2
Figure 3a~3b
Figure 3c~4c
AI summary
A computer-implemented method for validating a digital signature of at least one node in a peer to peer network, wherein each node is configured to store a database and at least one trust score s of a node in respect with another node of the peer to peer network, wherein each database is configured to store at least one trust endorsement of another node, the computer-implemented method comprising the steps of, a) executing in the plurality of nodes a gossip algorithm, obtaining in each node a updated version of its database, b) locally calculating in each node, a trust score s assigned to other node of the network for each node of its database, c) locally validating in each node, each digital signature of the at least one node of its database, based on the value of said trust score s of the peer to peer network, d) if there is a change in at least one trust endorsement value t of a database of a node, sending the changed trust endorsement to each neighbour node and executing step a), or e) if a new node is added or deleted in the peer to peer network, executing step a). A data processing system, a computer program product and a computer-readable storage medium for carrying out the steps of the method is also described.