路径点包含安全两方计算问题的求解

A Solution of Path Point-included Secure Two-Party Computation Problem

多方安全计算中集合点包含和几何点包含等方法都是近几年密码学研究的一个热点问题。提出路径点包含的安全多方计算问题,并对路径点包含基本原理进行研究。通过对选定路径进行特殊编码,编码后把路径转化为集合,再利用集合包含问题的处理方法,计算了两集合的交集,进而又把集合还原为路径,求出了两路径的公共路径,得到路径点包含安全两方计算的保密结果。最后分析证明了新方案的安全性。

The methods for multi-party secure computation,such as set point-inclusion and graph set-inclusion,are hot topics in recent years’ cryptography research.In this paper,a secure multi-party computation of path point-inclusion is proposed,and the principles of path point-inclusion are studied.The secret results of secure tow-party problem could be obtained through coding the selected path,then transforming the path into set,computing the intersection of these two sets by the processing method for set-inclusion problem,and then finding the public path of the two paths by path restoration.Finally,the discussion and analysis proves the security of this new scheme.