Recently, a new security definition, named plausible deniability, for synthetic records has been proposed by Bindschaedler et al. Intuitively, the synthetic record r is said to satisfy plausible deniability if there are multiple “original” records that may become r. In this paper, we show that even if each synthetic record satisfies the plausible deniability, there is a possibility that the collection of these records will not have the plausible deniability, i.e., some of these records are re-identifiable.
CITATION STYLE
Waseda, A., & Nojima, R. (2020). On limitation of plausible deniability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12231 LNCS, pp. 207–217). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-58208-1_12
Mendeley helps you to discover research relevant for your work.