Privacy preserving shortest path computation in presence of convex polygonal obstacles

ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings

Volumn , Issue , 2008, Pages 446-451

  Das, Ananda Swarup ^a   Keshri, Jitu Kumar ^a   Srinathan, Kannan ^a   Srivastava, Vaibhav ^a  

^a INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL CONFERENCES; PRIVACY PRESERVING; SHORTEST PATH; SHORTEST PATH COMPUTATIONS;

CANNING;

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

References (12)

1. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O. Computational Geometry: Algorithms and Applications. Second edn. Springer-Verlag (2000)
2. Joseph, O. Rourke. Computational Geometry in C, 2nd Edition Cambridge University Press
3. Atallah, M.J., Du, W. Secure multi-party computational geometry. In International Workshop on Algorithms and Data Structures, Springer-Verlag (2001) 165-179
4. O. Goldreich, S. Micali, A. Wigderson. How to play mental game. In Ninteenth ACM Symposium on Theory of Computing(STOC)
5. Wenliang Du A Study Of Several Specific Secure Two Party Computation Problems PhD Thesis, Submitted to Purdue University, August 2001
6. Goldreich, O. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press (2004)
7. Chang, Y.C. Single database private information retrieval with logarithmic communication. In ACISP. Volume 3108 of Lecture Notes in Computer Science. (2004) 50-61
8. Ronald Fagin, Moni Naor, Peter Winker Comparing Information without Leaking it. In Communications of the ACM, volume 39, 5 (1996) 77-85
9. Ibrahim, M.H. Two-party private vector dominance: The all-ornothing deal. In Third International Conference on Information Technology: New Generations (ITNG'06). (2006) 166-171
10. Yao, A. Protocols for secure computation. In IEEE Annual Symp. on Foundations of Computer Science (FOCS). (1982) 160-164
11. Brickell, J., Shmatikov, V. Privacy-preserving graph algorithms in the semi-honest model. In ASIACRYPT. Volume 3788 of Lecture Notes in Computer Science. (2005) 236-252
12. Paillier, P. Public Key Cryptosystem based on Composite Degree Residue Class In Eurocrypt. Volume 1592 of Lecture Notes in Computer Science. (1999) 223-238