{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:18:13Z","timestamp":1783009093558,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T00:00:00Z","timestamp":1193529600000},"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":[],"published-print":{"date-parts":[[2007,10,28]]},"DOI":"10.1145\/1315245.1315258","type":"proceedings-article","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T14:30:20Z","timestamp":1195137020000},"page":"92-102","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":90,"title":["Denial of service or denial of security?"],"prefix":"10.1145","author":[{"given":"Nikita","family":"Borisov","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George","family":"Danezis","sequence":"additional","affiliation":[{"name":"K.U. Leuven, Leuven, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prateek","family":"Mittal","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Parisa","family":"Tabriz","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,10,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1314333.1314336"},{"key":"e_1_3_2_1_2_1","volume-title":"IEEE Symposium on Security and Privacy","author":"Bellovin S. M.","year":"2003","unstructured":"S. M. Bellovin and D. A. Wagner , editors . IEEE Symposium on Security and Privacy , Berkeley, CA , May 2003 . IEEE Computer Society. S. M. Bellovin and D. A. Wagner, editors. IEEE Symposium on Security and Privacy, Berkeley, CA, May 2003. IEEE Computer Society."},{"key":"e_1_3_2_1_3_1","first-page":"30","volume-title":"Federrath {13}","author":"Berthold O.","unstructured":"O. Berthold , A. Pfitzmann , and R. Standtke . The disadvantages of free MIX routes and how to overcome them . In Federrath {13} , pages 30 -- 45 . O. Berthold, A. Pfitzmann, and R. Standtke. The disadvantages of free MIX routes and how to overcome them. In Federrath {13}, pages 30--45."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_5_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-46429-8_25","volume-title":"Computer Performance Evaluation: Modelling Techniques and Tools","author":"Daly D.","year":"2000","unstructured":"D. Daly , D. D. Deavours , J. M. Doyle , P. G. Webster , and W. H. Sanders . M\u00f6bius: An extensible tool for performance and dependability modeling . In B. R. Haverkort, H. C. Bohnenkamp, and C. U. Smith, editors, Computer Performance Evaluation: Modelling Techniques and Tools , volume 1786 of Lecture Notes in Computer Science , pages 332 -- 336 , Schaumburg, IL , Mar. 2000 . Springer . D. Daly, D. D. Deavours, J. M. Doyle, P. G. Webster, and W. H. Sanders. M\u00f6bius: An extensible tool for performance and dependability modeling. In B. R. Haverkort, H. C. Bohnenkamp, and C. U. Smith, editors, Computer Performance Evaluation: Modelling Techniques and Tools, volume 1786 of Lecture Notes in Computer Science, pages 332--336, Schaumburg, IL, Mar. 2000. Springer."},{"key":"e_1_3_2_1_6_1","first-page":"2","volume-title":"Bellovin and Wagner {2}","author":"Danezis G.","unstructured":"G. Danezis , R. Dingledine , and N. Mathewson . Mixminion: Design of a Type III Anonymous Remailer Protocol . In Bellovin and Wagner {2} , pages 2 -- 15 . G. Danezis, R. Dingledine, and N. Mathewson. Mixminion: Design of a Type III Anonymous Remailer Protocol. In Bellovin and Wagner {2}, pages 2--15."},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/3-540-45496-9_10","volume-title":"Information Hiding","author":"Dingledine R.","year":"2001","unstructured":"R. Dingledine , M. J. Freedman , D. Hopwood , and D. Molnar . A reputation system to increase MIX-net reliability . In I. S. Moskowitz, editor, Information Hiding , volume 2137 of Lecture Notes in Computer Science , pages 126 -- 141 , Pittsburgh, PA , 2001 . Springer Berlin\/Heidelberg . R. Dingledine, M. J. Freedman, D. Hopwood, and D. Molnar. A reputation system to increase MIX-net reliability. In I. S. Moskowitz, editor, Information Hiding, volume 2137 of Lecture Notes in Computer Science, pages 126--141, Pittsburgh, PA, 2001. Springer Berlin\/Heidelberg."},{"key":"e_1_3_2_1_8_1","volume-title":"Fifth Workshop on the Economics of Information Security (WEIS)","author":"Dingledine R.","year":"2006","unstructured":"R. Dingledine and N. Mathewson . Anonymity loves company: Usability and the network effect. In R. Anderson, editor , Fifth Workshop on the Economics of Information Security (WEIS) , Cambridge, UK , June 2006 . R. Dingledine and N. Mathewson. Anonymity loves company: Usability and the network effect. In R. Anderson, editor, Fifth Workshop on the Economics of Information Security (WEIS), Cambridge, UK, June 2006."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"R.\n      Dingledine V.\n      Shmatikov and \n      P. F.\n      Syverson\n  . \n  Synchronous batching: From cascades to free routes\n  . In D. Martin and A. Serjantov editors 4th Privacy Enhancing Technologies Workshop (PET) volume \n  3424\n   of \n  Lecture Notes in Computer Science pages \n  186\n  --\n  206 Toronto Canada May \n  2004\n  . \n  Springer Berlin\/Heidelberg\n  .  R. Dingledine V. Shmatikov and P. F. Syverson. Synchronous batching: From cascades to free routes. In D. Martin and A. Serjantov editors 4th Privacy Enhancing Technologies Workshop (PET) volume 3424 of Lecture Notes in Computer Science pages 186--206 Toronto Canada May 2004. Springer Berlin\/Heidelberg.","DOI":"10.1007\/11423409_12"},{"key":"e_1_3_2_1_11_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-36504-4_18","volume-title":"Financial Cryptography","author":"Dingledine R.","year":"2003","unstructured":"R. Dingledine and P. F. Syverson . Reliable MIX cascade networks through reputation . In M. Blaze, editor, Financial Cryptography , volume 2357 of Lecture Notes in Computer Science , pages 253 -- 268 , Southampton, Bermuda , 2003 . Springer Berlin\/Heidelberg . R. Dingledine and P. F. Syverson. Reliable MIX cascade networks through reputation. In M. Blaze, editor, Financial Cryptography, volume 2357 of Lecture Notes in Computer Science, pages 253--268, Southampton, Bermuda, 2003. Springer Berlin\/Heidelberg."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/646334.687813"},{"key":"e_1_3_2_1_13_1","volume-title":"Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability","volume":"2009","author":"Federrath H.","year":"2000","unstructured":"H. Federrath , editor. Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability , volume 2009 of Lecture Notes in Computer Science. Springer Berlin\/Heidelberg , July 2000 . H. Federrath, editor. Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, volume 2009 of Lecture Notes in Computer Science. Springer Berlin\/Heidelberg, July 2000."},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"Advances in Cryptology (CRYPTO)","author":"Furukawa J.","year":"2001","unstructured":"J. Furukawa and K. Sako . An efficient scheme for proving a shuffle . In J. Kilian, editor, Advances in Cryptology (CRYPTO) , volume 2139 of Lecture Notes in Computer Science , pages 368 -- 387 , Santa Barbara, CA , USA, 19-23 August 2001 . Springer Berlin\/Heidelberg . J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. In J. Kilian, editor, Advances in Cryptology (CRYPTO), volume 2139 of Lecture Notes in Computer Science, pages 368--387, Santa Barbara, CA, USA, 19-23 August 2001. Springer Berlin\/Heidelberg."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030113"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"M.\n      Gomu\u0142kiewicz M.\n      Klonowski and \n      M.\n      Kuty\u0142owski\n  . \n  Provable unlinkability against traffic analysis already after O(log(n)) steps! In K\n  . Zhang and Y. Zheng editors Information Security Conference volume \n  3225\n   of \n  Lecture Notes in Computer Science pages \n  354\n  --\n  366 Palo Alto CA Sept. \n  2004\n  . \n  Springer Berlin\/Heidelberg\n  .  M. Gomu\u0142kiewicz M. Klonowski and M. Kuty\u0142owski. Provable unlinkability against traffic analysis already after O(log(n)) steps! In K. Zhang and Y. Zheng editors Information Security Conference volume 3225 of Lecture Notes in Computer Science pages 354--366 Palo Alto CA Sept. 2004. Springer Berlin\/Heidelberg.","DOI":"10.1007\/978-3-540-30144-8_30"},{"key":"e_1_3_2_1_17_1","first-page":"2","volume-title":"Mixing E-mail with Babel. In Network and Distributed Security Symposium (NDSS)","author":"G\u00fclc\u00fc C.","year":"1996","unstructured":"C. G\u00fclc\u00fc and G. Tsudik . Mixing E-mail with Babel. In Network and Distributed Security Symposium (NDSS) , pages 2 -- 16 , San Diego, CA , February 1996 . Internet Society. C. G\u00fclc\u00fc and G. Tsudik. Mixing E-mail with Babel. In Network and Distributed Security Symposium (NDSS), pages 2--16, San Diego, CA, February 1996. Internet Society."},{"key":"e_1_3_2_1_18_1","first-page":"1","volume-title":"IFIP TC-6TC-11 Conference on Communications and Multimedia Security","author":"Iwanik J.","year":"2004","unstructured":"J. Iwanik , M. Klonowski , and M. Kuty\u0142owski . DUO-Onions and Hydra-Onions. failure and adversary resistant onion protocols . In IFIP TC-6TC-11 Conference on Communications and Multimedia Security , pages 1 -- 15 , Windermere, United Kingdom , September 2004 . Springer Boston . J. Iwanik, M. Klonowski, and M. Kuty\u0142owski. DUO-Onions and Hydra-Onions. failure and adversary resistant onion protocols. In IFIP TC-6TC-11 Conference on Communications and Multimedia Security, pages 1--15, Windermere, United Kingdom, September 2004. Springer Boston."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/647253.720294"},{"key":"e_1_3_2_1_20_1","volume-title":"July","author":"M\u00f6ller U.","year":"2003","unstructured":"U. M\u00f6ller , L. Cottrell , P. Palfrader , and L. Sassaman . Mixmaster Protocol - Version 2. Draft, available at: http:\/\/www.abditum.com\/mixmaster-spec.txt , July 2003 . U. M\u00f6ller, L. Cottrell, P. Palfrader, and L. Sassaman. Mixmaster Protocol - Version 2. Draft, available at: http:\/\/www.abditum.com\/mixmaster-spec.txt, July 2003."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180409"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502000"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11957454_13"},{"key":"e_1_3_2_1_24_1","unstructured":"P. Palfrader. Number of Running Tor Routers. http:\/\/www.noreply.org\/tor-running-routers\/ 2007.  P. Palfrader. Number of Running Tor Routers. http:\/\/www.noreply.org\/tor-running-routers\/ 2007."},{"key":"e_1_3_2_1_25_1","series-title":"Lecture Notes in Computer Science","first-page":"248","volume-title":"Advances in Cryptology(EUROCRYPT)","author":"Park C.","year":"1993","unstructured":"C. Park , K. Itoh , and K. Kurosawa . Efficient anonymous channel and all\/nothing election scheme . In T. Helleseth, editor, Advances in Cryptology(EUROCRYPT) , volume 765 of Lecture Notes in Computer Science , pages 248 -- 259 , Lofthus, Norway , 23-27 May 1993 . Springer Berlin\/Heidelberg . C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all\/nothing election scheme. In T. Helleseth, editor, Advances in Cryptology(EUROCRYPT), volume 765 of Lecture Notes in Computer Science, pages 248--259, Lofthus, Norway, 23-27 May 1993. Springer Berlin\/Heidelberg."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/646591.697650"},{"key":"e_1_3_2_1_27_1","first-page":"96","volume-title":"Federrath {13}","author":"Syverson P.","unstructured":"P. Syverson , G. Tsudik , M. Reed , and C. Landwehr . Towards an analysis of onion routing security . In Federrath {13} , pages 96 -- 114 . P. Syverson, G. Tsudik, M. Reed, and C. Landwehr. Towards an analysis of onion routing security. In Federrath {13}, pages 96--114."},{"key":"e_1_3_2_1_28_1","volume-title":"Network and Distributed Security Symposium (NDSS). Internet Society","author":"Wright M.","year":"2002","unstructured":"M. Wright , M. Adler , B. N. Levine , and C. Shields . An analysis of the degradation of anonymous protocols . In Network and Distributed Security Symposium (NDSS). Internet Society , February 2002 . M. Wright, M. Adler, B. N. Levine, and C. Shields. An analysis of the degradation of anonymous protocols. In Network and Distributed Security Symposium (NDSS). Internet Society, February 2002."},{"key":"e_1_3_2_1_29_1","unstructured":"M. Wright M. Adler B. N. Levine and C. Shields. Defending anonymous communication against passive logging attacks. In Bellovin and Wagner {2}.   M. Wright M. Adler B. N. Levine and C. Shields. Defending anonymous communication against passive logging attacks. In Bellovin and Wagner {2}."},{"key":"e_1_3_2_1_30_1","volume-title":"USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Zhuang L.","year":"2005","unstructured":"L. Zhuang , F. Zhou , B. Y. Zhao , and A. Rowstron . Cashmere: Resilient anonymous routing . In USENIX Symposium on Networked Systems Design and Implementation (NSDI) , Boston, MA , May 2005 . L. Zhuang, F. Zhou, B. Y. Zhao, and A. Rowstron. Cashmere: Resilient anonymous routing. In USENIX Symposium on Networked Systems Design and Implementation (NSDI), Boston, MA, May 2005."}],"event":{"name":"CCS07: 14th ACM Conference on Computer and Communications Security 2007","location":"Alexandria Virginia USA","acronym":"CCS07","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 14th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1315245.1315258","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1315245.1315258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:12Z","timestamp":1750254972000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1315245.1315258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,28]]},"references-count":30,"alternative-id":["10.1145\/1315245.1315258","10.1145\/1315245"],"URL":"https:\/\/doi.org\/10.1145\/1315245.1315258","relation":{},"subject":[],"published":{"date-parts":[[2007,10,28]]},"assertion":[{"value":"2007-10-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}