The main contribution of this paper consists in theoretical approximations of the collision rate of $n$ random identifiers uniformly distributed in $m (> n)$ buckets---along with bounds on the approximation errors. A secondary contribution is a decentralized anonymization system of media access control (MAC) addresses with a low collision rate. The main contribution supports the secondary one in that it quantifies its collision rate, thereby allowing designers to minimize $m$ while attaining specific collision rates. Recent works in crowd monitoring based on WiFi probe requests, for which collected MAC addresses should be anonymized, have inspired this research.

中文翻译：

---

均匀分布的标识符与 MAC 地址匿名化应用的冲突

本文的主要贡献在于对均匀分布在 $m (> n)$ 个桶中的 $n$ 个随机标识符的碰撞率的理论近似——以及近似误差的界限。第二个贡献是具有低冲突率的媒体访问控制 (MAC) 地址的分散匿名化系统。主要贡献支持次要贡献，因为它量化了其碰撞率，从而允许设计人员在达到特定碰撞率的同时最小化 $m$。最近在基于 WiFi 探测请求的人群监控方面的工作激发了这项研究的灵感，其中收集的 MAC 地址应该匿名。