【摘要】：目前,關(guān)于幾何圖形的相似問(wèn)題僅限于多邊形的相似,而一般幾何圖形相似的問(wèn)題還沒(méi)有研究.本文利用單向散列函數(shù)首先設(shè)計(jì)了保密判斷兩個(gè)數(shù)是否相等的協(xié)議、保密矩陣和向量是否相等的協(xié)議;最終,利用矩陣和向量相等的協(xié)議設(shè)計(jì)了保密判斷圖形是否同構(gòu)和圖形是否相似的協(xié)議.給出了以上協(xié)議的安全性證明、仿真實(shí)驗(yàn)與效率分析,實(shí)驗(yàn)數(shù)據(jù)表明本文保密的圖形相似判定協(xié)議效率是兩個(gè)多邊形相似協(xié)議效率的889倍.圖形相似的保密判定問(wèn)題是一個(gè)全新的安全多方計(jì)算幾何問(wèn)題,本文研究成果可應(yīng)用在分子生物學(xué)、機(jī)械工程和地形匹配等領(lǐng)域.
[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.
【作者單位】： 陜西師范大學(xué)計(jì)算機(jī)科學(xué)學(xué)院;內(nèi)蒙古科技大學(xué)信息工程學(xué)院;
【基金】：國(guó)家自然科學(xué)基金(No.61272435) 內(nèi)蒙古自然科學(xué)基金(No.2017MS0602) 中央高�；究蒲袠I(yè)務(wù)費(fèi)專項(xiàng)資金資助(No.2016TS061) 內(nèi)蒙古自治區(qū)高等學(xué)校科學(xué)研究項(xiàng)目(No.NJZY17164)
【分類號(hào)】：TP309

【相似文獻(xiàn)】

相關(guān)期刊論文 前2條

1 宏宇;;光速運(yùn)動(dòng)下的視覺(jué)效果[J];科技導(dǎo)報(bào);1990年04期

2 劉勇;周曉林;吳必文;王東勇;方，

本文編號(hào)：2220036