mlsanityData to 7 Oct 2026

PolyDNN: Polynomial Representation of NN for Communication-less SMPC Inference

arXiv 2104.00863 ↗First posted 2 Apr 2021cs.CR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

The structure and weights of Deep Neural Networks (DNN) typically encode and contain very valuable information about the dataset that was used to train the network. One way to protect this information when DNN is published is to perform an interference of the network using secure multi-party computations (MPC). In this paper, we suggest a translation of deep neural networks to polynomials, which are easier to calculate efficiently with MPC techniques. We show a way to translate complete networks into a single polynomial and how to calculate the polynomial with an efficient and information-secure MPC algorithm. The calculation is done without intermediate communication between the participating parties, which is beneficial in several cases, as explained in the paper.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 17 references that are in the map. First posted on arXiv 2 Apr 2021.

Builds on

5 of 17 references.

References · 5

  1. 2019CrypTFlow: Secure TensorFlow Inferencecited by 61
  2. 2017CryptoDL: Deep Neural Networks over Encrypted Datacited by 56
  3. 2017DeepSecure: Scalable Provably-Secure Deep Learningcited by 48
  4. 2019QUOTIENT: Two-Party Secure Neural Network Training and Predictioncited by 41
  5. 2014Crypto-Nets: Neural Networks over Encrypted Datacited by 10

Built on by

Not cited yet.