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

	সুরক্ষিত বহু-পক্ষীয় গণনা	কে-অ্যানোনিমিটি: প্রকাশিত তথ্যে ব্যক্তিগত গোপনীয়তা সুরক্ষা
ক্ষেত্র	গোপনীয়তা	গোপনীয়তা
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1982	2002
প্রবর্তক	Andrew Yao	Latanya Sweeney
ধরন	Cryptographic protocol family	Privacy-preserving data transformation
মৌলিক উৎস	Yao, A. C. (1982). Protocols for secure computations. 23rd Annual Symposium on Foundations of Computer Science, 160–164.	Sweeney, L. (2002). k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5), 557–570.
অপর নাম	MPC, Multi-Party Computation, Privacy-Preserving Computation, Güvenli Çok Taraflı Hesaplama	k-Anonymization, k-Anonymous Microdata, Quasi-Identifier Suppression Model, k-Anonimlik
সম্পর্কিত	3	2
সারসংক্ষেপ	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.	k-Anonymity is a formal privacy model introduced by Latanya Sweeney in 2002 to protect individuals when personal data is released for research or public use. It requires that every record in a published dataset be indistinguishable from at least k−1 other records with respect to a designated set of quasi-identifying attributes — such as age, gender, and ZIP code — preventing re-identification by linking released data to external sources.