E±cient Secure Multiparty ComputationalGeometry

LI Shundong; WANG Daoshun and DAI Yiqi

Article Contents

Article Navigation > Chinese Journal of Electronics > 2010 > 19(2): 324-328

LI Shundong and WANG Daoshun and DAI Yiqi, “E±cient Secure Multiparty ComputationalGeometry,” Chinese Journal of Electronics, vol. 19, no. 2, pp. 324-328, 2010,

Citation:

LI Shundong and WANG Daoshun and DAI Yiqi, “E±cient Secure Multiparty ComputationalGeometry,” Chinese Journal of Electronics, vol. 19, no. 2, pp. 324-328, 2010,

LI Shundong and WANG Daoshun and DAI Yiqi, “E±cient Secure Multiparty ComputationalGeometry,” Chinese Journal of Electronics, vol. 19, no. 2, pp. 324-328, 2010,

Citation:

LI Shundong and WANG Daoshun and DAI Yiqi, “E±cient Secure Multiparty ComputationalGeometry,” Chinese Journal of Electronics, vol. 19, no. 2, pp. 324-328, 2010,

PDF( 324 KB)

E±cient Secure Multiparty ComputationalGeometry

Received Date: 1900-01-01
Rev Recd Date: 1900-01-01
Publish Date: 2010-04-05

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.
- Cryptography,
- Secure multiparty com-putation,
- Triangle,
- Point inclusion,
- Protocol.