论文部分内容阅读
多方安全计算中集合点包含和几何点包含等方法都是近几年密码学研究的一个热点问题。提出路径点包含的安全多方计算问题,并对路径点包含基本原理进行研究。通过对选定路径进行特殊编码,编码后把路径转化为集合,再利用集合包含问题的处理方法,计算了两集合的交集,进而又把集合还原为路径,求出了两路径的公共路径,得到路径点包含安全两方计算的保密结果。最后分析证明了新方案的安全性。
Multi-party security computing in the collection point contains and geometric point of inclusion and other methods are cryptography in recent years, a hot issue. The problem of secure multi-party computation included in path points is proposed and the basic principle of path points is studied. After coding the selected path, the path is transformed into a set, and then the set contains the problem handling method, the intersection of the two sets is calculated, and then the set is restored to the path, the common path of the two paths is obtained, Get the path to the point containing the security results calculated by both parties. The final analysis proves the safety of the new scheme.