id: 05589644
dt: j
an: 05589644
au: Zhong, Sheng
ti: On distributed $k$-anonymization.
so: Fundam. Inform. 92, No. 4, 411-431 (2009).
py: 2009
pu: Polish Mathematical Society, Warsaw; IOS Press, Amsterdam
la: EN
cc: 
ut: $k$-anonymity; protocol; secure computation
ci: 
li: 
ab: Summary: When a database owner needs to disclose her data, she can
    $k$-anonymize her data to protect the involved individuals’ privacy.
    However, if the data is distributed between two owners, then it is an
    open question whether the two owners can jointly $k$-anonymize the
    union of their data, such that the information suppressed in one
    owner’s data is not revealed to the other owner. In this paper, we
    study this problemof distributed $k$-anonymization. We have two major
    results: First, it is impossible to design an unconditionally private
    protocol that implements any normal $k$-anonymization function, where
    normal $k$-anonymization functions are a very broad class of
    $k$-anonymization functions. Second, we give an efficent protocol that
    implements a normal $k$-anonymization function and show that it is
    private against polynomial-time adversaries. Our results have many
    potential applications and can be extended to three or more parties.
rv: