Privacy-Preserving Shortest Path Computation

23rd Annual Network and Distributed System Security Symposium, NDSS 2016

Volumn , Issue , 2016, Pages

  Wu, David J ^a   Zimmerman, Joe ^a   Planul, Jérémy ^a   Mitchell, John C ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOCATION BASED SERVICES; PRIVACY-PRESERVING TECHNIQUES;

CLOUD COMPUTING SERVICES; CLOUD SERVICE PROVIDERS; CLOUD-BASED; CRYPTOGRAPHIC PROTOCOLS; FASTEST ROUTE; LEARN+; PRIVACY PRESERVING; SHORTEST PATH COMPUTATIONS; STREET MAPS;

NAVIGATION SYSTEMS;

EID: 85180750328     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.14722/ndss.2016.23052     Document Type: Conference Paper

References (64)

1. J. Angwin and J. Valentino-Devries, “Apple, Google collect user data,” The Wall Street Journal, 2011.
2. B. Applebaum, Y. Ishai, and E. Kushilevitz, “How to garble arithmetic circuits,” SIAM J. Comput., vol. 43, no. 2, pp. 905-929, 2014.
3. D. Ascher, P. F. Dubois, K. Hinsen, J. Hugunin, and T. Oliphant, “Numerical python,” Lawrence Livermore National Laboratory, Tech. Rep., 2001.
4. M. Bellare, V. T. Hoang, S. Keelveedhi, and P. Rogaway, “Efficient garbling from a fixed-key blockcipher,” in IEEE Symposium on Security and Privacy, 2013, pp. 478-492.
5. M. Bellare, V. T. Hoang, and P. Rogaway, “Foundations of garbled circuits,” Cryptology ePrint Archive, Report 2012/265, 2012, http: //eprint.iacr.org/.
6. D. K. Blandford, G. E. Blelloch, and I. A. Kash, “Compact representations of separable graphs,” in SODA, 2003, pp. 679-688. [Online]. Available: http://dl.acm.org/citation.cfm?id=644108.644219
7. D. K. Blandford, G. E. Blelloch, and I. A. Kash, “An experimental analysis of a compact graph representation,” in Workshop on Analytic Algorithmics and Combinatorics, 2004, pp. 49-61.
8. M. Blanton, A. Steele, and M. Aliasgari, “Data-oblivious graph algorithms for secure computation and outsourcing,” in ASIA CCS, 2013, pp. 207-218.
9. J. Bos, C. Costello, P. Longa, and M. Naehrig, “Specification of curve selection and supported curve parameters in MSR ECCLib,” Microsoft Research, Tech. Rep. MSR-TR-2014-92, June 2014.
10. J. Brickell and V. Shmatikov, “Privacy-preserving graph algorithms in the semi-honest model,” in ASIACRYPT, 2005, pp. 236-252.
11. R. H. Byrd, P. Lu, J. Nocedal, and C. Zhu, “A limited memory algorithm for bound constrained optimization,” SIAM J. Comput., vol. 16, no. 5, pp. 1190-1208, 1995.
12. C. Cachin, S. Micali, and M. Stadler, “Computationally private information retrieval with polylogarithmic communication,” in EUROCRYPT, 1999, pp. 402-414.
13. R. Canetti, “Security and composition of cryptographic protocols: a tutorial (part I),” SIGACT News, vol. 37, no. 3, pp. 67-92, 2006.
14. H. Carter, C. Lever, and P. Traynor, “Whitewash: outsourcing garbled circuit generation for mobile devices,” in ACSAC, 2014, pp. 266-275.
15. H. Carter, B. Mood, P. Traynor, and K. R. B. Butler, “Secure outsourced garbled circuit evaluation for mobile devices,” in USENIX, 2013, pp. 289-304.
16. Y. Chang, “Single database private information retrieval with logarithmic communication,” in ACISP, 2004, pp. 50-61.
17. J. Cheng, “How Apple tracks your location without consent, and why it matters,” Ars Technica, 2011.
18. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, “Private information retrieval,” in FOCS, 1995, pp. 41-50.
19. E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, no. 1, pp. 269-271, 1959.
20. M. Duckham and L. Kulik, “A formal model of obfuscation and negotiation for location privacy,” in PERVASIVE, 2005, pp. 152-170.
21. A. Fiat and A. Shamir, “How to prove yourself: Practical solutions to identification and signature problems,” in CRYPTO, 1986, pp. 186-194.
22. K. B. Frikken and P. Golle, “Private social network analysis: how to assemble pieces of a graph privately,” in WPES, 2006, pp. 89-98.
23. C. Gentry and Z. Ramzan, “Single-database private information retrieval with constant communication rate,” in ICALP, 2005, pp. 803-815.
24. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, “Protecting data privacy in private information retrieval schemes,” J. Comput. Syst. Sci., vol. 60, no. 3, pp. 592-629, 2000.
25. O. Goldreich, S. Goldwasser, and S. Micali, “How to construct random functions,” J. ACM, vol. 33, no. 4, pp. 792-807, 1986.
26. O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game or A completeness theorem for protocols with honest majority,” in STOC, 1987, pp. 218-229.
27. O. Goldreich and R. Ostrovsky, “Software protection and simulation on oblivious RAMs,” J. ACM, vol. 43, no. 3, pp. 431-473, 1996.
28. T. Granlund and the GMP development team, GNU MP: The GNU Multiple Precision Arithmetic Library, 5th ed., 2012, http://gmplib.org/.
29. C. Hazay and Y. Lindell, Efficient Secure Two-Party Protocols - Techniques and Constructions, ser. Information Security and Cryptography. Springer, 2010.
30. X. He, M. Kao, and H. Lu, “A fast general methodology for informationtheoretically optimal encodings of graphs,” SIAM J. Comput., vol. 30, no. 3, pp. 838-846, 2000.
31. Y. Ishai, J. Katz, E. Kushilevitz, Y. Lindell, and E. Petrank, “On achieving the “best of both worlds” in secure multiparty computation,” SIAM J. Comput., vol. 40, no. 1, pp. 122-141, 2011.
32. M. Keller and P. Scholl, “Efficient, oblivious data structures for MPC,” in ASIACRYPT, 2014, pp. 506-525.
33. V. Kolesnikov, A.-R. Sadeghi, and T. Schneider, “Improved garbled circuit building blocks and applications to auctions and computing minima,” Cryptology ePrint Archive, Report 2009/411, 2009, http: //eprint.iacr.org/.
34. V. Kolesnikov and T. Schneider, “Improved garbled circuit: Free XOR gates and applications,” in ICALP, 2008, pp. 486-498.
35. H. W. Kuhn and B. Yaw, “The Hungarian method for the assignment problem,” Naval Res. Logist. Quart, pp. 83-97, 1955.
36. E. Kushilevitz and R. Ostrovsky, “Replication is NOT needed: SINGLE database, computationally-private information retrieval,” in FOCS, 1997, pp. 364-373.
37. K. C. K. Lee, W. Lee, H. V. Leong, and B. Zheng, “Navigational path privacy protection: navigational path privacy protection,” in CIKM, 2009, pp. 691-700.
38. Y. Lindell and B. Pinkas, “A proof of security of Yao’s protocol for two-party computation,” J. Cryptology, vol. 22, no. 2, pp. 161-188, 2009.
39. H. Lipmaa, “An oblivious transfer protocol with log-squared communication,” in ISC, 2005, pp. 314-328.
40. R. J. Lipton and R. E. Tarjan, “A separator theorem for planar graphs,” SIAM J. Appl. Math, no. 2, pp. 177-189, 1979.
41. C. Liu, X. S. Wang, K. Nayak, Y. Huang, and E. Shi, “ObliVM: A programming framework for secure computation,” in IEEE Symposium on Security and Privacy, 2015.
42. C. A. Melchor, J. Barrier, L. Fousse, and M. Killijian, “Xpire: Private information retrieval for everyone,” IACR Cryptology ePrint Archive, vol. 2014, p. 1025, 2014. [Online]. Available: http: //eprint.iacr.org/2014/1025
43. X. Meng, S. Kamara, K. Nissim, and G. Kollios, “GRECS: graph encryption for approximate shortest distance queries,” IACR Cryptology ePrint Archive, vol. 2015, p. 266, 2015. [Online]. Available: http://eprint.iacr.org/2015/266
44. K. Mouratidis, “Strong location privacy: A case study on shortest path queries,” in ICDE, 2013, pp. 136-143.
45. K. Mouratidis and M. L. Yiu, “Shortest path computation with no information leakage,” PVLDB, vol. 5, no. 8, pp. 692-703, 2012.
46. M. Naor and B. Pinkas, “Oblivious transfer and polynomial evaluation,” in STOC, 1999, pp. 245-254.
47. M. Naor and B. Pinkas, “Efficient oblivious transfer protocols,” in SODA, 2001, pp. 448- 457.
48. M. Naor and B. Pinkas, “Computationally secure oblivious transfer,” J. Cryptology, vol. 18, no. 1, pp. 1-35, 2005.
49. OpenStreetMap Contributors, “OpenStreetMap,” http://www. openstreetmap.org/.
50. R. Ostrovsky and W. E. S. III, “A survey of single-database private information retrieval: Techniques and applications,” in Public Key Cryptography, 2007, pp. 393-411.
51. P. Paillier, “Public-key cryptosystems based on composite degree residuosity classes,” in EUROCRYPT, 1999, pp. 223-238.
52. B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams, “Secure twoparty computation is practical,” in ASIACRYPT, 2009, pp. 250-267.
53. M. O. Rabin, “How to exchange secrets with oblivious transfer,” IACR Cryptology ePrint Archive, vol. 2005, p. 187, 2005.
54. L. Rosasco, E. D. Vito, A. Caponnetto, M. Piana, and A. Verri, “Are loss functions all the same?" Neural Computation, vol. 16, no. 5, pp. 1063-107, 2004.
55. C.-P. Schnorr, “Efficient identification and signatures for smart cards,” in CRYPTO, 1989, pp. 239-252.
56. V. Shoup, “NTL: A library for doing number theory,” http://www.shoup. net/ntl/.
57. C. Stachniss, “C implementation of the Hungarian method,” http: //www2.informatik.uni-freiburg.de/_stachnis/misc.html, 2004.
58. E. Stefanov, M. van Dijk, E. Shi, C. W. Fletcher, L. Ren, X. Yu, and S. Devadas, “Path ORAM: an extremely simple oblivious RAM protocol,” in CCS, 2013, pp. 299-310.
59. The OpenSSL Project, “OpenSSL: The open source toolkit for SSL/TLS,” April 2003, www.openssl.org.
60. M. Thorup and U. Zwick, “Approximate distance oracles,” in STOC, 2001, pp. 183-192. [Online]. Available: http://doi.acm.org/10.1145/ 380752.380798
61. X. S. Wang, K. Nayak, C. Liu, T. H. Chan, E. Shi, E. Stefanov, and Y. Huang, “Oblivious data structures,” in CCS, 2014, pp. 215-226.
62. Y. Xi, L. Schwiebert, and W. Shi, “Privacy preserving shortest path routing with an application to navigation,” Pervasive and Mobile Computing, vol. 13, pp. 142-149, 2014.
63. A. C. Yao, “How to generate and exchange secrets (extended abstract),” in FOCS, 1986, pp. 162-167.
64. T. Zhang, “Solving large scale linear prediction problems using stochastic gradient descent algorithms,” in ICML, 2004.