{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:25:42Z","timestamp":1725564342305},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642154638"},{"type":"electronic","value":"9783642154645"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15464-5_17","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T13:51:03Z","timestamp":1283349063000},"page":"156-167","source":"Crossref","is-referenced-by-count":2,"title":["Privacy-Aware Folksonomies"],"prefix":"10.1007","author":[{"given":"Clemens","family":"Heidinger","sequence":"first","affiliation":[]},{"given":"Erik","family":"Buchmann","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Huber","sequence":"additional","affiliation":[]},{"given":"Klemens","family":"B\u00f6hm","sequence":"additional","affiliation":[]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Aggarwal, G., et al.: Two can keep a secret: A distributed architecture for secure database services. In: Proc. CIDR (2005)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Ames, M., Naaman, M.: Why we tag: motivations for annotation in mobile and online media. In: CHI 2007: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (2007)","DOI":"10.1145\/1240624.1240772"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-74143-5_30","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M. Bellare","year":"2007","unstructured":"Bellare, M., Boldyreva, A., O\u2019Neill, A.: Deterministic and efficiently searchable encryption. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 535\u2013552. Springer, Heidelberg (2007)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/3-540-46416-6_50","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"S. Berkovits","year":"1991","unstructured":"Berkovits, S.: How to broadcast a secret. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 535\u2013541. Springer, Heidelberg (1991)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Burghardt, T., et al.: Understanding user preferences and awareness: Privacy mechanisms in location-based services. In: CoopIS (2009)","DOI":"10.1007\/978-3-642-05148-7_21"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Ceselli, A., et al.: Modeling and assessing inference exposure in encrypted databases. ACM Trans. Inf. Syst. Secur.\u00a08(1) (2005)","DOI":"10.1145\/1053283.1053289"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: STOC 1988: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (1988)","DOI":"10.1145\/62212.62214"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Damiani, E., et\u00a0al: Balancing confidentiality and efficiency in untrusted relational dbmss. In: CCS 2003: Proceedings of the 10th ACM Conference on Computer and Communications Security (2003)","DOI":"10.1145\/948109.948124"},{"issue":"6","key":"17_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(90)90010-U","volume":"34","author":"O. Goldreich","year":"1990","unstructured":"Goldreich, O.: A note on computational indistinguishability. Inf. Process. Lett.\u00a034(6), 277\u2013281 (1990)","journal-title":"Inf. Process. Lett."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC 1987: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (1987)","DOI":"10.1145\/28395.28420"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Hacig\u00fcm\u00fc\u015f, H., et al.: Executing sql over encrypted data in the database-service-provider model. In: SIGMOD 2002: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data (2002)","DOI":"10.1145\/564691.564717"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Hacig\u00fcm\u00fc\u015f, H., Iyer, B., Mehrotra, S.: Providing database as a service. In: Proceedings of 18th International Conference on Data Engineering (2002)","DOI":"10.1109\/ICDE.2002.994695"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Heckner, M., Neubauer, T., Wolff, C.: Tree, funny, to_read, google: what are tags supposed to achieve? a comparative analysis of user keywords for different digital resource types. In: SSM 2008: Proceeding of the 2008 ACM Workshop on Search in Social Media, pp. 3\u201310 (2008)","DOI":"10.1145\/1458583.1458589"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Hore, B., Mehrotra, S., Tsudik, G.: A privacy-preserving index for range queries. In: VLDB 2004: Proceedings of the Thirtieth International Conference on Very Large Data Bases. VLDB Endowment (2004)","DOI":"10.1016\/B978-012088469-8.50064-4"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11890850_22","volume-title":"Provenance and Annotation of Data","author":"I. Khan","year":"2006","unstructured":"Khan, I., Schroeter, R., Hunter, J.: Implementing a secure annotation service. In: Moreau, L., Foster, I. (eds.) IPAW 2006. LNCS, vol.\u00a04145, pp. 212\u2013221. Springer, Heidelberg (2006)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., Venkatasubramanian, S.: t-closeness: Privacy beyond k-anonymity and l-diversity. In: Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007 (2007)","DOI":"10.1109\/ICDE.2007.367856"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., et\u00a0al: l-diversity: Privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data, 1(1) (March 2007)","DOI":"10.1145\/1217299.1217302"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Marlow, C., et al.: Ht06, tagging paper, taxonomy, flickr, academic article, to read. In: HYPERTEXT 2006: Proceedings of the Seventeenth Conference on Hypertext and Hypermedia (2006)","DOI":"10.1145\/1149941.1149949"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Rivadeneira, A.W., et al.: Getting our head in the clouds: toward evaluation studies of tagclouds. In: CHI 2007: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (2007)","DOI":"10.1145\/1240624.1240775"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Sweeney, L.: k-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst.\u00a010(5) (October 2002)","DOI":"10.1142\/S0218488502001648"}],"container-title":["Lecture Notes in Computer Science","Research and Advanced Technology for Digital Libraries"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15464-5_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:08:11Z","timestamp":1606169291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15464-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642154638","9783642154645"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15464-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}