Pool-based anonymous communication framework for high-performance computing
The Journal of Supercomputing
| Hi-index | 0.00 |
We propose XPROB, a generalized pool-based anonymous communication framework. XPROB defines a family of infinite pool-based anonymous communication systems with resistance against global active adversary (adversary with all capabilities to monitor all external activities of system, to delay and to create messages in the system). Our proposal is to solve the limitation of APROB Channel that concerns only global delaying adversary. XPROB provides flexibility for users to justify their level of anonymity (and speed) and satisfies probabilistic real-time condition which ensures to deliver any message within a predefined duration with high probability. Experimental evaluation shows that each instance of XPROB provides lower source-hiding property than APROB Channel with the same environment and users' behaviors (rate and number of sent messages).