On Limitation of Plausible Deniability.

IWSEC(2020)

引用 0|浏览2
暂无评分
摘要
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.
更多
查看译文
关键词
Privacy, Plausible deniability, Re-identifiable
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要