An Improved Anonymous Identifier

Abstract

Privacy is an integral part of today’s digital transformation era and there is a paradigm shift toward anonymity in communication. This paper proposes an algorithm for assigning anonymous IDs to every member of a group of participants and provides an upper bound on one of the parameters of the algorithm. The algorithm terminates in one round.The proposed algorithm improves an earlier algorithm (AIDA) and mirrors its working. Simulation is used to show that AIDA may not terminate when the number of participants is large. We then discuss the software architecture and performance improvements offered by the proposed algorithm.