ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

Secure Multi-Party Computation×차분 프라이버시×
분야프라이버시프라이버시
계열Machine learningMachine learning
기원 연도19822006
창시자Andrew YaoCynthia Dwork
유형Cryptographic protocol familyPrivacy-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ı HesaplamaDP, epsilon-differential privacy, randomized privacy, Diferansiyel Gizlilik
관련33
요약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데이터셋
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Secure Multi-Party Computation · Differential Privacy. 2026-06-17에 다음에서 검색함: https://scholargate.app/ko/compare