PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 1, 2019263 citations

Bit-Flip Attack: Crushing Neural Network With Progressive Bit Search

View Full Paper
ARAdnan Siraj RakinZHZhezhi HeDFDeliang Fan

Key Points

  • This work introduces a novel methodology for DNN weight attacks aimed at understanding vulnerabilities in neural network parameters.
  • Proposed a Bit-Flip Attack (BFA) targeting weight storage in DNNs using principles of the Row-Hammer attack.
  • Developed a Progressive Bit Search (PBS) algorithm to pinpoint vulnerable bits for maximum impact on accuracy with minimal flips.
  • Applied BFA to the ResNet-18 architecture to assess its effectiveness and measure accuracy degradation.
  • BFA caused ResNet-18 accuracy to drop from 69.8% to 0.1% with only 13 bit-flips, an unprecedented impact.
  • Randomly flipping 100 bits resulted in less than 1% accuracy degradation, demonstrating BFA's efficiency.
  • Successfully identified and targeted the most vulnerable bits among 93 million stored bits.

Abstract

Several important security issues of Deep Neural Network (DNN) have been raised recently associated with different applications and components. The most widely investigated security concern of DNN is from its malicious input, a. k. a adversarial example. Nevertheless, the security challenge of DNN's parameters is not well explored yet. In this work, we are the first to propose a novel DNN weight attack methodology called Bit-Flip Attack (BFA) which can crush a neural network through maliciously flipping extremely small amount of bits within its weight storage memory system (i. e. , DRAM). The bit-flip operations could be conducted through well-known Row-Hammer attack, while our main contribution is to develop an algorithm to identify the most vulnerable bits of DNN weight parameters (stored in memory as binary bits), that could maximize the accuracy degradation with a minimum number of bit-flips. Our proposed BFA utilizes a Progressive Bit Search (PBS) method which combines gradient ranking and progressive search to identify the most vulnerable bit to be flipped. With the aid of PBS, we can successfully attack a ResNet-18 fully malfunction (i. e. , top-1 accuracy degrade from 69. 8% to 0. 1%) only through 13 bit-flips out of 93 million bits, while randomly flipping 100 bits merely degrades the accuracy by less than 1%. Code is released at: https: //github. com/elliothe/NeuralNetworkWeightAttack.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Rakin et al. (2019) studied this question.

synapsesocial.com/papers/6a0f2c15f27f69a1d34261a4https://doi.org/10.1109/iccv.2019.00130
Ask AI
Helpful
Bookmark
Share
View Full Paper