Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Intersection attack and using dummy address

In: Tatra Mountains Mathematical Publications, vol. 37, no. 3
Jędrzej Kabarowski - Mirosław Kutyłowski
Detaily:
Rok, strany: 2007, 49 - 57
Kľúčové slová:
anonymous communication, intersection attack
O článku:
We consider anonymous communication protocols and the intersection attack exercised against them. We analyze defense strategy of sending extra messages to dummy destinations. We show that the optimal number of dummy destinations should be determined based on the traffic intensity and the number of the real destinations $m$ as well as on the number of communication rounds we want to participate in. We present an integral expression for computing the optimal value and show examples that it need not to be $m$, as often believed.
Ako citovať:
ISO 690:
Kabarowski, J., Kutyłowski, M. 2007. Intersection attack and using dummy address. In Tatra Mountains Mathematical Publications, vol. 37, no.3, pp. 49-57. 1210-3195.

APA:
Kabarowski, J., Kutyłowski, M. (2007). Intersection attack and using dummy address. Tatra Mountains Mathematical Publications, 37(3), 49-57. 1210-3195.