Privacy-preserving collision detection of two circles
Article No.: 73, Pages 1 - 7
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.
References
[1]
A. C. Yao, Protocols For Secure Computations, In proceedings of the 23rd Annual IEEE symposium on Foundations of Computer Science, 1982, pp. 160--164.
[2]
Bart Goethals, Sven Laur, Helger Lipmaa and Taneli Mielikäinen. On Private Scalar Product Computation for Privacy-Preserving Data Mining, Available From http://www.adrem.ua.ac.be/~goethals/publications/sspfordm.pdf.
[3]
C. Cachin, Efficient Private Bidding and Auctions with an Oblivious Third Party, In Proceedings of the 6th ACM Conference on Computer and Communications Security, pp. 120--127, 1999.
[4]
C. Clifton, M. Kantarcioglu, et al, Tools for Privacy Preserving Distributed Data Mining, In SIGKDD Explorations, 4(2): 28--34 December 2002.
[5]
I. Ioannidis, A. Grama and M. Atallah, A Secure Protocol for Computing Dot-Products in Clustered and Distributed Environments, In The 2002 International Conference on Parallel Processing, Vancouver, British Columbia, Aug. 18--21 2002.
[6]
Ioannis Ioannidis and Ananth Grama, An Efficient Protocol for Yao's Millionaires' Problem, In Proceedings of the 36th Hawaii International Conference on System Sciences (HICSS'03), 2003.
[7]
J. Vaidya and C. Clifton, Privacy Preserving Association Rule Mining in Vertically Partitioned Data, In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 23--26 2002.
[8]
Mikhail J. Atallah and Wenliang Du, Secure Multi-Party Computational Geometry, In Lecture Notes in Computer Science, 2125, Springer Verlag. Proceedings of 7th International Workshop on Algorithms and Data Structures (WADS 2001), August, 8--10, 2001, Providence, Rhode Island, USA. pp. 165--179.
[9]
O. Goldreich, Secure multi-party computation (working draft), Available from http://www.wisdom.weizmann.ac.il/~oded/PS/prot.ps, 1998
[10]
S. Goldwasser, Multi-party Computatoin: Past and Present, In Proceedings of the 16th annual ACM symposium on Principles of distributed computing, Santa Barbara, CA USA, August 21--24 1997.
[11]
Wenliang Du and Zhijun Zhan, A practical Approach to Solve Secure Multi-party Computation Problems, In Proceedings of New Security Paradigms Workshop, 2002.
Index Terms
- Privacy-preserving collision detection of two circles
Recommendations
A Privacy Preserving Protocol for Generation the Common Tangent of Two Circles
IHMSC '14: Proceedings of the 2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics - Volume 01Special secure multi-party computation is a hot topic in recent years' research. Privacy preserving path planning is that how to do path planning without leakage of privacy information. It has a very broad application prospects, but there is little ...
A privacy framework: indistinguishable privacy
EDBT '13: Proceedings of the Joint EDBT/ICDT 2013 WorkshopsIn this paper we illustrate a privacy framework named Indistinguishable Privacy. Indistinguishable privacy could be deemed as the formalization of the existing privacy definitions in privacy preserving data publishing as well as secure multi-party ...
Privacy-preserving point-inclusion protocol for an arbitrary area based on phase-encoded quantum private query
The point-inclusion problem is an important secure multi-party computation that it involves two parties, where one has a private point and the other has a private area, and they want to determine whether the point is inside the area without revealing ...
Comments
Information & Contributors
Information
Published In
June 2007
440 pages
ISBN:9781595937575
- Conference Chairs:
- Jianzhong Li,
- Wang-Chien Lee,
- Fabrizio Silvestri
Sponsors
Publisher
ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)
Brussels, Belgium
Publication History
Published: 06 June 2007
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Overall Acceptance Rate 33 of 91 submissions, 36%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 128Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in