방법 비교

	차분 프라이버시	k-익명성: 공개 데이터에서 개인 정보 보호
분야	프라이버시	프라이버시
계열	Machine learning	Machine learning
기원 연도	2006	2002
창시자	Cynthia Dwork	Latanya Sweeney
유형	Privacy-preserving randomized mechanism	Privacy-preserving data transformation
원전	Dwork, C. (2006). Differential privacy. International Colloquium on Automata, Languages and Programming (ICALP), 1–12.	Sweeney, L. (2002). k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5), 557–570.
별칭	DP, epsilon-differential privacy, randomized privacy, Diferansiyel Gizlilik	k-Anonymization, k-Anonymous Microdata, Quasi-Identifier Suppression Model, k-Anonimlik
관련	3	2
요약	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.	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.