{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T05:48:17Z","timestamp":1741153697871,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642201486"},{"type":"electronic","value":"9783642201493"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20149-3_9","type":"book-chapter","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T22:41:56Z","timestamp":1302302516000},"page":"93-107","source":"Crossref","is-referenced-by-count":9,"title":["Distributed Privacy Preserving Data Collection"],"prefix":"10.1007","author":[{"given":"Mingqiang","family":"Xue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chedy","family":"Ra\u00efssi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Kalnis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung Keng","family":"Pung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"29","author":"C. Asmuth","year":"1983","unstructured":"Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Information Theory\u00a029(2), 208\u2013210 (1983)","journal-title":"IEEE Trans. Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Bayardo, R., Agrawal, R.: Data privacy through optimal k-anonymization. In: Proc. of ICDE, pp. 217\u2013228 (2005)","key":"9_CR2","DOI":"10.1109\/ICDE.2005.42"},{"key":"9_CR3","first-page":"76","volume-title":"KDD 2006","author":"J. Brickell","year":"2006","unstructured":"Brickell, J., Shmatikov, V.: Efficient anonymity-preserving data collection. In: KDD 2006, pp. 76\u201385. ACM, New York (2006)"},{"doi-asserted-by":"crossref","unstructured":"Damgard, I., Fitzi, M., Kiltz, E., Nielsen, J., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation, pp. 285\u2013304 (2006)","key":"9_CR4","DOI":"10.1007\/11681878_15"},{"doi-asserted-by":"crossref","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate, pp. 803\u2013815 (2005)","key":"9_CR5","DOI":"10.1007\/11523468_65"},{"unstructured":"Ghinita, G., Karras, P., Kalnis, P., Mamoulis, N.: Fast data anonymization with low information loss. In: Proc. of VLDB, pp. 758\u2013769 (2007)","key":"9_CR6"},{"key":"9_CR7","first-page":"1321","volume-title":"CIKM 2008: Proceeding of the 17th ACM Conference on Information and Knowledge Mmanagement","author":"P. Jurczyk","year":"2008","unstructured":"Jurczyk, P., Xiong, L.: Privacy-preserving data publishing for horizontally partitioned databases. In: CIKM 2008: Proceeding of the 17th ACM Conference on Information and Knowledge Mmanagement, pp. 1321\u20131322. ACM, New York (2008)"},{"issue":"19","key":"9_CR8","doi-asserted-by":"publisher","first-page":"4148","DOI":"10.1016\/j.ins.2007.04.008","volume":"177","author":"K. Kaya","year":"2007","unstructured":"Kaya, K., Sel\u00e7uk, A.A.: Threshold cryptography based on asmuth-bloom secret sharing. Inf. Sci.\u00a0177(19), 4148\u20134160 (2007)","journal-title":"Inf. Sci."},{"doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Incognito: Efficient full-domain k-anonymity. In: Proc. of ACM SIGMOD, pp. 49\u201360 (2005)","key":"9_CR9","DOI":"10.1145\/1066157.1066164"},{"doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-diversity: Privacy beyond k-anonymity. In: Proc. of ICDE (2006)","key":"9_CR10","DOI":"10.1109\/ICDE.2006.1"},{"key":"9_CR11","first-page":"223","volume-title":"PODS 2004","author":"A. Meyerson","year":"2004","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: PODS 2004, pp. 223\u2013228. ACM, New York (2004)"},{"issue":"1","key":"9_CR12","first-page":"124","volume":"13","author":"B. Moon","year":"2001","unstructured":"Moon, B., Jagadish, H.v., Faloutsos, C., Saltz, J.H.: Analysis of the clustering properties of the hilbert space-filling curve. IEEE TKDE\u00a013(1), 124\u2013141 (2001)","journal-title":"IEEE TKDE"},{"doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes, pp. 223\u2013238 (1999)","key":"9_CR13","DOI":"10.1007\/3-540-48910-X_16"},{"doi-asserted-by":"crossref","unstructured":"Samarati, P., Sweeney, L.: Generalizing data to provide anonymity when disclosing information (abstract). In: Proc. of ACM PODS, p. 188 (1998)","key":"9_CR14","DOI":"10.1145\/275487.275508"},{"issue":"11","key":"9_CR15","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"5","key":"9_CR16","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: k-anonymity: A model for protecting privacy. Int. J. of Uncertainty, Fuzziness and Knowledge-Based Systems\u00a010(5), 557\u2013570 (2002)","journal-title":"Int. J. of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"9_CR17","first-page":"334","volume-title":"KDD 2005","author":"Z. Yang","year":"2005","unstructured":"Yang, Z., Zhong, S., Wright, R.N.: Anonymity-preserving data collection. In: KDD 2005, pp. 334\u2013343. ACM, New York (2005)"},{"issue":"17","key":"9_CR18","doi-asserted-by":"publisher","first-page":"2948","DOI":"10.1016\/j.ins.2009.05.004","volume":"179","author":"S. Zhong","year":"2009","unstructured":"Zhong, S., Yang, Z., Chen, T.: k-anonymous data collection. Inf. Sci.\u00a0179(17), 2948\u20132963 (2009)","journal-title":"Inf. Sci."},{"key":"9_CR19","first-page":"139","volume-title":"PODS 2005","author":"S. Zhong","year":"2005","unstructured":"Zhong, S., Yang, Z., Wright, R.N.: Privacy-enhancing k-anonymization of customer data. In: PODS 2005, pp. 139\u2013147. ACM, New York (2005)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20149-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T23:57:28Z","timestamp":1741132648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20149-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201486","9783642201493"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20149-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}