US 12,189,819 B2
Method and apparatus for de-identification of personal information
Dae Woo Choi, Seoul (KR); Woo Seok Kwon, Seoul (KR); Myeong Sik Hwang, Seoul (KR); Sang Wook Kim, Seoul (KR); and Gi Tae Kim, Seoul (KR)
Assigned to Fasoo, Seoul (KR)
Filed by FASOO CO., LTD., Seoul (KR)
Filed on May 14, 2022, as Appl. No. 17/744,630.
Application 17/744,630 is a continuation of application No. 16/314,202, granted, now 11,354,436, previously published as PCT/KR2017/006765, filed on Jun. 27, 2017.
Claims priority of application No. 10-2016-0082839 (KR), filed on Jun. 30, 2016; application No. 10-2016-0082860 (KR), filed on Jun. 30, 2016; and application No. 10-2016-0082878 (KR), filed on Jun. 30, 2016.
Prior Publication US 2022/0277106 A1, Sep. 1, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 21/62 (2013.01); G06F 16/00 (2019.01); G06F 16/23 (2019.01)
CPC G06F 21/6254 (2013.01) [G06F 16/00 (2019.01); G06F 16/2379 (2019.01); G06F 21/62 (2013.01)] 15 Claims
OG exemplary drawing
 
1. A personal information de-identification method performed by a personal information de-identification apparatus, the method comprising:
acquiring an original table including records in which original data indicating personal information is recorded from a database;
classifying respective records included in the original table based on attributes of the respective records, wherein the respective records are classified as one of classes of identifier (ID), quasi-identifier (QI), sensitive attribute (SA), and insensitive attribute (IA);
generalizing the original data recorded in the respective records included in the original table based on generalization levels;
setting up a generalization hierarchy model composed of the original data and the generalized data;
generating an original lattice including a plurality of candidate nodes indicating tables, which indicate generalization levels for types of personal information, based on a hierarchical structure indicated by the generalization hierarchy model; and
setting up a final lattice including one or more candidate nodes which satisfy a preset requirement among the plurality of candidate nodes included in the original lattice,
wherein a de-identified table generated in the generalizing of the original data is generated based on K-anonymity, generated based on K-anonymity and L-diversity, or generated based on K-anonymity and T-closeness, and
wherein the preset requirement includes a preset suppression requirement, which indicates a ratio of equivalence classes which do not satisfy a preset K-anonymity to equivalence classes constituting the de-identified table.