{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:09:04Z","timestamp":1725556144885},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642136566"},{"type":"electronic","value":"9783642136573"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13657-3_23","type":"book-chapter","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T11:29:16Z","timestamp":1274182156000},"page":"198-207","source":"Crossref","is-referenced-by-count":4,"title":["Privacy-Preserving Network Aggregation"],"prefix":"10.1007","author":[{"given":"Troy","family":"Raeder","sequence":"first","affiliation":[]},{"given":"Marina","family":"Blanton","sequence":"additional","affiliation":[]},{"given":"Nitesh V.","family":"Chawla","sequence":"additional","affiliation":[]},{"given":"Keith","family":"Frikken","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1613\/jair.1509","volume":"23","author":"N.V. Chawla","year":"2005","unstructured":"Chawla, N.V., Karakoulas, G.: Learning from labeled and unlabeled data: An empirical study across techniques and domains. JAIR\u00a023, 331\u2013366 (2005)","journal-title":"JAIR"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damgard, I., Nielsen, J.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013299. Springer, Heidelberg (2001)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Damgard, I., Jurik, M.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. In: PKC, pp. 90\u2013104 (2001)","DOI":"10.1007\/3-540-44586-2_9"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial Cryptography","author":"P. Fouque","year":"2001","unstructured":"Fouque, P., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, pp. 90\u2013104. Springer, Heidelberg (2001)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Freedman","year":"2004","unstructured":"Freedman, M., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-72738-5_16","volume-title":"Applied Cryptography and Network Security","author":"K. Frikken","year":"2007","unstructured":"Frikken, K.: Privacy-preserving set union. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 237\u2013252. Springer, Heidelberg (2007)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Heckman, J.: Sample selection bias as a specification error. Econometrica: Journal of the econometric society, 153\u2013161 (1979)","DOI":"10.2307\/1912352"},{"issue":"9","key":"23_CR8","first-page":"1026","volume":"16","author":"M. Kantarcioglu","year":"2004","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE TKDE\u00a016(9), 1026\u20131037 (2004)","journal-title":"IEEE TKDE"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L. Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"23_CR10","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography (1996)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT 1999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public key cryptosystem based on composite degree residue classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Raeder, T., Blanton, M., Chawla, N., Frikken, K.: Privacy-preserving network aggregation. Technical Report TR-2010-02, Notre Dame Computer Science and Engineering (2010)","DOI":"10.1007\/978-3-642-13657-3_23"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Raeder, T., Chawla, N.: Modeling a store\u2019s product space as a social network. In: Proceedings of ASONAM, Athens, Greece (2009)","DOI":"10.1109\/ASONAM.2009.53"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1006\/jeth.1996.0117","volume":"71","author":"M. Raith","year":"1996","unstructured":"Raith, M.: A general model of information sharing in oligopoly. Journal of Economic Theory\u00a071(1), 260\u2013288 (1996)","journal-title":"Journal of Economic Theory"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1145\/775047.775142","volume-title":"Proceedings of KDD 2002","author":"J. Vaidya","year":"2002","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: Proceedings of KDD 2002, pp. 639\u2013644. ACM, New York (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13657-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:48:17Z","timestamp":1558277297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13657-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642136566","9783642136573"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13657-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}