RPROB - a family of binomial-mix-based anonymous communication systems
Minh–Triet Tran, Anh-Duc Duong, Isao Echizen · 2009
We propose RPROB, an infinite family of anonymous communication systems, each of which corresponds to a binomial mix. Any instance of RPROB provides resistance against global active adversary with capabilities to monitor every external activity, 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. Experimental evaluation shows that any instance of RPROB provides higher anonymity than APROB channel with the same environment and users' behaviors (rate and number of sent messages). Furthermore, because of the randomness provided by a binomial mix, an adversary cannot determine with certainty the probability of a user to be a sender of a delivered message in RPROB system as in pool-based APROB channel. The prefix `R' in RPROB is to emphasize the randomness of our proposal. RPROB also 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.