Skip to main content

Privacy-Preserving Ridesharing Recommendation in Geosocial Networks

  • Conference paper
  • First Online:
Computational Social Networks (CSoNet 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9795))

Included in the following conference series:

Abstract

Geosocial networks have received a lot of attentions recently and enabled many promising applications, especially the on-demand transportation services that are increasingly embraced by millions of mobile users. Despite the well understood benefits, such services also raise unique security and privacy issues that are currently not very well investigated. In this paper, we focus on the trending ridesharing recommendation service in geosocial networks, and propose a new privacy-preserving framework with salient features to both users and recommendation service providers. In particular, the proposed framework is able to recommend whether and where the users should wait to rideshare in given geosocial networks, while preserving user privacy. Meanwhile, it also protects the proprietary data of recommendation service providers from any unauthorised access, such as data breach incidents. These privacy-preserving features make the proposed framework especially suitable when the recommendation service backend is to be outsourced at public cloud for improved service scalability. On the technical front, we first use kernel density estimation to model destination distributions of taxi trips for each cluster of the underlying road network, denoted as cluster arrival patterns. Then we utilize searchable encryption to carefully protect all the proprietary data so as to allow authorised users to retrieve encrypted patterns with secure requests. Given retrieved patterns, the user can safely compute the potential of ridesharing by investigating the probabilities of possible destinations from ridesharing requirements. Experimental results show both the effectiveness of the proposed recommendation algorithm comparing to the naive “wait-at-where-you-are” strategy, and the efficiency of the utilized privacy-preserving techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Instead of transforming the original pick-up time \(t_i\) into discrete values between 1 and 48 [6], we transform \(t_i\) to continuous values to keep more details about the time domain. Please refer to the experiment section for more details.

  2. 2.

    All roads in \(C_i\) share the same kernel density estimator and thus the same \(P({\mathbf {x}_{new_k}})\).

  3. 3.

    Departure probabilities are ordered according to road ids in ascending order. Suppose in \(Pattern_1\) of cluster \(c_1\) there are three probabilities 0.3, 0, 0.7 and \(c_1\) \(=\) {\(r_1\), \(r_3\), \(r_4\)}. We get p(\(A_{r_1}\)\(=\) 0.3, p(\(A_{r_3}\)\(=\) 0 and p(\(A_{r_4}\)\(=\) 0.7.

  4. 4.

    We manage address with indirect addressing [5] to provide efficient storage and access of sparse tables.

  5. 5.

    https://github.com/fivethirtyeight/uber-tlc-foil-response. Destinations are generated based on a check-in dataset of Foursquare from http://download.csdn.net.

  6. 6.

    We didn’t study precision and recall of WW since users wait at where they are.

References

  1. Bao, J., Zheng, Y., Mokbel, M.F.: Location-based and preference-aware recommendation using sparse geo-social networking data. In: SIGSPATIAL, pp. 199–208 (2012)

    Google Scholar 

  2. Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Bost, R., Popa, R.A., Tu, S., Goldwasser, S.: Machine learning classification over encrypted data. In: NDSS (2015)

    Google Scholar 

  4. Cui, H., Yuan, X., Wang, C.: Harnessing encrypted data in cloud for secure and efficient image sharing from mobile devices. In: INFOCOM, pp. 2659–2667 (2015)

    Google Scholar 

  5. Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: CCS, pp. 79–88 (2006)

    Google Scholar 

  6. Dai, C.: Ridesharing recommendation: whether and where should i wait? In: Cui, B., Zhang, N., Xu, J., Lian, X., Liu, D. (eds.) WAIM 2016. LNCS, vol. 9658, pp. 151–163. Springer, Heidelberg (2016). doi:10.1007/978-3-319-39937-9_12

    Chapter  Google Scholar 

  7. Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM 43(3), 431–473 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: CCS, pp. 965–976 (2012)

    Google Scholar 

  9. Ma, S., Wolfson, O.: Analysis and evaluation of the slugging form of ridesharing. In: SIGSPATIAL, pp. 64–73 (2013)

    Google Scholar 

  10. Ma, S., Zheng, Y., Wolfson, O.: Real-time city-scale taxi ridesharing. IEEE Trans. Knowl. Data Eng. 27(7), 1782–1795 (2015)

    Article  Google Scholar 

  11. Narayanan, A., Thiagarajan, N., Lakhani, M., Hamburg, M., Boneh, D.: Location privacy via private proximity testing. In: NDSS (2011)

    Google Scholar 

  12. Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB, pp. 802–813 (2003)

    Google Scholar 

  13. Silverman, B.W.: Density Estimation for Statistics and Data Analysis, vol. 26. CRC Press, Boca Raton (1986)

    Book  MATH  Google Scholar 

  14. Toubiana, V., Narayanan, A., Boneh, D., Nissenbaum, H., Barocas, S.: Adnostic: privacy preserving targeted advertising. In: NDSS (2010)

    Google Scholar 

  15. Wang, C., Ren, K., Yu, S., Urs, K.M.R.: Achieving usable and privacy-assured similarity search over outsourced cloud data. In: INFOCOM, pp. 451–459 (2012)

    Google Scholar 

  16. Wang, R., Chow, C., Lyu, Y., Lee, V.C.S., Kwong, S., Li, Y., Zeng, J.: TaxiRec: recommending road clusters to taxi drivers using ranking-based extreme learning machines. In: SIGSPATIAL, pp. 53:1–53:4 (2015)

    Google Scholar 

  17. Yuan, X., Cui, H., Wang, X., Wang, C.: Enabling privacy-assured similarity retrieval over millions of encrypted records. In: Pernul, G., Y A Ryan, P., Weippl, E. (eds.) ESORICS. LNCS, vol. 9327, pp. 40–60. Springer, Heidelberg (2015). doi:10.1007/978-3-319-24177-7_3

    Chapter  Google Scholar 

  18. Yuan, X., Wang, X., Wang, C., Squicciarini, A.C., Ren, K.: Enabling privacy-preserving image-centric social discovery. In: ICDCS, pp. 198–207 (2014)

    Google Scholar 

Download references

Acknowledgement

This work was supported in part by the Research Grants Council of Hong Kong (Project No. CityU 138513), and the Natural Science Foundation of China (Project No. 61572412).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cong Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Dai, C., Yuan, X., Wang, C. (2016). Privacy-Preserving Ridesharing Recommendation in Geosocial Networks. In: Nguyen, H., Snasel, V. (eds) Computational Social Networks. CSoNet 2016. Lecture Notes in Computer Science(), vol 9795. Springer, Cham. https://doi.org/10.1007/978-3-319-42345-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42345-6_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42344-9

  • Online ISBN: 978-3-319-42345-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics