{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:45:59Z","timestamp":1742913959777,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642203046"},{"type":"electronic","value":"9783642203053"}],"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-20305-3_9","type":"book-chapter","created":{"date-parts":[[2011,4,5]],"date-time":"2011-04-05T02:55:14Z","timestamp":1301972114000},"page":"100-107","source":"Crossref","is-referenced-by-count":3,"title":["Reduce to the Max: A Simple Approach for Massive-Scale Privacy-Preserving Collaborative Network Measurements (Short Paper)"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Ricciato","sequence":"first","affiliation":[]},{"given":"Martin","family":"Burkhart","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Roughan, M., Zhang, Y.: Secure distributed data-mining and its application to large-scale network measurements. ACM Computer Communication Review\u00a036(1) (2006)","DOI":"10.1145\/1111322.1111326"},{"key":"9_CR2","unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics. In: 19th USENIX Security Symposium, Washington, DC, USA (August 2010)"},{"key":"9_CR3","volume-title":"ACM symposium on Theory of Computing","author":"C. Gentry","year":"2009","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: ACM symposium on Theory of Computing. ACM, New York (2009)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: ACM Symp. on Theory of computing, STOC (1988)","DOI":"10.1145\/62212.62213"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Atallah, M., Bykova, M., Li, J., Frikken, K., Topkara, M.: Private collaborative forecasting and benchmarking. In: Proc. ACM WPES 2004 (October 2004)","DOI":"10.1145\/1029179.1029204"},{"key":"9_CR6","unstructured":"Ricciato, F., Burkhart, M.: Reduce to the max: A simple approach for massive-scale privacy-preserving collaborative network measurements (extended version). CoRR, vol. abs\/1101.5509 (2011), http:\/\/arxiv.org\/abs\/1101.5509"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A. Broder","year":"2004","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. Internet Mathematics\u00a01(4), 485\u2013509 (2004)","journal-title":"Internet Mathematics"},{"key":"9_CR8","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)"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology\u00a01(1), 65\u201375 (1988)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Traffic Monitoring and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20305-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T13:41:21Z","timestamp":1560087681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20305-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642203046","9783642203053"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20305-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]]}}}