השוואת שיטות

	הצפנה הומומורפית	חישוב רב-משתתפים מאובטח
תחום	פרטיות	פרטיות
משפחה	Machine learning	Machine learning
שנת המקור	2009	1982
הוגה השיטה	Craig Gentry	Andrew Yao
סוג	Lattice-based cryptographic scheme	Cryptographic protocol family
מקור מכונן	Gentry, C. (2009). Fully homomorphic encryption using ideal lattices. ACM Symposium on Theory of Computing (STOC), 169–178.	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	MPC, Multi-Party Computation, Privacy-Preserving Computation, Güvenli Çok Taraflı Hesaplama
קשורות	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.	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.