【摘要】 随着信息技术的快速发展，在保护数据隐私的条件下进行多方合作计算越来越普及，安全多方计算已成为解决这类问题的核心技术。在科学研究及实际应用中，人们常根据两个字符串之间的汉明/编辑距离度量其相似程度，研究汉明/编辑距离的保密计算具有重要意义。文中主要针对汉明距离与编辑距离的两方保密计算问题进行研究。首先将汉明距离的计算问题转化为向量内积计算问题，应用加密选择技巧以及Okamoto-Uchiyama(OU)密码系统设计保密计算协议。然后通过对参与者字符串中各字符进行统一编号的方法，将编辑距离的计算问题转化为判定隐私数据的差是否为0的问题，应用OU密码系统设计编辑距离保密计算协议。应用模拟范例严格证明了协议的安全性，分析了协议的计算复杂性，测试了协议的实际执行效率，并与目前已有相关结果进行了分析比较。理论分析和实验结果都表明了协议的高效性。更多还原

【Abstract】 With the rapid development of information technology, privacy-preserving multiparty cooperative computation is becoming more and more popular.Secure multiparty computation is a key technology to address such problems.In scientific research and practical applications, people measure the similarity of two strings with Hamming(edit) distance.It is of great significance to study privacy-preserving Hamming(edit) distance computation.This paper studies privacy-preserving Hamming(edit) distance computation.First, we transform Hamming distance computation to inner product computation of vectors, and then use Okamoto-Uchiyama(OU) cryptosystem and encryption-and-choose technique to design protocol for Hamming distance.Second, we give each alphabet of a string a number, transform edit distance to determine whether the difference of the number of two alphabets is 0,and use OU cryptosystem to design a privacy-preserving edit distance computation protocol.The security of the protocol is strictly proved, the computational complexity of the protocol is analyzed, the actual implementation efficiency of the protocol is tested and compared with the existing results.Theoretical analysis and experimental results show that our protocols are efficient.更多还原