Privacy-Preserving Blockchain-Based Federated Learning for IoT Devices
Open accessAbstract
Home appliance manufacturers strive to obtain feedback from users to improve their products and services to build a smart home system. To help manufacturers develop a smart home system, we design a federated learning (FL) system leveraging a reputation mechanism to assist home appliance manufacturers to train a machine learning model based on customers’ data. Then, manufacturers can predict customers’ requirements and consumption behaviors in the future. The working flow of the system includes two stages: in the first stage, customers train the initial model provided by the manufacturer using both the mobile phone and the mobile-edge computing (MEC) server. Customers collect data from various home appliances using phones, and then they download and train the initial model with their local data. After deriving local models, customers sign on their models and send them to the blockchain. In case customers or manufacturers are malicious, we use the blockchain to replace the centralized aggregator in the traditional FL system. Since records on the blockchain are untampered, malicious customers or manufacturers’ activities are traceable. In the second stage, manufacturers select customers or organizations as miners for calculating the averaged model using received models from customers. By the end of the crowdsourcing task, one of the miners, who is selected as the temporary leader, uploads the model to the blockchain. To protect customers’ privacy and improve the test accuracy, we enforce differential privacy (DP) on the extracted features and propose a new normalization technique. We experimentally demonstrate that our normalization technique outperforms batch normalization when features are under DP protection. In addition, to attract more customers to participate in the crowdsourcing FL task, we design an incentive mechanism to award participants.
AI snapshot
Written from the paper’s full text.
TL;DR
The paper designs a blockchain-based crowdsourcing federated learning system for IoT smart-home data, combining mobile feature extraction with differential privacy, MEC training, Algorand blockchain, IPFS storage, and a reputation incentive. It proposes a normalization technique that outperforms batch normalization under differential privacy and reports MNIST experiments plus Raspberry Pi feasibility tests.
Key findings
- The proposed normalization constrains feature values to \([-\sqrt{N-1}, \sqrt{N-1}]\) without enforcing mean 0 or variance 1; under \(\epsilon\)-DP it outperforms batch normalization. With \(N=64\), batch-normalized features are seriously perturbed when \(\epsilon \ll 5.33\), while the proposed method’s features are overwhelmed only when \(\epsilon \ll 2\).
- On MNIST with 10 participants, 6,000 images each, batch size 64, default \(\epsilon=2\), 40 local epochs, and 2 global epochs, the system achieves at least 90% accuracy when global epoch = 2 and \(\epsilon > 1\); the discussion states it can achieve 97% accuracy.
- Under DP (\(\epsilon=2\)), test accuracy decreases as batch size increases; without DP, batch normalization outperforms the proposed normalization. With \(\epsilon=2\) and 40 local epochs, the optimal number of global epochs is 2; accuracy drops at 3 or 4 global epochs because noise increases.
- In the incentive simulation (\(\gamma_{\text{Max}}=100\), initial reputation \(h=5\)), no incentive gives a fixed reward of 5 per global epoch; honest customers gain more reward/reputation, while a poisoning update yields reward 0 and drops reputation to 0 if it equals \(h=5\), otherwise by 1.
- Raspberry Pi 4 training with 6,000 images takes about 144 seconds per epoch versus about 9 seconds on the laptop edge server; for 40 epochs this is about 96 minutes versus 6 minutes. Average local model size is 617.8 KB, giving about 0.6178 seconds communication cost at 1 MB/s upload bandwidth.
Methods
- System design: manufacturers post a crowdsourcing FL task; customers collect home-appliance data via phone, extract CNN features locally, add \(\epsilon\)-DP Laplace noise, and offload perturbed features and labels to an MEC server for fully connected layer training. Customers sign model hashes and upload them to a consortium blockchain using Algorand PoS/BFT; miners verify with Multi-KRUM, a selected leader aggregates the global model, and IPFS provides off-chain storage.
- Privacy/normalization: each feature dimension is normalized to \([-\sqrt{N-1}, \sqrt{N-1}]\), giving sensitivity \(2\sqrt{N-1}\); independent zero-mean Laplace noise with scale \(2\sqrt{N-1}/\epsilon\) is added to each normalized feature dimension.
- Experiments: MNIST (60,000 training, 10,000 test images), CNN with two convolutional layers (30 and 80 channels), max-pooling, four fully connected hidden layers reducing dimension from 3920 to 10, learning rate 0.01, batch size 64, \(\epsilon \in [1,10]\) with default \(\epsilon=2\), default 2 global epochs and 40 local epochs, 10 participants with 6,000 images each. A Raspberry Pi 4 simulates the mobile device and a laptop emulates the edge server; incentive experiments use \(\gamma_{\text{Max}}=100\) and initial reputation \(h=5\).
Limitations
- Stated: future work will test the system with real-world home-appliance datasets and find a deterministically optimal balance between local and global epochs. The paper also notes that customers who seldom use devices may postpone crowdsourcing progress.
- Evident: the evaluation is limited to MNIST and simulated FL by averaging locally trained model parameters; mobile and edge hardware are simulated by a Raspberry Pi 4 and a laptop, not an actual smart-home deployment.
- Evident: the paper does not report a formal end-to-end security proof or real-world attack evaluation, though it discusses GAN-based and DeepInversion risks qualitatively.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
0 of 29 cited sources checked · 0 supported · 0 flagged
- Findingown data§ Privacy-Preserving Blockchain-Based Federated Learning for IoT Devices · p. 1
The proposed normalization technique outperforms batch normalization when features are under differential privacy protection.
“We experimentally demonstrate that our normalization technique outperforms batch normalization when features are under differential privacy protection.”
- Also stated in: § I. INTRODUCTION · p. 2 · plain
“Second, we propose a new normalization technique which delivers a higher test accuracy than batch normalization, while preserving the privacy of the extracted features of each participant's data.”
Quote in the paperSubstantial claim - Also stated in: § I. INTRODUCTION · p. 2 · plain
- Findingown data§ C. Normalization Technique · p. 6
Experiments in Section VI show that our normalization technique significantly improves the learning accuracy over that of Jiang et al.'s batch normalization.
“Experiments to be presented in Section VI show that our normalization technique significantly improves the learning accuracy over that of [45].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [45] [45] L. Jiang, X. Lou, R. Tan, and J. Zhao, 'Differentially private collaborative learning for the IoT edge,' in International Workshop on Crowd Intelligence for Smart Cities: Technology and Applications (CISC) , 2018. -
Not checked in the free run.
- Findingreasoning§ C. Normalization Technique · p. 7
When using our normalization technique, the true value will be overwhelmed by noise when the privacy parameter ε ≪ 2.
“Hence, when the privacy parameter ϵ ≪ 2 , the true value will be overwhelmed by the noise.”
Quote in the paperSubstantial claim - Findingown data§ B. Experimental Results · p. 8
Figure 3 shows the superiority of DP-aware FL using our normalization technique over DP-aware FL using Jiang et al.'s batch normalization.
“Figure 3 shows the superiority of DP-aware FL using our normalization technique over DPaware FL using Jiang et al. 's batch normalization [45].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [45] [45] L. Jiang, X. Lou, R. Tan, and J. Zhao, 'Differentially private collaborative learning for the IoT edge,' in International Workshop on Crowd Intelligence for Smart Cities: Technology and Applications (CISC) , 2018. -
Not checked in the free run.
- Findingreasoning§ B. Experimental Results · p. 9
The test accuracy of FL model decreases as the batch size increases when the number of global epoch is 1 and DP parameter ε = 2.
“Figure 4 presents that the test accuracy of FL model decreases as the batch size increases when the number of global epoch is 1 and DP parameter ϵ = 2 .”
Quote in the paperSubstantial claim
- Findingown data§ B. Experimental Results · p. 9
When the privacy parameter ε = 2 and the number of local epochs is 40, the optimal number of global epochs is 2.
“In our case, when the privacy parameter ϵ = 2 and the number of local epochs is 40 , the optimal number of global epochs is 2 .”
Quote in the paperNot a substantial claim - Findingown data§ B. Experimental Results · p. 9
The test accuracy will start to drop if the number of local epochs is 40 and the number of global epoch is more than 2.
“But the test accuracy will start to drop if the number of local epochs is 40 and the number of global epoch is more than 2 .”
Quote in the paperNot a substantial claim - Findingreasoning§ B. Experimental Results · p. 9
The test accuracy increases as the privacy parameter ε increases.
“The test accuracy increases as the privacy parameter ϵ increases.”
Quote in the paperNot a substantial claim - Findingown data§ D. Evaluation on the incentive mechanism · p. 10
When there is no incentive mechanism, the reward value is the same in each global epoch regardless of poisoning updates.
“As shown in Figure 10, when there is no incentive mechanism, the reward value is the same in each global epoch regardless of poisoning updates.”
Quote in the paperSubstantial claim - Findingown data§ B. Experimental Results · p. 9
We can achieve at least 90% accuracy when the global epoch = 2 and the privacy parameter ε > 1.
“Our experiment shows that we can achieve at least 90% accuracy when the global epoch = 2 and the privacy parameter ϵ > 1 .”
Quote in the paperNot a substantial claim - Findingown data§ B. Experimental Results · p. 9
If no differential privacy noise is added, the test accuracy with batch normalization outperforms that using our normalization technique.
“However, Figure 5 shows that if no differential privacy noise is added, the test accuracy with the batch normalization outperforms that using our normalization technique.”
Quote in the paperSubstantial claim - Findingreasoning§ B. Experimental Results · p. 9
The test accuracy is better when the number of global epoch = 2 than when the number of global epoch = 1 or 3 when ε = 2 and the number of local epochs is 40.
“Furthermore, Figure 6 illustrates that the test accuracy is better when the number of global epoch = 2 than the number of global epoch = 1 or 3 when ϵ = 2 and the number of local epochs is 40 .”
Quote in the paperNot a substantial claim - Findingown data§ B. Experimental Results · p. 9
The test accuracy of FL model is affected by both the number of local epochs and the number of global epochs.
“Figure 8 shows that the test accuracy of FL model is affected by both the number of local epochs and the number of the global epochs.”
Quote in the paperNot a substantial claim - Findingreasoning§ B. Experimental Results · p. 9
As the batch size increases, the test accuracy will decrease.
“Moreover, as the batch size increases, the test accuracy will decrease.”
Quote in the paperSubstantial claim - Findingown data§ C. Performance evaluation on the mobile device and edge server · p. 10
The average size of locally trained models is 617.8 KB in our experiment.
“The average size of locally trained models is 617 . 8 KB in our experiment.”
Quote in the paperSubstantial claim - Findingnone given§ D. Evaluation on the incentive mechanism · p. 10
Without the incentive mechanism, customers' reputation will be 0.
“Without the incentive mechanism, customers' reputation will be 0 .”
Quote in the paperSubstantial claim - Findingnone given§ D. Evaluation on the incentive mechanism · p. 10
If the malicious behaviour happens when the value of reputation is higher than h, the reputation drops by 1, so does the reward in the subsequent global epoch.
“However, if the malicious behaviour happens when the value of reputation is higher than h , the reputation drops by 1 , so does the reward in the subsequent global epoch.”
Quote in the paperSubstantial claim - Findingown data§ D. Evaluation on the incentive mechanism · p. 10
If a customer is honest and uploads the correct update in every global epoch, her reputation increases as the number of global epoch increases.
“If a customer is honest and uploads the correct update in every global epoch, her reputation increases as the number of global epoch increases.”
Quote in the paperSubstantial claim - Findingown data§ D. Evaluation on the incentive mechanism · p. 10
With the incentive mechanism, the honest customer, whose updates are accepted, will gain more rewards as the number of global epochs increases.
“However, with the incentive mechanism, the honest customer, whose updates are accepted, will gain more rewards as the number of global epochs increases.”
Quote in the paperSubstantial claim - Findingreasoning§ VII. DISCUSSION · p. 11
We can achieve the accuracy of 97%.
“and we can achieve the accuracy of 97% .”
Quote in the paperSubstantial claim - Findingreasoning§ D. Evaluation on the incentive mechanism · p. 10
If the poisoning attack is performed when the value of the reputation is equal to h, the customer's reputation will be clear, which will result in small rewards afterwards.
“If the poisoning attack is performed when the value of the reputation is equal to the h , the customer's reputation will be clear, which will result in small rewards afterwards.”
Quote in the paperNot a substantial claim - Premisecitation§ I. INTRODUCTION · p. 1
Attackers can recover data from gradients uploaded by customers.
“Attackers can recover data from gradients uploaded by customers [4].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [4] [4] B. Hitaj, G. Ateniese, and F. Perez-Cruz, 'Deep models under the GAN: information leakage from collaborative deep learning,' in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , 2017, pp. 603-618. - source
Not checked in the free run.
- Premisecitation§ I. INTRODUCTION · p. 1
Gradient updates might leak significant information about customers' training data.
“However, Melis et al. [3] demonstrated that gradient updates might leak significant information about customers' training data.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites Melis et al. [3] [3] L. Melis, C. Song, E. De Cristofaro, and V. Shmatikov, 'Exploiting unintended feature leakage in collaborative learning,' in IEEE Symposium on Security and Privacy (S&P) , 2019. -
Not checked in the free run.
- Premisecitation§ III. RELATED WORK · p. 3
Directly adding differential privacy noise to the original data instead of the gradients may seriously affect accuracy.
“However, they directly added differential privacy noise to the original data instead of the gradients, which may affect the accuracy seriously.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [16] [16] Y. Lu, X. Huang, Y. Dai, S. Maharjan, and Y. Zhang, 'Blockchain and federated learning for privacy-preserved data sharing in industrial IoT,' IEEE Transactions on Industrial Informatics , 2019. -
Not checked in the free run.
- Interpretationnone given§ I. INTRODUCTION · p. 2
The proposed normalization technique preserves the privacy of the extracted features of each participant's data.
“Second, we propose a new normalization technique which delivers a higher test accuracy than batch normalization, while preserving the privacy of the extracted features of each participant's data.”
Quote in the paperNot a substantial claim - Premisecitation§ I. INTRODUCTION · p. 1
The federated approach for training the model is susceptible to model poisoning attacks.
“Besides, the federated approach for training the model is susceptible to model poisoning attacks [5].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [5] [5] C. Fung, C. J. Yoon, and I. Beschastnikh, 'Mitigating sybils in federated learning poisoning,' arXiv preprint arXiv:1808.04866 , 2018. -
Not checked in the free run.
- Premisecitation§ I. INTRODUCTION · p. 1
Information leakage risks exist in the third party's mobile edge computing (MEC) server.
“In addition, information leakage risks exist in the third party's mobile edge computing (MEC) server [6].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [6] [6] Y. Zhang, T. Gu, and X. Zhang, 'Mdldroid: a chainsgd-reduce approach to mobile deep learning for personal mobile sensing,' in 2020 19th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN) . IEEE, 2020, pp. 73-84. -
Not checked in the free run.
- Interpretationnone given§ I. INTRODUCTION · p. 2
By leveraging differential privacy, the system prevents adversaries from exploiting the learned model to infer customers' sensitive information.
“Besides, by leveraging differential privacy, we prevent adversaries from exploiting the learned model to infer customers' sensitive information.”
Quote in the paperNot a substantial claim - Premisecitation§ C. Normalization Technique · p. 6
Both Jiang et al.'s solution and our solution add the same zero-mean Laplace noise to normalized layer inputs.
“Both Jiang et al. 's solution [45] and our solution add the same zero-mean Laplace noise to normalized layer inputs.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [45] [45] L. Jiang, X. Lou, R. Tan, and J. Zhao, 'Differentially private collaborative learning for the IoT edge,' in International Workshop on Crowd Intelligence for Smart Cities: Technology and Applications (CISC) , 2018. -
Not checked in the free run.
- Interpretationreasoning§ C. Normalization Technique · p. 6
Our normalization technique imposes no constraints on the mean and variance.
“without any constraints on the mean and variance.”
Quote in the paperSubstantial claim - Interpretationcitation§ B. Incentive mechanism · p. 5
The incentive mechanism prevents poisoning attacks.
“Specifically, by combining the Multi-KRUM [51,52] and the reputation-based incentive protocols [53], an incentive mechanism is designed to prevent the poisoning attack as well as reward contributors properly.”
Quote in the paperSubstantial claim0 of 3 sources checked- cites [51] [51] P. Blanchard, E. M. E. Mhamdi, R. Guerraoui, and J. Stainer, 'Machine learning with adversaries: Byzantine tolerant gradient descent,' in Advances in Neural Information Processing Systems , 2017, pp. 119-129. -
Not checked in the free run.
- cites [52] [52] M. Shayan, C. Fung, C. J. Yoon, and I. Beschastnikh, 'Biscotti: A ledger for private and secure peer-to-peer machine learning,' arXiv preprint arXiv:1811.09904 , 2018. - source
Not checked in the free run.
- cites [53] [53] Y. Zhang and M. Van der Schaar, 'Reputation-based incentive protocols in crowdsourcing applications,' in 2012 Proceedings IEEE INFOCOM . IEEE, 2012, pp. 2140-2148. - source
Not checked in the free run.
- Interpretationreasoning§ C. Normalization Technique · p. 6
Most feature values after batch normalization lie in [-3σ, 3σ], which is [-3, 3], instead of [-√N-1, √N-1].
“Similarly, most feature values after batch normalization lie in [ -3 σ, 3 σ ] which is [ -3 , 3] instead of [ - √ N -1 , √ N -1] .”
Quote in the paperSubstantial claim - Study design and conductcitation§ C. Normalization Technique · p. 6
Independent zero-mean Laplace noise with scale 2√N-1/ε is added to each normalized feature dimension to protect it under ε-differential privacy.
“Then, based on Laplace mechanism [9], the independent zero-mean Laplace noise with scale 2 √ N -1 / ϵ is added to each ˆ X i,j,k for i ∈ { 1 , 2 , . . . , L f } and j ∈ { 1 , 2 , . . . , W f } to protect X i,j,k under ϵ -differential privacy.”
- Also stated in: § A. Experiment Setup · p. 7 · plain
“Then, according to Laplace mechanism [9], the independent zero-mean Laplace noise with scale 2 √ N -1 / ϵ is added to each dimension of the normalized features to protect features under ϵ -differential privacy.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [9] [9] C. Dwork, F. McSherry, K. Nissim, and A. Smith, 'Calibrating noise to sensitivity in private data analysis,' in Theory of Cryptography Conference (TCC) , 2006, pp. 265-284. - source
Not checked in the free run.
- Also stated in: § A. Experiment Setup · p. 7 · plain
- Interpretationreasoning§ C. Normalization Technique · p. 6
When the same amount of Laplace noise is added, feature values using batch normalization will be perturbed more easily than using our normalization technique.
“Hence, when the same amount of Laplace noise is added, feature values using batch normalization will be perturbed more easily than using our normalization technique.”
Quote in the paperSubstantial claim - Interpretationreasoning§ C. Normalization Technique · p. 6
Features have smaller magnitudes when using batch normalization than when using our normalization technique.
“Thus, features have smaller magnitudes when using batch normalization than using our normalization technique.”
Quote in the paperSubstantial claim - Interpretationnone given§ C. Normalization Technique · p. 6
Feature values lie more evenly in [-√N-1, √N-1] when using our normalization technique.
“In contrast, feature values lie more evenly in [ - √ N -1 , √ N -1] when using our normalization technique.”
Quote in the paperNot a substantial claim - Interpretationreasoning§ B. Experimental Results · p. 8
Our normalization technique is useful when Laplace noise is added to features because we relax constraints of normalization compared with batch normalization.
“Thus, we confirm that our normalization technique is useful when we add Laplace noise to features, because we relax constraints of normalization compared with batch normalization as stated in Section IV-A.”
Quote in the paperSubstantial claim - Interpretationreasoning§ C. Normalization Technique · p. 7
Our normalization technique outperforms batch normalization under ε-differential privacy when training the FL model, achieving higher test accuracy.
“Summarizing above, the trained model with our normalization technique will achieve a higher test accuracy than trained using the batch normalization.”
- Also stated in: § B. Experimental Results · p. 9 · boosted
“Thus, we conclude that our normalization technique outperforms the batch normalization under ϵ -differential privacy when training the FL model.”
- Also stated in: § VIII. CONCLUSION AND FUTURE WORK · p. 11 · plain
“To improve the accuracy of FL model, we design a new normalization technique which is proved to outperform the batch normalization if features' privacy is protected by differential privacy.”
Quote in the paperSubstantial claim - Also stated in: § B. Experimental Results · p. 9 · boosted
- Interpretationreasoning§ C. Normalization Technique · p. 7
Features will be perturbed more seriously when using batch normalization than our normalization technique.
“Thus, our above example implies that features will be perturbed more seriously when using batch normalization than our normalization technique.”
Quote in the paperSubstantial claim - Interpretationreasoning§ B. Delay in Crowdsourcing · p. 7
The delay problem can be mitigated by using incentive mechanisms.
“This problem can be mitigated by using the incentive mechanisms.”
Quote in the paperNot a substantial claim - Interpretationown data§ B. Experimental Results · p. 9
Our designed FL method is effective.
“Through our experiment, we can verify that our designed FL method is effective.”
Quote in the paperSubstantial claim - Interpretationown data§ C. Performance evaluation on the mobile device and edge server · p. 9
It is feasible to utilize mobile devices in federated learning.
“Thus, we confirm that it is feasible to utilize mobile devices in the federated learning.”
Quote in the paperSubstantial claim - Interpretationreasoning§ C. Performance evaluation on the mobile device and edge server · p. 10
Assuming upload bandwidth is 1MB/s, the communication cost is 0.6178 second.
“Assume the upload bandwidth is 1MB/s, so the communication cost is 0 . 6178 second.”
Quote in the paperSubstantial claim- The authors state this as an assumption: The upload bandwidth is 1MB/s.
- Interpretationreasoning§ B. Experimental Results · p. 9
Our normalization technique works better with FL under DP protection.
“Therefore, we conclude that our normalization technique works better with FL under DP protection.”
Quote in the paperSubstantial claim - Interpretationreasoning§ C. Performance evaluation on the mobile device and edge server · p. 10
The delay of our proposed approach is small because smartphones often use wideband network connections.
“In addition to the training time, the delay of our proposed approach, which depends on the transmission rate, is small because smartphones often use wideband network connections (e.g., 4G and WiFi).”
Quote in the paperNot a substantial claim- Rests on an assumption: Smartphones often use wideband network connections (e.g., 4G and WiFi).
- Interpretationown data§ C. Performance evaluation on the mobile device and edge server · p. 9
An edge server will significantly improve the speed of training because it trains much faster.
“Besides, an edge server will significantly improve the speed of training because it trains much faster.”
Quote in the paperNot a substantial claim - Interpretationown data§ C. Performance evaluation on the mobile device and edge server · p. 10
The communication cost is little compared with wasted training time on the mobile device.
“The communication cost is little compared with wasted training time on the mobile device.”
Quote in the paperNot a substantial claim - Premisecitation§ VII. DISCUSSION · p. 11
Hitaj et al. demonstrated that a curious server could obtain confidential information using a generative adversarial network if gradients were protected by a large privacy budget in collaborative learning.
“Hitaj et al. [4] demonstrated that a curious server could obtain the confidential information using the generative adversarial network if gradients were protected by a large privacy budget in the collaborative learning.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [4] [4] B. Hitaj, G. Ateniese, and F. Perez-Cruz, 'Deep models under the GAN: information leakage from collaborative deep learning,' in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , 2017, pp. 603-618. - source
Not checked in the free run.
- Premisecitation§ VII. DISCUSSION · p. 11
Their experiments confirmed that GAN-based approaches might not work well when the selected privacy parameter was smaller than 10, which is the upper bound of privacy parameter in our experiment.
“But their experiments confirmed that GAN-based approaches might not work well when the selected privacy parameter was smaller than 10 , which is the upper bound of privacy parameter in our experiment, and we can achieve the accuracy of 97% .”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [4] [4] B. Hitaj, G. Ateniese, and F. Perez-Cruz, 'Deep models under the GAN: information leakage from collaborative deep learning,' in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , 2017, pp. 603-618. - source
Not checked in the free run.
- Premisecitation§ VII. DISCUSSION · p. 11
There are studies discussing potential risks of information leakage in FL in which attackers may infer customers' private data from gradients.
“There are studies discussing potential risks of information leakage in FL [4,66] in which attackers may infer customers' private data from gradients.”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [4] [4] B. Hitaj, G. Ateniese, and F. Perez-Cruz, 'Deep models under the GAN: information leakage from collaborative deep learning,' in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , 2017, pp. 603-618. - source
Not checked in the free run.
- cites [66] [66] H. Yin, P. Molchanov, J. M. Alvarez, Z. Li, A. Mallya, D. Hoiem, N. K. Jha, and J. Kautz, 'Dreaming to distill: Data-free knowledge transfer via deepinversion,' in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2020, pp. 8715-8724. source
Not checked in the free run.
- The quote only partly states this claim. 1
- May combine two claims. 29
- Classified as probably not a substantial claim. 24
The quote only partly states this claim.
Findingreasoning§ C. Normalization Technique · p. 7When batch size N=64 and Laplace scale is 2√N-1/ε, true feature values will be seriously perturbed by noise when the privacy parameter ε ≪ 5.33 using batch normalization.
“Thus, true feature values will be seriously perturbed by noise when the privacy parameter ϵ ≪ 5 . 33 using batch normalization.”
Quote in the paperSubstantial claimMay combine two claims.
Findingreasoning§ B. Experimental Results · p. 9For each DP-aware FL, the test accuracy gets closer to the test accuracy of FL without DP as the privacy parameter ε increases, because a larger ε means less privacy protection and less noise.
“For each DP-aware FL, we also observe that the test accuracy gets closer to the test accuracy of FL without DP as the privacy parameter ϵ increases, because a larger privacy parameter ϵ means less privacy protection which equals that less noise is used.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingreasoning§ C. Performance evaluation on the mobile device and edge server · p. 9For default forty epochs, the mobile device and the edge server use about 96 minutes and 6 minutes, respectively.
“For default forty epochs, the mobile device and the edge server use about 96 minutes and 6 minutes, respectively.”
Quote in the paperSubstantial claimMay combine two claims.
Findingreasoning§ B. Experimental Results · p. 9When the number of global epochs increases to 3 or 4, the test accuracy may decrease because the noise increases as the number of global epochs increases.
“However, when the number of global epochs increases to 3 or 4 , the test accuracy may decrease. The test accuracy decreases because the noise increases as the number of global epochs increases.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ B. Experimental Results · p. 9As the number of global epochs increases, the test accuracy increases if DP noise is not added; however, Laplace noise increases as the number of global epochs increases, which negatively affects the test accuracy.
“As the number of global epochs increases, the test accuracy increases if DP noise is not added. However, Laplace noise increases as the number of global epochs increases, which negatively affects the test accuracy.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingnone given§ D. Evaluation on the incentive mechanism · p. 10If there is no incentive mechanism, the customer gets a fixed reward of 5 in every global epoch.
“If there is no incentive mechanism, the customer gets a fixed reward of 5 in every global epoch.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ C. Performance evaluation on the mobile device and edge server · p. 9It takes about 144 seconds to train the model with 6,000 images on the Raspberry Pi 4 for each epoch, and about 9 seconds on the laptop.
“It takes about 144 seconds to train the model with 6,000 images on the Raspberry Pi 4 (i.e., the mobile device) for each epoch, and it uses about 9 seconds to train the model on the laptop (i.e., the edge server).”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ B. Experimental Results · p. 9When the number of local epochs equals 20 or 30, it takes 4 global epochs to achieve a similar accuracy; when the number of local epochs is 40, it takes 2 global epochs.
“From Figure 8, when the number of local epochs equals 20 or 30 , it takes 4 global epochs to achieve a similar accuracy. When the number of local epochs is 40 , it takes 2 global epochs.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingnone given§ D. Evaluation on the incentive mechanism · p. 10The behaviour of the poisoning attack affects the value of reputation, which results in a decrease of the reputation.
“Besides, the behaviour of the poisoning attack affects the value of reputation, which results in a decrease of the reputation.”
Quote in the paperSubstantial claimMay combine two claims.
Findingnone given§ D. Evaluation on the incentive mechanism · p. 10If a customer uploads a malicious update when her reputation value equals h (i.e., 5), her reputation will drop to 0; if her reputation is not 5, her reputation drops by 1 when caught performing poisoning attack.
“However, if a customer uploads a malicious update when her reputation value equals to the h (i.e., 5 ), her reputation will drop to 0 . However, if her reputation is not 5 , her reputation drops by 1 when caught performing poisoning attack.”
Quote in the paperSubstantial claimMay combine two claims.
Findingnone given§ D. Evaluation on the incentive mechanism · p. 10If a customer's update is considered as poisoning, her update will not be accepted, and her reward is 0.
“If a customer's update is considered as poisoning (i.e., the value of s in Eq. (1) is significantly larger than others), her update will not be accepted, that is, her reward is 0 .”
Quote in the paperSubstantial claimClassified as probably not a substantial claim. May combine two claims.
Interpretationreasoning§ I. INTRODUCTION · p. 1Customers and the requester can save high service fees while keeping the crowdsourcing system functional.
“Therefore, customers and the requester can save high service fees while keeping the crowdsourcing system functional.”
Quote in the paperSubstantial claim- Rests on an assumption: The traditional crowdsourcing system is hosted by a third party, which charges customers costly service fees.
Probably not a substantial claim: may not pass S4 (based).
Interpretationnone given§ I. INTRODUCTION · p. 2The blockchain-based system prevents malicious model updates by ensuring that all model updates are held accountable.
“Third, our blockchain-based system prevents malicious model updates by ensuring that all model updates are held accountable.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationreasoning§ A. System Overview · p. 4Neither manufacturers nor customers can deny recorded contributions or activities.
“In addition, neither manufacturers nor customers can deny recorded contributions or activities.”
- Also stated in: § A. System Overview · p. 5 · plain
“By using the immutable property of the blockchain, both manufacturers and customers cannot deny transactions stored on the blockchain.”
Quote in the paperSubstantial claim- Also stated in: § A. System Overview · p. 5 · plain
May combine two claims.
Interpretationcitation§ B. Differential Privacy · p. 3The final trained model satisfies differential privacy because noise is added to an intermediate layer and the post-processing property holds.
“Hence, in our design, although noise is added to an intermediate layer of the neural network, the post-processing property ensures that the final trained model also satisfies differential privacy.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [9] [9] C. Dwork, F. McSherry, K. Nissim, and A. Smith, 'Calibrating noise to sensitivity in private data analysis,' in Theory of Cryptography Conference (TCC) , 2006, pp. 265-284. - source
Not checked in the free run.
Classified as probably not a substantial claim.
Premisecitation§ C. Normalization Technique · p. 6According to the three-sigma rule of Gaussian distribution, about 99.73% of values lie within three standard deviations of the mean.
“According to the three-sigma rule of Gaussian distribution [54], about 99 . 73% values lie within three standard deviations of the mean.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [54] [54] F. Pukelsheim, 'The three sigma rule,' The American Statistician , vol. 48, no. 2, pp. 88-91, 1994. -
Not checked in the free run.
Classified as probably not a substantial claim.
Premisecitation§ B. Differential Privacy · p. 3The Laplace mechanism can be used to ensure differential privacy by adding independent zero-mean Laplace noise with scale λ to each dimension of the output.
“The Laplace mechanism of [9] can be used to ensure differential privacy by adding independent zero-mean Laplace noise with scale λ to each dimension of the output.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [9] [9] C. Dwork, F. McSherry, K. Nissim, and A. Smith, 'Calibrating noise to sensitivity in private data analysis,' in Theory of Cryptography Conference (TCC) , 2006, pp. 265-284. - source
Not checked in the free run.
Classified as probably not a substantial claim.
Premisecitation§ B. Differential Privacy · p. 3The post-processing property of differential privacy means that a data analyst cannot compute the function of the output of a differentially private algorithm and reduce its privacy guarantee without obtaining additional knowledge about the private data.
“The post-processing property [9] of differential privacy means that a data analyst cannot compute the function of the output of a differentially private algorithm and reduce its privacy guarantee without obtaining additional knowledge about the private data.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [9] [9] C. Dwork, F. McSherry, K. Nissim, and A. Smith, 'Calibrating noise to sensitivity in private data analysis,' in Theory of Cryptography Conference (TCC) , 2006, pp. 265-284. - source
Not checked in the free run.
May combine two claims.
Premisecitation§ C. Normalization Technique · p. 6When using batch normalization, the mean of features is 0 and the variance is 1.
“When using batch normalization, the mean of features µ = 0 and the variance σ = 1 .”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [45] [45] L. Jiang, X. Lou, R. Tan, and J. Zhao, 'Differentially private collaborative learning for the IoT edge,' in International Workshop on Crowd Intelligence for Smart Cities: Technology and Applications (CISC) , 2018. -
Not checked in the free run.
Classified as probably not a substantial claim.
Premisecitation§ I. INTRODUCTION · p. 1Federated learning enables analysts to analyze and utilize locally generated data in a decentralized way without requiring uploading data to a centralized server.
“Federated learning (FL) enables analysts to analyze and utilize the locally generated data in a decentralized way without requiring uploading data to a centralized server; that is, the utility of data are well maintained despite data are preserved locally.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [13] [13] B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, 'Communication-efficient learning of deep networks from decentralized data,' in Artificial Intelligence and Statistics , 2017, pp. 1273-1282. -
Not checked in the free run.
Probably not a substantial claim: may not pass S4 (based). May combine two claims.
Interpretationnone given§ I. INTRODUCTION · p. 2The reputation-based incentive mechanism rewards reliable customers and punishes malicious customers correspondingly.
“Furthermore, to motivate more customers to participate in the crowdsourcing task and reduce malicious and poisoning updates, we utilize a reputation-based crowdsourcing incentive mechanism, which rewards reliable customers and punish malicious customers correspondingly.”
Quote in the paperNot a substantial claim- Rests on an assumption: Some customers are unwilling to participate in training the FL model.
May combine two claims.
Interpretationreasoning§ C. Normalization Technique · p. 7The larger privacy parameter means less noise, so feature values using batch normalization are more vulnerable.
“The larger privacy parameter means the less noise, so that feature values using batch normalization are more vulnerable.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.
Premisenone given§ A. Experiment Setup · p. 7The normalization layer enables the computation of sensitivity in differential privacy to determine the amount of noise to add, speeds up the learning rate, and regularizes gradients from distraction to outliers.
“The normalization layer enables the computation of sensitivity in differential privacy to determine the amount of noise to add, speeds up the learning rate, and regularizes gradients from distraction to outliers.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Premisecitation§ A. Experiment Setup · p. 7The MNIST dataset includes 60,000 training image samples and 10,000 test image samples, each a 28×28 gray scale image showing a handwritten number within 0 to 9.
“The MNIST dataset includes 60,000 training image samples and 10,000 test image samples. Each sample is a 28 × 28 gray scale image showing a handwritten number within 0 to 9 .”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [56] [56] Y. LeCun, C. Cortes, and C. Burges, 'MNIST handwritten digit database,' 2010, accessed on March 1, 2019. [Online]. Available: http://yann.lecun.com/exdb/mnist -
Not checked in the free run.
Probably not a substantial claim: may not pass S4 (based). May combine two claims.
Interpretationreasoning§ A. Privacy and Security · p. 7Our system leverages differential privacy to protect the privacy of extracted features, keeping participating customers' data confidential.
“Our system leverages differential privacy technique to protect the privacy of the extracted features. Thus, the system keeps the participating customers' data confidential.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationreasoning§ B. Experimental Results · p. 8A feature that goes through batch normalization often results in a smaller magnitude than one that goes through our normalization technique, so the feature value is easily overwhelmed by noise when using batch normalization.
“A feature goes through batch normalization often results in a smaller magnitude than that goes through our normalization technique, so the value of feature is easily overwhelmed by the noise when using batch normalization.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S4 (based).
Study design and conductreasoning§ A. Experiment Setup · p. 7We apply ε-DP noise to perturb the output of normalization layers to preserve the privacy of the extracted features.
“Then, we apply ϵ -DP noise to perturb the output of normalization layers to preserve the privacy of the extracted features.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based). May combine two claims.
Study design and conductnone given§ A. Privacy and Security · p. 7The trained model is encrypted and signed by the sender to prevent attackers and imposters from stealing the model or deriving original data through reverse-engineering.
“Furthermore, the trained model is encrypted and signed by the sender to prevent the attackers and imposters from stealing the model or deriving original data through reverse-engineering.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based). May combine two claims.
Study design and conductnone given§ A. Experiment Setup · p. 7We normalize each dimension of the feature to the interval [-√N-1, √N-1] for batch size N, so that the sensitivity of the normalized feature vector when one dimension changes is 2√N-1.
“We normalize each dimension of the feature to the interval [ - √ N -1 , √ N -1] for N denoting the batch size, so that the sensitivity of the normalized feature vector when one dimension of the feature changes is 2 √ N -1 .”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Premisecitation§ B. Delay in Crowdsourcing · p. 7Yu et al. designed a queue to store customers who submitted their models in order, so customers who submit locally trained models early will be rewarded to encourage earlier updates.
“Yu et al. [55] designed a queue to store customers who submitted their models in order. Thus, customers who submit their locally trained models early will be rewarded to encourage people to submit their updates earlier.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [55] [55] H. Yu, Z. Liu, Y. Liu, T. Chen, M. Cong, X. Weng, D. Niyato, and Q. Yang, 'A fairness-aware incentive scheme for federated learning,' in Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society , 2020, pp. 393-399. -
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Premisecitation§ A. Experiment Setup · p. 7MNIST is a standard dataset employed for testing machine learning algorithms and gives moderate and typical complexity faced by IoT applications.
“In addition, the MNIST is a standard dataset employed for testing machine learning algorithms. It gives moderate and typical complexity faced by IoT applications.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [45,57]-[62]
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing).
Interpretationreasoning§ B. Delay in Crowdsourcing · p. 7Customers who seldom use devices may postpone the overall crowdsourcing progress.
“As a result, customers who seldom use devices may postpone the overall crowdsourcing progress.”
Quote in the paperNot a substantial claim- The authors state this as an assumption: There is a large number of customers, and the system highly depends on customers' training results to obtain the predictive model in one global epoch.
Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Interpretationnone given§ B. Experimental Results · p. 9A larger ε means that less noise is added to features, so that the privacy protection is weaker.
“A larger ϵ means that less noise is added to features, so that the privacy protection is weaker.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Premisecitation§ C. Performance evaluation on the mobile device and edge server · p. 9A client is supposed to participate in federated learning when the smartphone is idle, such as charging, screen off, and connected to an unmetered network.
“A client is supposed to participate in the federated learning when the smartphone is idle, such as charging, screen off, and connected to an unmetered network, for example, WiFi [13,65].”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites [13] [13] B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, 'Communication-efficient learning of deep networks from decentralized data,' in Artificial Intelligence and Statistics , 2017, pp. 1273-1282. -
Not checked in the free run.
- cites [65] [65] K. Bonawitz, H. Eichner, W. Grieskamp, D. Huba, A. Ingerman, V. Ivanov, C. Kiddon, J. Koneˇ cn` y, S. Mazzocchi, H. B. McMahan et al. , 'Towards federated learning at scale: System design,' arXiv preprint arXiv:1902.01046 , 2019. -
Not checked in the free run.
May combine two claims.
Interpretationreasoning§ B. Experimental Results · p. 9The added Laplace noise increases as the batch size N increases, which results in a worse test accuracy.
“This is because we add Laplace noise to features, the added noise will increase as the batch size N increases, which results in a worse test accuracy.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Premisecitation§ B. Experimental Results · p. 9Typical ε values for experiments are between 0.1 and 10.
“Typical ϵ values for experiments are between 0 . 1 and 10 [63].”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [63] [63] D. S´ anchez, J. Domingo-Ferrer, and S. Mart´ ınez, 'Improving the utility of differential privacy via univariate microaggregation,' in International Conference on Privacy in Statistical Databases , 2014, pp. 130-142. -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Probably not a substantial claim: may not pass S4 (based).
Study design and conductnone given§ VIII. CONCLUSION AND FUTURE WORK · p. 11Our system enforces differential privacy to protect the privacy of customers' data.
“Besides, our system enforces differential privacy to protect the privacy of customers' data.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationreasoning§ D. Evaluation on the incentive mechanism · p. 11Our incentive mechanism can encourage honest customers to contribute their useful updates while preventing malicious customers from attempting to perform the poisoning attack.
“Thus, our incentive mechanism can encourage honest customers to contribute their useful updates while preventing malicious customers from attempting to perform the poisoning attack.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationreasoning§ VII. DISCUSSION · p. 11In our trained model, we add Laplacian noise during training in the batch normalization layer, so attackers are unable to obtain the true information stored there, and DeepInversion is ineffective against our trained model.
“In our trained model, we add Laplacian noise during training in the batch normalization layer, and then attackers are unable to obtain the true information stored there. Thus, their approach is ineffective against our trained model.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationreasoning§ VII. DISCUSSION · p. 11We leverage differential privacy to perturb features before classification in the fully connected layers, so gradients are also protected by differential privacy.
“To prevent this scenario, we leverage differential privacy to perturb features before classification in the fully connected layers. Thus, gradients are also protected by differential privacy.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationreasoning§ VII. DISCUSSION · p. 11Our designed approach guarantees the accuracy and protects the privacy of local models as well as data.
“Therefore, our designed approach guarantees the accuracy and protects the privacy of local models as well as data.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S4 (based).
Interpretationnone given§ VIII. CONCLUSION AND FUTURE WORK · p. 11By designing a proper incentive mechanism for the crowdsourcing task, customers are more likely to participate in the crowdsourcing tasks.
“By designing a proper incentive mechanism for the crowdsourcing task, customers are more likely to participate in the crowdsourcing tasks.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based). May combine two claims.
Interpretationnone given§ VIII. CONCLUSION AND FUTURE WORK · p. 11The blockchain will audit all customers' updates during federated training, so the system can hold model updates accountable to prevent malicious customers or manufacturers.
“The blockchain will audit all customers' updates during the federated training, so that the system can hold the model updates accountable to prevent malicious customers or manufacturers.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
Premisecitation§ VII. DISCUSSION · p. 11Yin et al. introduced a DeepInversion method which could invert a trained neural network to synthesized class-conditional input images starting from random noise, leveraging information stored in the batch normalization layer.
“In addition, Yin et al. [66] introduced a DeepInversion method which could invert a trained neural network to a synthesized class-conditional input images starting from the random noise. However, they leveraged the information stored in the batch normalization layer.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [66] [66] H. Yin, P. Molchanov, J. M. Alvarez, Z. Li, A. Mallya, D. Hoiem, N. K. Jha, and J. Kautz, 'Dreaming to distill: Data-free knowledge transfer via deepinversion,' in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2020, pp. 8715-8724. source
Not checked in the free run.
The paper relies on this without support.
The traditional crowdsourcing system is hosted by a third party, which charges customers costly service fees.
“The traditional crowdsourcing system is hosted by a third party, which charges customers costly service fees, while our designed system uses blockchain to record crowdsourcing activities.”
The paper relies on this without support.
Mobile phones have limited computational power and battery life.
“Since mobile phones have limited computational power and battery life, we offload part of the training task to the edge computing sever.”
The paper relies on this without support.
Home appliances are equipped with heterogeneous storage and computational powers, making it difficult to enable each IoT device to train the deep model.
“However, since home appliances are equipped with heterogeneous storage and computational powers, it is difficult to enable each IoT device to train the deep model.”
The paper relies on this without support.
Data in home appliances contain customers' confidential information.
“Because data in home appliances contain customers' confidential information and training consumes computing resources, some customers are unwilling to participate in training the FL model.”
The paper relies on this without support.
Training consumes computing resources.
“Because data in home appliances contain customers' confidential information and training consumes computing resources, some customers are unwilling to participate in training the FL model.”
The paper relies on this without support.
Some customers are unwilling to participate in training the FL model.
“Because data in home appliances contain customers' confidential information and training consumes computing resources, some customers are unwilling to participate in training the FL model.”
The authors state this as an assumption.
There is a large number of customers, and the system highly depends on customers' training results to obtain the predictive model in one global epoch.
“Assume there is a large number of customers, and the system highly depends on customers' training results to obtain the predictive model in one global epoch.”
The authors state this as an assumption.
The upload bandwidth is 1MB/s.
“Assume the upload bandwidth is 1MB/s, so the communication cost is 0 . 6178 second.”
The paper relies on this without support.
Smartphones often use wideband network connections (e.g., 4G and WiFi).
“because smartphones often use wideband network connections (e.g., 4G and WiFi).”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
This approach limits the danger of personal user data being leaked to an external source, ensuring better level of client security.
“This approach limits the danger of personal user data being leaked to an external source, ensuring better level of client security [149].”
From Federated learning-based AI approaches in smart healthcare: Concepts, taxonomies, challenges and open issues (2023) · cites this paper as [149]
FL reduces the risks of leakage of sensitive user information to external third-party, thus providing a higher degree of user privacy.
“This would reduce the risks of the leakage of sensitive user information to the external third-party, and thus providing a higher degree of user privacy [30].”
From Federated learning for smart healthcare: A survey (2023) · cites this paper as [30]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
MNIST dataset is cited as the Biscotti paper
MinorThe performance evaluation cites [52] for the MNIST dataset, but reference [52] is a paper titled "Biscotti," while the paper identifies [56] as the MNIST dataset reference elsewhere.
“we distribute the MNIST dataset [52] with 60,000 images to ten participants equally”
“[52] M. Shayan, C. Fung, C. J. Yoon, and I. Beschastnikh, 'Biscotti: A ledger for private and secure peer-to-peer machine learning,' arXiv preprint arXiv:1811.09904 , 2018.”
Byzantine parameter f is assigned two different meanings
MinorTable I defines f as Byzantine miners, but the incentive-mechanism section defines it as the number of Byzantine customers. These are different groups in the proposed system.
“| f | Byzantine miners |”
“R means the number of updates, and f means the number of Byzantine customers.”
Cites
Communication-Efficient Learning of Deep Networks from Decentralized Data
McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. Y. (2016) · arXiv · doi:10.48550/arxiv.1602.05629 · Cited by 14,215 · see citing works
Edge computing: Vision and challenges
Shi, W., Cao, J., Zhang, Q., Li, Y., & Xu, L. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2579198 · Cited by 8,733 · see citing works
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 · see citing works
Federated Machine Learning: Concept and Applications
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3298981 · Cited by 6,322 · see citing works
Self-citationFederated learning: Challenges, methods, and future directions
Li, T., Sahu, A. K., Talwalkar, A., & Smith, V. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2975749 · Cited by 6,210 · see citing works
Federated Learning: Strategies for Improving Communication Efficiency
Konečný, J., McMahan, H. B., Yu, F. X., Richtárik, P., Suresh, A. T., & Bacon, D. (2016) · arXiv · doi:10.48550/arxiv.1610.05492 · Cited by 3,766 · see citing works
Federated Learning in Mobile Edge Networks: A Comprehensive Survey
Lim, W. Y. B., Luong, N. C., Hoang, D. T., Jiao, Y., Liang, Y.-C., Yang, Q., Niyato, D., & Miao, C. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2986024 · Cited by 2,565 · see citing works
Self-citationTowards Federated Learning at Scale: System Design
Bonawitz, K., Eichner, H., Grieskamp, W., Huba, D., Ingerman, A., Ivanov, V., Kiddon, C., Konečný, J., Mazzocchi, S., McMahan, H. B., et al. (2019) · arXiv · doi:10.48550/arxiv.1902.01046 · Cited by 2,334 · see citing works
Adaptive Federated Learning in Resource Constrained Edge Computing Systems
Wang, S., Tuor, T., Salonidis, T., Leung, K. K., Makaya, C., He, T., & Chan, K. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2904348 · Cited by 2,232 · see citing works
Client Selection for Federated Learning with Heterogeneous Resources in Mobile Edge
Nishio, T., & Yonetani, R. (2019) · ICC 2019 - 2019 IEEE International Conference on Communications (ICC) · doi:10.1109/icc.2019.8761315 · Cited by 1,875 · see citing works
RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response
Erlingsson, Ú., Pihur, V., & Korolova, A. (2014) · Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2660267.2660348 · Cited by 1,838 · see citing works
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 · see citing works
Nasr, M., Shokri, R., & Houmansadr, A. (2019) · 2019 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2019.00065 · Cited by 1,760 · see citing works
Exploiting Unintended Feature Leakage in Collaborative Learning
Melis, L., Song, C., De Cristofaro, E., & Shmatikov, V. (2019) · 2019 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2019.00029 · Cited by 1,734 · see citing works
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Gilad, Y., Hemo, R., Micali, S., Vlachos, G., & Zeldovich, N. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132757 · Cited by 1,499 · see citing works
(2017) · neural information processing systems · Cited by 1,413 · see citing works
Deep Models Under the GAN: Information Leakage from Collaborative Deep Learning
Hitaj, B., Ateniese, G., & Perez-Cruz, F. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134012 · Cited by 1,377 · see citing works
Blockchain and Federated Learning for Privacy-Preserved Data Sharing in Industrial IoT
Lu, Y., Huang, X., Dai, Y., Maharjan, S., & Zhang, Y. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2942190 · Cited by 1,245 · see citing works
Pukelsheim, F. (1994) · The American Statistician · doi:10.2307/2684253 · Cited by 1,242 · see citing works
Shi, W., & Dustdar, S. (2016) · Computer · doi:10.1109/mc.2016.145 · Cited by 1,241 · see citing works
A Privacy-Preserving and Transparent Certification System for Digital Credentials
Saramago, R. Q., Meling, H., & Jehl, L. N. (2014) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.opodis.2022.9 · Cited by 1,204 · see citing works
A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks
Wang, W., Hoang, D. T., Hu, P., Xiong, Z., Niyato, D. T., Wang, P., Wen, Y., & Kim, D. I. (2019) · IEEE Access · doi:10.1109/access.2019.2896108 · Cited by 1,105 · see citing works
Self-citationPukelsheim, F. (1994) · The American Statistician · doi:10.1080/00031305.1994.10476030 · Cited by 1,072 · see citing works
In-Edge AI: Intelligentizing Mobile Edge Computing, Caching and Communication by Federated Learning
Wang, X., Han, Y., Wang, C., Zhao, Q., Chen, X., & Chen, M. (2019) · IEEE Network · doi:10.1109/mnet.2019.1800286 · Cited by 1,030 · cited 2× · see citing works
“In addition, a few studies have combined deep learning or FL with edge computing [44]–[47].”
BackgroundBlockchained On-Device Federated Learning
Kim, H., Park, J., Bennis, M., & Kim, S.-L. (2020) · IEEE Communications Letters · doi:10.1109/lcomm.2019.2921755 · Cited by 887 · see citing works
Beyond Inferring Class Representatives: User-Level Privacy Leakage From Federated Learning
Wang, Z., Song, M., Zhang, Z., Song, Y., Wang, Q., & Qi, H. (2019) · IEEE INFOCOM 2019 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2019.8737416 · Cited by 881 · see citing works
DeepChain: Auditable and Privacy-Preserving Deep Learning with Blockchain-based Incentive
Weng, J., Weng, J., Zhang, J., Li, M., Zhang, Y., & Luo, W. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2019.2952332 · Cited by 610 · cited 1× · see citing works
“For example, Weng et al. [21] proposed a system called DeepChain for the collaborative learning.”
BackgroundEfficient and Privacy-Enhanced Federated Learning for Industrial Artificial Intelligence
Hao, M., Li, H., Luo, X., Xu, G., Yang, H., & Liu, S. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2945367 · Cited by 569 · see citing works
Dreaming to Distill: Data-Free Knowledge Transfer via DeepInversion
Yin, H., Molchanov, P., Alvarez, J. M., Li, Z., Mallya, A., Hoiem, D., Jha, N. K., & Kautz, J. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00874 · Cited by 540 · see citing works
Self-citationCrowdbc: a blockchain-based decentralized framework for crowdsourcing
Li, M., Weng, J., Yang, A., Lu, W., Zhang, Y., Hou, L., Liu, J.-N., Xiang, Y., & Deng, R. H. (2019) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2018.2881735 · Cited by 522 · see citing works
Communication-Efficient Federated Learning for Wireless Edge Intelligence in IoT
Mills, J., Hu, J., & Min, G. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2956615 · Cited by 436 · see citing works
Mitigating Sybils in Federated Learning Poisoning
Fung, C., Yoon, C. J. M., & Beschastnikh, I. (2018) · arXiv · doi:10.48550/arxiv.1808.04866 · Cited by 385 · see citing works
Reputation-based incentive protocols in crowdsourcing applications
Zhang, Y., & van der Schaar, M. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195597 · Cited by 315 · see citing works
A Fairness-aware Incentive Scheme for Federated Learning
Yu, H., Liu, Z., Liu, Y., Chen, T., Cong, M., Weng, X., Niyato, D. T., & Yang, Q. (2020) · Proceedings of the AAAI/ACM Conference on AI Ethics and Society · doi:10.1145/3375627.3375840 · Cited by 236 · see citing works
Self-citationThreats to federated learning A survey
Lyu, L., Yu, H., & Yang, Q. (2020) · arXiv · doi:10.48550/arxiv.2003.02133 · Cited by 221 · see citing works
Self-citationPrivacy-Preserving Collaborative Deep Learning With Unreliable Participants
Zhao, L., Wang, Q., Zou, Q., Zhang, Y., & Chen, Y. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2019.2939713 · Cited by 210 · see citing works
When Edge Meets Learning: Adaptive Control for Resource-Constrained Distributed Machine Learning
Wang, S., Tuor, T., Salonidis, T., Leung, K. K., Makaya, C., He, T., & Chan, K. (2018) · IEEE INFOCOM 2018 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2018.8486403 · Cited by 209 · see citing works
BAFFLE : Blockchain Based Aggregator Free Federated Learning
Ramanan, P., & Nakayama, K. (2020) · IEEE International Conference on Blockchain (Blockchain) · doi:10.1109/blockchain50366.2020.00017 · Cited by 193 · see citing works
Privacy Loss in Apple's Implementation of Differential Privacy on MacOS 10.12Preprint
Jun, T., Korolova, A., Bai, X., Wang, X., & Wang, X. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.02753 · Cited by 169 · see citing works
FDC: A Secure Federated Deep Learning Mechanism for Data Collaborations in the Internet of Things
Yin, B., Yin, H., Wu, Y., & Jiang, Z. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2966778 · Cited by 149 · see citing works
Proof of Federated Learning: A Novel Energy-Recycling Consensus Algorithm
Qu, X., Wang, S., Hu, Q., & Cheng, X. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2021.3056773 · Cited by 144 · see citing works
Shielding Collaborative Learning: Mitigating Poisoning Attacks through Client-Side Detection
Zhao, L., Hu, S., Wang, Q., Jiang, J., Chao, S., Luo, X., & Hu, P. (2020) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2020.2986205 · Cited by 127 · see citing works
Awan, S., Li, F., Luo, B., & Liu, M. (2019) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3319535.3363256 · Cited by 125 · see citing works
A Blockchain-Enabled Trustless Crowd-Intelligence Ecosystem on Mobile Edge Computing
Xu, J., Wang, S., Bhargava, B. K., & Yang, F. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2896965 · Cited by 116 · see citing works
Fog-Embedded Deep Learning for the Internet of Things
Lyu, L., Bezdek, J. C., He, X., & Jin, J. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2912465 · Cited by 61 · see citing works
Self-citationBiscotti: A Ledger for Private and Secure Peer-to-Peer Machine Learning
Shayan, M., Fung, C., Yoon, C. J. M., & Beschastnikh, I. (2018) · arXiv · doi:10.48550/arxiv.1811.09904 · Cited by 61 · see citing works
P3: Privacy-Preserving Scheme Against Poisoning Attacks in Mobile-Edge Computing
Zhao, P., Huang, H., Zhao, X., et al. (2020) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2019.2960824 · Cited by 45 · see citing works
Learning from Differentially Private Neural Activations with Edge Computing
Mao, Y., Yi, S., Li, Q., Feng, J., Xu, F., & Zhong, S. (2018) · IEEE/ACM Symposium on Edge Computing (SEC) · doi:10.1109/sec.2018.00014 · Cited by 44 · see citing works
Challenges of Privacy-Preserving Machine Learning in IoT
Zheng, M., Xu, D., Jiang, L., Gu, C., Tan, R., & Cheng, P. (2019) · International Workshop on Challenges in Artificial Intelligence and Machine Learning for Internet of Things (AIChallengeIoT) · doi:10.1145/3363347.3363357 · Cited by 41 · see citing works
Self-citationBiscotti - a ledger for private and secure peer to peer machine learningPreprint
Shayan, M. (2019) · arXiv (Cornell University) · doi:10.14288/1.0387042 · Cited by 34 · see citing works
Transfer Anomaly Detection by Inferring Latent Domain Representations
Kumagai, A., Iwata, T., & Fujiwara, Y. (2019) · neural information processing systems · Cited by 31 · see citing works
Enhancing the Privacy of Federated Learning with SketchingPreprint
Liu, Z., Li, T., Smith, V., & Sekar, V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.01812 · Cited by 29 · see citing works
Lightweight and Unobtrusive Data Obfuscation at IoT Edge for Remote Inference
Xu, D., Zheng, M., Jiang, L., Gu, C., Tan, R., & Cheng, P. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2983278 · Cited by 27 · see citing works
Self-citationTowards Fair and Decentralized Privacy-Preserving Deep Learning with BlockchainPreprint
Lyu, L., Yu, J., Nandakumar, K., et al. (2019) · arXiv (Cornell University) · Cited by 25 · see citing works
Self-citationFitCNN: A cloud-assisted and low-cost framework for updating CNNs on IoT devices
Liu, D., Yang, C., Li, S., Chen, X., Ren, J., Liu, R., Duan, M., Tan, Y., & Liang, L. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2018.09.020 · Cited by 24 · see citing works
Privbus: A privacy-enhanced crowdsourced bus service via fog computing
He, Y., Ni, J., Niu, B., Li, F., & Shen, X. (2019) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2019.09.007 · Cited by 24 · see citing works
Differentially Private Collaborative Learning for the IoT Edge
Jiang, L., Lou, X., Tan, R., & Zhao, J. (2019) · International Conference on Embedded Wireless Systems and Networks · doi:10.5555/3324320.3324405 · Cited by 23 · see citing works
Self-citationBAFFLE : Blockchain Based Aggregator Free Federated LearningPreprint
Ramanan, P., & Nakayama, K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.07452 · Cited by 23 · see citing works
A Fog-Assisted Privacy-Preserving Task Allocation in Crowdsourcing
Zhang, J., Zhang, Q., & Ji, S. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2989578 · Cited by 23 · see citing works
MDLdroid: a ChainSGD-reduce Approach to Mobile Deep Learning for Personal Mobile Sensing
Zhang, Y., Gu, T., & Zhang, X. (2020) · 2020 19th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN) · doi:10.1109/ipsn48710.2020.00-45 · Cited by 23 · see citing works
Wu, F., & Luo, T. (2020) · ACM Transactions on Privacy and Security · doi:10.1145/3375752 · Cited by 22 · see citing works
Towards Privacy-preserving Mobile Applications with Federated Learning
Dolui, K., Gyllensten, I. C., Lowet, D., et al. (2019) · International Conference on Mobile Systems, Applications, and Services · doi:10.1145/3307334.3328657 · Cited by 21 · see citing works
Improving the Utility of Differential Privacy via Univariate Microaggregation
Sánchez, D., Domingo‐Ferrer, J., & Mart́ınez, S. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11257-2_11 · Cited by 16 · see citing works
Proof of Federated Learning: A Novel Energy-recycling Consensus AlgorithmPreprint
Qu, X., Wang, S., Hu, Q., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.11745 · Cited by 13 · see citing works
Liang, T. (2020) · Journal of Computer and Communications · doi:10.4236/jcc.2020.84007 · Cited by 10 · see citing works
Constrained deep neural network architecture search for IoT devices accounting hardware calibrationPreprint
Scheidegger, F., Luca Benini, C., Bekas, C., & Malossi, A. C. I. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.10818 · Cited by 9 · see citing works
Flagged first, then by citations
Research works printed but not linked: 5
- 2020, Raspberry PI 4 Tech Specs
- 2020, Smart Home—Statistics & Facts
- lecun, 2010, MNIST Handwritten Digit Database
- benet, 2014, IPFS - Content Addressed Versioned P2P File System
- hao, 2019, How Apple Personalizes Siri Without Hoovering Up Your Data
Cited by
Sorted by citations
Federated Learning for Internet of Things: A Comprehensive Survey
Nguyen, D. C., Ding, M., Pathirana, P. N., Seneviratne, A., Li, J., & Vincent Poor, H. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3075439 · Cited by 1,503 · see citing works
“Blockchain [37] can be used to address this issue, aiming to replace the centralized aggregator in the traditional FL system [103].”
BackgroundMethodA Survey on Federated Learning Systems: Vision, Hype and Reality for Data Privacy and Protection
Li, Q., Wen, Z., Wu, Z., Hu, S., Wang, N., Li, Y., Liu, X., & He, B. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3124599 · Cited by 1,407 · see citing works
Federated learning for smart healthcare: A survey
Nguyen, D. C., Pham, Q.-V., Pathirana, P. N., Ding, M., Seneviratne, A., Lin, Z., Dobre, O., & Hwang, W.-J. (2023) · ACM Computing Surveys · doi:10.1145/3501296 · Cited by 827 · see citing works
A Survey on Federated Learning for Resource-Constrained IoT Devices
Imteaj, A., Thakker, U., Wang, S., Li, J., & Amini, M. H. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3095077 · Cited by 774 · see citing works
Privacy-Preserving Traffic Flow Prediction: A Federated Learning Approach
Liu, Y., Yu, J. J. Q., Kang, J., Niyato, D., & Zhang, S. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2991401 · Cited by 712 · see citing works
Self-citationFederated learning meets blockchain in edge computing: Opportunities and challenges
Nguyen, D. C., Ding, M., Pham, Q.-V., Pathirana, P. N., Le, L. B., Seneviratne, A., Li, J., Niyato, D., & Poor, H. V. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3072611 · Cited by 661 · see citing works
Self-citationLocal Differential Privacy-Based Federated Learning for Internet of Things
Zhao, Y., Zhao, J., Yang, M., Wang, T., Wang, N., Lyu, L., Niyato, D., & Lam, K.-Y. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3037194 · Cited by 456 · see citing works
Self-citationRahman, A., Hossain, M. S., Muhammad, G., Kundu, D., Debnath, T., Rahman, M., Khan, M. S. I., Tiwari, P., & Band, S. S. (2023) · Cluster Computing · doi:10.1007/s10586-022-03658-4 · Cited by 399 · see citing works
Collaborative Federated Learning for Healthcare: Multi-Modal COVID-19 Diagnosis at the Edge
Qayyum, A., Ahmad, K., Ahsan, M. A., Al-Fuqaha, A., & Qadir, J. (2022) · IEEE Open Journal of the Computer Society · doi:10.1109/ojcs.2022.3206407 · Cited by 345 · see citing works
Rauniyar, A., Hagos, D. H., Jha, D., Håkegård, J. E., Bagci, U., Rawat, D. B., & Vlassov, V. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3329061 · Cited by 315 · see citing works
Blockchain-empowered Federated Learning: Challenges, Solutions, and Future Directions
Zhu, J., Cao, J., Saxena, D., Jiang, S., & Ferradi, H. (2023) · ACM Computing Surveys · doi:10.1145/3570953 · Cited by 309 · see citing works
Federated learning for secure IoMT-applications in smart healthcare systems: A comprehensive review
Rani, S., Kataria, A., Kumar, S., & Tiwari, P. (2023) · Knowledge-Based Systems · doi:10.1016/j.knosys.2023.110658 · Cited by 228 · see citing works
Drones’ Edge Intelligence Over Smart Environments in B5G: Blockchain and Federated Learning Synergy
Alsamhi, S. H., Almalki, F. A., Afghah, F., Hawbani, A., Shvetsov, A. V., Lee, B., & Song, H. (2022) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2021.3132561 · Cited by 139 · see citing works
Topology-aware Federated Learning in Edge Computing: A Comprehensive Survey
Wu, J., Dong, F., Leung, H., Zhu, Z., Zhou, J., & Drew, S. (2024) · ACM Computing Surveys · doi:10.1145/3659205 · Cited by 130 · see citing works
A Blockchain‐Based Federated Learning Method for Smart Healthcare
Chang, Y., Fang, C., & Sun, W. (2021) · Computational Intelligence and Neuroscience · doi:10.1155/2021/4376418 · Cited by 119 · see citing works
Pandl, K. D., Thiebes, S., Schmidt-Kraepelin, M., & Sunyaev, A. (2020) · IEEE Access · doi:10.1109/access.2020.2981447 · Cited by 115 · see citing works
Zhan, S., Huang, L., Luo, G., Zheng, S., Gao, Z., & Chao, H.-C. (2025) · Electronics · doi:10.3390/electronics14132512 · Cited by 82 · see citing works
Free-riders in Federated Learning: Attacks and Defenses
Lin, J., Du, M., & Liu, J. (2019) · arXiv · doi:10.48550/arxiv.1911.12560 · Cited by 76 · see citing works
Privacy-Enhancing Technologies in Federated Learning for the Internet of Healthcare Things: A Survey
Mosaiyebzadeh, F., Pouriyeh, S., Parizi, R. M., Sheng, Q. Z., Han, M., Zhao, L., Sannino, G., Ranieri, C. M., Ueyama, J., & Batista, D. M. (2023) · Electronics · doi:10.3390/electronics12122703 · Cited by 51 · see citing works
Adam, M., & Baroudi, U. (2024) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2024.3506214 · Cited by 46 · see citing works
Privacy Protection for Blockchain-Based Healthcare IoT Systems: A Survey
Qi, M., Wang, Z., Han, Q.-L., Zhang, J., Chen, S., & Xiang, Y. (2024) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2022.106058 · Cited by 44 · see citing works
Lightweight Privacy and Security Computing for Blockchained Federated Learning in IoT
Fan, M., Ji, K., Zhang, Z., Yu, H., & Sun, G. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3267112 · Cited by 37 · see citing works
Guo, H., Meese, C., Li, W., Shen, C.-C., & Nejad, M. (2023) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2023.3318990 · Cited by 26 · see citing works
Communication-Efficient and Distributed Learning Over Wireless Networks: Principles and Applications
Park, J., Samarakoon, S., Elgabli, A., Kim, J., Bennis, M., Kim, S.-L., & Debbah, M. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3055679 · Cited by 25 · see citing works
- Authors
- Zhao, Y., Zhao, J., Jiang, L., Tan, R., Niyato, D., Li, Z., Lyu, L., & Liu, Y.
- Affiliations
- Nanyang Technological University (SG)
- Agency for Science, Technology and Research (SG)
- National University of Singapore (SG)
- Yunnan University of Finance And Economics (CN)
- Venue
- IEEE Internet of Things Journal
- Published
- 2021-02-01
- Volume
- 8
- Issue
- 3
- Pages
- 1817-1829
- ISSN
- 2327-4662 (ISSN-L)
- 2372-2541
- OpenAlex
- W3051272477
- Cited by
- 613
- References
- 66
- Citations by year
- 2026: 55 · 2025: 107 · 2024: 122 · 2023: 137 · 2022: 109 · 2021: 65 · 2020: 17 · 2019: 1
- FWCI
- 31.94
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Internet of Things Journal (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- DR-NTU (Nanyang Technological University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Nanyang Technological University Startup Grant
- Alibaba-NTU Singapore Joint Research Institute
- Singapore Ministry of Education Academic Research Fund (Tier 1 RG128/18, Tier 1 RG115/19, Tier 1 RT07/19, Tier 1 RT01/19, Tier 2 MOE2019-T2-1-176)
- NTU-WASP Joint Project
- Singapore National Research Foundation under its Strategic Capability Research Centres Funding Initiative: Strategic Centre for Research in Privacy-Preserving Technologies and Systems
- Energy Research Institute @NTU
- Singapore NRF National Satellite of Excellence, Design Science and Technology for Secure Critical Infrastructure NSoE (DeST-SCI2019-0012, DeST-SCI2019-0007)
- AI Singapore 100 Experiments Programme
- NTU Project for Large Vertical Take-Off and Landing Research Platform
- MOE AcRF Tier 1 (2019-T1-001-044)
- National Research Foundation (NRF), Singapore, under Singapore Energy Market Authority, Energy Resilience (NRF2017EWT-EP003-041)
- Singapore NRF (2015-NRF-ISF001-2277)
- A*STAR-NTU-SUTD Joint Research Grant on Artificial Intelligence for the Future of Manufacturing (RGANS1906)
- Wallenberg AI, Autonomous Systems and Software Program and Nanyang Technological University (M4082187 (4080))
- NTU-WeBank JRI (NWJ-2020-004)
- Alibaba Group through Alibaba Innovative Research Program and Alibaba-NTU Singapore Joint Research Institute, NTU-Singapore, Singapore Ministry of Education Tier 1 (RG16/20)
- RIE 2020 Advanced Manufacturing and Engineering Domain’s Core Funds-SERC Strategic Funds: Trusted Data Vault (A1918g0063)
- National Natural Science Foundation of China (11703010)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Keywords
- federated learning, blockchain, privacy preservation, Internet of Things, home automation, home appliance manufacturers, reputation mechanism, differential privacy, feature normalization, mobile edge computing, crowdsourcing, incentive mechanisms, model aggregation
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.
Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-09.
Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-09.
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