By Topic

Anonymity of a buffer constrained chaum mix: Optimal strategy and asymptotics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mishra, A. ; Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA, USA ; Venkitasubramaniam, P.

As networked systems increasingly pervade every facet of life, it is quintessential for users to communicate without revealing their identities or the paths of data flow. Chaum Mixes are intermediate nodes or routers that are used to provide anonymity by using cryptographic and batching methods to hide source identities. The anonymity achievable by batching strategies, are however, severely impacted by limited buffer capacity of the mix node. This paper presents an information theoretic investigation of a buffer constrained mix, and provides the first single letter characterization of the maximum achievable anonymity as a function of buffer size for a mix serving two users with equal arrival rates. For two users with unequal arrival rates the anonymity is expressed as a solution to a series of finite recursive equations. For more than two users and arbitrary arrival rates, a lower bound on the convergence rate of anonymity is derived as buffer size increases and it is shown that under certain arrival configurations the lower bound is tight.

Published in:

Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on

Date of Conference:

7-12 July 2013