Memory Space Interchange for Blockchain Replay Attack Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current systems face challenges in efficiently identifying and preventing replay attacks in blockchain networks, which can lead to resource wastage and property loss, due to the probabilistic nature of existing solutions like Bloom filters and the difficulty in implementing effective anti-replay techniques in decentralized systems.
Innovation Solution
The proposed solution involves dividing memory space into a working and backup section, where only the most recent transactions are stored in the working section, allowing for redundancy and efficient search times, and implementing a switch-over mechanism when the working section reaches a threshold capacity, ensuring seamless transition and reducing memory overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a Bloom filter is used to identify duplicate transactions, then the system can detect replay attacks, but the search time increases and computing resources are consumed
Solution Approach 1:
The memory space is divided into multiple sections (first section, second section, third section) that are alternately used for storing transaction information. This segmentation allows the system to search only within the active section rather than the entire memory space, significantly reducing search time while maintaining reliable replay attack detection across all sections.
2Reliability
If all transaction information is stored in memory, then replay attacks can be detected, but memory space is wasted on historical transactions
Solution Approach 1:
The system dynamically switches between different memory sections based on the threshold condition. When the first section reaches the threshold, the system switches to the second section for new transactions, making the first section available for reuse. This dynamic switching mechanism maintains effective replay attack detection while optimizing memory usage by avoiding permanent retention of all historical transactions.
Solution Approach 2:
The system implements periodic switching between memory sections based on a threshold condition. Transactions are stored in the active section until the threshold is reached, then the system periodically switches to the next section. This periodic action ensures that only recent transactions are stored in any given section, reducing overall memory consumption while maintaining detection reliability.
3Quantity of substance
If a threshold condition is set for memory switching, then memory overhead is reduced, but the system complexity increases
Solution Approach 1:
The system automatically monitors the storage status of the first section and switches to the second section when the threshold condition is met, without requiring external intervention. The switch-over process is handled autonomously by the system itself, which manages the threshold monitoring and section switching logic internally, thereby reducing memory overhead while keeping the complexity manageable through self-service operation.
Data Source
AI summary
Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for detecting and disabling replay attacks. One of the methods includes receiving a transaction to be completed in a blockchain. A current working section of memory storing transaction information that is designated for use in identifying past transactions already processed is determined, where the memory also stores a backup section providing, when used in combination with the current working section, an alternating memory section storage scheme for the transaction information. From the current working section, whether the transaction has previously been processed is determined. When it is determined that the transaction has previously been processed, the transaction is bypassed. When it is determined that the transaction has not previously been processed the transaction is processed and transaction information for the transaction is written into the current working section.