STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficient private bidding and auctions with an oblivious third party
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Secure multi-party computation problems and their applications: a review and open problems
Proceedings of the 2001 workshop on New security paradigms
Secure Multi-party Computational Geometry
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Building decision tree classifier on private data
CRPIT '14 Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14
A Scheme for Testing Privacy State in Pervasive Sensor Networks
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2
A secure multidimensional point inclusion protocol
Proceedings of the 9th workshop on Multimedia & security
A new efficient privacy-preserving scalar product protocol
AusDM '07 Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Towards Empirical Aspects of Secure Scalar Product
ISA '08 Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008)
Efficient Secure Protocols to Determine Whether a Point is inside a Convex Hull
IEEC '09 Proceedings of the 2009 International Symposium on Information Engineering and Electronic Commerce
An efficient solution to the millionaires' problem based on homomorphic encryption
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
Privacy Preserving Computation Geometry is an important direction in the application of Secure Multi-party Computation and contains many research subjects, such as intersection problem, point-inclusion problem, convex hull, rang searching and so on. Particularly, point-inclusion problem is of great practical significance in our daily life. In this paper, we will devote our attention to the point-segment position problem in point-inclusion and aim to determine the relationship of a point and a segment. In our solution, we present a concise secure protocol based on two basic protocols, secure scalar product protocol and secure comparison protocol. Compared with precious solutions, which may disclose at least one inside point, our protocol performs better in terms of preserving privacy. It will not reveal any inside point, which is crucially significant in some special occasion.