arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.03018cs.DBcs.CR
收藏

基于后缀树的精确高效的隐私保护串匹配

Accurate and Efficient Suffix Tree Based Privacy-Preserving String Matching

Sirintra Vaiwsri, Thilina Ranbaduge, Peter Christen, Kee Siong Ng

摘要:

计算不同组织持有的字符串之间的相似性而不揭示这些字符串的任务在健康信息学,国家人口普查,基因组学和欺诈检测等领域越来越重要。大多数现有的隐私保护字符串比较函数要么基于比较编码字符q-gram的集合,只允许加密字符串的精确匹配,要么针对具有小字母表的长基因组序列。基于集合的隐私保护相似度函数通常用于在隐私保护记录链接的上下文中比较名称和地址字符串,不考虑子字符串的位置。因此,两个非常不同的字符串可能被认为是一个精确的匹配,导致错误的链接记录。现有的基于集合的技术也不能识别跨两个字符串的最长公共子串的长度。在本文中,我们提出了一种新的方法,准确和有效的隐私保护字符串匹配的基础上,使用链式哈希编码的后缀树。我们将一个基于哈希的编码技术后,编码的后缀,以提高隐私对频率攻击,如利用本福德定律。我们的方法允许执行各种操作,而不需要显示要比较的字符串:最长公共子串的长度,两个字符串是否具有相同的开头,中间或结尾,以及两个字符串之间的最长公共子串相似性。这些函数允许更准确地比较,例如,银行账户、信用卡或电话号码,这不能与现有的隐私保护字符串匹配技术进行适当的比较。我们对几个不同类型字符串的数据集进行了评估,验证了我们所提出的方法的隐私性和准确性。

英文摘要:

The task of calculating similarities between strings held by different organizations without revealing these strings is an increasingly important problem in areas such as health informatics, national censuses, genomics, and fraud detection. Most existing privacy-preserving string comparison functions are either based on comparing sets of encoded character q-grams, allow only exact matching of encrypted strings, or they are aimed at long genomic sequences that have a small alphabet. The set-based privacy-preserving similarity functions commonly used to compare name and address strings in the context of privacy-preserving record linkage do not take the positions of sub-strings into account. As a result, two very different strings can potentially be considered as an exact match leading to wrongly linked records. Existing set-based techniques also cannot identify the length of the longest common sub-string across two strings. In this paper we propose a novel approach for accurate and efficient privacy-preserving string matching based on suffix trees that are encoded using chained hashing. We incorporate a hashing based encoding technique upon the encoded suffixes to improve privacy against frequency attacks such as those exploiting Benford's law. Our approach allows various operations to be performed without the strings to be compared being revealed: the length of the longest common sub-string, do two strings have the same beginning, middle or end, and the longest common sub-string similarity between two strings. These functions allow a more accurate comparison of, for example, bank account, credit card, or telephone numbers, which cannot be compared appropriately with existing privacy-preserving string matching techniques. Our evaluation on several data sets with different types of strings validates the privacy and accuracy of our proposed approach.

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

↑