Research Article
Privacy-preserving collision detection of two circles
@INPROCEEDINGS{10.4108/infoscale.2007.86, author={XU Wei-jiang and HUANG Liu-sheng and JING Wei-wei and YAO Yi-fei }, title={Privacy-preserving collision detection of two circles}, proceedings={2nd International ICST Conference on Scalable Information Systems}, publisher={ACM}, proceedings_a={INFOSCALE}, year={2010}, month={5}, keywords={Privacy-Preserving Collision Detection Secure Multi-party Computation}, doi={10.4108/infoscale.2007.86} }- XU Wei-jiang
HUANG Liu-sheng
JING Wei-wei
YAO Yi-fei
Year: 2010
Privacy-preserving collision detection of two circles
INFOSCALE
ICST
DOI: 10.4108/infoscale.2007.86
Abstract
The proliferation of the network has opened up great opportunities for cooperative computation. But privacy concerns often prevent different parties from sharing their data in order to do cooperative computation tasks. Secure multi-party computation deals with the privacy concern in cooperative computation while ensuring correctness of the computation and that no more information is revealed to a participant in the computation than can be inferred from that participant's input and output [10]. This paper addresses the problem of privacy preserving collision detection of two circles for the first time, which is an important problem in privacy preserving computational geometry. Four protocols are presented in this paper to solve the problem, and their correctness and security are also analyzed. The experimental results illustrate that our method for detecting collision of two moving circles is very effective.
