{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:04:12Z","timestamp":1746331452153,"version":"3.40.4"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319085050"},{"type":"electronic","value":"9783319085067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08506-7_11","type":"book-chapter","created":{"date-parts":[[2014,6,20]],"date-time":"2014-06-20T01:39:22Z","timestamp":1403228362000},"page":"204-223","source":"Crossref","is-referenced-by-count":17,"title":["Do Dummies Pay Off? Limits of Dummy Traffic Protection in Anonymous Communications"],"prefix":"10.1007","author":[{"given":"Simon","family":"Oya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmela","family":"Troncoso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"P\u00e9rez-Gonz\u00e1lez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Danezis, G., Diaz, C., Syverson, P.: Systems for anonymous communication. In: Rosenberg, B. (ed.) Handbook of Financial Cryptography and Security. Cryptography and Network Security Series, pp. 341\u2013389. Chapman & Hall\/CRC (2009)","key":"11_CR1","DOI":"10.1201\/9781420059823-c13"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM\u00a024(2), 84\u201390 (1981)","journal-title":"Communications of the ACM"},{"issue":"6","key":"11_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/MSECP.2003.1253565","volume":"1","author":"D. Agrawal","year":"2003","unstructured":"Agrawal, D., Kesdogan, D.: Measuring anonymity: The disclosure attack. IEEE Security and Privacy\u00a01(6), 27\u201334 (2003)","journal-title":"IEEE Security and Privacy"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-03168-7_4","volume-title":"Privacy Enhancing Technologies","author":"G. Danezis","year":"2009","unstructured":"Danezis, G., Troncoso, C.: Vida: How to use bayesian inference to de-anonymize persistent communications. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol.\u00a05672, pp. 56\u201372. Springer, Heidelberg (2009)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11423409_2","volume-title":"Privacy Enhancing Technologies","author":"N. Mathewson","year":"2005","unstructured":"Mathewson, N., Dingledine, R.: Practical traffic analysis: Extending and resisting statistical disclosure. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol.\u00a03424, pp. 17\u201334. Springer, Heidelberg (2005)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-31680-7_3","volume-title":"Privacy Enhancing Technologies","author":"F. P\u00e9rez-Gonz\u00e1lez","year":"2012","unstructured":"P\u00e9rez-Gonz\u00e1lez, F., Troncoso, C.: Understanding statistical disclosure: A least squares approach. In: Fischer-H\u00fcbner, S., Wright, M. (eds.) PETS 2012. LNCS, vol.\u00a07384, pp. 38\u201357. Springer, Heidelberg (2012)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-36467-6_9","volume-title":"Privacy Enhancing Technologies","author":"O. Berthold","year":"2003","unstructured":"Berthold, O., Langos, H.: Dummy traffic against long term intersection attacks. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol.\u00a02482, pp. 110\u2013128. Springer, Heidelberg (2003)"},{"unstructured":"Diaz, C., Preneel, B.: Taxonomy of mixes and dummy traffic. In: Working Conference on Privacy and Anonymity in Networked and Distributed Systems, pp. 215\u2013230. Kluwer Academic Publishers (2004)","key":"11_CR8"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-30114-1_22","volume-title":"Information Hiding","author":"C. D\u00edaz","year":"2004","unstructured":"D\u00edaz, C., Preneel, B.: Reasoning about the anonymity provided by pool mixes that generate dummy traffic. In: Fridrich, J. (ed.) IH 2004. LNCS, vol.\u00a03200, pp. 309\u2013325. Springer, Heidelberg (2004)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-540-74835-9_36","volume-title":"Computer Security \u2013 ESORICS 2007","author":"N. Mallesh","year":"2007","unstructured":"Mallesh, N., Wright, M.: Countering statistical disclosure with receiver-bound cover traffic. In: Biskup, J., L\u00f3pez, J. (eds.) ESORICS 2007. LNCS, vol.\u00a04734, pp. 547\u2013562. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: Design of a type iii anonymous remailer protocol. In: IEEE Symposium on Security and Privacy, pp. 2\u201315. IEEE Computer Society (2003)","key":"11_CR11","DOI":"10.1109\/SECPRI.2003.1199323"},{"unstructured":"M\u00f6ller, U., Cottrell, L., Palfrader, P., Sassaman, L.: Mixmaster Protocol \u2014 Version 2. IETF Internet Draft (July 2003)","key":"11_CR12"},{"unstructured":"P\u00e9rez-Gonz\u00e1lez, F., Troncoso, C., Oya, S.: A least squares approach to the traffic analysis of high-latency anonymous communication systems, http:\/\/webs.uvigo.es\/gpscuvigo\/sites\/default\/files\/publications\/lsda2013.pdf","key":"11_CR13"},{"doi-asserted-by":"crossref","unstructured":"Oya, S., Troncoso, C., P\u00e9rez-Gonz\u00e1lez, F.: Meet the family of statistical disclosure attacks. In: IEEE Global Conference on Signal and Information Processing, 4p. (2013)","key":"11_CR14","DOI":"10.1109\/GlobalSIP.2013.6736858"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-40956-4_2","volume-title":"Privacy Enhancing Technologies","author":"C. D\u00edaz","year":"2003","unstructured":"D\u00edaz, C., Serjantov, A.: Generalising mixes. In: Dingledine, R. (ed.) PET 2003. LNCS, vol.\u00a02760, pp. 18\u201331. Springer, Heidelberg (2003)"},{"unstructured":"Oya, S., Troncoso, C., P\u00e9rez-Gonz\u00e1lez, F.: Technical report tsc\/so\/02052014: Derivation of the mean squared error of the least squares estimator in a timed pool mix with dummy traffic, http:\/\/webs.uvigo.es\/gpscuvigo\/sites\/default\/files\/publications\/trpets14.pdf","key":"11_CR16"},{"unstructured":"Haykin, S.: Adaptive Filter Theory, 4th edn. Prentice Hall (2002)","key":"11_CR17"}],"container-title":["Lecture Notes in Computer Science","Privacy Enhancing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08506-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T11:56:40Z","timestamp":1746273400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08506-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319085050","9783319085067"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08506-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}