Estimating the number of hosts corresponding to an address while preserving anonymity

Authors:
Alif Wahid;Christopher Leckie;Chenfeng Zhou
Affiliations:
Department of Computing and Information Systems, The University of Melbourne, Australia;Department of Computing and Information Systems, The University of Melbourne, Australia;Department of Computing and Information Systems, The University of Melbourne, Australia
Venue:
NSS'12 Proceedings of the 6th international conference on Network and System Security
Year:
2012

Citing 19
Cited 0

The Markov-modulated Poisson process (MMPP) cookbook

Performance Evaluation
Extending the IP internet through address reuse

ACM SIGCOMM Computer Communication Review
On the self-similar nature of Ethernet traffic (extended version)

IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level

IEEE/ACM Transactions on Networking (TON)
Proof of a fundamental result in self-similar traffic modeling

ACM SIGCOMM Computer Communication Review
A technique for counting natted hosts

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
How dynamic are IP addresses?

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Usage-based dhcp lease time optimization

Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
My botnet is bigger than yours (maybe, better than yours): why size estimates remain challenging

HotBots'07 Proceedings of the first conference on First Workshop on Hot Topics in Understanding Botnets
Accountable internet protocol (aip)

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Census and survey of the visible internet

Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
De-anonymizing the internet using unreliable IDs

Proceedings of the ACM SIGCOMM 2009 conference on Data communication
On dominant characteristics of residential broadband internet traffic

Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Power-Law Distributions in Empirical Data

SIAM Review
Understanding block-level address usage in the visible internet

Proceedings of the ACM SIGCOMM 2010 conference
Netalyzr: illuminating the edge network

IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
The great IPv4 land grab: resource certification for the IPv4 grey market

Proceedings of the 10th ACM Workshop on Hot Topics in Networks
A Pareto-modulated Poisson process (PMPP) model for long-range dependent traffic

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Estimating the number of hosts that have been assigned to an Internet address is a challenging problem due to confounding factors such as the dynamic allocation of addresses and the prohibition of access to privacy sensitive data that can reveal user identities and remove anonymity. We propose a probabilistic method that strikes a desired balance between protection of anonymity and accuracy of estimation. By utilising the phenomenon of preferential attachment, we show that the number of hosts corresponding to an address is accurately predicted by the number of times that an address appears in a series of alternating ON and OFF intervals. We validate our method using a four month trace of dynamic address allocations at a campus wireless network. In so doing, we demonstrate the practical significance and utility of such an anonymity preserving method for estimating the number of hosts corresponding to a dynamic address.