E±cient Secure Multiparty ComputationalGeometry
-
Graphical Abstract
-
Abstract
Secure multiparty computational geome-
try is an important ¯eld of Secure multiparty computation
(SMC). We ¯rst present an SMC protocol for comput-
ing the area of a triangle using symmetric cryptographic
method, which is of independent interest in SMC, then use
it to solve the point inclusion problem of convex polygon,
and further solve the inclusion problem of concave polygon.
Compared with existing solutions, these new protocols are
much more e±cient. It is proved, by well accepted sim-
ulation paradigm, that all the protocols proposed in this
paper are secure.
-
-