Evaluating the Efficacy of Homomorphic Encryption and Secure Multiparty Computation for Preserving Confidentiality in Decentralized Data Ecosystems
Keywords:
Homomorphic Encryption, Secure Multiparty Computation, Decentralized Data Ecosystems, Cryptographic Privacy, Federated Learning, Data ConfidentialityAbstract
In decentralized data ecosystems, the confidentiality of sensitive information remains a significant challenge, particularly in the face of collaborative data analysis. This paper evaluates two cryptographic paradigms—Homomorphic Encryption (HE) and Secure Multiparty Computation (SMC)—for their potential to ensure data privacy without compromising utility. Using comparative metrics such as computational overhead, scalability, and confidentiality guarantees, we conduct an evaluative study rooted in cryptographic theory and practical implementations. Our findings reveal key trade-offs in applying HE and SMC within decentralized frameworks such as federated learning and blockchain-based networks. We conclude by identifying deployment scenarios best suited to each paradigm and highlighting future research opportunities in hybridized models.
References
Gentry, C. (2009). Fully Homomorphic Encryption Using Ideal Lattices. Communications of the ACM, Vol. 56, Issue 9.
Halevi, S., & Shoup, V. (2011). Algorithms in HElib. Journal of Cryptology, Vol. 24, Issue 4.
Goldreich, O. (2004). Foundations of Cryptography Vol. 2. Cambridge University Press.
Damgård, I., et al. (2012). Multiparty Computation from Somewhat Homomorphic Encryption. Advances in Cryptology – CRYPTO, Vol. 7417, Issue 1.
Keller, M., et al. (2018). Overdrive: Efficient Secure MPC Protocol. IEEE Transactions on Information Forensics, Vol. 13, Issue 5.
Yao, A. (2016). Encrypted Smart Contracts. IEEE Transactions on Dependable Systems, Vol. 13, Issue 2.
Kosba, A., et al. (2017). Hawk: The Framework for Private Smart Contracts. IEEE Security & Privacy, Vol. 15, Issue 4.
Dwork, C., & Roth, A. (2010). Differential Privacy. Foundations and Trends in Theoretical Computer Science, Vol. 9, Issue 3-4.
Lauter, K., Naehrig, M., & Vaikuntanathan, V. (2011). Can Homomorphic Encryption be Practical? ACM Cloud Computing Security Workshop, Vol. 12, Issue 1.
Bogdanov, D., et al. (2013). Sharemind: Framework for Privacy-Preserving Computations. ACM Transactions on Privacy and Security, Vol. 15, Issue 2.
Bonawitz, K., et al. (2017). Practical Secure Aggregation for FL. Proceedings of the ACM SIGSAC, Vol. 24, Issue 5.
Riazi, M. S., et al. (2018). Chameleon: A Hybrid Secure Computation Framework. IEEE Transactions on Information Forensics, Vol. 13, Issue 7.
Mohassel, P., & Zhang, Y. (2017). SecureML: Secure Machine Learning. IEEE Security & Privacy, Vol. 15, Issue 6.
Wu, X., et al. (2019). A Survey on Blockchain and Privacy-Preserving ML. ACM Computing Surveys, Vol. 52, Issue 6.
Juvekar, C., Vaikuntanathan, V., & Chandrakasan, A. (2018). Gazelle: Low Latency Encrypted Inference. USENIX Security Symposium, Vol. 27, Issue 8
Downloads
Published
Issue
Section
License
Copyright (c) 2021 Fatima Al-Mansouri (Author)

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.