{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:19Z","timestamp":1750308139497,"version":"3.41.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2006,1,10]],"date-time":"2006-01-10T00:00:00Z","timestamp":1136851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2006,1,10]]},"abstract":"<jats:p>\n            The rapid growth of the Internet over the last decade has been startling. However, efforts to track its growth have often fallen afoul of bad data --- for instance, how much traffic does the Internet now carry? The problem is not that the data is technically hard to obtain, or that it does not exist, but rather that the data is not shared. Obtaining an overall picture requires data from multiple sources, few of whom are open to sharing such data, either because it violates privacy legislation, or exposes business secrets. Likewise, detection of global Internet health problems is hampered by a lack of data sharing. The approaches used so far in the Internet,\n            <jats:italic>e.g.<\/jats:italic>\n            trusted third parties, or data anonymization, have been only partially successful, and are not widely adopted.The paper presents a method for performing computations on shared data\n            <jats:italic>without any participants revealing their secret data<\/jats:italic>\n            . For example, one can compute the sum of traffic over a set of service providers without any service provider learning the traffic of another. The method is simple, scalable, and flexible enough to perform a wide range of valuable operations on Internet data.\n          <\/jats:p>","DOI":"10.1145\/1111322.1111326","type":"journal-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T18:14:10Z","timestamp":1139249650000},"page":"7-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Secure distributed data-mining and its application to large-scale network measurements"],"prefix":"10.1145","volume":"36","author":[{"given":"Matthew","family":"Roughan","sequence":"first","affiliation":[{"name":"University of Adelaide, Australia"}]},{"given":"Yin","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX"}]}],"member":"320","published-online":{"date-parts":[[2006,1,10]]},"reference":[{"volume-title":"Introduced in Senate of the United States","year":"2003","key":"e_1_2_1_1_1","unstructured":"Data-mining moratorium act of 2003. Introduced in Senate of the United States in January 2003 . http:\/\/thomas.loc.gov\/cgi-bin\/query\/z?c108:S.188:. Data-mining moratorium act of 2003. Introduced in Senate of the United States in January 2003. http:\/\/thomas.loc.gov\/cgi-bin\/query\/z?c108:S.188:."},{"key":"e_1_2_1_2_1","volume-title":"http:\/\/www.abs.gov.au\/Ausstats\/abs@.nsf\/0\/6445f12663006b83ca256a150079564d? OpenDocument","author":"Activity Internet","year":"2005","unstructured":"Internet Activity , Australia. http:\/\/www.abs.gov.au\/Ausstats\/abs@.nsf\/0\/6445f12663006b83ca256a150079564d? OpenDocument , 2005 . Internet Activity, Australia. http:\/\/www.abs.gov.au\/Ausstats\/abs@.nsf\/0\/6445f12663006b83ca256a150079564d? OpenDocument, 2005."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029179.1029204"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637210"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637210"},{"key":"e_1_2_1_6_1","first-page":"251","volume-title":"Proc. Advances in Cryptology (CRYPTO'86)","author":"Benaloh J.","year":"1987","unstructured":"J. Benaloh . Secret sharing homomorphisms: Keeping shares of a secret secret . In Proc. Advances in Cryptology (CRYPTO'86) , pages 251 -- 260 , 1987 . J. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret. In Proc. Advances in Cryptology (CRYPTO'86), pages 251--260, 1987."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_13"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 14th Systems Administration Conference (LISA 2000","author":"Brutag J. D.","year":"2000","unstructured":"J. D. Brutag . Aberrant behavior detection and control in time series for network monitoring . In Proceedings of the 14th Systems Administration Conference (LISA 2000 ),New Orleans, LA, USA , December 2000 . USENIX. J. D. Brutag. Aberrant behavior detection and control in time series for network monitoring. In Proceedings of the 14th Systems Administration Conference (LISA 2000),New Orleans, LA, USA, December 2000. USENIX."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/772862.772867"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the International Conference on Very Large Data Bases","author":"Cormode G.","year":"2005","unstructured":"G. Cormode and M. arofalakis. Sketching streams through the net: Distributed approximate query tracking . In Proceedings of the International Conference on Very Large Data Bases , 2005 . G. Cormode and M. arofalakis. Sketching streams through the net: Distributed approximate query tracking. In Proceedings of the International Conference on Very Large Data Bases, 2005."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24698-5_7"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065201"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872838"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863972"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/285237.285287"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.826367"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948236"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028813"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015492"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-001-0019-2"},{"key":"e_1_2_1_22_1","volume-title":"Algorithms and applications","author":"Muthukrishnan S.","year":"2003","unstructured":"S. Muthukrishnan . Data streams : Algorithms and applications , 2003 . Manuscript based on invited talk from 14th SODA. Available from http:\/\/www.cs.rutgers.edu\/~muthu\/stream-1-1.ps. S. Muthukrishnan. Data streams: Algorithms and applications, 2003. Manuscript based on invited talk from 14th SODA. Available from http:\/\/www.cs.rutgers.edu\/~muthu\/stream-1-1.ps."},{"key":"e_1_2_1_23_1","first-page":"1","volume-title":"B. B. Dingel, W. Weiershausen, A. K. Dutta, and K.-I","author":"Odlyzko A. M.","year":"2003","unstructured":"A. M. Odlyzko . Internet traffic growth: Sources and implications . In B. B. Dingel, W. Weiershausen, A. K. Dutta, and K.-I . Sato, editors, Optical Transmission Systems and Equipment for WDM Networking II, volume 5247 , pages 1 -- 15 . Proc. SPIE , 2003 . A. M. Odlyzko. Internet traffic growth: Sources and implications. In B. B. Dingel, W. Weiershausen, A. K. Dutta, and K.-I. Sato, editors, Optical Transmission Systems and Equipment for WDM Networking II, volume 5247, pages 1--15. Proc. SPIE, 2003."},{"key":"e_1_2_1_24_1","unstructured":"T. Oetiker. RRDtool. http:\/\/people.ee.ethz.ch\/~oetiker\/webtools\/rrdtool\/.  T. Oetiker. RRDtool. http:\/\/people.ee.ethz.ch\/~oetiker\/webtools\/rrdtool\/."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863994"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505233"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1016687.1016703"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/974121.974131"},{"key":"e_1_2_1_30_1","volume-title":"ICNP","author":"Xu J.","year":"2002","unstructured":"J. Xu , J. Fan , M. Ammar , and S. Moon . Prefix-preserving IP address anonymization: Measurement-based security evaluation and a new cryptography-based scheme . In ICNP , Paris , November 2002 . J. Xu, J. Fan, M. Ammar, and S. Moon. Prefix-preserving IP address anonymization: Measurement-based security evaluation and a new cryptography-based scheme. In ICNP, Paris, November 2002."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_2_1_32_1","first-page":"160","volume-title":"Proc. of the 23th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"Yao A.","year":"1986","unstructured":"A. Yao . Protocols for secure computations . In Proc. of the 23th IEEE Symposium on Foundations of Computer Science (FOCS) , pages 160 -- 164 , 1986 . A. Yao. Protocols for secure computations. In Proc. of the 23th IEEE Symposium on Foundations of Computer Science (FOCS), pages 160--164, 1986."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251086.1251116"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/781027.781053"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111322.1111326","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1111322.1111326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:39Z","timestamp":1750262919000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111322.1111326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1,10]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,1,10]]}},"alternative-id":["10.1145\/1111322.1111326"],"URL":"https:\/\/doi.org\/10.1145\/1111322.1111326","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2006,1,10]]},"assertion":[{"value":"2006-01-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}