메뉴 건너뛰기




Volumn 4, Issue , 2009, Pages 53-60

Privacy preserving k-anonymity for re-publication of incremental datasets

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMIZATION; DATA QUALITY; DATA SETS; EFFECTIVE SOLUTION; INCREMENTAL DATASETS; INCREMENTAL UPDATES; K-ANONYMITY; K-ANONYMIZATION; PRIVACY BREACHES; PRIVACY PRESERVING; RE-PUBLICATION;

EID: 70449420103     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSIE.2009.549     Document Type: Conference Paper
Times cited : (11)

References (14)
  • 1
    • 3142691086 scopus 로고    scopus 로고
    • On the complexity of optimal k-anonymity
    • A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In PODS, pages 223-228, 2004.
    • (2004) PODS , pp. 223-228
    • Meyerson, A.1    Williams, R.2
  • 3
    • 33749607006 scopus 로고    scopus 로고
    • l-diversity: Privacy beyond k-anonymity
    • A. Machanavajjhala, J. Gehrke and D. Kifer. l-diversity: Privacy beyond k-anonymity. In ICDE, page 24 , 2006.
    • (2006) ICDE , pp. 24
    • Machanavajjhala, A.1    Gehrke, J.2    Kifer, D.3
  • 4
    • 70449458897 scopus 로고    scopus 로고
    • A. Asuncion and D.J. Newman. UCI Machine Learning Repository [OL], ttp://mlearn.ics.uci.edu/MLRepository.html, 2007.
    • A. Asuncion and D.J. Newman. UCI Machine Learning Repository [OL], ttp://mlearn.ics.uci.edu/MLRepository.html, 2007.
  • 6
    • 0003483188 scopus 로고    scopus 로고
    • Protecting privacy when disclosing information: K-anonymity and its enforcement through generalization and suppression
    • SRI-CSL-98-04, 1998
    • P. Samarati and L. Sweeney. Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. In Technical Report SRI-CSL-98-04, 1998.
    • In Technical Report
    • Samarati, P.1    Sweeney, L.2
  • 7
    • 35448962139 scopus 로고    scopus 로고
    • Approximate Algorithms for k-Anonymity
    • H. Park and K. Shim. Approximate Algorithms for k-Anonymity. In SIGMOD, pages 67-78, 2007.
    • (2007) SIGMOD , pp. 67-78
    • Park, H.1    Shim, K.2
  • 9
    • 33750732631 scopus 로고    scopus 로고
    • J.-W. Byun, Y. Sohn, E. Bertino, and N. Li. Secure anonymization for incremental datasets. In SDM, pages 48-63, 2006.
    • J.-W. Byun, Y. Sohn, E. Bertino, and N. Li. Secure anonymization for incremental datasets. In SDM, pages 48-63, 2006.
  • 10
    • 29844444250 scopus 로고    scopus 로고
    • Incognito: Efficient full-domain k-anonymity
    • K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Incognito: Efficient full-domain k-anonymity. In SIGMOD, pages 49-60, 2005.
    • (2005) SIGMOD , pp. 49-60
    • LeFevre, K.1    DeWitt, D.J.2    Ramakrishnan, R.3
  • 11
    • 33749606641 scopus 로고    scopus 로고
    • Mondrian multidimensional k-anonymity
    • K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Mondrian multidimensional k-anonymity. In ICDE, page 25 , 2006.
    • (2006) ICDE , pp. 25
    • LeFevre, K.1    DeWitt, D.J.2    Ramakrishnan, R.3
  • 12
    • 0035517699 scopus 로고    scopus 로고
    • Protecting respondent's identities in microdata release
    • P. Samarati. Protecting respondent's identities in microdata release. IEEE Transactions on Knowledge and Data Engineering, 13(6), pages 1010-1027, 2001.
    • (2001) IEEE Transactions on Knowledge and Data Engineering , vol.13 , Issue.6 , pp. 1010-1027
    • Samarati, P.1
  • 13
    • 28444449426 scopus 로고    scopus 로고
    • Data privacy through optimal k-anonymization
    • R. Bayardo and R. Agrawal. Data privacy through optimal k-anonymization. In ICDE, pages 217-228, 2005.
    • (2005) ICDE , pp. 217-228
    • Bayardo, R.1    Agrawal, R.2
  • 14
    • 35448967088 scopus 로고    scopus 로고
    • m-Invariance: Towards privacy preserving re-publication of dynamic datasets
    • X. Xiao and Y. Tao. m-Invariance: Towards privacy preserving re-publication of dynamic datasets. In SIGMOD, pages 689-700, 2007.
    • (2007) SIGMOD , pp. 689-700
    • Xiao, X.1    Tao, Y.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.