University Library
  • Login
A gateway to Melbourne's research publications
Minerva Access is the University's Institutional Repository. It aims to collect, preserve, and showcase the intellectual output of staff and students of the University of Melbourne for a global audience.
View Item 
  • Minerva Access
  • Engineering and Information Technology
  • Computing and Information Systems
  • Computing and Information Systems - Research Publications
  • View Item
  • Minerva Access
  • Engineering and Information Technology
  • Computing and Information Systems
  • Computing and Information Systems - Research Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

    Developing Non-Stochastic Privacy-Preserving Policies Using Agglomerative Clustering

    Thumbnail
    Download
    Accepted version (1.277Mb)

    Citations
    Scopus
    Altmetric
    1
    Author
    Ding, N; Farokhi, F
    Date
    2020-06-15
    Source Title
    IEEE Transactions on Information Forensics and Security
    Publisher
    Institute of Electrical and Electronics Engineers
    University of Melbourne Author/s
    Ding, Ni; Farokhi, Farhad
    Affiliation
    Computing and Information Systems
    Electrical and Electronic Engineering
    Metadata
    Show full item record
    Document Type
    Journal Article
    Citations
    Ding, N. & Farokhi, F. (2020). Developing Non-Stochastic Privacy-Preserving Policies Using Agglomerative Clustering. IEEE Transactions on Information Forensics and Security, 15, pp.3911-3923. https://doi.org/10.1109/TIFS.2020.3002479.
    Access Status
    Open Access
    URI
    http://hdl.handle.net/11343/251364
    DOI
    10.1109/TIFS.2020.3002479
    Abstract
    We consider a non-stochastic privacy-preserving problem in which an adversary aims to infer sensitive information S from publicly accessible data X without using statistics. We consider the problem of generating and releasing a quantization X^ of X to minimize the privacy leakage of S to X^ while maintaining a certain level of utility (or, inversely, the quantization loss). The variables S and X are treated as bounded and non-probabilistic, but are otherwise general. We consider two existing non-stochastic privacy measures, namely the maximum uncertainty reduction L0(S→X^) and the refined information I∗(S;X^) (also called the maximin information) of S . For each privacy measure, we propose a corresponding agglomerative clustering algorithm that converges to a locally optimal quantization solution X^ by iteratively merging elements in the alphabet of X . To instantiate the solution to this problem, we consider two specific utility measures, the worst-case resolution of X by observing X^ and the maximal distortion of the released data X^ . We show that the value of the maximin information I∗(S;X^) can be determined by dividing the confusability graph into connected subgraphs. Hence, I∗(S;X^) can be reduced by merging nodes connecting subgraphs. The relation to the probabilistic information-theoretic privacy is also studied by noting that the Gács-Körner common information is the stochastic version of I∗ and indicates the attainability of statistical indistinguishability.

    Export Reference in RIS Format     

    Endnote

    • Click on "Export Reference in RIS Format" and choose "open with... Endnote".

    Refworks

    • Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References


    Collections
    • Minerva Elements Records [52443]
    • Electrical and Electronic Engineering - Research Publications [792]
    • Computing and Information Systems - Research Publications [1565]
    Minerva AccessDepositing Your Work (for University of Melbourne Staff and Students)NewsFAQs

    BrowseCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects
    My AccountLoginRegister
    StatisticsMost Popular ItemsStatistics by CountryMost Popular Authors