{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T17:40:31Z","timestamp":1718905231258},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,11,16]],"date-time":"2016-11-16T00:00:00Z","timestamp":1479254400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Spanish Ministry of Economy and Competitiveness","award":["FJCI-2014-19703","CSD2007-00004"],"award-info":[{"award-number":["FJCI-2014-19703","CSD2007-00004"]}]},{"name":"Generalitat de Catalunya (ES)","award":["2009 SGR 1362"],"award-info":[{"award-number":["2009 SGR 1362"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10115-016-1010-4","type":"journal-article","created":{"date-parts":[[2016,11,17]],"date-time":"2016-11-17T06:09:59Z","timestamp":1479362999000},"page":"113-145","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Shall I post this now? Optimized, delay-based privacy protection in social networks"],"prefix":"10.1007","volume":"52","author":[{"given":"Javier","family":"Parra-Arnau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F\u00e9lix G\u00f3mez","family":"M\u00e1rmol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Rebollo-Monedero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Forn\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,16]]},"reference":[{"issue":"3","key":"1010_CR1","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/MSP.2007.75","volume":"5","author":"D Rosenblum","year":"2007","unstructured":"Rosenblum D (2007) What anyone can know: the privacy risks of social networking sites. IEEE Secur Priv 5(3):40\u201349","journal-title":"IEEE Secur Priv"},{"issue":"8","key":"1010_CR2","doi-asserted-by":"crossref","first-page":"1849","DOI":"10.1109\/TKDE.2012.120","volume":"25","author":"R Heatherly","year":"2013","unstructured":"Heatherly R, Kantarcioglu M, Thuraisingham B (2013) Preventing private information inference attacks on social networks. IEEE Trans Knowl Data Eng 25(8):1849\u20131862","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1010_CR3","doi-asserted-by":"crossref","unstructured":"Lindamood J, Heatherly R, Kantarcioglu M, Thuraisingham B (2009) Inferring private information using social network data. In: Proceedings of the 18th international conference on World wide web. ACM, pp 1145\u20131146","DOI":"10.1145\/1526709.1526899"},{"issue":"2","key":"1010_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MIC.2013.132","volume":"18","author":"F G\u00f3mez M\u00e1rmol","year":"2014","unstructured":"G\u00f3mez M\u00e1rmol F, Gil P\u00e9rez M, Mart\u00ednez P\u00e9rez G (2014) Reporting offensive content in social networks: toward a reputation-based assessment approach. IEEE Internet Comput 18(2):32\u201340. doi: 10.1109\/MIC.2013.132","journal-title":"IEEE Internet Comput"},{"issue":"4","key":"1010_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2797139","volume":"15","author":"S Pina Ros","year":"2015","unstructured":"Pina Ros S, Pina Canelles A, Gil P\u00e9rez M, G\u00f3mez M\u00e1rmol F, Mart\u00ednez P\u00e9rez G (2015) Chasing offensive conducts in social networks: a reputation-based practical approach for Frisber. ACM Trans Internet Technol 15(4):1\u201320. doi: 10.1145\/2797139","journal-title":"ACM Trans Internet Technol"},{"key":"1010_CR6","unstructured":"Younis Z, Khatib RA (2014) Trending in Ramadan\u2014what do people tweet about during the holy month? The Online Project. Technical report [Online]. http:\/\/www.theonlineproject.me\/files\/reports\/Trending_in_Ramadan_-_English1"},{"key":"1010_CR7","unstructured":"Social media in ramadan\u2014Exploring arab user habits on Facebook and Twitter. The Online Project. Technical Report 2013. [Online]. http:\/\/theonlineproject.me\/files\/newsletters\/Social-Media-in-Ramadan-Report-English"},{"key":"1010_CR8","doi-asserted-by":"crossref","unstructured":"Bilge L, Strufe T, Balzarotti D, Kirda E (2009) All your contacts belong to us: automated identity theft attacks on social networks. In: Proceedings of ACM international WWW conference, Sanibel Island, FL, pp 551\u2013560","DOI":"10.1145\/1526709.1526784"},{"key":"1010_CR9","doi-asserted-by":"crossref","unstructured":"Douceur JR (2002) The sybil attack. In: Proceedings of international workshop peer-to-peer syst. (IPTPS). Springer, London, UK, pp 251\u2013260","DOI":"10.1007\/3-540-45748-8_24"},{"key":"1010_CR10","doi-asserted-by":"crossref","unstructured":"Yu H, Kaminsky M, Gibbons PB, Flaxman A (2006) SybilGuard: defending against Sybil attacks via social networks. In: Proceedings of ACM conference special interest group data Communications (SIGCOMM), Pisa, Italy, pp 267\u2013278","DOI":"10.1145\/1159913.1159945"},{"issue":"3","key":"1010_CR11","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/TNET.2009.2034047","volume":"18","author":"H Yu","year":"2010","unstructured":"Yu H, Gibbons PB, Kaminsky M, Xiao F (2010) Sybillimit: a near-optimal social network defense against sybil attacks. IEEE\/ACM Trans Netw 18(3):885\u2013898","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1010_CR12","doi-asserted-by":"crossref","unstructured":"Zhou B, Pei J (2008) Preserving privacy in social networks against neighborhood attacks. In: Proceedings of IEEE interantoinal conference on data engineering (ICDE), Canc\u00fan, Mexico, pp 506\u2013515","DOI":"10.1109\/ICDE.2008.4497459"},{"issue":"1","key":"1010_CR13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10115-010-0311-2","volume":"28","author":"B Zhou","year":"2011","unstructured":"Zhou B, Pei J (2011) The $$k$$ k -anonymity and $$l$$ l -diversity approaches for privacy preservation in social networks against neighborhood attacks. Knowl Inform Syst 28(1):47\u201377","journal-title":"Knowl Inform Syst"},{"key":"1010_CR14","doi-asserted-by":"publisher","unstructured":"Shen X, Tan B, Zhai C (2007) Privacy protection in personalized search. ACM Spec. Interest Group Inform. Retrieval (SIGIR) Forum 41(1):4\u201317. [Online] doi: 10.1145\/1273221.1273222","DOI":"10.1145\/1273221.1273222"},{"issue":"2","key":"1010_CR15","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum D (1981) Untraceable electronic mail, return addresses, and digital pseudonyms. Commun ACM 24(2):84\u201388","journal-title":"Commun ACM"},{"key":"1010_CR16","unstructured":"Cottrell L (1994) Mixmaster and remailer attacks. [Online]. http:\/\/obscura.com\/~loki\/remailer\/remailer-essay.html"},{"key":"1010_CR17","doi-asserted-by":"crossref","unstructured":"Danezis G (2003) Mix-networks with restricted routes. In: Proceedings of international symposium on privacy enhancing technologies (PETS). Lecture notes computer science (LNCS), pp 1\u201317","DOI":"10.1007\/978-3-540-40956-4_1"},{"key":"1010_CR18","doi-asserted-by":"crossref","unstructured":"Kesdogan D, Egner J, B\u00fcschkes R (1998) Stop-and-go mixes: providing probabilistic anonymity in an open system. In: Proceedings of information hiding workshop (IH). Springer, pp 83\u201398","DOI":"10.1007\/3-540-49380-8_7"},{"key":"1010_CR19","unstructured":"Berthold O, Pfitzmann A, Standtke R (2000) The disadvantages of free MIX routes and how to overcome them. In: Proceedings of designing privacy enhancing technologies: workshop on design issues in anonymity and unobservability. Series Lecture notes computer science (LNCS). Springer, Berkeley, CA, pp 30\u201345"},{"key":"1010_CR20","unstructured":"D\u00edaz C, Seys S, Claessens J, Preneel B (2002) Towards measuring anonymity. In: Proceedings of international symposium on privacy enhancing technologies (PETS), Series Lecture notes on computer science (LNCS), vol 2482. Springer, pp 54\u201368"},{"key":"1010_CR21","doi-asserted-by":"crossref","unstructured":"Serjantov A, Danezis G (2002) Towards an information theoretic metric for anonymity. In: Proceedings of international symposium on privacy enhancing technologies (PETS), vol 2482. Springer, pp 41\u201353","DOI":"10.1007\/3-540-36467-6_4"},{"key":"1010_CR22","doi-asserted-by":"crossref","unstructured":"Steinbrecher S, Kopsell S (2003) Modelling unlinkability. In: Proceedings of internaional symposium on privacy enhancing technologies (PETS). Springer, pp 32\u201347","DOI":"10.1007\/978-3-540-40956-4_3"},{"key":"1010_CR23","unstructured":"D\u00edaz C (2005) Anonymity and privacy in electronic services. Ph.D. dissertation, Katholieke University, Leuven"},{"issue":"9","key":"1010_CR24","doi-asserted-by":"crossref","first-page":"4631","DOI":"10.1109\/TIT.2010.2054471","volume":"56","author":"D Rebollo-Monedero","year":"2010","unstructured":"Rebollo-Monedero D, Forn\u00e9 J (2010) Optimal query forgery for private information retrieval. IEEE Trans Inform Theory 56(9):4631\u20134642","journal-title":"IEEE Trans Inform Theory"},{"key":"1010_CR25","doi-asserted-by":"crossref","unstructured":"Howe DC, Nissenbaum H (2009) Lessons from the identity trail: privacy, anonymity and identity in a networked society. NY: Oxford Univ. Press, ch. TrackMeNot: Resisting surveillance in Web search, pp 417\u2013436. [Online]. http:\/\/mrl.nyu.edu\/~dhowe\/trackmenot","DOI":"10.1093\/oso\/9780195372472.003.0023"},{"key":"1010_CR26","doi-asserted-by":"publisher","unstructured":"Parra-Arnau J, Perego A, Ferrari E, Forn\u00e9 J, Rebollo-Monedero D (Jan. 2014) Privacy-preserving enhanced collaborative tagging. IEEE Trans. Knowl. Data Eng., 26(1):180\u2013193, [Online]. Available: doi: 10.1109\/TKDE.2012.248","DOI":"10.1109\/TKDE.2012.248"},{"key":"1010_CR27","doi-asserted-by":"publisher","unstructured":"Parra-Arnau J, Rebollo-Monedero D, Forn\u00e9 J, Mu\u00f1oz JL, Esparza O (2012) Optimal tag suppression for privacy protection in the semantic Web. Data Knowl Eng 81\u201382:46\u201366 [Online]. doi: 10.1016\/j.datak.2012.07.004","DOI":"10.1016\/j.datak.2012.07.004"},{"key":"1010_CR28","unstructured":"Deng M (2010) Privacy preserving content protection. Ph.D. dissertation, Katholieke University, Leuven"},{"key":"1010_CR29","doi-asserted-by":"crossref","unstructured":"Levine BN, Reiter MK, Wang C, Wright M (2004) Timing attacks in low-latency mix systems. In: Proceedings of international financial cryptography conference. Springer, pp 251\u2013265","DOI":"10.1007\/978-3-540-27809-2_25"},{"key":"1010_CR30","doi-asserted-by":"crossref","unstructured":"Bauer K, McCoy D, Grunwald D, Kohno T, Sicker D (2007) Low-resource routing attacks against anonymous systems. University of Colorado, Technical report","DOI":"10.1145\/1314333.1314336"},{"key":"1010_CR31","doi-asserted-by":"crossref","unstructured":"Murdoch SJ, Danezis G (2005) Low-cost traffic analysis of tor. In: Proceedings of IEEE symposium security and privacy (SP), pp 183\u2013195","DOI":"10.1109\/SP.2005.12"},{"key":"1010_CR32","doi-asserted-by":"crossref","unstructured":"Pfitzmann B, Pfitzmann A (1990) How to break the direct RSA implementation of mixes. In: Proceedings of annual international conference on the theory and applications of cryptographic techniques (EUROCRYPT). Springer, pp 373\u2013381","DOI":"10.1007\/3-540-46885-4_37"},{"key":"1010_CR33","unstructured":"Grossman WM (1996) alt.scientology.war, [Online]. www.wired.com\/wired\/archive\/3.12\/alt.scientology.war_pr.html"},{"key":"1010_CR34","unstructured":"AOL search data scandal (2006) Accessed on 15 November 2013. [Online]. http:\/\/en.wikipedia.org\/wiki\/AOL_search_data_scandal"},{"key":"1010_CR35","unstructured":"European data protection supervisor (2013) [Online]. http:\/\/www.edps.europa.eu"},{"key":"1010_CR36","unstructured":"Twitter charts - xefer. [Online]. http:\/\/xefer.com\/twitter\/"},{"key":"1010_CR37","doi-asserted-by":"crossref","unstructured":"Xu Y, Wang K, Zhang B, Chen Z (2007) Privacy-enhancing personalized Web search. In: Proceedings of the international WWW conference. ACM, pp 591\u2013600","DOI":"10.1145\/1242572.1242652"},{"key":"1010_CR38","doi-asserted-by":"crossref","unstructured":"Ye S, Wu F, Pandey R, Chen H (2009) Noise injection for search privacy protection. In: Proceedings of international conference on computer science engineering. IEEE Computer Society, pp 1\u20138","DOI":"10.1109\/CSE.2009.77"},{"key":"1010_CR39","doi-asserted-by":"crossref","unstructured":"Erola A, Castell\u00e0-Roca J, Viejo A, Mateo-Sanz JM (2011) Exploiting social networks to provide privacy in personalized Web search. J Syst Softw 84(10):1734\u2013745. [Online]. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0164121211001117","DOI":"10.1016\/j.jss.2011.05.009"},{"key":"1010_CR40","doi-asserted-by":"publisher","unstructured":"Parra-Arnau J, Rebollo-Monedero D, Forn\u00e9 J (2014) Measuring the privacy of user profiles in personalized information systems. Future Gen Comput Syst (FGCS), Special Issue Data, Knowl Eng 33:53\u201363 [Online]. doi: 10.1016\/j.future.2013.01.001","DOI":"10.1016\/j.future.2013.01.001"},{"key":"1010_CR41","unstructured":"Hildebrandt M, Backhouse J, Andronikou V, Benoist E, Canhoto A, Diaz C, Gasson M, Geradts Z, Meints M, Nabeth T, Bendegem JPV, der Hof SV, Vedder A, Yannopoulos A (2005) Descriptive analysis and inventory of profiling practices\u2014deliverable 7.2. Future Identity Information Society (FIDIS), Technical report"},{"key":"1010_CR42","volume-title":"Profiling the European citizen: cross-disciplinary perspectives","year":"2008","unstructured":"Hildebrandt M, Gutwirth S (eds) (2008) Profiling the European citizen: cross-disciplinary perspectives. Springer, Berlin"},{"issue":"9","key":"1010_CR43","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1109\/PROC.1982.12425","volume":"70","author":"ET Jaynes","year":"1982","unstructured":"Jaynes ET (1982) On the rationale of maximum-entropy methods. Proc IEEE 70(9):939\u2013952","journal-title":"Proc IEEE"},{"key":"1010_CR44","volume-title":"Elements of information theory","author":"TM Cover","year":"2006","unstructured":"Cover TM, Thomas JA (2006) Elements of information theory, 2nd edn. Wiley, New York","edition":"2"},{"key":"1010_CR45","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"key":"1010_CR46","doi-asserted-by":"crossref","unstructured":"Parra-Arnau J, Rebollo-Monedero D, Forn\u00e9 J (2014) Optimal forgery and suppression of ratings for privacy enhancement in recommendation systems. Entropy, 16(3):1586\u20131631. [Online]. http:\/\/www.mdpi.com\/1099-4300\/16\/3\/1586","DOI":"10.3390\/e16031586"},{"key":"1010_CR47","volume-title":"Mathematical analysis. A modern approach to advanced calculus","author":"TM Apostol","year":"1974","unstructured":"Apostol TM (1974) Mathematical analysis. A modern approach to advanced calculus, 2nd edn. Addison Wesley, Boston","edition":"2"},{"key":"1010_CR48","doi-asserted-by":"crossref","unstructured":"Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in facebook. In: Proceedings of the 2nd ACM SIGCOMM workshop on social networks (WOSN\u201909),","DOI":"10.1145\/1592665.1592675"},{"key":"1010_CR49","doi-asserted-by":"crossref","unstructured":"Ferrara E, Interdonato R, Tagarelli A (2014) Online popularity and topical interests through the lens of instagram. In: Proceedings of ACM conference on hypertext and social media (HT), pp 24\u201334","DOI":"10.1145\/2631775.2631808"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-016-1010-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-1010-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-1010-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T17:10:04Z","timestamp":1718903404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-016-1010-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,16]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1010"],"URL":"https:\/\/doi.org\/10.1007\/s10115-016-1010-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,16]]}}}