A loss-tolerant mechanism of message segmentation and reconstruction in multi-path communication of anti-tracking network

Abstract

The low threshold and convenience of the techniques about network monitoring and tracing have posed a great threat on the netizens’ privacy. Open data shows that the rampant business of netizens’ private information has become one of the biggest network dark industries. Multi-path communication applied in the anonymous communication netowrk improves the difficulty of online theft of the netizens’ privacy. But in the current multi-path communication mechanisms, when some message blocks are lost, the frequent request for the lost message blocks greatly reduces the communication efficiency and the tracking-resistance. To address this problem, we propose a loss-tolerant mechanism of message segmentation and reconstruction in multi-path communication (FMC). The loss-tolerance of FMC is subject to the property of orthogonal matrix that the inner product of any two rows(columns) is 0. FMC works as follows: (1) firstly, the message is encoded into an orthogonal matrix, and divided into triangular blocks as more as possible; (2) secondly, the message blocks are sent to different communication paths, and each communication path guarantees the security of the transmitted message; (3) thirdly, the receiver recovers the original message even when some message blocks are lost. Without the frequent request for the lost message blocks, FMC greatly improves the communication efficiency and tracking-resistance. Experimental results show that FMC has a strong loss-tolerant performance, and the receiver can certainly recover the original message with 15% lost message blocks at most. Also, we analyze the data expansion rate of FMC in matrix segmentation and multi-path communication. For a n × n matrix, (Formula Presented) is a proper size of message blocks to balance loss-tolerance, tracking-resistance and communication efficiency.