The DOI matches its Crossref record; 76 of the 76 references it cites were found in a registry or an index.
Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications
Open accessAbstract
We present Chameleon, a novel hybrid (mixed-protocol) framework for secure function evaluation (SFE) which enables two parties to jointly compute a function without disclosing their private inputs. Chameleon combines the best aspects of generic SFE protocols with the ones that are based upon additive secret sharing. In particular, the framework performs linear operations in the ring $\mathbbZ _2^l $ using additively secret shared values and nonlinear operations using Yao's Garbled Circuits or the Goldreich-Micali-Wigderson protocol. Chameleon departs from the common assumption of additive or linear secret sharing models where three or more parties need to communicate in the online phase: the framework allows two parties with private inputs to communicate in the online phase under the assumption of a third node generating correlated randomness in an offline phase. Almost all of the heavy cryptographic operations are precomputed in an offline phase which substantially reduces the communication overhead. Chameleon is both scalable and significantly more efficient than the ABY framework (NDSS'15) it is based on. Our framework supports signed fixed-point numbers. In particular, Chameleon's vector dot product of signed fixed-point numbers improves the efficiency of mining and classification of encrypted data for algorithms based upon heavy matrix multiplications. Our evaluation of Chameleon on a 5 layer convolutional deep neural network shows 133x and 4.2x faster executions than Microsoft CryptoNets (ICML'16) and MiniONN (CCS'17), respectively.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Learning Multiple Layers of Features from Tiny Images
Krizhevsky, A. (2024) · doi:10.57702/zp44cu3g · Cited by 23,395
TensorFlow: A system for large-scale machine learning
Abadi, M., Barham, P., Chen, J., Chen, Z., Davis, A., Dean, J., Devin, M., Ghemawat, S., Irving, G., Isard, M., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.08695 · Cited by 11,822
The Limitations of Deep Learning in Adversarial Settings
Papernot, N., McDaniel, P., Jha, S., Fredrikson, M., Celik, Z. B., & Swami, A. (2016) · 2016 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2016.36 · Cited by 3,993
How to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Privacy-preserving deep learning
Shokri, R., & Shmatikov, V. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813687 · Cited by 2,356
SecureML: A System for Scalable Privacy-Preserving Machine Learning
Mohassel, P., & Zhang, Y. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.12 · Cited by 1,936
Goldreich, O. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721656 · Cited by 1,805
Privacy-Preserving Deep Learning via Additively Homomorphic Encryption
Phong, L. T., Aono, Y., Hayashi, T., Wang, L., & Moriai, S. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2017.2787987 · Cited by 1,662
Foundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
Research works printed but not linked: 10
- D. Beaver . 1995. Precomputing oblivious transfer. In CRYPTO. D. Beaver . 1995. Precomputing oblivious transfer. In CRYPTO. · doi:10.1007/3-540-44750-4_8
- H. Carter B. Mood P. Traynor and K. R. B. Butler . 2013. Secure Outsourced Garbled Circuit Evaluation for Mobile Devices USENIX Security. H. Carter B. Mood P. Traynor and K. R. B. Butler . 2013. Secure Outsourced Garbled Circuit Evaluation for Mobile Devices USENIX Security.
- J. Feigenbaum , B. Pinkas , R. Ryger , and F. Saint-Jean . 2004 . Secure computation of surveys . In EU Workshop on Secure Multiparty Protocols. J. Feigenbaum, B. Pinkas, R. Ryger, and F. Saint-Jean . 2004. Secure computation of surveys. In EU Workshop on Secure Multiparty Protocols.
- 10.1109/ARES.2012.28 · doi:10.1109/ares.2012.28
- W. jie Lu and J. Sakuma . 2018 . Faster Multiplication Triplet Generation from Homomorphic Encryption for Practical Privacy-Preserving Machine Learning under a Narrow Bandwidth. Cryptology ePrint Archive, Report 2018/139. (2018). W. jie Lu and J. Sakuma . 2018. Faster Multiplication Triplet Generation from Homomorphic Encryption for Practical Privacy-Preserving Machine Learning under a Narrow Bandwidth. Cryptology ePrint Archive, Report 2018/139. (2018).
- B. Kreuter , A. Shelat , B. Mood , and K. R. Butler . 2013 . PCF: A Portable Circuit Format for Scalable Two-Party Secure Computation USENIX Security. B. Kreuter, A. Shelat, B. Mood, and K. R. Butler . 2013. PCF: A Portable Circuit Format for Scalable Two-Party Secure Computation USENIX Security.
- B. Kreuter A. Shelat and C.-H. Shen . 2012. Billion-Gate Secure Computation with Malicious Adversaries. USENIX Security. B. Kreuter A. Shelat and C.-H. Shen . 2012. Billion-Gate Secure Computation with Malicious Adversaries. USENIX Security.
- E. Makri , D. Rotaru , N. P. Smart, and F. Vercauteren . 2017 . PICS : Private Image Classification with SVM. Cryptology ePrint Archive, Report 2017/1190. (2017). E. Makri, D. Rotaru, N. P. Smart, and F. Vercauteren . 2017. PICS: Private Image Classification with SVM. Cryptology ePrint Archive, Report 2017/1190. (2017).
- P. Mohassel O. Orobets and B. Riva . 2016. Efficient Server-Aided 2PC for Mobile Phones. In PoPETs. P. Mohassel O. Orobets and B. Riva . 2016. Efficient Server-Aided 2PC for Mobile Phones. In PoPETs. · doi:10.1515/popets-2016-0006
- E. Pattuk M. Kantarcioglu H. Ulusoy and B. Malin . 2016. CheapSMC: A Framework to Minimize Secure Multiparty Computation Cost in the Cloud. In DBSec. E. Pattuk M. Kantarcioglu H. Ulusoy and B. Malin . 2016. CheapSMC: A Framework to Minimize Secure Multiparty Computation Cost in the Cloud. In DBSec. · doi:10.1007/978-3-319-41483-6_20
Cited by
Federated Machine Learning: Concept and Applications
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3298981 · Cited by 6,322
Deep Learning With Edge Computing: A Review
Chen, J., & Ran, X. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2921977 · Cited by 1,540
A Survey on Federated Learning Systems: Vision, Hype and Reality for Data Privacy and Protection
Li, Q., Wen, Z., Wu, Z., Hu, S., Wang, N., Li, Y., Liu, X., & He, B. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3124599 · Cited by 1,407
A Survey on Federated Learning for Resource-Constrained IoT Devices
Imteaj, A., Thakker, U., Wang, S., Li, J., & Amini, M. H. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3095077 · Cited by 774
Privacy and Robustness in Federated Learning: Attacks and Defenses
Lyu, L., Yu, H., Ma, X., Chen, C., Sun, L., Zhao, J., Yang, Q., & Yu, P. S. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3216981 · Cited by 548
Metadata
- Authors
- Riazi, M. S., Weinert, C., Tkachenko, O., Songhori, E. M., Schneider, T., & Koushanfar, F.
- Venue
- Proceedings of the 2018 on Asia Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2018-05-29
- Pages
- 707-721
- OpenAlex
- W2963106566
- Cited by
- 410
- References
- 76
- FWCI
- 19.66
- Type
- conference paper
- Language
- en
- Open access
- gold
- Funders
- Office of Naval Research (N00014-17-1-2500)
- Semiconductor Research Corporation (2016-TS-269)
- National Science Foundation Trust-Hub (CNS-1649423)
- National Science Foundation (CNS-1619261)
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications. https://app.cochat.ai/papers/10.1145/3196494.3196522
- The paper
- Riazi, M. S., Weinert, C., Tkachenko, O., Songhori, E. M., Schneider, T., & Koushanfar, F. (2018). Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications. Proceedings of the 2018 on Asia Conference on Computer and Communications Security. https://doi.org/10.1145/3196494.3196522
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.