เปรียบเทียบวิธี

	Homomorphic Encryption	ความเป็นส่วนตัวเชิงอนุพันธ์	สหพันธ์การเรียนรู้	การคำนวณแบบหลายฝ่ายที่ปลอดภัย
สาขาวิชา	ความเป็นส่วนตัว	ความเป็นส่วนตัว	ความเป็นส่วนตัว	ความเป็นส่วนตัว
ตระกูล	Machine learning	Machine learning	Machine learning	Machine learning
ปีกำเนิด	2009	2006	2017	1982
ผู้ริเริ่ม	Craig Gentry	Cynthia Dwork	McMahan et al.	Andrew Yao
ประเภท	Lattice-based cryptographic scheme	Privacy-preserving randomized mechanism	Distributed privacy-preserving machine learning	Cryptographic protocol family
แหล่งต้นตำรับ	Gentry, C. (2009). Fully homomorphic encryption using ideal lattices. ACM Symposium on Theory of Computing (STOC), 169–178.	Dwork, C. (2006). Differential privacy. International Colloquium on Automata, Languages and Programming (ICALP), 1–12.	McMahan, B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. (2017). Communication-efficient learning of deep networks from decentralized data. Artificial Intelligence and Statistics, 1273–1282.	Yao, A. C. (1982). Protocols for secure computations. 23rd Annual Symposium on Foundations of Computer Science, 160–164.
ชื่อเรียกอื่น	FHE, Fully Homomorphic Encryption, Leveled Homomorphic Encryption, Homomorfik Şifreleme	DP, epsilon-differential privacy, randomized privacy, Diferansiyel Gizlilik	Collaborative Learning, Decentralized Learning, FedAvg, Federe Öğrenme	MPC, Multi-Party Computation, Privacy-Preserving Computation, Güvenli Çok Taraflı Hesaplama
ที่เกี่ยวข้อง	3	3	3	3
สรุป	Homomorphic Encryption (HE) is a cryptographic framework that allows arbitrary computations to be performed directly on encrypted data without requiring decryption. First realized as a fully general construction by Craig Gentry in 2009 using ideal lattices, it enables a server to process sensitive data and return an encrypted result that, when decrypted by the data owner, equals the result of performing the same computation on the plaintext. It is foundational to privacy-preserving machine learning, secure cloud computing, and confidential analytics.	Differential privacy is a mathematical framework for releasing statistical information about a dataset while providing rigorous guarantees that individual records cannot be identified or inferred. Introduced by Cynthia Dwork in 2006, it formalizes privacy as a probabilistic bound: any single individual's presence or absence in the dataset changes the output distribution by at most a multiplicative factor of e^ε, where ε is the privacy budget controlling the privacy–utility tradeoff.	Federated Learning is a distributed machine learning paradigm introduced by McMahan et al. in 2017 in which a global model is trained collaboratively across multiple decentralized clients — such as mobile devices or hospital systems — without ever transferring raw data to a central server. Each participant computes model updates locally using its private data; only those updates, not the underlying data, are communicated and aggregated by the server to improve the shared model.	Secure Multi-Party Computation (SMPC) is a cryptographic paradigm that enables two or more parties to jointly compute a function over their private inputs without revealing those inputs to one another. Introduced by Andrew Yao in 1982 through his seminal garbled-circuit construction, SMPC provides provable privacy guarantees grounded in computational hardness assumptions. It underpins modern privacy-preserving data analysis, enabling collaborative computation on sensitive datasets in finance, healthcare, and machine learning.