{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:29:09Z","timestamp":1740137349607,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["835294"],"award-info":[{"award-number":["835294"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10207-020-00530-7","type":"journal-article","created":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T05:02:41Z","timestamp":1609563761000},"page":"763-782","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Enhanced models for privacy and utility in continuous-time diffusion networks"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0084-521X","authenticated-orcid":false,"given":"Federica","family":"Granese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Gorla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,2]]},"reference":[{"key":"530_CR1","doi-asserted-by":"crossref","unstructured":"Backes, M., Gomez-Rodriguez, M., Manoharan, P., Surma, B.: Reconciling privacy and utility in continuous-time diffusion networks. In: 2017 IEEE 30th Computer Security Foundations Symposium (CSF), pp. 292\u2013304 (2017)","DOI":"10.1109\/CSF.2017.29"},{"key":"530_CR2","doi-asserted-by":"publisher","unstructured":"Brach, P., Epasto, A., Panconesi, A., Sankowski, P.: Spreading rumours without the network. In: COSN 2014\u2014Proceedings of the 2014 ACM Conference on Online Social Networks, pp. 107\u2013118 (2014). https:\/\/doi.org\/10.1145\/2660460.2660472","DOI":"10.1145\/2660460.2660472"},{"key":"530_CR3","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J., Schwartz, R.: A tight linear time (1\/2)-approximation for unconstrained submodular maximization. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 649\u2013658 (2012)","DOI":"10.1109\/FOCS.2012.73"},{"key":"530_CR4","doi-asserted-by":"crossref","unstructured":"Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web, pp. 665\u2013674. ACM (2011)","DOI":"10.1145\/1963405.1963499"},{"key":"530_CR5","doi-asserted-by":"crossref","unstructured":"Carnes, T., Nagarajan, C., Wild, S.M., van Zuylen, A.: Maximizing influence in a competitive social network: a follower\u2019s perspective. In: Proceedings of the Ninth International Conference on Electronic Commerce, pp. 351\u2013360 (2007)","DOI":"10.1145\/1282100.1282167"},{"key":"530_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029\u20131038. ACM (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"530_CR7","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199\u2013208. ACM (2009)","DOI":"10.1145\/1557019.1557047"},{"issue":"4","key":"530_CR8","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/3173043","volume":"65","author":"F Chierichetti","year":"2018","unstructured":"Chierichetti, F., Giakkoupis, G., Lattanzi, S., Panconesi, A.: Rumor spreading and conductance. J. ACM 65(4), 17:1\u201317:21 (2018). https:\/\/doi.org\/10.1145\/3173043","journal-title":"J. ACM"},{"issue":"1","key":"530_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.jal.2014.11.011","volume":"13","author":"Z Christoff","year":"2015","unstructured":"Christoff, Z., Hansen, J.U.: A logic for diffusion in social networks. J. Appl. Logic 13(1), 48\u201377 (2015)","journal-title":"J. Appl. Logic"},{"key":"530_CR10","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1029\/WR015i005p01001","volume":"15","author":"JL Cohon","year":"1979","unstructured":"Cohon, J.L., Church, R.L., Sheer, D.P.: Generating multiobjective trade-offs: an algorithm for bicriterion problems. Water Resour. Res. 15, 1001\u20131010 (1979)","journal-title":"Water Resour. Res."},{"key":"530_CR11","doi-asserted-by":"publisher","first-page":"3399","DOI":"10.1118\/1.2335486","volume":"33","author":"D Craft","year":"2006","unstructured":"Craft, D., Halabi, T., Shih, H.A., Bortfeld, T.R.: Approximating convex Pareto surfaces in multiobjective radiotherapy planning. Med. Phys. 33, 3399\u20133407 (2006)","journal-title":"Med. Phys."},{"issue":"3","key":"530_CR12","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1137\/13093875X","volume":"45","author":"C Daskalakis","year":"2016","unstructured":"Daskalakis, C., Diakonikolas, I., Yannakakis, M.: How good is the chord algorithm? SIAM J. Comput. 45(3), 811\u2013858 (2016). https:\/\/doi.org\/10.1137\/13093875X","journal-title":"SIAM J. Comput."},{"key":"530_CR13","doi-asserted-by":"crossref","unstructured":"De Choudhury, M., Mason, W., M. Hofman, J., Watts, D.: Inferring relevant social networks from interpersonal communication. In: Proceedings of the 19th International Conference on World Wide Web, WWW \u201910, pp. 301\u2013310 (2010)","DOI":"10.1145\/1772690.1772722"},{"key":"530_CR14","unstructured":"Du, N., Song, L., Woo, H., Zha, H.: Uncover topic-sensitive information diffusion networks. In: AISTATS, pp. 229\u2013237 (2013)"},{"key":"530_CR15","volume-title":"Submodular Functions and Optimization. Annals of Discrete Mathematics","author":"S Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization. Annals of Discrete Mathematics. Elsevier, Amsterdam (2005)"},{"key":"530_CR16","unstructured":"Gomez-Rodriguez, M., Balduzzi, D., Sch\u00f6lkopf, B.: Uncovering the temporal dynamics of diffusion networks. In: ICML, pp. 561\u2013568 (2011)"},{"key":"530_CR17","unstructured":"Gomez Rodriguez, M., Sch\u00f6lkopf, B.: Influence maximization in continuous time diffusion networks. In: Proceedings of the 29th International Conference on Machine Learning, pp. 313\u2013320. Omnipress (2012)"},{"issue":"2","key":"530_CR18","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2824253","volume":"34","author":"M Gomez-Rodriguez","year":"2016","unstructured":"Gomez-Rodriguez, M., Song, L., Du, N., Zha, H., Sch\u00f6lkopf, B.: Influence estimation and maximization in continuous-time diffusion networks. ACM Trans. Inf. Syst. 34(2), 9:1\u20139:33 (2016)","journal-title":"ACM Trans. Inf. Syst."},{"key":"530_CR19","doi-asserted-by":"publisher","unstructured":"Gorla, D., Granese, F., Palamidessi, C.: Enhanced models for privacy and utility in continuous-time diffusion networks. In: Hierons, R.M., Mosbah, M. (eds.) ICTAC 2019\u201416th International Colloquium on Theoretical Aspects of Computing, Lecture Notes in Computer Science, vol. 11884. Springer, Hammamet, Tunisia (2019). https:\/\/doi.org\/10.1007\/978-3-030-32505-3_18. https:\/\/hal.inria.fr\/hal-02424329","DOI":"10.1007\/978-3-030-32505-3_18"},{"key":"530_CR20","unstructured":"Iyer, R., Bilmes, J.: Submodular optimization with submodular cover and submodular knapsack constraints. In: Proceedings of the 26th International Conference on Neural Information Processing Systems, vol. 2, pp. 2436\u20132444. Curran Associates Inc. (2013)"},{"key":"530_CR21","first-page":"99","volume":"2","author":"R Kasprzak","year":"2012","unstructured":"Kasprzak, R.: Diffusion in networks. J. Telecommun. Inf. Technol. 2, 99\u2013106 (2012)","journal-title":"J. Telecommun. Inf. Technol."},{"key":"530_CR22","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM (2003)","DOI":"10.1145\/956750.956769"},{"key":"530_CR23","doi-asserted-by":"crossref","unstructured":"Lappas, T., Terzi, E., Gunopulos, D., Mannila, H.: Finding Effectors in Social Networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1059\u20131068. ACM (2010)","DOI":"10.1145\/1835804.1835937"},{"issue":"1\u20132","key":"530_CR24","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.14778\/1920841.1920980","volume":"3","author":"D Nanongkai","year":"2010","unstructured":"Nanongkai, D., Sarma, A.D., Lall, A., Lipton, R.J., Xu, J.: Regret-minimizing representative databases. Proc. VLDB Endow. 3(1\u20132), 1114\u20131124 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"530_CR25","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of Web sources. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 86\u201392 (2000)"},{"key":"530_CR26","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Multiobjective query optimization. In: Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 52\u201358. ACM (2001)","DOI":"10.1145\/375551.375560"},{"key":"530_CR27","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining Knowledge-sharing Sites for Viral Marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61\u201370. ACM (2002)","DOI":"10.1145\/775047.775057"},{"key":"530_CR28","doi-asserted-by":"crossref","unstructured":"Soma, T., Yoshida, Y.: Presentation of regret ratio minimization in multi-objective submodular function maximization. https:\/\/www.opt.mist.i.u-tokyo.ac.jp\/~tasuku\/talks.html\/ (2017)","DOI":"10.1609\/aaai.v31i1.10652"},{"key":"530_CR29","doi-asserted-by":"crossref","unstructured":"Soma, T., Yoshida, Y.: Regret ratio minimization in multi-objective submodular function maximization. In: AAAI, pp. 905\u2013911 (2017)","DOI":"10.1609\/aaai.v31i1.10652"},{"key":"530_CR30","doi-asserted-by":"crossref","unstructured":"Tzoumas, V., Amanatidis, C., Markakis, E.: A game-theoretic analysis of a competitive diffusion process over social networks. In: Proceedings of the 8th International Conference on Internet and Network Economics, WINE\u201912, pp. 1\u201314. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-35311-6_1"},{"key":"530_CR31","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1086\/518527","volume":"34","author":"D Watts","year":"2007","unstructured":"Watts, D., Dodds, P.: Influentials, networks, and public opinion formation. J. Consum. Res. 34, 441\u2013458 (2007)","journal-title":"J. Consum. Res."},{"issue":"6684","key":"530_CR32","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"530_CR33","doi-asserted-by":"crossref","unstructured":"Yu, M., Gupta, V., Kolar, M.: An influence-receptivity model for topic based information cascades. In: International Conference on Data Mining (ICDM), pp. 1141\u20131146. IEEE (2017)","DOI":"10.1109\/ICDM.2017.152"},{"issue":"C","key":"530_CR34","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.eswa.2016.01.008","volume":"55","author":"Y Zeng","year":"2016","unstructured":"Zeng, Y., Chen, X., Cong, G., Qin, S., Tang, J., Xiang, Y.: Maximizing influence under influence loss constraint in social networks. Expert Syst. Appl. 55(C), 255\u2013267 (2016)","journal-title":"Expert Syst. Appl."},{"key":"530_CR35","first-page":"409","volume":"8","author":"D Zhou","year":"2015","unstructured":"Zhou, D., Wenbao, H., Wang, Y.: Identifying topic-sensitive influential spreaders in social networks. Int. J. Hybrid Inf. Technol. 8, 409\u2013422 (2015)","journal-title":"Int. J. Hybrid Inf. Technol."},{"key":"530_CR36","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.future.2012.06.011","volume":"31","author":"J Zhou","year":"2014","unstructured":"Zhou, J., Zhang, Y., Cheng, J.: Preference-based mining of top-K influential nodes in social networks. Fut. Gener. Comput. Syst. 31, 40\u201347 (2014)","journal-title":"Fut. Gener. Comput. Syst."}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-020-00530-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-020-00530-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-020-00530-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T06:52:50Z","timestamp":1670655170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-020-00530-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,2]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["530"],"URL":"https:\/\/doi.org\/10.1007\/s10207-020-00530-7","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2021,1,2]]},"assertion":[{"value":"2 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}