Interactive Simulations of Backdoors in Neural Networks

Peter Bajcsy, Maxime Bros
5/21/2024
cs.LGcs.CR

No confident code implementation found for this paper.

Abstract

This work addresses the problem of planting and defending cryptographic-based backdoors in artificial intelligence (AI) models. The motivation comes from our lack of understanding and the implications of using cryptographic techniques for planting undetectable backdoors under theoretical assumptions in the large AI model systems deployed in practice. Our approach is based on designing a web-based simulation playground that enables planting, activating, and defending cryptographic backdoors in neural networks (NN). Simulations of planting and activating backdoors are enabled for two scenarios: in the extension of NN model architecture to support digital signature verification and in the modified architectural block for non-linear operators. Simulations of backdoor defense against backdoors are available based on proximity analysis and provide a playground for a game of planting and defending against backdoors. The simulations are available at https://pages.nist.gov/nn-calculator

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{bajcsy2024interactive,
  title  = {Interactive Simulations of Backdoors in Neural Networks},
  author = {Peter Bajcsy and Maxime Bros},
  year   = {2024},
  eprint = {2405.13217},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.13217v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.13217.svg)](https://codeofpaper.com/paper/2405.13217)

Discussion