A perfect collision-free pseudonym system

Ji Won Yoon, Hyoungshick Kim

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 languageEnglish
Article number5752795
Pages (from-to)686-688
Number of pages3
JournalIEEE Communications Letters
Volume15
Issue number6
DOIs
Publication statusPublished - 2011 Jun 1
Externally publishedYes

Fingerprint

Collision
Communication
Permutation
Anonymity
Randomness
Experimental Results

Keywords

  • anonymous communication
  • collision-free
  • Collsion-free pseudonym
  • pseudo-random permutation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Modelling and Simulation

Cite this

A perfect collision-free pseudonym system. / Yoon, Ji Won; Kim, Hyoungshick.

In: IEEE Communications Letters, Vol. 15, No. 6, 5752795, 01.06.2011, p. 686-688.

Research output: Contribution to journalArticle

Yoon, Ji Won ; Kim, Hyoungshick. / A perfect collision-free pseudonym system. In: IEEE Communications Letters. 2011 ; Vol. 15, No. 6. pp. 686-688.
@article{73e419527637417db0ae1e3b41073408,
title = "A perfect collision-free pseudonym system",
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.",
keywords = "anonymous communication, collision-free, Collsion-free pseudonym, pseudo-random permutation",
author = "Yoon, {Ji Won} and Hyoungshick Kim",
year = "2011",
month = "6",
day = "1",
doi = "10.1109/LCOMM.2011.040711.110052",
language = "English",
volume = "15",
pages = "686--688",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - A perfect collision-free pseudonym system

AU - Yoon, Ji Won

AU - Kim, Hyoungshick

PY - 2011/6/1

Y1 - 2011/6/1

N2 - 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.

AB - 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.

KW - anonymous communication

KW - collision-free

KW - Collsion-free pseudonym

KW - pseudo-random permutation

UR - http://www.scopus.com/inward/record.url?scp=79959543812&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959543812&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2011.040711.110052

DO - 10.1109/LCOMM.2011.040711.110052

M3 - Article

VL - 15

SP - 686

EP - 688

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 6

M1 - 5752795

ER -