STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Comparing information without leaking it
Communications of the ACM
Multi party computations: past and present
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Efficient private bidding and auctions with an oblivious third party
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Secure multi-party computation problems and their applications: a review and open problems
Proceedings of the 2001 workshop on New security paradigms
Secure Computation without Agreement
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Privacy-Preserving Cooperative Scientific Computations
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters
IEEE Transactions on Computers
Information Sciences: an International Journal
Preservation of Privacy in Thwarting the Ballot Stuffing Scheme
TrustBus '08 Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business
Secure two-party point-circle inclusion problem
Journal of Computer Science and Technology
Security analysis of the Louis protocol for location privacy
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Privacy-preserving data-oblivious geometric algorithms for geographic data
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Privacy in mobile computing for location-sharing-based services
PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
Research on secure multi-party computational geometry
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Protocol to compute polygon intersection in STC model
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
| Hi-index | 0.00 |
Secure Multi-party Computation has been a research focus in international cryptographic community in recent years. In this paper the authors investigate how some computational geometric problems could be solved in a cooperative environment, where two parties need to solve a geometric problem based on their joint data, but neither wants to disclose its private data to the other party. These problems are the distance between two private points, the relation between a private point and a circle area, the relation between a private point and an ellipse area and the shortest distance between two point sets. The paper gives solutions to these specific geometric problems, and in doing so a building block is developed, the protocol for the distance between two private points, that is also useful in the solutions to other geometric problems and combinatorial problems.