Blockchain Relay Node Data Propagation Anonymity

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Blockchain-based networks are vulnerable to de-anonymization attacks through traffic analysis, which compromises network anonymity by linking user IP addresses with transaction sources and destinations.

Innovation Solution

The Diffusion Mixer Protocol (DMP) is implemented, which includes a random differential relay stage that randomly delays and mixes transaction relays among nodes, making it difficult for attackers to determine source nodes, and a standard diffusion stage for timely propagation, ensuring that even if an attacker monitors inter-node traffic, they cannot easily identify source or relaying nodes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If nodes propagate transactions directly to peer nodes in a blockchain network, then data propagation efficiency is improved, but network anonymity is compromised due to traffic analysis attacks

Engineering Contradiction:
Improvedata propagation efficiencyVSAvoidnetwork anonymity
Core Design Contradiction:
ProductivityVSLoss of information

Solution Approach 1:

The patent introduces a relay node as an intermediary between source nodes and peer nodes. The relay node receives transactions from source nodes, validates them, and then propagates them to peer nodes. This intermediary structure prevents direct observation of transaction flows between source and peer nodes, thereby protecting network anonymity while maintaining efficient data propagation through the relay node's coordinated distribution mechanism.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Speed

If nodes validate and propagate each received transaction immediately, then transaction confirmation speed is improved, but vulnerability to de-anonymization attacks increases

Engineering Contradiction:
Improvetransaction confirmation speedVSAvoidde-anonymization attack vulnerability
Core Design Contradiction:
SpeedVSObject-affected harmful factors

Solution Approach 1:

The relay node performs preliminary validation and buffering of transactions before propagation. Instead of immediate propagation upon receipt, the relay node validates transactions first, then propagates them in a controlled manner. This preliminary action allows the system to maintain fast confirmation speeds while the controlled propagation timing and routing prevent attackers from easily correlating transaction flows to specific nodes.

Inventive Principle:
Principle #10Preliminary action

3Device complexity

If the network uses standard diffusion protocol for transaction propagation, then propagation simplicity is maintained, but traffic patterns become predictable and susceptible to analysis

Engineering Contradiction:
Improvepropagation protocol simplicityVSAvoidtraffic pattern predictability
Core Design Contradiction:
Device complexityVSDifficulty of detecting and measuring

Solution Approach 1:

The patent implements a dynamic propagation mechanism where the relay node adjusts propagation timing and selection of peer nodes based on current network conditions and transaction characteristics. This dynamic approach introduces variability in traffic patterns, making them unpredictable to attackers. The relay node can adaptively choose which peer nodes to propagate to and when, while maintaining the overall simplicity of the diffusion protocol structure.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS11863422B2Blockchain-based systems and methods for propagating data in a network
Publication Date: 2024.01.02 NCHAIN LICENSING AG
  • US11863422B2 patent drawing
  • US11863422B2 patent drawing
  • US11863422B2 patent drawing

AI summary

A method of propagating data packets in a network of nodes is disclosed. The method, implemented at one of the nodes, includes: generating at least one data packet of a first type; collecting a set of data packets of the first type during a first time period, the set including the at least one generated data packet and at least one data packet of the first type received from one or more first nodes in the network; and determining a mapping of the data packets of the set to a plurality of neighbouring nodes connected to the node, the mapping indicating an expected time of relay of each data packet of the set to neighbouring nodes, wherein determining the mapping includes determining at least one of: a first sub-mapping which allocates any two data packets having a same source for relay to different subsets of the neighbouring nodes; and a second sub-mapping which assigns different expected times of relay to any two data packets that are generated at the node or received by the node from the one or more first nodes in a same time interval.