STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
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
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
The round complexity of secure protocols
The round complexity of secure protocols
A study of several specific secure two-party computation problems
A study of several specific secure two-party computation problems
Cryptography and cryptographic protocols
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Private Information: To Reveal or not to Reveal
ACM Transactions on Information and System Security (TISSEC)
PBS: Private Bartering Systems
Financial Cryptography and Data Security
Security analysis of the Louis protocol for location privacy
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Small, stupid, and scalable: secure computing with faerieplay
Proceedings of the fifth ACM workshop on Scalable trusted computing
Privacy in mobile computing for location-sharing-based services
PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
Point-based trust: define how much privacy is worth
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Anonymous user tracking for location-based community services
LoCA'06 Proceedings of the Second international conference on Location- and Context-Awareness
Achieving fairness in private contract negotiation
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Efficient correlated action selection
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
A spatial cloaking framework based on range search for nearest neighbor search
DPM'09/SETOP'09 Proceedings of the 4th international workshop, and Second international conference on Data Privacy Management and Autonomous Spontaneous Security
Participatory personal data: An emerging research challenge for the information sciences
Journal of the American Society for Information Science and Technology
| Hi-index | 0.00 |
The number of location-aware mobile devices has been rising for several years. As this trend continues, these devices may be able to use their location information to provide interesting applications for their owners. Possible applications for such devices include: i) planning a route that brings the owner near a coffee shop or ii) a route that would allow the owner to intersect one of their friends' own route. The difficulty with such computations is that the owners of the devices will not want their devices to be sending their location (or future locations) to some random server to compute the functions. In this paper, we look at computing distance functions of routes in a private manner; we propose using Secure Multi-party Computation (SMC) techniques to solve these computational geometry problems. In this paper we propose protocols for three such problems: i) the distance between a point and a line segment, ii) the distance between two moving points each defined by a parametric equation (with constant velocity), and iii) the distance between two line segments.