A Combinatorial Enumeration Approach for Measuring Anonymity

Simple item page
dc.creatorGrégoire, Jean-Charles
dc.creatorHamel, Angèle M.
dc.date2009-02-10
dc.date.accessioned2026-07-07T12:39:53Z
dc.date.available2026-07-07T12:39:53Z
dc.descriptionA recent paper of Edman et al. has taken a combinatorial approach to measuring the anonymity of a threshold mix anonymous communications system. Their paper looks at ways of matching individual messages sent to individual messages received, irrespective of user, and determines a measure of the anonymity provided by the system. Here we extend this approach to include in the calculation information about how many messages were sent or received by a user and we define a new metric that can be computed exactly and efficiently using classical and elegant techniques from combinatorial enumeration.
dc.description18 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/0902.1663
dc.identifierhttp://arxiv.org/abs/0902.1663
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219278
dc.subjectCombinatorics
dc.subject05E05
dc.titleA Combinatorial Enumeration Approach for Measuring Anonymity
dc.typetext

Files

Collections

arXiv