2009/02/10 by Jean‐Charles Grégoire, Jean-Charles Grégoire, Grégoire, Jean-Charles +2
Computer Science · Mathematics · #05E05 #Combinatorics (math.CO) #Cryptography and Data Security #FOS: Mathematics #Hate Speech and Cyberbullying Detection #Internet Traffic Analysis and Secure E-voting #math.CO #msc:05E05
paper · pdf · doi:10.48550/arxiv.0902.1663
18 pages, 4 figures
arxiv created 2009/02/10 · openalex publication_date 2009/02/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/03
A 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.