Cited by 245Cryptography and Data SecuritySecurity and Verification in ComputingPrivacy-Preserving Technologies in Data

CrypTFlow: Secure TensorFlow Inference

Open access
Kumar, Nishant, Rathee, Mayank, Chandran, Nishanth, Gupta, Divya, Rastogi, Aseem, Sharma, Rahul·2020·2020 IEEE Symposium on Security and Privacy (SP)

Abstract

We present CrypTFlow, a first of its kind system that converts TensorFlow inference code into Secure Multi-party Computation (MPC) protocols at the push of a button. To do this, we build three components. Our first component, Athos, is an end-to-end compiler from TensorFlow to a variety of semihonest MPC protocols. The second component, Porthos, is an improved semi-honest 3-party protocol that provides significant speedups for TensorFlow like applications. Finally, to provide malicious secure MPC protocols, our third component, Aramis, is a novel technique that uses hardware with integrity guarantees to convert any semi-honest MPC protocol into an MPC protocol that provides malicious security. The malicious security of the protocols output by Aramis relies on integrity of the hardware and semi-honest security of MPC. Moreover, our system matches the inference accuracy of plaintext TensorFlow.We experimentally demonstrate the power of our system by showing the secure inference of real-world neural networks such as ResNet50 and DenseNet121 over the ImageNet dataset with running times of about 30 seconds for semi-honest security and under two minutes for malicious security. Prior work in the area of secure inference has been limited to semi-honest security of small networks over tiny datasets such as MNIST or CIFAR. Even on MNIST/CIFAR, CrypTFlow outperforms prior work.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/sp40000.2020.00092

Cites

79 of 79 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Computational considerations are a concern for SMPC beyond small algorithm sizes, with efficient SMPC implementations of state-of-the-art neural network algorithms currently under active development.

    “computational considerations are a concern beyond small algorithm sizes, with efficient SMPC implementations of state-of-the-art neural network algorithms currently under active development 78 .”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

6 of the 85 references couldn’t be matched to a known paper.

Research works printed but not linked: 9

  1. [16]16. N. Agrawal, A. S. Shamsabadi, M. J. Kusner, and A. Gascón, "QUO- TIENT: Two-Party Secure Neural Network Training and Prediction," in Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, London, UK, November 11-15, 2019, 2019, pp. 1231-1247.
  2. [24]24. F. Boemer, Y. Lao, R. Cammarota, and C. Wierzynski, "nGraph-HE: A Graph Compiler for Deep Learning on Homomorphically Encrypted Data," in Proceedings of the 16th ACM International Conference on Computing Frontiers, CF 2019, Alghero, Italy, April 30 -May 2, 2019, 2019, pp. 3-13.
  3. [29]29. H. Chaudhari, A. Choudhury, A. Patra, and A. Suresh, "ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction," in Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop, CCSW@CCS 2019, London, UK, November 11, 2019, 2019, pp. 81-92.
  4. [44]44. O. Goldreich, S. Micali, and A. Wigderson, "How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority," in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, 1987, pp. 218-229.
  5. [48]48. C. Hazay, Y. Ishai, A. Marcedone, and M. Venkitasubramaniam, "LevioSA: Lightweight Secure Arithmetic Computation," in Proceed- ings of the 2019 ACM Conference on Computer and Communications Security, CCS 2019, London, UK, November 11-15, 2019, 2019, pp. 327-344.
  6. [69]69. P. Mohassel and P. Rindal, "ABY 3 : A Mixed Protocol Framework for Machine Learning," in Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, October 15-19, 2018, 2018, pp. 35-52.
  7. [81]81. M. S. Riazi, C. Weinert, O. Tkachenko, E. M. Songhori, T. Schneider, and F. Koushanfar, "Chameleon: A Hybrid Secure Computation Frame- work for Machine Learning Applications," in Proceedings of the 2018 on Asia Conference on Computer and Communications Security, AsiaCCS 2018, Incheon, Republic of Korea, June 04-08, 2018, 2018, pp. 707-721.
  8. [88]88. S. Wagh, D. Gupta, and N. Chandran, "SecureNN: 3-Party Secure Computation for Neural Network Training," PoPETs, vol. 2019, no. 3, pp. 26-49, 2019.
  9. [91]91. A. C. Yao, "How to Generate and Exchange Secrets (Extended Ab- stract)," in 27th Annual Symposium on Foundations of Computer Sci- ence, Toronto, Canada, 27-29 October 1986. IEEE Computer Society, 1986, pp. 162-167.

Cited by

Sorted by citations

Authors
Kumar, N., Rathee, M., Chandran, N., Gupta, D., Rastogi, A., & Sharma, R.
Affiliations
Microsoft (United States) (US)
Venue
2020 IEEE Symposium on Security and Privacy (SP)
Publisher
IEEE
Published
2020-05
Volume
2019
Pages
336-353
ISSN
1081-6011 (ISSN-L)
OpenAlex
W2974824775
Cited by
245
References
85
Citations by year
2026: 18 · 2025: 41 · 2024: 48 · 2023: 43 · 2022: 33 · 2021: 42 · 2020: 20
FWCI
13.18
Type
conference paper
Language
en
Open access
Locations
  • IEEE Symposium on Security and Privacy (S&P) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • IACR Cryptology ePrint Archive (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Security and Verification in Computing
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
Keywords
secure multi-party computation, secure inference, TensorFlow, neural network inference, semi-honest security, malicious security, compilers, hardware integrity, secure machine learning, ResNet50, DenseNet121, ImageNet

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.

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