A Parallelism-Based Approach to Network Anonymization
Igor Margasinski

TL;DR
This paper proposes a parallelism-based architecture for anonymous networks that enhances privacy without relying on proxy chains, enabling low-delay anonymous communication suitable for various network services.
Contribution
It introduces a novel parallelization framework for anonymous networks that improves privacy and reduces delays compared to existing chain-based methods like P2Priv.
Findings
The new architecture effectively hides initiators of communication.
It supports anonymous access to distributed and client-server services.
The approach reduces latency while maintaining high anonymity.
Abstract
Considering topologies of anonymous networks we used to organizing anonymous communication into hard to trace paths hiding its origin or destination. In anonymity the company is crucial, however the serial transportation imposes a costly tradeoff between a level of privacy and a speed of communication. This paper introduces a framework of a novel architecture for anonymous networks that hides initiators of communications by parallelization of anonymous links. The new approach, which is based on the grounds of the anonymous P2P network called P2Priv, does not require content forwarding via a chain of proxy nodes to assure high degree of anonymity. Contrary to P2Priv, the new architecture can be suited to anonymization of various network communications, including anonymous access to distributed as well as client-server services. In particular, it can be considered as an anonymization…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInternet Traffic Analysis and Secure E-voting · Cryptography and Data Security · Privacy-Preserving Technologies in Data
