השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| חישוב רב-משתתפים מאובטח× | למידה מאוחדת (Federated Learning)× | k-אנונימיות: הגנה על פרטיות הפרט בנתונים ששוחררו× | |
|---|---|---|---|
| תחום | פרטיות | פרטיות | פרטיות |
| משפחה | Machine learning | Machine learning | Machine learning |
| שנת המקור≠ | 1982 | 2017 | 2002 |
| הוגה השיטה≠ | Andrew Yao | McMahan et al. | Latanya Sweeney |
| סוג≠ | Cryptographic protocol family | Distributed privacy-preserving machine learning | Privacy-preserving data transformation |
| מקור מכונן≠ | Yao, A. C. (1982). Protocols for secure computations. 23rd Annual Symposium on Foundations of Computer Science, 160–164. DOI ↗ | McMahan, B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. (2017). Communication-efficient learning of deep networks from decentralized data. Artificial Intelligence and Statistics, 1273–1282. link ↗ | Sweeney, L. (2002). k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5), 557–570. DOI ↗ |
| כינויים | MPC, Multi-Party Computation, Privacy-Preserving Computation, Güvenli Çok Taraflı Hesaplama | Collaborative Learning, Decentralized Learning, FedAvg, Federe Öğrenme | k-Anonymization, k-Anonymous Microdata, Quasi-Identifier Suppression Model, k-Anonimlik |
| קשורות≠ | 3 | 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. | Federated Learning is a distributed machine learning paradigm introduced by McMahan et al. in 2017 in which a global model is trained collaboratively across multiple decentralized clients — such as mobile devices or hospital systems — without ever transferring raw data to a central server. Each participant computes model updates locally using its private data; only those updates, not the underlying data, are communicated and aggregated by the server to improve the shared model. | 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. |
| ScholarGateמערך נתונים ↗ |
|
|
|