{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T16:26:28Z","timestamp":1776183988459,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T00:00:00Z","timestamp":1776124800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T00:00:00Z","timestamp":1776124800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08497-3","type":"journal-article","created":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T15:34:09Z","timestamp":1776180849000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Collaborative trajectory privacy protection framework with joint trajectory similarity constraint and reputation rating"],"prefix":"10.1007","volume":"82","author":[{"given":"Tongpo","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengqi","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,14]]},"reference":[{"key":"8497_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comcom.2016.03.002","volume":"85","author":"T Dargahi","year":"2016","unstructured":"Dargahi T et al (2016) ABAKA: a novel attribute-based k-anonymous collaborative solution for LBSs. Comput Commun 85:1\u201313","journal-title":"Comput Commun"},{"key":"8497_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.knosys.2018.01.007","volume":"148","author":"Y Dong","year":"2018","unstructured":"Dong Y, Pi D (2018) Novel privacy-preserving algorithm based on frequent path for trajectory data publishing. Knowl-Based Syst 148:55\u201365","journal-title":"Knowl-Based Syst"},{"issue":"9","key":"8497_CR3","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s10707-018-0326-5","volume":"22","author":"J Xu","year":"2018","unstructured":"Xu J, Guting RH, Gao Y (2018) Continuous k-nearest neighbor query processing for large-scale multi-attribute trajectories a systematic framework. GeoInformatica 22(9):723\u2013766","journal-title":"GeoInformatica"},{"issue":"2","key":"8497_CR4","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1109\/TNET.2018.2812851","volume":"26","author":"H Jiang","year":"2018","unstructured":"Jiang H, Zhao P, Wang C (2018) RobLoP: towards robust privacy preserving against location dependent attacks in continuous LBS queries. IEEE\/ACM Trans Netw 26(2):1018\u20131032","journal-title":"IEEE\/ACM Trans Netw"},{"key":"8497_CR5","doi-asserted-by":"crossref","unstructured":"Hasan AT et al. (2018) An effective privacy architecture to preserve user trajectories in reward-based LBS applications. 7(2): 53","DOI":"10.3390\/ijgi7020053"},{"issue":"99","key":"8497_CR6","doi-asserted-by":"publisher","first-page":"24555","DOI":"10.1109\/ACCESS.2017.2767641","volume":"5","author":"P Sui","year":"2017","unstructured":"Sui P, Li X, Bai Y (2017) A study of enhancing privacy for intelligent transportation systems k-correlation privacy model against moving preference attacks for location trajectory data. IEEE Access 5(99):24555\u201324567","journal-title":"IEEE Access"},{"issue":"2","key":"8497_CR7","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/TSC.2013.55","volume":"7","author":"RH Hwang","year":"2014","unstructured":"Hwang RH, Hsueh YL, Chung HW (2014) A novel time-obfuscated algorithm for trajectory privacy protection. IEEE Trans Serv Comput 7(2):126\u2013139","journal-title":"IEEE Trans Serv Comput"},{"key":"8497_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.ins.2016.08.010","volume":"387","author":"P Tao","year":"2017","unstructured":"Tao P et al (2017) Collaborative trajectory privacy preserving scheme in location-based services. Inf Sci 387:165\u2013179","journal-title":"Inf Sci"},{"key":"8497_CR9","doi-asserted-by":"crossref","unstructured":"Gramaglia M et al (2017) Preserving mobile subscriber privacy in open datasets of spatiotemporal trajectories. In: IEEE Infocom-IEEE Conference on Computer Communications","DOI":"10.1109\/INFOCOM.2017.8056979"},{"key":"8497_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.ins.2016.10.038","volume":"378","author":"Y Han","year":"2017","unstructured":"Han Y, Xie ZQ, Yang J (2017) The privacy preserving method for dynamic trajectory releasing based on adaptive clustering. Inf Sci 378:131\u2013143","journal-title":"Inf Sci"},{"key":"8497_CR11","doi-asserted-by":"publisher","first-page":"30110","DOI":"10.1109\/ACCESS.2018.2833163","volume":"6","author":"Q Han","year":"2018","unstructured":"Han Q et al (2018) Lclean: a plausible approach to individual trajectory data sanitization. IEEE Access 6:30110\u201330116","journal-title":"IEEE Access"},{"key":"8497_CR12","doi-asserted-by":"publisher","first-page":"77975","DOI":"10.1109\/ACCESS.2018.2884516","volume":"6","author":"X Zhang","year":"2018","unstructured":"Zhang X et al (2018) TPP: trajectory privacy preservation against tensor voting based inference attacks. IEEE Access 6:77975\u201377985","journal-title":"IEEE Access"},{"key":"8497_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10723-018-9435-5","volume":"16","author":"P Sui","year":"2018","unstructured":"Sui P, Yang X (2018) A privacy-preserving compression storage method for large trajectory data in road network. J Grid Comput 16:229\u2013245","journal-title":"J Grid Comput"},{"key":"8497_CR14","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.cose.2018.05.001","volume":"77","author":"Z Hu","year":"2018","unstructured":"Hu Z et al (2018) Trajectory privacy protection method based on the time interval divided. Comput Secur 77:488\u2013499","journal-title":"Comput Secur"},{"key":"8497_CR15","doi-asserted-by":"crossref","unstructured":"Terrovitis M, Mamoulis N (2008) Privacy preservation in the publication of trajectories. In: International Conference on Mobile Data Management.","DOI":"10.1109\/MDM.2008.29"},{"issue":"03","key":"8497_CR16","doi-asserted-by":"publisher","first-page":"1850006","DOI":"10.1142\/S0218843018500065","volume":"27","author":"Z Hu","year":"2018","unstructured":"Hu Z, Jing Y, Zhang J (2018) Personalized trajectory privacy protection method based on user-requirement. Int J Cooper Inf Syst 27(03):1850006","journal-title":"Int J Cooper Inf Syst"},{"issue":"3","key":"8497_CR17","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/MCOM.2017.1600690CM","volume":"55","author":"G Yang","year":"2017","unstructured":"Yang G et al (2017) Promoting cooperation by the social incentive mechanism in mobile crowdsensing. IEEE Commun Mag 55(3):86\u201392","journal-title":"IEEE Commun Mag"},{"issue":"6","key":"8497_CR18","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1049\/iet-net.2017.0079","volume":"6","author":"N Mantas","year":"2018","unstructured":"Mantas N et al (2018) Towards an incentive-compatible, reputation-based framework for stimulating cooperation in opportunistic networks: a survey. Iet Netw 6(6):169\u2013178","journal-title":"Iet Netw"},{"issue":"1","key":"8497_CR19","first-page":"67","volume":"18","author":"Y Hu","year":"2018","unstructured":"Hu Y, Xiao Z (2018) Virtual resource pricing scheme in cloud platforms. Int J Netw Virt Organ 18(1):67","journal-title":"Int J Netw Virt Organ"},{"issue":"12","key":"8497_CR20","doi-asserted-by":"publisher","first-page":"3069","DOI":"10.1109\/TSP.2014.2320457","volume":"62","author":"Y Zhang","year":"2014","unstructured":"Zhang Y, van der Schaar M (2014) Collective ratings for online communities with strategic users. IEEE Trans Signal Process 62(12):3069\u20133083","journal-title":"IEEE Trans Signal Process"},{"issue":"11","key":"8497_CR21","doi-asserted-by":"publisher","first-page":"2801","DOI":"10.1109\/TIFS.2018.2834318","volume":"13","author":"J Lu","year":"2018","unstructured":"Lu J et al (2018) Game-theoretic design of optimal two-sided rating protocols for service exchange dilemma in crowdsourcing. IEEE Trans Inf Foren Secur 13(11):2801\u20132815","journal-title":"IEEE Trans Inf Foren Secur"},{"issue":"5","key":"8497_CR22","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1109\/LCOMM.2017.2651064","volume":"21","author":"Y Qi","year":"2017","unstructured":"Qi Y, Wang H (2017) Incentive pricing mechanism for hybrid access in femtocell networks. IEEE Commun Lett 21(5):1091\u20131094","journal-title":"IEEE Commun Lett"},{"key":"8497_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.neucom.2017.04.027","volume":"260","author":"Y Dai","year":"2017","unstructured":"Dai Y et al (2017) Real-time pricing scheme based on Stackelberg game in smart grid with multiple power retailers. Neurocomputing 260:149\u2013156","journal-title":"Neurocomputing"},{"issue":"1","key":"8497_CR24","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1086\/406755","volume":"46","author":"RL Trivers","year":"1971","unstructured":"Trivers RL (1971) The evolution of reciprocal altruism. Q Rev Biol 46(1):35\u201357","journal-title":"Q Rev Biol"},{"issue":"02","key":"8497_CR25","doi-asserted-by":"publisher","first-page":"1240025","DOI":"10.1142\/S0129054112400254","volume":"23","author":"M Seredynski","year":"2012","unstructured":"Seredynski M, Bouvry P (2012) Direct reciprocity-based cooperation in mobile ad hoc networks. Int J Found Comput Sci 23(02):1240025","journal-title":"Int J Found Comput Sci"},{"key":"8497_CR26","doi-asserted-by":"crossref","unstructured":"Shin K et al. (2015) T-chain: a general incentive scheme for cooperative computing. In: IEEE International Conference on Distributed Computing Systems","DOI":"10.1109\/ICDCS.2015.25"},{"issue":"4","key":"8497_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2785627","volume":"3","author":"Y Xiao","year":"2013","unstructured":"Xiao Y, Schaar MVD (2013) Socially-optimal design of service exchange platforms with imperfect monitoring. ACM Trans Econ Comput 3(4):1\u201325","journal-title":"ACM Trans Econ Comput"},{"issue":"1","key":"8497_CR28","first-page":"1","volume":"2","author":"Z Yu","year":"2014","unstructured":"Yu Z et al (2014) Rating protocols in online. Communities 2(1):1\u201334","journal-title":"Communities"},{"issue":"6","key":"8497_CR29","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1109\/TIFS.2017.2656468","volume":"12","author":"J Lu","year":"2017","unstructured":"Lu J et al (2017) Designing socially-optimal rating protocols for crowdsourcing contest dilemma. IEEE Trans Inf Forensics Secur 12(6):1330\u20131344","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"8497_CR30","doi-asserted-by":"publisher","first-page":"24078","DOI":"10.1155\/2022\/1424078","volume":"14","author":"Z Li","year":"2022","unstructured":"Li Z, Xing X, Qian J et al (2022) Trajectory privacy preserving for continuous LBSs in VANET. Wirel Commun Mobile Comput 14:24078. https:\/\/doi.org\/10.1155\/2022\/1424078","journal-title":"Wirel Commun Mobile Comput"},{"key":"8497_CR31","doi-asserted-by":"publisher","unstructured":"Zhang S, Wang G, Liu Q et al. (2017) A trajectory privacy-preserving scheme based on dual-K mechanism for continuous location-based services. In: Proceedings IEEE ISPA\/IUCC, pp. 940-947. https:\/\/doi.org\/10.1109\/ISPA\/IUCC.2017.00153","DOI":"10.1109\/ISPA\/IUCC.2017.00153"},{"key":"8497_CR32","doi-asserted-by":"publisher","first-page":"3711","DOI":"10.1007\/s10207-024-00894-0","volume":"23","author":"A Miranda Pascual","year":"2024","unstructured":"Miranda Pascual A, Guerra Balboa P, Parra Arnau J et al (2024) An overview of proposals towards the privacy preserving publication of trajectory data. Int J Inf Secur 23:3711\u20133747. https:\/\/doi.org\/10.1007\/s10207-024-00894-0","journal-title":"Int J Inf Secur"},{"key":"8497_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2025.104514","author":"Y Niu","year":"2025","unstructured":"Niu Y, Zhang J, Tang Z et al (2025) Privacy-preserving spatiotemporal trajectory generalization publishing scheme with differential privacy. Comput Secur. https:\/\/doi.org\/10.1016\/j.cose.2025.104514","journal-title":"Comput Secur"},{"key":"8497_CR34","doi-asserted-by":"publisher","first-page":"104697","DOI":"10.1016\/j.cose.2025.104697","volume":"159","author":"X He","year":"2025","unstructured":"He X, Li J, Lin Y et al (2025) TDSF: trajectory-preserving method of dual-strategy fusion with differential privacy in LBS. Comput Secur 159:104697. https:\/\/doi.org\/10.1016\/j.cose.2025.104697","journal-title":"Comput Secur"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08497-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08497-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08497-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T15:34:12Z","timestamp":1776180852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08497-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,14]]},"references-count":34,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["8497"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08497-3","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,14]]},"assertion":[{"value":"13 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"351"}}