Abstract:
Two party’s privacy is no protecting in string approximate matching of database. In order to resolve this problem, a secure query protocol is proposed. Based on the secure computing edit distance protocols, the vacant transmission protocols and the homomorphism encryption schemes are used under the effective protection of two party’s privacy to achieve string approximate matching query. Furthermore, the correctness, the security and the computational complexity of this scheme are as well analyzed. The results of analysis show that the proposed scheme is secure and efficient.
Key words:
string approximate matching,
vacant transmission,
homomorphism encryption,
edit distance,
privacy protection
摘要: 数据库中字符串近似匹配查询不能完全保护查询双方的隐私信息。针对该问题,提出一种对数据库中字符串数据的近似匹配查询协议。采用安全计算编辑距离协议、同态加密、茫然传输等安全技术,在有效保护查询双方隐私信息的情况下,实现对字符串近似匹配的查询,并分析该协议的正确性、安全性及复杂性,结果表明,该方案是安全有效的。
关键词:
字符串近似匹配,
茫然传输,
同态加密,
编辑距离,
隐私保护
CLC Number:
YUAN Xian-Beng, ZHONG Gong, HUANG Hong-Sheng, YI Lei. Secure Query Protocol for String Approximate Matching[J]. Computer Engineering, 2011, 37(20): 142-144.
袁先平, 仲红, 黄宏升, 易磊. 一种字符串近似匹配的安全查询协议[J]. 计算机工程, 2011, 37(20): 142-144.