On privacy preserving convex hull

Proceedings - International Conference on Availability, Reliability and Security, ARES 2009

Volumn , Issue , 2009, Pages 187-192

  Hans, Sandeep ^a   Addepalli, Sarat C ^a   Gupta, Anuj ^a   Srinathan, Kannan ^a  

^a INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

Convex hull; Privacy preserving computational geometry; Secure multiparty computation

Indexed keywords

CONVEX HULL; NEW SOLUTIONS; PRIVACY PRESERVING; PRIVACY PRESERVING COMPUTATIONAL GEOMETRY; SECURE COMPUTATION; SECURE MULTIPARTY COMPUTATION; TWO-PARTY PROTOCOLS;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CRYPTOGRAPHY; SET THEORY;

COMPUTATIONAL GEOMETRY;

EID: 70349694737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARES.2009.159     Document Type: Conference Paper

References (22)

1. A. C.-C. Yao, "Protocols for Secure Computations," in Proceedings of 23rd IEEE Symposium on the Foundations of Computer Science (FOCS). IEEE Press, 1982, pp. 160-164.
2. O. Goldreich, S. Micali, and A. Wigderson, "How to Play any Mental Game," in Proceedings of the 19th Symposium on Theory of Computing (STOC). ACM Press, 1987, pp. 218-229.
3. D. Beaver and S. Goldwasser, "Multiparty computation with faulty majority," in CRYPTO '89: Proceedings on Advances in cryptology. New York, NY, USA: Springer-Verlag New York, Inc., 1989, pp. 589-590.
4. O. Goldriech, S. Goldwasser, and N. Linial, "FaultTolerant Computation in the Full Information Model," in Proceedings of 32nd IEEE Symposium on Foundations of Computer Science (FOCS), 1991, pp. 447-457.
5. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness Theorems for Non-cryptographic Faulttolerant Distributed Computation," in Proceedings of the 20th Symposium on Theory of Computing (STOC). ACM Press, 1988, pp. 1-10.
6. M. Hirt and U. Maurer, "Complete Characterization of Adversaries Tolerable in Secure Multi-party Computation," in Proceedings of the 16th Symposium on Principles of Distributed Computing (PODC). ACM Press, August 1997, pp. 25-34.
7. R. Cramer, I. Damgard, S. Dziembowski, M. Hirt, and T. Rabin, "Efficient Multi-party Computations Secure Against an Adaptive Adversary," in Proceedings of Advances in Crytology-EUROCRYPT '99, ser. Lecture Notes in Computer Science (LNCS), vol. 1592, 1999, pp. 311-326.
8. M. Hirt and U. Maurer, "Player simulation and general adversary structures in perfect multiparty computation," Journal of Cryptology, vol. 13, pp. 31-60, 2000.
9. R. Agrawal and R. Srikant, "Privacy-preserving data mining," SIGMOD Rec., vol. 29, no. 2, pp. 439-450, 2000.
10. J. Brickell and V. Shmatikov, "Privacy-preserving graph algorithms in the semi-honest model," in ASIACRYPT, 2005, pp. 236-252.
11. W. Du and M. J. Atallah, "Privacy-preserving cooperative scientific computations," in In 14th IEEE Computer Security Foundations Workshop, 2001, pp. 273-282.
12. K. B. Frikken, "Privacy-preserving set union," in ACNS, 2007, pp. 237-252.
13. K. B. Frikken and M. J. Atallah, "Privacy preserving electronic surveillance," in WPES '03: Proceedings of the 2003 ACM workshop on Privacy in the electronic society. New York, NY, USA: ACM, 2003, pp. 45-52.
14. W. Du and M. J. Atallah, "Privacy-preserving cooperative statistical analysis," in In Proceedings of the 17th Annual Computer Security Applications Conference, 2001, pp. 102-110.
15. A. S. Das, J. K. Keshri, K. Srinathan, and V. Srivastava, "Privacy preserving shortest path computation in presence of convex polygonal obstacles," in ARES '08: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security. Washington, DC, USA: IEEE Computer Society, 2008, pp. 446-451.
16. W. Du and M. J. Atallah, "Secure multi-party computation problems and their applications: A review and open problems," in In New Security Paradigms Workshop, 2001, pp. 11-20.
17. T. Thomas, "Secure two-party protocols for point inclusion problem," CoRR, vol. abs/0705.4185, 2007.
18. D. R. Chand and S. S. Kapur, "An algorithm for convex polytopes," J. ACM, vol. 17, no. 1, pp. 78-86, 1970.
19. R. Jarvis, "On the identification of the convex hull of a finite set of points in the plane," IPL, vol. 2, pp. 18-21, 1973.
20. R. L. Graham, "An efficient algorithm for determining the convex hull of a finite planar set," Inf. Process. Lett., vol. 1, no. 4, pp. 132-133, 1972.
21. T. M. Chan, "Optimal output-sensitive convex hull algorithms in two and three dimensions," Discrete & Computational Geometry, vol. 16, pp. 361-368, 1996.
22. Q. Wang, Y. Luo, and L. Huang, "Privacy-preserving protocols for finding the convex hulls," in ARES, 2008, pp. 727-732.