방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| Secure Multi-Party Computation× | 차분 프라이버시× | |
|---|---|---|
| 분야 | 프라이버시 | 프라이버시 |
| 계열 | 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데이터셋 ↗ |
|
|