{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:22:59Z","timestamp":1743067379109,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030688837"},{"type":"electronic","value":"9783030688844"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-68884-4_25","type":"book-chapter","created":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T23:29:09Z","timestamp":1612826949000},"page":"294-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Statistical Method of Space Distribution for Riding Based on R-Tree Under Differential Privacy"],"prefix":"10.1007","author":[{"given":"Yubing","family":"Qiu","sequence":"first","affiliation":[]},{"given":"Jianping","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Lan","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Zhenzhen","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yingjie","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,7]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The r*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, (ICMD 1990), pp. 322\u2013331. ACM Press (1990)","DOI":"10.1145\/93605.98741"},{"key":"25_CR2","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-tree: an index structure for high-dimensional data. In: Proceedings of 22th International Conference on Very Large Data Bases, (ICVLDB 1996), pp. 28\u201339 (1996)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Cao, Y., Yoshikawa, M.: Differentially private real-time data release over infinite trajectory streams. In: 2015 16th IEEE International Conference on Mobile Data Management, (MDM 2015), pp. 68\u201373. IEEE Computer Society (2015)","DOI":"10.1109\/MDM.2015.15"},{"key":"25_CR4","unstructured":"Chen, Z., Kan, X., Zhang, S., Chen, L., Xu, Y., Zhong, H.: Differentially private aggregated mobility data publication using moving characteristics. arXiv preprint arXiv:1908.03715 (2019)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Cormode, G., Procopiuc, C., Srivastava, D., Shen, E., Yu, T.: Differentially private spatial decompositions. In: IEEE 28th International Conference on Data Engineering, (ICDE 2012), pp. 20\u201331. IEEE Computer Society (2012)","DOI":"10.1109\/ICDE.2012.16"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486\u2013503. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_29"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, (ICMD 1984), pp. 1805\u20131817 (2017)","DOI":"10.1145\/602259.602266"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.14778\/1920841.1920970","volume":"3","author":"M Hay","year":"2010","unstructured":"Hay, M., Rastogi, V., Miklau, G., Suciu, D.: Boosting the accuracy of differentially private histograms through consistency. Proc. VLDB Endow. 3(1), 1021\u20131032 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Hua, J., Gao, Y., Zhong, S.: Differentially private publication of general time-serial trajectory data. In: 2015 IEEE Conference on Computer Communications, (INFOCOM 2015), Kowloon, Hong Kong, 26 April\u20131 May 2015, pp. 549\u2013557. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218422"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0164-1212(00)00078-9","volume":"3","author":"P Huang","year":"2001","unstructured":"Huang, P., Lin, P., Lin, H.: Optimizing storage utilization in r-tree dynamic index structure for spatial databases. J. Syst. Softw. 3, 291\u2013299 (2001)","journal-title":"J. Syst. Softw."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Mir, D.J., Isaacman, S., C\u00e1ceres, R., Martonosi, M., Wright, R.N.: DP-WHERE: differentially private modeling of human mobility. 2013 IEEE International Conference on Big Data. ICBD 2013, pp. 580\u2013588. IEEE Computer Society, IEEE (2013)","DOI":"10.1109\/BigData.2013.6691626"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Qardaji, W., Yang, W., Li, N.: Differentially private grids for geospatial data. In: 29th IEEE International Conference on Data Engineering, (ICDE 2013), pp. 757\u2013768. IEEE Computer Society (2013)","DOI":"10.1109\/ICDE.2013.6544872"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-24907-6_1","volume-title":"Security, Privacy, and Anonymity in Computation, Communication, and Storage","author":"Y Semenko","year":"2019","unstructured":"Semenko, Y., Saucez, D.: Distributed privacy preserving platform for ridesharing services. In: Wang, G., Feng, J., Bhuiyan, M.Z.A., Lu, R. (eds.) SpaCCS 2019. LNCS, vol. 11611, pp. 1\u201314. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24907-6_1"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-030-24907-6_15","volume-title":"Security, Privacy, and Anonymity in Computation, Communication, and Storage","author":"H Shahriar","year":"2019","unstructured":"Shahriar, H., et al.: Data protection labware for mobile security. In: Wang, G., Feng, J., Bhuiyan, M.Z.A., Lu, R. (eds.) SpaCCS 2019. LNCS, vol. 11611, pp. 183\u2013195. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24907-6_15"},{"key":"25_CR16","first-page":"557","volume":"05","author":"L Sweeney","year":"2012","unstructured":"Sweeney, L.: k-anomymity: a model for protecting privacy. Int. J. Uncertainty Fuzziness Knowl. Based Syst. 05, 557\u2013570 (2012)","journal-title":"Int. J. Uncertainty Fuzziness Knowl. Based Syst."},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"2054","DOI":"10.1109\/TII.2019.2930286","volume":"3","author":"T Wang","year":"2020","unstructured":"Wang, T., Luo, H., Jia, W., Liu, A., Xie, M.: MTES: an intelligent trust evaluation scheme in sensor-cloud-enabled industrial Internet of Things. IEEE Trans. Ind. Inf. 3, 2054\u20132062 (2020)","journal-title":"IEEE Trans. Ind. Inf."},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1109\/TII.2019.2938861","volume":"16","author":"T Wang","year":"2019","unstructured":"Wang, T., Ke, H., Zheng, X., Wang, K., Liu, A.: Big data cleaning based on mobile edge computing in industrial sensor-cloud. IEEE Trans. Ind. Inf. 16, 1321\u20131329 (2019)","journal-title":"IEEE Trans. Ind. Inf."},{"key":"25_CR19","unstructured":"Wu, Y.K., Huang, H., Wu, Q., Liu, A., Wang, T.: A risk defense method based on microscopic state prediction with partial information observations in social networks. J. Parallel Distrib. Comput. 131, 189\u2013199 (2019)"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Xu, F., Tu, Z., Li, Y., Zhang, P., Fu, X., Jin, D.: Trajectory recovery from ash: User privacy is NOT preserved in aggregated mobility data. In: Proceedings of the 26th International Conference on World Wide Web, (WWW 2017), pp. 1241\u20131250. ACM (2017)","DOI":"10.1145\/3038912.3052620"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"104775","DOI":"10.1109\/ACCESS.2020.2999580","volume":"8","author":"Y Yan","year":"2020","unstructured":"Yan, Y., Gao, X., Mahmood, A., Feng, T., Xie, P.: Differential private spatial decomposition and location publishing based on unbalanced quadtree partition algorithm. IEEE Access 8, 104775\u2013104787 (2020)","journal-title":"IEEE Access"},{"key":"25_CR22","unstructured":"Yan, Y., Hao, X.: Differential privacy partitioning algorithm based on adaptive density grids. J. Shandong Univ., 15\u201325 (2018). (SCIENCE EDITION)"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, J., Xiao, X., Xie, X.: PrivTree: a differentially private algorithm for hierarchical decompositions. In: Proceedings of the 2016 International Conference on Management of Data, (ICMD 2016), pp. 155\u2013170. ACM (2016)","DOI":"10.1145\/2882903.2882928"},{"key":"25_CR24","first-page":"847","volume":"57","author":"X Zhang","year":"2020","unstructured":"Zhang, X., Fu, N., Meng, X.: Towards spatial range queries under local differential privacy. J. Comput. Res. Dev. 57, 847 (2020)","journal-title":"J. Comput. Res. Dev."},{"key":"25_CR25","first-page":"1143","volume":"55","author":"X Zhang","year":"2018","unstructured":"Zhang, X., Jin, K., Meng, X.: Private spatial decomposition with adaptive grids. J. Comput. Res. Dev. 55, 1143\u20131156 (2018)","journal-title":"J. Comput. Res. Dev."}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Anonymity in Computation, Communication, and Storage"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68884-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T23:47:15Z","timestamp":1612828035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68884-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030688837","9783030688844"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68884-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SpaCCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spaccs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.spaccs2020.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}