Online Privacy-Preserving Data-Driven Network Anomaly Detection
- 21 January 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 40 (3) , 982-998
Abstract
We study online privacy-preserving anomaly detection in a setting in which the data are distributed over a network and locally sensitive to each node, and a probabilistic data model is unknown. We design and analyze a data-driven solution scheme where each node observes a high-dimensional data stream for which it computes a local outlierness score. This score is then perturbed, encrypted, and sent to a network operator. The network operator then decrypts an aggregate statistic over the network and performs online network anomaly detection via the proposed generalized cumulative sum (CUSUM) algorithm. We derive an asymptotic lower bound and an asymptotic approximation for the average false alarm period of the proposed algorithm. Additionally, we derive an asymptotic upper bound and asymptotic approximation for the average detection delay of the proposed algorithm under a certain anomaly. We show the analytical tradeoff between the anomaly detection performance and the differential privacy level, controlled via the local perturbation noise. Experiments illustrate that the proposed algorithm offers a good tradeoff between privacy and quick anomaly detection against the UDP flooding and spam attacks in a real Internet of Things (IoT) network.Keywords
Funding Information
- U.S. National Science Foundation (ECCS-2040500, ECCS- 2040572)
This publication has 45 references indexed in Scilit:
- Privacy-Preserving Mining of Frequent Routes in Cellular Network Data2015
- A Collaborative Intrusion Detection Mechanism Against False Data Injection Attack in Advanced Metering InfrastructureIEEE Transactions on Smart Grid, 2015
- Privacy-Aware Smart Metering: A SurveyIEEE Communications Surveys & Tutorials, 2014
- Private and Dynamic Time-Series Data Aggregation with Trust Relaxation2014
- Privacy-Preserving Stream Aggregation with Fault Tolerance2012
- Efficient and provably secure aggregation of encrypted data in wireless sensor networksACM Transactions on Sensor Networks, 2009
- Our Data, Ourselves: Privacy Via Distributed Noise Generation2006
- Optimal Stopping Times for Detecting Changes in DistributionsThe Annals of Statistics, 1986
- EDF Statistics for Goodness of Fit and Some ComparisonsJournal of the American Statistical Association, 1974
- Procedures for Reacting to a Change in DistributionThe Annals of Mathematical Statistics, 1971