保护私有信息的图形相似判定
发布时间：2018-09-03 12:55
【摘要】：目前,关于几何图形的相似问题仅限于多边形的相似,而一般几何图形相似的问题还没有研究.本文利用单向散列函数首先设计了保密判断两个数是否相等的协议、保密矩阵和向量是否相等的协议;最终,利用矩阵和向量相等的协议设计了保密判断图形是否同构和图形是否相似的协议.给出了以上协议的安全性证明、仿真实验与效率分析,实验数据表明本文保密的图形相似判定协议效率是两个多边形相似协议效率的889倍.图形相似的保密判定问题是一个全新的安全多方计算几何问题,本文研究成果可应用在分子生物学、机械工程和地形匹配等领域.
[Abstract]:At present, the similarity of geometry is limited to the similarity of polygons, but the problem of geometric similarity has not been studied. In this paper, we first design a protocol to judge whether two numbers are equal or not, and whether the security matrix and vector are equal by using one-way hash function. A protocol to determine whether the graph is isomorphic or not is designed by using the equal matrix and vector protocol. The security proof, simulation experiment and efficiency analysis of the above protocol are given. The experimental data show that the efficiency of the proposed protocol is 889 times that of the two polygon similarity protocols. The secure decision problem of graphic similarity is a new secure multi-party computational geometry problem. This paper can be applied in the fields of molecular biology, mechanical engineering and terrain matching.
【作者单位】： 陕西师范大学计算机科学学院;内蒙古科技大学信息工程学院;
【基金】：国家自然科学基金(No.61272435) 内蒙古自然科学基金(No.2017MS0602) 中央高校基本科研业务费专项资金资助(No.2016TS061) 内蒙古自治区高等学校科学研究项目(No.NJZY17164)
【分类号】：TP309
[Abstract]:At present, the similarity of geometry is limited to the similarity of polygons, but the problem of geometric similarity has not been studied. In this paper, we first design a protocol to judge whether two numbers are equal or not, and whether the security matrix and vector are equal by using one-way hash function. A protocol to determine whether the graph is isomorphic or not is designed by using the equal matrix and vector protocol. The security proof, simulation experiment and efficiency analysis of the above protocol are given. The experimental data show that the efficiency of the proposed protocol is 889 times that of the two polygon similarity protocols. The secure decision problem of graphic similarity is a new secure multi-party computational geometry problem. This paper can be applied in the fields of molecular biology, mechanical engineering and terrain matching.
【作者单位】： 陕西师范大学计算机科学学院;内蒙古科技大学信息工程学院;
【基金】：国家自然科学基金(No.61272435) 内蒙古自然科学基金(No.2017MS0602) 中央高校基本科研业务费专项资金资助(No.2016TS061) 内蒙古自治区高等学校科学研究项目(No.NJZY17164)
【分类号】：TP309
【相似文献】
相关期刊论文 前2条
1 宏宇;;光速运动下的视觉效果[J];科技导报;1990年04期
2 刘勇;周晓林;吴必文;王东勇;方，
本文编号：2220036
本文链接：https://www.wllwen.com/kejilunwen/ruanjiangongchenglunwen/2220036.html
