Privacy-Preserving Collaborative Deep Learning with Application to Human Activity Recognition
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
The proliferation of wearable devices has contributed to the emergence of mobile crowdsensing, which leverages the power of the crowd to collect and report data to a third party for large-scale sensing and collaborative learning. However, since the third party may not be honest, privacy poses a major concern. In this paper, we address this concern with a two-stage privacy-preserving scheme called RG-RP: the first stage is designed to mitigate maximum a posteriori (MAP) estimation attacks by perturbing each participant's data through a nonlinear function called repeated Gompertz (RG); while the second stage aims to maintain accuracy and reduce transmission energy by projecting high-dimensional data to a lower dimension, using a row-orthogonal random projection (RP) matrix. The proposed RG-RP scheme delivers better recovery resistance to MAP estimation attacks than most state-of-the-art techniques on both synthetic and real-world datasets. For collaborative learning, we proposed a novel LSTM-CNN model combining the merits of Long Short-Term Memory (LSTM) and Convolutional Neural Networks (CNN). Our experiments on two representative movement datasets captured by wearable sensors demonstrate that the proposed LSTM-CNN model outperforms standalone LSTM, CNN and Deep Belief Network. Together, RG+RP and LSTM-CNN provide a privacy-preserving collaborative learning framework that is both accurate and privacy-preserving.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Deep Convolutional and LSTM Recurrent Neural Networks for Multimodal Wearable Activity Recognition
Ordóñez, F., & Roggen, D. (2016) · Sensors · doi:10.3390/s16010115 · Cited by 2,761 · cited 1×
“Deep learning techniques have been shown to outperform the existing well-established methods that rely on hand-crafted feature extraction and shallow feature learning architectures, owing to its potential to uncover features that are tied to the dynamics of human motion production, from simple motion encoding in lower…”
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835 · cited 1×
“’s scheme [11] requires participants to communicate with each other (in addition to the cloud service), and use verifiable secret sharing to generate shares of random noise, imposing computational and communication costs on the order of 2t , where t is the estimated maximum number of dishonest participants.”
BackgroundHomer, N., Szelinger, S., Redman, M., Duggan, D., Tembe, W., Muehling, J., Pearson, J. V., Stephan, D. A., Nelson, S. F., & Craig, D. W. (2008) · PLoS Genetics · doi:10.1371/journal.pgen.1000167 · Cited by 1,221
Deep, Convolutional, and Recurrent Models for Human Activity Recognition Using Wearables
Hammerla, N. Y., Halloran, S., & Ploetz, T. (2016) · arXiv · doi:10.48550/arxiv.1604.08880 · Cited by 606
Secure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595 · cited 1×
“There exist cryptographic techniques that allow data mining algorithms to be modified to process encrypted data; these techniques fall under the heading of secure multiparty computation (SMC) [9].”
BackgroundmHealthDroid: A Novel Framework for Agile Development of Mobile Health Applications
Banos, O., Garcia, R., Holgado-Terriza, J. A., Damas, M., Pomares, H., Rojas, I., Saez, A., & Villalonga, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-13105-4_14 · Cited by 583
Research works printed but not linked: 25
- Ács Gergely, I have a dream!(differentially private smart metering) International Workshop on Information Hiding
- 10.1145/335191.335438 · DOI · Paper page
- 10.1109/TSMCB.2010.2051540 · DOI
- 10.1145/502512.502546 · DOI · Paper page
- Blunsom Phil, 2014, Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics.
- 10.1109/ICDM.2005.121 · DOI · Paper page
- Cramer Ronald, 2015, Ivan Bjerre Damgøard, and Jesper Buus Nielsen
- 10.14778/1454159.1454226 · DOI · Paper page
- Erfani Sarah M, 2014, Shanika Karunasekera, Christopher A Leckie, and Marimuthu Palaniswami.
- 10.1145/1460412.1460440 · DOI · Paper page
- 10.1016/j.datak.2012.10.004 · DOI
- 10.1007/s11036-012-0415-x · DOI
- 10.1145/1066157.1066163 · DOI · Paper page
- LeCun Yann, 1995, Convolutional networks for images, speech, and time series. The handbook of brain theory and neural networks
- 10.1007/11871637_30 · DOI
- Liu Kun, A survey of attack techniques on privacy-preserving data perturbation methods. Privacy-Preserving Data Mining
- 10.1109/TKDE.2006.14 · DOI · Paper page
- Lyu Lingjuan, 2016, Sarah M Erfani, Christopher Leckie, and Marimuthu Palaniswami.
- Mangasarian Olvi L, 2008, International Conference on Data Mining (DMIN), 2
- 10.5555/2568179 · doi:10.5555/2568179
- 10.1007/s00778-006-0010-5 · DOI
- 10.1109/TC.2011.83 · DOI
- 10.1109/TC.2011.83 · DOI
- Shi Elaine, Privacy-preserving aggregation of time-series data Annual Network & Distributed System Security Symposium (NDSS)
- Zhang Fan, 2012, Data perturbation with state-dependent noise for participatory sensing INFOCOM
Cited by
Deep Learning for Sensor-based Human Activity Recognition
Chen, K., Zhang, D., Yao, L., Guo, B., Yu, Z., & Liu, Y. (2022) · ACM Computing Surveys · doi:10.1145/3447744 · Cited by 690
“ue. For example, Lyu et al. proposed to tailor two kinds of data perturbation mechanisms: Random Projection and repeated Gompertz to achieve a better tradeoff between privacy and recognition accuracy [89]. Recently, differential privacy has gained increasing research attention due to its strong theoretical privacy gua…”
BackgroundDeep Learning for Sensor-based Human Activity Recognition: Overview, Challenges and Opportunities
Chen, K., Zhang, D., Yao, L., Guo, B., Yu, Z., & Liu, Y. (2020) · arXiv · doi:10.48550/arxiv.2001.07416 · Cited by 314
“ue. For example, Lyu et al. proposed to tailor two kinds of data perturbation mechanisms: Random Projection and repeated Gompertz to achieve a better tradeoff between privacy and recognition accuracy [89]. Recently, differential privacy has gained increasing research attention due to its strong theoretical privacy gua…”
BackgroundDeep CNN-LSTM With Self-Attention Model for Human Activity Recognition Using Wearable Sensor
Khatun, M. A., Yousuf, M. A., Ahmed, S., Uddin, M. Z., Alyami, S. A., Al-Ashhab, S., Akhdar, H. F., Khan, A., Azad, A., & Moni, M. A. (2022) · IEEE Journal of Translational Engineering in Health and Medicine · doi:10.1109/jtehm.2022.3177710 · Cited by 288
“Proposed deep CNN-LSTM with self-attention model was compared with LSTM-CNN from Lyu et al. [53] and CNN-LSTM [54] under the same experimental scenario in order to further verify the model performance.”
Towards Fair and Privacy-Preserving Federated Deep Models
Lyu, L., Yu, J., Nandakumar, K., Li, Y., Ma, X., Jin, J., Yu, H., & Ng, K. S. (2020) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.2996273 · Cited by 250
Self-citationA review of privacy-preserving techniques for deep learning
Boulemtafes, A., Derhab, A., & Challal, Y. (2020) · Neurocomputing · doi:10.1016/j.neucom.2019.11.041 · Cited by 211
“• Transmission energy can be saved by projecting high-dimensional data to lower dimension (compressing data) using row-orthogonal random projection (RP) matrix on input data, knowing that RP does not have any impact on accuracy degradation [20].”
BackgroundMethodResultInfluential
Metadata
- Authors
- Lyu, L., He, X., Law, Y. W., & Palaniswami, M.
- Venue
- Proceedings of the 2017 ACM on Conference on Information and Knowledge Management
- Publisher
- ACM
- Published
- 2017-11-06
- Pages
- 1219-1228
- OpenAlex
- W2767613317
- Cited by
- 81
- References
- 8
- FWCI
- 1.91
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.