arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2105.09616cs.ITmath.IT
收藏

列删除下的数据库匹配

Database Matching Under Column Deletions

Serhat Bakirtas, Elza Erkip

摘要:

通过匹配互联网上可用的各种形式的用户数据来对用户身份进行去匿名化会引起隐私问题。在这种情况下的隐私泄漏的基本理解需要仔细研究的条件下,相关的数据库可以匹配。针对时间索引数据库中的同步错误,研究了随机列删除下的随机数据库匹配问题。适应工具从信息论,特别是那些开发的删除通道,删除位置信息的存在和不存在的情况下,数据库匹配的条件推导出,部分删除信息显着增加了可实现的数据库增长率成功匹配。此外,给定一批正确匹配的行,删除检测算法,提供部分删除信息,并推导出该算法的删除检测概率的下限的列大小和批量大小。数据库大小和批量大小之间的关系,以保证一个给定的删除检测概率,使用所提出的算法表明,一个批量大小增长的双对数与行大小是足够的非零检测概率保证。

英文摘要:

De-anonymizing user identities by matching various forms of user data available on the internet raises privacy concerns. A fundamental understanding of the privacy leakage in such scenarios requires a careful study of conditions under which correlated databases can be matched. Motivated by synchronization errors in time indexed databases, in this work, matching of random databases under random column deletion is investigated. Adapting tools from information theory, in particular ones developed for the deletion channel, conditions for database matching in the absence and presence of deletion location information are derived, showing that partial deletion information significantly increases the achievable database growth rate for successful matching. Furthermore, given a batch of correctly-matched rows, a deletion detection algorithm that provides partial deletion information is proposed and a lower bound on the algorithm's deletion detection probability in terms of the column size and the batch size is derived. The relationship between the database size and the batch size required to guarantee a given deletion detection probability using the proposed algorithm suggests that a batch size growing double-logarithmic with the row size is sufficient for a nonzero detection probability guarantee.

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

↑