{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T15:47:28Z","timestamp":1772380048147,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642145261","type":"print"},{"value":"9783642145278","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14527-8_4","type":"book-chapter","created":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T05:31:56Z","timestamp":1278480716000},"page":"56-74","source":"Crossref","is-referenced-by-count":24,"title":["Collaborative, Privacy-Preserving Data Aggregation at Scale"],"prefix":"10.1007","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]},{"given":"Haakon","family":"Ringberg","sequence":"additional","affiliation":[]},{"given":"Michael J.","family":"Freedman","sequence":"additional","affiliation":[]},{"given":"Matthew","family":"Caesar","sequence":"additional","affiliation":[]},{"given":"Jennifer","family":"Rexford","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Alexa the Web Information Company (2010), http:\/\/www.alexa.com\/"},{"key":"4_CR2","unstructured":"Allman, M., Blanton, E., Paxson, V., Shenker, S.: Fighting coordinated attackers with cross-organizational information sharing. In: HotNets (November 2006)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: A system for secure multi-party computation. In: CCS (October 2008)","DOI":"10.1145\/1455770.1455804"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC (1988)","DOI":"10.1145\/62212.62213"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P. Bogetoft","year":"2009","unstructured":"Bogetoft, P., Christensen, D.L., Damgard, I., Geisler, M., Jakobsen, T., Kr\u00f8igaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 325\u2013343. Springer, Heidelberg (2009)"},{"key":"4_CR6","unstructured":"Burrows, M.: The Chubby lock service for loosely-coupled distributed systems. In: OSDI (November 2006)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/3-540-48184-2_43","volume-title":"Advances in Cryptology - CRYPTO 1987","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.B.: Multiparty unconditionally secure protocols. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 462\u2013462. Springer, Heidelberg (1988)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. J. ACM\u00a045(6) (November 1998)","DOI":"10.1145\/293347.293350"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-03356-8_11","volume-title":"CRYPTO 2009","author":"R. Cramer","year":"2009","unstructured":"Cramer, R., Damg\u00e5rd, I.: On the amortized complexity of zero-knowledge protocols. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 177\u2013191. Springer, Heidelberg (2009)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-01957-9_8","volume-title":"Applied Cryptography and Network Security","author":"D. Dachman-Soled","year":"2009","unstructured":"Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient robust private set intersection. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol.\u00a05536, pp. 125\u2013142. Springer, Heidelberg (2009)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router. In: USENIX Technical (August 2004)","DOI":"10.21236\/ADA465464"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"J.R. Douceur","year":"2002","unstructured":"Douceur, J.R.: The Sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 251. Springer, Heidelberg (2002)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Fagin, R., Naor, M., Winkler, P.: Comparing information without leaking it. Comm. ACM\u00a039(5) (1996)","DOI":"10.1145\/229459.229469"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Reiter, M.K.: Fair exchange with a semi-trusted third party (extended abstract). In: CCS (April 1997)","DOI":"10.1145\/266420.266424"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","volume-title":"Theory of Cryptography","author":"M.J. Freedman","year":"2005","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 303\u2013324. Springer, Heidelberg (2005)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M.J. Freedman","year":"2004","unstructured":"Freedman, M.J., 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":"4_CR17","unstructured":"Friend-of-a-Friend Project (2009), http:\/\/www.foaf-project.org\/"},{"key":"4_CR18","unstructured":"Garriss, S., Kaminsky, M., Freedman, M.J., Karp, B., Mazi\u00e8res, D., Yu, H.: Re: Reliable email. In: NSDI (May 2006)"},{"key":"4_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game (extended abstract). In: STOC (May 1987)","DOI":"10.1145\/28395.28420"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS\u00a028 (1984)","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Computing\u00a018 (1989)","DOI":"10.1137\/0218012"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-78524-8_10","volume-title":"Theory of Cryptography","author":"C. Hazay","year":"2008","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 155\u2013175. Springer, Heidelberg (2008)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y. Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 145\u2013161. Springer, Heidelberg (2003)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Jung, J., Sit, E., Balakrishnan, H., Morris, R.: DNS performance and the effectiveness of caching. IEEE\/ACM Trans. Networking\u00a010(5) (October 2002)","DOI":"10.1109\/TNET.2002.803905"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, p. 36. Springer, Heidelberg (2000)"},{"key":"4_CR28","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay: A secure two-party computation system. In: USENIX Security (August 2004)"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Mao, Z., Sekar, V., Spatscheck, O., van der Merwe, J., Vasudevan, R.: Analyzing large DDoS attacks using multiple data sources. In: SIGCOMM LSAD (September 2006)","DOI":"10.1145\/1162666.1162675"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC (May 1999)","DOI":"10.1145\/301250.301312"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/3-540-48405-1_36","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, p. 573. Springer, Heidelberg (1999)"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA (January 2001)","DOI":"10.1007\/3-540-44448-3_16"},{"key":"4_CR33","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudorandom functions. In: FOCS (October 1997)"},{"key":"4_CR34","unstructured":"Poole, L., Pai, V.S.: ConfiDNS: Leveraging scale and history to improve DNS security. In: WORLDS (November 2006)"},{"key":"4_CR35","unstructured":"Privacy Rights Clearinghouse. A chronology of data breaches (January 2009), http:\/\/www.privacyrights.org\/ar\/ChronDataBreaches.htm"},{"key":"4_CR36","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Tech. Rep. TR-81, Harvard Aiken Computation Lab. (1981)"},{"key":"4_CR37","unstructured":"Rajab, M.A., Zarfoss, J., Monrose, F., Terzis, A.: My botnet is bigger than yours (maybe, better than yours): Why size estimates remain challenging. In: HotBots (April 2007)"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Ramachandran, A., Feamster, N.: Understanding the network-level behavior of spammers. In: SIGCOMM (September 2006)","DOI":"10.1145\/1159913.1159947"},{"key":"4_CR39","unstructured":"Ringberg, H., Soule, A., and Caesar, M. Evaluating the potential of collaborative anomaly detection (2008) (manuscript)"},{"key":"4_CR40","unstructured":"Schechter, S., Jung, J., Stockwell, W., McLain, C.: Inoculating SSH against address harvesting. In: NDSS (Feburary 2006)"},{"key":"4_CR41","unstructured":"Wendlandt, D., Andersen, D.G., Perrig, A.: Perspectives: Improving SSH-style host authentication with multi-path probing. In: USENIX Technical (June 2008)"},{"key":"4_CR42","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: FOCS (November 1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Privacy Enhancing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14527-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T14:04:00Z","timestamp":1591452240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14527-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145261","9783642145278"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14527-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}