विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| सुरक्षित बहु-पक्षीय संगणना× | विभेदक गोपनीयता× | |
|---|---|---|
| क्षेत्र | गोपनीयता | गोपनीयता |
| परिवार | 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. DOI ↗ | Dwork, C. (2006). Differential privacy. International Colloquium on Automata, Languages and Programming (ICALP), 1–12. DOI ↗ |
| उपनाम | 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. |
| ScholarGateडेटासेट ↗ |
|
|