当前位置: X-MOL 学术J. Inf. Secur. Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Efficient protocols for private wildcards pattern matching
Journal of Information Security and Applications ( IF 5.6 ) Pub Date : 2020-09-18 , DOI: 10.1016/j.jisa.2020.102609
Tushar Kanti Saha , Deevashwer Rathee , Takeshi Koshiba

A wildcard character in a pattern adds an additional feature in the field of pattern matching. In this paper, we consider two problems of secure pattern matching (SPM) with wildcards: (i) SPM with repetitive wildcards (SPM-RW) and (ii) SPM with compound wildcards (SPM-CW). Here we consider that a type of wildcard characters “*” is used to represent gaps in the pattern for the first problem of SPM with wildcards. Usually, a wildcard character “*” is used to replace with zero or more letters in the text for the pattern matching problem. Yasuda et al. (ACISP 2014) proposed a protocol with an existing data packing method for secure wildcards pattern matching using symmetric somewhat homomorphic encryption (SwHE) in the semi-honest model in which a wildcard character in the pattern is replaced with just one letter in the text. Furthermore, we enhance their work to replace a wildcard with any sequence of letters in the text then propose SPM-RW protocols by using the symmetric and public-key SwHE schemes in the semi-honest model. Also, we propose a packing method that improves the number of homomorphic multiplications by a factor of k compared to a naive usage of Yasuda et al.’s method to solve the SPM-RW problem in which k is the number of sub-patterns. Next, we consider the SPM-CW problem for processing private database queries, which allows a few types of wildcards (“$”, “*”, and “!”) to appear in the pattern. To solve this problem, we propose an SPM-CW protocol using a double-query technique with public-key SwHE encryption in the semi-honest model. Our experiments exhibit the practicality of the new protocols for SPM-RW and SPM-CW, which outperforms state-of-the-art.



中文翻译:

专用通配符模式匹配的有效协议

模式中的通配符在模式匹配领域中添加了附加功能。在本文中,我们考虑了带通配符的安全模式匹配(SPM)的两个问题:(i)带重复通配符的SPM(SPM-RW)和(ii)带复合通配符的SPM(SPM-CW)。在这里,我们认为通配符SPM的第一个问题是使用通配符“ * ”来表示模式中的间隙。通常,通配符“ *”用于替换文本中的零个或多个字母以解决模式匹配问题。Yasuda等。(ACISP 2014)提出了一种具有现有数据打包方法的协议,用于在半诚实模型中使用对称的同态加密(SwHE)进行安全的通配符模式匹配,其中模式中的通配符仅用文本中的一个字母替换。此外,我们加强了他们的工作,以用文本中的任何字母序列替换通配符,然后通过在半诚实模型中使用对称和公钥SwHE方案提出SPM-RW协议。此外,我们提出了一种打包方法,该方法可以将同态乘法的数量提高一个ķ 与Yasuda等人在解决SPM-RW问题时的天真的用法相比 ķ是子模式的数量。接下来,我们考虑用于处理私有数据库查询的SPM-CW问题,该问题允许在模式中出现几种类型的通配符(“ $ ”,“ * ”和“!”)。为了解决这个问题,我们提出了一种在半诚实模型中使用带有公共密钥SwHE加密的双查询技术的SPM-CW协议。我们的实验展示了SPM-RW和SPM-CW新协议的实用性,其性能优于最新技术。

更新日期:2020-09-20
down
wechat
bug