4.6 Article

Efficient Privacy-Preserving Machine Learning for Blockchain Network

Journal

IEEE ACCESS
Volume 7, Issue -, Pages 136481-136495

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2940052

Keywords

Blockchain; Computational modeling; Security; Privacy; Machine learning; Computer architecture; Fabrics; Adversarial node; differential privacy; machine learning; permissioned blockchain

Funding

  1. Institute of Information and Communications Technology Planning and Evaluation (IITP) - Korean Government (MSIT) [2018-0-01369]
  2. Developing Blockchain Identity Management System with Implicit Augmented Authentication and Privacy Protection for O2O Services [2017-0-00441]
  3. Development of Core Technologies of Intrusion Tolerance System for Autonomous Vehicles

Ask authors/readers for more resources

A blockchain as a trustworthy and secure decentralized and distributed network has been emerged for many applications such as in banking, finance, insurance, healthcare and business. Recently, many communities in blockchain networks want to deploy machine learning models to get meaningful knowledge from geographically distributed large-scale data owned by each participant. To run a learning model without data centralization, distributed machine learning (DML) for blockchain networks has been studied. While several works have been proposed, privacy and security have not been sufficiently addressed, and as we show later, there are vulnerabilities in the architecture and limitations in terms of efficiency. In this paper, we propose a privacy-preserving DML model for a permissioned blockchain to resolve the privacy, security, and performance issues in a systematic way. We develop a differentially private stochastic gradient descent method and an error-based aggregation rule as core primitives. Our model can treat any type of differentially private learning algorithm where non-deterministic functions should be defined. The proposed error-based aggregation rule is effective to prevent attacks by an adversarial node that tries to deteriorate the accuracy of DML models. Our experiment results show that our proposed model provides stronger resilience against adversarial attacks than other aggregation rules under a differentially private scenario. Finally, we show that our proposed model has high usability because it has low computational complexity and low transaction latency.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available