The DOI matches its Crossref record; 75 of the 75 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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 · cited 2×
“rks and fully hide their structure [83]. Privacy-preserving classification of electrocardiogram (ECG) signals using neural networks has been addressed in [10]. The recent work of Shokri and Shmatikov [85] is a Differential Privacy (DP) based approach for the distributed training of a Neural Network and they do not pro…”
BackgroundMethodSecureML: 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 · cited 1×
“SecureML [66] is a framework for privacy-preserving machine learning.”
BackgroundGoldreich, 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
Multiparty Computation from Somewhat Homomorphic Encryption
Damgård, I., Pastro, V., Smart, N., & Zakarias, S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_38 · Cited by 1,331 · cited 3×
“SPDZ [31] is a secure computation protocol based on additive secret sharing that is secure against n − 1 corrupted computation nodes in the malicious model.”
BackgroundInfluential(2016) · International Conference on Machine Learning · Cited by 1,270
Privacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077
Efficient Multiparty Protocols Using Circuit Randomization
Beaver, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_34 · Cited by 893
Fairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Pinkas, B., & Sella, Y. (2004) · USENIX Security Symposium · Cited by 846
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Demmler, D., Schneider, T., & Zohner, M. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23113 · Cited by 827
Self-citationPrivacy preserving auctions and mechanism design
Naor, M., Pinkas, B., & Sumner, R. (1999) · Proceedings of the 1st ACM conference on Electronic commerce · doi:10.1145/336992.337028 · Cited by 753
Extending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746
Improved Garbled Circuit: Free XOR Gates and Applications
Kolesnikov, V., & Schneider, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_40 · Cited by 743
Self-citationOblivious Neural Network Predictions via MiniONN Transformations
Liu, J., Juuti, M., Lu, Y., & Asokan, N. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134056 · Cited by 691
Sharemind: A Framework for Fast Privacy-Preserving Computations
Bogdanov, D., Laur, S., & Willemson, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88313-5_13 · Cited by 690
Machine Learning Classification over Encrypted Data
Bost, R., Popa, R. A., Tu, S., & Goldwasser, S. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23241 · Cited by 674
Faster Secure Two-Party Computation Using Garbled Circuits
Huang, Y., Evans, D., Katz, J. I., & Malka, L. (2011) · doi:10.18130/v3hj5c · Cited by 532
FairplayMP: a system for secure multi-party computation
Ben-David, A., Nisan, N., & Pinkas, B. (2008) · Proceedings of the 15th ACM conference on Computer and communications security · doi:10.1145/1455770.1455804 · Cited by 475
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Asharov, G., Jain, A., López-Alt, A., Tromer, E., Vaikuntanathan, V., & Wichs, D. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_29 · Cited by 454
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records
Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., & Taft, N. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.30 · Cited by 439
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
Araki, T., Furukawa, J., Lindell, Y., Nof, A., & Ohara, K. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978331 · Cited by 405
Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits Using Half Gates
Zahur, S., Rosulek, M., & Evans, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_8 · Cited by 367
Efficient Privacy-Preserving Face Recognition
Sadeghi, A.-R., Schneider, T., & Wehrenberg, I. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14423-3_16 · Cited by 363
Self-citationMore efficient oblivious transfer and extensions for faster secure computation
Asharov, G., Lindell, Y., Schneider, T., & Zohner, M. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516738 · Cited by 358
Self-citationTASTY: tool for automating secure two-party computations
Henecka, W., K ögl, S., Sadeghi, A.-R., Schneider, T., & Wehrenberg, I. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866358 · Cited by 356
Self-citationObliVM: A Programming Framework for Secure Computation
Liu, C., Wang, X. S., Nayak, K., Huang, Y., & Shi, E. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.29 · Cited by 307
CryptoDL: Deep Neural Networks over Encrypted Data
Hesamifard, E., Takabi, H., & Ghasemi, M. (2017) · arXiv · doi:10.48550/arxiv.1711.05189 · Cited by 306
Efficient Garbling from a Fixed-Key Blockcipher
Bellare, M., Hoang, V. T., Keelveedhi, S., & Rogaway, P. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.39 · Cited by 304
(2010) · Cited by 291
Asynchronous Multiparty Computation: Theory and Implementation
Damgård, I., Geisler, M., Krøigaard, M., & Nielsen, J. B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00468-1_10 · Cited by 251
Correlated pseudorandomness and the complexity of private computations
Beaver, D. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237996 · Cited by 233
Privacy-Preserving Classification on Deep Neural Network.Preprint
Chabanne, H., de Wargny, A., Milgram, J., Morel, C., & Prouff, E. (2017) · IACR Cryptology ePrint Archive · Cited by 224
Privacy-preserving deep learning
Shokri, R., & Shmatikov, V. (2015) · 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2015.7447103 · Cited by 223
Secure Computation with Fixed-Point Numbers
Catrina, O., & Saxena, A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14577-3_6 · Cited by 214
High-performance secure multi-party computation for data mining applications
Bogdanov, D., Niitsoo, M., Toft, T., & Willemson, J. (2012) · International Journal of Information Security · doi:10.1007/s10207-012-0177-2 · Cited by 212
TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits
Songhori, E. M., Hussain, S. U., Sadeghi, A.-R., Schneider, T., & Koushanfar, F. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.32 · Cited by 210
Self-citationPrivacy-Preserving ECG Classification With Branching Programs and Neural Networks
Barni, M., Failla, P., Lazzeretti, R., Sadeghi, A.-R., & Schneider, T. (2011) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2011.2108650 · Cited by 194
Self-citationPrivacy-preserving remote diagnostics
Brickell, J., Porter, D. E., Shmatikov, V., & Witchel, E. (2007) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1315245.1315307 · Cited by 189
Privacy-preserving SVM classification
Vaidya, J., Yu, H., & Jiang, X. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0073-7 · Cited by 178
DeepSecure: Scalable Provably-Secure Deep Learning
Rouhani, B. D., Riazi, M. S., & Koushanfar, F. (2018) · 2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC) · doi:10.1109/dac.2018.8465894 · Cited by 176
Self-citationSecure and Efficient Protocols for Iris and Fingerprint Identification
Blanton, M., & Gasti, P. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23822-2_11 · Cited by 168
Rahulamathavan, Y., Phan, R. C. ‐., Veluru, S., Cumanan, K., & Rajarajan, M. (2014) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2013.51 · Cited by 165
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
Furukawa, J., Lindell, Y., Nof, A., & Weinstein, O. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56614-6_8 · Cited by 153
Efficient Secure Computation with Garbled Circuits
Huang, Y., Shen, C.-H., Evans, D., Katz, J. I., & Shelat, A. A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25560-1_2 · Cited by 146
Protocols for Secure Remote Database Access with Approximate Matching
Du, W. K., & Atallah, M. J. (2001) · Advances in information security · doi:10.1007/978-1-4615-1467-1_6 · Cited by 146
I am Robot: (Deep) Learning to Break Semantic Image CAPTCHAs
Sivakorn, S., Polakis, I., & Keromytis, A. D. (2016) · IEEE European Symposium on Security and Privacy · doi:10.1109/eurosp.2016.37 · Cited by 145
Secure Evaluation of Private Linear Branching Programs with Medical Applications
Barni, M., Failla, P., Kolesnikov, V., Lazzeretti, R., Sadeghi, A., & Schneider, T. H. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04444-1_26 · Cited by 144
Self-citationOblivious Neural Network Computing via Homomorphic Encryption
Orlandi, C., Piva, A., & Barni, M. (2007) · EURASIP Journal on Information Security · doi:10.1155/2007/37343 · Cited by 138
Cryptographically private support vector machines
Laur, S., Lipmaa, H., & Mielikäinen, T. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150477 · Cited by 137
Secure two-party computations in ANSI C
Holzer, A., Franz, M., Katzenbeisser, S., & Veith, H. (2012) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2382196.2382278 · Cited by 125
Salus: a system for server-aided secure function evaluation
Kamara, S., Mohassel, P., & Riva, B. (2012) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2382196.2382280 · Cited by 119
GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits
Schneider, T. H., & Zohner, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39884-1_23 · Cited by 112
Self-citationSecure outsourced garbled circuit evaluation for mobile devices
Carter, H., Mood, B., Traynor, P., & Butler, K. R. B. (2015) · Journal of Computer Security · doi:10.3233/jcs-150540 · Cited by 111
Araki, T., Barak, A., Furukawa, J., Lichter, T., Lindell, Y., Nof, A., Ohara, K., Watzman, A., & Weinstein, O. (2017) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2017.15 · Cited by 108
Secure Computation on Floating Point Numbers.
Aliasgari, M., Blanton, M., Zhang, Y., & Steele, A. (2012) · Cited by 98
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
Ben-Efraim, A., Lindell, Y., & Omri, E. (2016) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2976749.2978347 · Cited by 95
Secure Multiparty Computation from SGX
Bahmani, R., Barbosa, M., Brasser, F., Portela, B., Sadeghi, A., Scerri, G., & Warinschi, B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70972-7_27 · Cited by 89
Zhang, Y., Steele, A., & Blanton, M. (2013) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2508859.2516752 · Cited by 86
Automated Synthesis of Optimized Circuits for Secure Computation
Demmler, D., Dessouky, G., Koushanfar, F., Sadeghi, A., Schneider, T. H., & Zeitouni, S. (2015) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2810103.2813678 · Cited by 84
Self-citationFrigate: A Validated, Extensible, and Efficient Compiler and Interpreter for Secure Computation
Mood, B., Gupta, D., Carter, H., Butler, K. R. B., & Traynor, P. (2016) · IEEE European Symposium on Security and Privacy · doi:10.1109/eurosp.2016.20 · Cited by 83
Automatic Protocol Selection in Secure Two-Party Computations
Kerschbaum, F., Schneider, T. H., & Schröpfer, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-07536-5_33 · Cited by 62
Self-citationSadeghi, A., & Schneider, T. H. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00730-9_21 · Cited by 51
Self-citationWhitewash: outsourcing garbled circuit generation for mobile devices
Carter, H., Lever, C., & Traynor, P. (2014) · Annual Computer Security Applications Conference · doi:10.1145/2664243.2664255 · Cited by 51
Privacy-Preserving Outsourced Media Search
Weng, L., Amsaleg, L., & Furon, T. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2587258 · Cited by 47
Pullonen, P., & Siim, S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48051-9_13 · Cited by 41
Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations
Krips, T., & Willemson, J. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13257-0_11 · Cited by 25
Outsourcing Secure Two-Party Computation as a Black Box
Carter, H., Mood, B., Traynor, P., & Butler, K. R. B. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-26823-1_15 · Cited by 24
Ad-Hoc Secure Two-Party Computation on Mobile Devices using Hardware Tokens.Preprint
Demmler, D., Schneider, T. H., & Zohner, M. (2014) · IACR Cryptology ePrint Archive · Cited by 23
Self-citationRiazi, M. S., Songhori, E. M., & Koushanfar, F. (2017) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3061639.3062305 · Cited by 9
Self-citation
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
“The protocol outcome enables multiple data owners to collaboratively agree to generate a function without leaking any information [130]–[132].”
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
“Besides, SMC-based protocols can enable multiple participants to collaboratively compute an agreed-upon function without leaking input information from any participant except for what can be inferred from the outcomes of the computation [101], [102].”
Background
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
- 75
- 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
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.