পদ্ধতির তুলনা করুন

	সুরক্ষিত বহু-পক্ষীয় গণনা	ডিফারেনশিয়াল প্রাইভেসি
ক্ষেত্র	গোপনীয়তা	গোপনীয়তা
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1982	2006
প্রবর্তক	Andrew Yao	Cynthia Dwork
ধরন	Cryptographic protocol family	Privacy-preserving randomized mechanism
মৌলিক উৎস	Yao, A. C. (1982). Protocols for secure computations. 23rd Annual Symposium on Foundations of Computer Science, 160–164.	Dwork, C. (2006). Differential privacy. International Colloquium on Automata, Languages and Programming (ICALP), 1–12.
অপর নাম	MPC, Multi-Party Computation, Privacy-Preserving Computation, Güvenli Çok Taraflı Hesaplama	DP, epsilon-differential privacy, randomized privacy, Diferansiyel Gizlilik
সম্পর্কিত	3	3
সারসংক্ষেপ	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.	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.