arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.4833cs.CRcs.DBcs.FL
收藏

数据树抗推理攻击的安全性验证

Toward Security Verification against Inference Attacks on Data Trees

Ryo Iwase, Yasunori Ishihara, Toru Fujiwara

摘要:

本文介绍了我们正在进行的工作,对数据树的推理攻击的安全验证。我们专注于无限的秘密推理攻击,这意味着攻击者不能缩小候选人的敏感信息的价值有限的可用信息的攻击者。我们的目的是提出一个模型,在此模型下无限秘密是可判定的。具体来说,我们首先提出了树转换器,这是足够的表达,以代表实际的查询。然后,为了表示攻击者的知识,我们提出了数据树类型,这样的类型推断和逆类型推断对这些树转换器是可能的数据树类型,和无限的数据树类型是可判定的。

英文摘要:

This paper describes our ongoing work on security verification against inference attacks on data trees. We focus on infinite secrecy against inference attacks, which means that attackers cannot narrow down the candidates for the value of the sensitive information to finite by available information to the attackers. Our purpose is to propose a model under which infinite secrecy is decidable. To be specific, we first propose tree transducers which are expressive enough to represent practical queries. Then, in order to represent attackers' knowledge, we propose data tree types such that type inference and inverse type inference on those tree transducers are possible with respect to data tree types, and infiniteness of data tree types is decidable.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑