Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/LCOMM.2011.040711.110052 | IEEE Communications Letters |
Keywords | Field | DocType |
Arrays,Complexity theory,Entropy,Loading,Testing,Monte Carlo methods,Correlation | Computer science,Pseudonym,Permutation,Telecommunication security,Collision free,Theoretical computer science,Anonymity,Randomness,Computational complexity theory | Journal |
Volume | Issue | ISSN |
15 | 6 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ji Won Yoon | 1 | 112 | 23.94 |
| Hyoungshick Kim | 2 | 226 | 32.27 |