电子学报 ›› 2017, Vol. 45 ›› Issue (9): 2184-2189.DOI: 10.3969/j.issn.0372-2112.2017.09.019

• 学术论文 • 上一篇    下一篇

保护私有信息的图形相似判定

李顺东1, 杨晓莉1, 左祥建1, 周素芳1, 亢佳1, 刘新1,2   

  1. 1. 陕西师范大学计算机科学学院, 陕西西安 710119;
    2. 内蒙古科技大学信息工程学院, 内蒙古包头 014010
  • 收稿日期:2016-08-07 修回日期:2016-10-19 出版日期:2017-09-25
    • 作者简介:
    • 李顺东,男,1963年生于河南平顶山.现为陕西师范大学计算机科学学院教授、博士生导师.主要研究方向为密码学与信息安全.E-mail:shundong@snnu.edu.cn;杨晓莉,女,1989年生于陕西商洛.现为陕西师范大学计算机科学学院硕士研究生.主要研究方向为密码学与信息安全.E-mail:xiaoliyang@snnu.edu.cn
    • 基金资助:
    • 国家自然科学基金 (No.61272435); 内蒙古自然科学基金 (No.2017MS0602); 中央高校基本科研业务费专项资金资助 (No.2016TS061); 内蒙古自治区高等学校科学研究项目 (No.NJZY17164)

Privacy-Preserving Graphical Similarity Determination

LI Shun-dong1, YANG Xiao-li1, ZUO Xiang-jian1, ZHOU Su-fang1, KANG Jia1, LIU Xin1,2   

  1. 1. School of Computer Science, Shaanxi Normal University, Xi'an, Shaanxi 710119, China;
    2. School of Information Engineering, Inner Mongolia University of Science and Technology, Baotou, Inner Mongolia 014010, China
  • Received:2016-08-07 Revised:2016-10-19 Online:2017-09-25 Published:2017-09-25
    • Supported by:
    • National Natural Science Foundation of China (No.61272435); Natural Science Foundation of Inner Mongolia Autonomous Region,  China (No.2017MS0602); Fundamental Research Funds for the Central Universities (No.2016TS061); Scientific Research Project of Universities and Colleges in Inner Mongolia Autonomous Region (No.NJZY17164)

摘要: 目前,关于几何图形的相似问题仅限于多边形的相似,而一般几何图形相似的问题还没有研究.本文利用单向散列函数首先设计了保密判断两个数是否相等的协议、保密矩阵和向量是否相等的协议;最终,利用矩阵和向量相等的协议设计了保密判断图形是否同构和图形是否相似的协议.给出了以上协议的安全性证明、仿真实验与效率分析,实验数据表明本文保密的图形相似判定协议效率是两个多边形相似协议效率的889倍.图形相似的保密判定问题是一个全新的安全多方计算几何问题,本文研究成果可应用在分子生物学、机械工程和地形匹配等领域.

关键词: 密码学, 安全多方计算, 计算几何, 图形相似, 图形同构

Abstract: At present,graphical similarity is limited to polygonal similarity,but the problem of general graphical similarity has not been studied.We first present protocols for privately determining whether two numbers,matrices or vectors are equal based on one-way hash function.Finally,we design protocols to privately determine whether two special graphics are isomorphic,and whether two graphics are similar.We prove the security of the protocols,implement them on a personal computer and analyze their efficiency.The simulation shows that the protocol of two similar graphics is 889 times as fast as the protocol of two similar polygons.Privately determining whether two graphs are similar is completely a new secure multiparty computation problem.It has application prospects in the field of the molecular biology,mechanical engineering and terrestrial matching,etc.

Key words: cryptography, secure multi-party computation, computational geometry, graphics similar, graphics isomorphism

中图分类号: