Research And Application Of Confidential Computing Geometric Problems

In this information times,the rapidly developing internet has been popularized among all industries,and has burst in all aspects of human life.Network is a vast treasure of information,which brings huge benefits to human society.However,network also easily results in information leaking,and thus severly challenges the information security.Cryptography,as a cornerstone of information security,can be used to guarantee the confidentiality,integrality and authentication of information,and therefore to preserve the privacy of private data.Secure multiparty computation(SMC)is presently a research focus in the international cryptographic community and a key technology of privacy preserving and information security in cyberspace.Using SMC,two or more parties can perform cooperative computations that have social,economic,or scientific significance on their private data without leaking them to mine the value of private data.Secure multiparty computational geometry is an important branch of SMC.Privately determining the similarity between two graphics is a completely new secure multiparty computation problem,which has important theoretical value and broad application prospects in information security.This paper studies three practical privacy-preserving problems arising from graphics similar and SMC.The main contents and contributions of this study are as follows.1.This paper is used separately a simple solution and paillier's additively homomorphic encryption for the problem of the intersection of two straight lines secure multi-party computation,this study first presents two new schemes to improve the efficiency and the communication complexity of the existing protocols.Then,on the basis of the protocol 3,we propose a protocol to privately determine the relationship between a line and a plane.Using the simulation paradigm,we prove that all protocols proposed in this study are secure.Finally,We analyze the computational complexity and communication complexity.2.Based on symmetric encryption technique,we first present a protocol to determine whether two numbers are equal.Then we propose a protocol to privately determine whether two matrices are equal.Finally,we design two protocols to privately determine whether two special graphics are isomorphic and two graphics are similar.Based on privately determine whether two graphics are similar,we design a protocol to privately determine whether two arbitrary convex graphics are similar.Owing to using the symmetric encryption algorithm,these protocols are all very efficient.We prove that these protocols are secure in the semi-honest model using the simulation paradigm and analyze their computational complexities and applications.