Privacy-preserving data-oblivious geometric algorithms for geographic data

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2010, Pages 13-22

  Eppstein, David ^a   Goodrich, Michael T ^a   Tamassia, Roberto ^b  

^a Irvine   (United States)

^b Brown Univerity   (United States)

Author keywords

All nearest neighbors; Closest pairs; Compressed quadtrees; Convex hulls; Data oblivious algorithms; Secure multi party computations; Well separated pairs decomposition

Indexed keywords

ALL NEAREST NEIGHBORS; CLOSEST PAIRS; CONVEX HULL; OBLIVIOUS ALGORITHMS; QUAD TREES; SECURE MULTI-PARTY COMPUTATION;

ALGORITHMS; COMPUTATIONAL GEOMETRY; CRYPTOGRAPHY; INFORMATION SYSTEMS; NETWORK PROTOCOLS; NETWORK SECURITY;

GEOGRAPHIC INFORMATION SYSTEMS;

EID: 78650606457     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1869790.1869796     Document Type: Conference Paper

References (50)

1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka. A simple parallel tree contraction algorithm. J. Algorithms, 10:287-302, 1989.
2. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in c log n parallel steps. Combinatorica, 3:1-19, 1983.
3. R. Anderson and G. Miller. Deterministic parallel list ranking. In Proc. 3rd Aegean Workshop Computing, volume 319 of Lecture Notes Comput. Sci., pages 81-90. Springer-Verlag, 1988.
4. M. J. Atallah and W. Du. Secure multi-party computational geometry. In 7th Workshop on Algorithms and Data Structures, pages 165-179, 2001.
5. M. J. Atallah and M. T. Goodrich. Parallel algorithms for some functions of two convex polygons. Algorithmica, 3:535-548, 1988.
6. J. Basch, L. J. Guibas, and J. Hershberger. Data structures for mobile data. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pages 747-756, 1997.
7. A. Ben-David, N. Nisan, and B. Pinkas. FairplayMP: A system for secure multi-party computation. In CCS '08: Proceedings of the 15th ACM conference on Computer and communications security, pages 257-266, New York, NY, USA, 2008. ACM.
8. R. Benetis, S. Jensen, G. Karc̊iauskas, and S. S̊altenis. Nearest and reverse nearest neighbor queries for moving objects. The VLDB Journal, 15(3):229-249, 2006.
9. O. Berkman, B. Schieber, and U. Vishkin. Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. J. Algorithms, 14(3):344-370, 1993.
10. M. Bern, D. Eppstein, and S.-H. Teng. Parallel construction of quadtrees and quality triangulations. Internat. J. Comput. Geom. Appl., 9(6):517-532, 1999.
11. E. Bertino. Privacy-preserving techniques for location-based services. SIGSPATIAL Special, 1(2):2-3, 2009.
12. E. Bertino, B. Thuraisingham, M. Gertz, and M. L. Damiani. Security and privacy for geospatial data: concepts and research directions. In Proc. ACM Int. Workshop on Security and Privacy in GIS and LBS (SPRINGL), pages 6-19, 2008.
13. K. Buchin, M. Buchin, M. van Kreveld, and J. Luo. Finding long and similar parts of trajectories. In GIS '09: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 296-305, New York, NY, USA, 2009. ACM.
14. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42:67-90, 1995.
15. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally composable two-party and multi-party secure computation. In STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 494-503, New York, NY, USA, 2002. ACM.
16. T. M. Chan. Well-separated pair decomposition in linear time? Inf. Process. Lett., 107(5):138-141, 2008.
17. C.-Y. Chow and M. F. Mokbel. Privacy in location-based services: a system architecture perspective. SIGSPATIAL Special, 1(2):23-27, 2009.
18. R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal list ranking. Inform. Control, 1:153-174, 1986.
19. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.
20. W. Du and M. J. Atallah. Secure multi-party computation problems and their applications: a review and open problems. In 2001 Workshop on New Security Paradigms, pages 13-22, 2001.
21. W. Du and Z. Zhan. A practical approach to solve secure multi-party computation problems. In NSPW '02: Proceedings of the 2002 workshop on New security paradigms, pages 127-135, New York, NY, USA, 2002. ACM.
22. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.
23. J.-C. Freytag. Privacy in location-aware systems. SIGSPATIAL Special, 1(2):4-8, 2009.
24. W. M. Getz and C. Wilmers. A local nearest-neighbor convex-hull construction of home ranges and utilization distributions. Ecography, 27(4):489-505, 2004.
25. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious RAMs. J. ACM, 43(3):431-473, 1996.
26. M. T. Goodrich. Randomized Shellsort: A simple oblivious sorting algorithm. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1-16. SIAM, 2010.
27. S. Hans, S. C. Addepalli, A. Gupta, and K. Srinathan. On privacy preserving convex hull. In Int. Conf. on Availability, Reliability and Security, pages 187-192, Los Alamitos, CA, USA, 2009. IEEE Computer Society.
28. H. Hayashi, D. Ito, M. Tanizaki, K. Kimura, and H. Kajiyama. Dual-heap kNN: k-nearest neighbor search for spatial data retrieval in embedded DBMS. In GIS '08: Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, pages 1-10, New York, NY, USA, 2008. ACM.
29. A. Henrich, V. Lüdecke, and D. Blank. Approaches for determining the geographic footprint of arbitrary terms for retrieval and visualization. In GIS '08: Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, pages 1-4, New York, NY, USA, 2008. ACM.
30. L. Kulik. Privacy for real-time location-based services. SIGSPATIAL Special, 1(2):9-14, 2009.
31. D. Li, L. Huang, W. Yang, Y. Zhu, Y. Luo, Z. Chen, L. Li, and Y. Ye. A practical three-dimensional privacy-preserving approximate convex hulls protocol. In FCST '08: Proceedings of the 2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology, pages 17-23, Washington, DC, USA, 2008. IEEE Computer Society.
32. S.-D. Li and Y.-Q. Dai. Secure two-party computational geometry. Journal of Computer Science and Technology, 20(2):258-263, 2005.
33. D. Liu and M.-C. Lee. Analysis of wireless localization using non-line-of-sight radio signals. In GIS '09: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 412-415, New York, NY, USA, 2009. ACM.
34. L. Liu. Privacy and location anonymization in location-based services. SIGSPATIAL Special, 1(2):15-22, 2009.
35. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - a secure two-party computation system. In SSYM'04: Proceedings of the 13th conference on USENIX Security Symposium, pages 20-20, Berkeley, CA, USA, 2004. USENIX Association.
36. U. Maurer. Secure multi-party computation made simple. Discrete Appl. Math., 154(2):370-381, 2006.
37. G. L. Miller and J. H. Reif. Parallel tree contraction and its applications. In Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci., pages 478-489, 1985.
38. J. O'Rourke. Computational Geometry in C. Cambridge University Press, 2nd edition, 1998.
39. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Syst. Sci., 23:166-204, 1981.
40. K. Park, P. Valduriez, and H. Choo. Mobile continuous nearest neighbor queries on air. In GIS '08: Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, pages 1-4, New York, NY, USA, 2008. ACM.
41. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, Oct. 1990.
42. M. Reid-Miller, G. L. Miller, and F. Modugno. List ranking and parallel tree contraction. In J. H. Reif, editor, Synthesis of Parallel Algorithms, pages 115-194. Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1993.
43. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In SIGMOD '95: Proceedings of the 1995 ACM SIGMOD international conference on Management of data, pages 71-79, New York, NY, USA, 1995. ACM.
44. H. Samet. Spatial Data Structures: Quadtrees, Octrees, and Other Hierarchical Methods. Addison-Wesley, Reading, MA, 1989.
45. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.
46. I. Stojmenovic, A. P. Ruhil, and D. K. Lobiyal. Voronoi diagram and convex hull based geocasting and routing in wireless networks. Wirel. Commun. Mob. Comput., 6(2):247-258, 2006.
47. P. M. Vaidya. An O(n log n) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom., 4:101-115, 1989.
48. G. Wang, T. Luo, M. T. Goodrich, W. Du, and Z. Zhu. Bureaucratic protocols for secure two-party sorting, selection, and permuting. In 5th ACM Symposium on Information, Computer and Communications Security (ASIACCS), pages 226-237. ACM, 2010.
49. Q. Wang, Y. Luo, and L. Huang. Privacy-preserving protocols for finding the convex hulls. In ARES '08: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security, pages 727-732, Washington, DC, USA, 2008. IEEE Computer Society.
50. Q. Wang and Y. Zhang. A convex hull algorithm for planar point set based on privacy protecting. In Int. Workshop on Educ. Tech. and Comp. Sci., pages 434-437, 2009.