J. Darwin1, R. Anantha Kumar2
1 PG scholar, Department of CSE, Kalasalingam Institute of Technology, Krishnankoil, Tamilnadu, India.
2 Assistant Professor, Department of CSE, Kalasalingam Institute of Technology, Krishnankoil, Tamilnadu, India.
1 PG scholar, Department of CSE, Kalasalingam Institute of Technology, Krishnankoil, Tamilnadu, India.
2 Assistant Professor, Department of CSE, Kalasalingam Institute of Technology, Krishnankoil, Tamilnadu, India.
In this paper proposed the
Quantifying anonymity using conditional entropy of the routes given the
adversary’s observation, the problem of optimizing anonymity is posed as a
two-player zero-sum game between the network designer and the adversary. Game
theory applied to study the optimal performance tradeoffs and equilibrium
strategies. Using independent schedule however, requires dummy transmissions by
the relays. The results are applied to study the relationships between
anonymity, the fraction of monitored relays and the fraction of hidden relays
in large networks.
