Abstract
For anonymous communication, the most popular method is to use pseudonyms instead of original identities. We previously demonstrated the possibility of a collision-free pseudonym system by uniquely assigning a permutation element to each network entity. We extend this idea by assigning k permutation elements to each entity for k ≥ 1. We analyse the randomness of the pseudonyms used in the proposed system to show the effect of k by varying k from 1 to 50. Our experimental results show that our pseudonym system can provide practical anonymity with k.
| Original language | English |
|---|---|
| Article number | 5752795 |
| Pages (from-to) | 686-688 |
| Number of pages | 3 |
| Journal | IEEE Communications Letters |
| Volume | 15 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 2011 Jun |
| Externally published | Yes |
Keywords
- Collsion-free pseudonym
- anonymous communication
- collision-free
- pseudo-random permutation
ASJC Scopus subject areas
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering
Fingerprint Dive into the research topics of 'A perfect collision-free pseudonym system'. Together they form a unique fingerprint.
Cite this
Yoon, J. W., & Kim, H. (2011). A perfect collision-free pseudonym system. IEEE Communications Letters, 15(6), 686-688. [5752795]. https://doi.org/10.1109/LCOMM.2011.040711.110052