An Efficient Protocol for Privately Determining the Relationship between Two Rectangles

DOI

10.2991/cnci-19.2019.45How to use a DOI?

Keywords

Secure multi-party computation, computational geometry, the relation between two rectangles.

Abstract

Secure multiparty computation (smc) is a research focus in the international cryptographic community, while secure multiparty geometry computation is an important field of smc. In this paper, we study an important secure computational geometric problem, that is, to privately determine the location relation between two rectangles. The existing protocols for this problem are of low efficiency. To efficiently solve this problem, we use sorting technique to design a protocol for privately determining the location relation between two rectangles. Finally, we analyze the theoretical efficiency to show that our protocol is efficient.

Copyright

© 2019, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Wenli Wang
AU  - Xuhong Liu
PY  - 2019/05
DA  - 2019/05
TI  - An Efficient Protocol for Privately Determining the Relationship between Two Rectangles
BT  - Proceedings of the 2019 International Conference on Computer, Network, Communication and Information Systems (CNCI 2019)
PB  - Atlantis Press
SP  - 306
EP  - 310
SN  - 2352-538X
UR  - https://doi.org/10.2991/cnci-19.2019.45
DO  - 10.2991/cnci-19.2019.45
ID  - Wang2019/05
ER  -