{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:38:22Z","timestamp":1752230302766,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316791"},{"type":"electronic","value":"9783642316807"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31680-7_3","type":"book-chapter","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T17:40:32Z","timestamp":1340818832000},"page":"38-57","source":"Crossref","is-referenced-by-count":18,"title":["Understanding Statistical Disclosure: A Least Squares Approach"],"prefix":"10.1007","author":[{"given":"Fernando","family":"P\u00e9rez-Gonz\u00e1lez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmela","family":"Troncoso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"3_CR1","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 & Privacy\u00a01(6), 27\u201334 (2003)","journal-title":"IEEE Security & Privacy"},{"issue":"2","key":"3_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"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Danezis, G.: Statistical disclosure attacks: Traffic confirmation in open environments. In: Gritzalis, Vimercati, Samarati, Katsikas (eds.) Proceedings of Security and Privacy in the Age of Uncertainty (SEC 2003), Athens. IFIP TC11, pp. 421\u2013426. Kluwer (May 2003)","DOI":"10.1007\/978-0-387-35691-4_40"},{"key":"3_CR4","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)","DOI":"10.1201\/9781420059823-c13"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-75551-7_3","volume-title":"Privacy Enhancing Technologies","author":"G. Danezis","year":"2007","unstructured":"Danezis, G., Diaz, C., Troncoso, C.: Two-Sided Statistical Disclosure Attack. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol.\u00a04776, pp. 30\u201344. Springer, Heidelberg (2007)"},{"key":"3_CR6","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 (S&P 2003), pp. 2\u201315. IEEE Computer Society (2003)","DOI":"10.1109\/SECPRI.2003.1199323"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-30114-1_21","volume-title":"Information Hiding","author":"G. Danezis","year":"2004","unstructured":"Danezis, G., Serjantov, A.: Statistical Disclosure or Intersection Attacks on Anonymity Systems. In: Fridrich, J. (ed.) IH 2004. LNCS, vol.\u00a03200, pp. 293\u2013308. Springer, Heidelberg (2004)"},{"key":"3_CR8","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":"3_CR9","doi-asserted-by":"crossref","unstructured":"Edman, M., Yener, B.: On anonymity in an electronic society: A survey of anonymous communication systems. ACM Computing Surveys\u00a042(1) (2010)","DOI":"10.1145\/1592451.1592456"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-36415-3_4","volume-title":"Information Hiding","author":"D. Kesdogan","year":"2003","unstructured":"Kesdogan, D., Agrawal, D., Penz, S.: Limits of Anonymity in Open Environments. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol.\u00a02578, pp. 53\u201369. Springer, Heidelberg (2003)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-03351-3_28","volume-title":"Computer Science - Theory and Applications","author":"D. Kesdogan","year":"2009","unstructured":"Kesdogan, D., M\u00f6lle, D., Richter, S., Rossmanith, P.: Breaking Anonymity by Learning a Unique Minimum Hitting Set. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol.\u00a05675, pp. 299\u2013309. Springer, Heidelberg (2009)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-30114-1_23","volume-title":"Information Hiding","author":"D. Kesdogan","year":"2004","unstructured":"Kesdogan, D., Pimenidis, L.: The Hitting Set Attack on Anonymity Protocols. In: Fridrich, J. (ed.) IH 2004. LNCS, vol.\u00a03200, pp. 326\u2013339. Springer, Heidelberg (2004)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Liu, J., Xu, H., Xie, C.: A new statistical hitting set attack on anonymity protocols. In: Computational Intelligence and Security, International Conference (CIS 2007), pp. 922\u2013925. IEEE Computer Society (2007)","DOI":"10.1109\/CIS.2007.73"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-16435-4_17","volume-title":"Information Hiding","author":"N. Mallesh","year":"2010","unstructured":"Mallesh, N., Wright, M.: The Reverse Statistical Disclosure Attack. In: B\u00f6hme, R., Fong, P.W.L., Safavi-Naini, R. (eds.) IH 2010. LNCS, vol.\u00a06387, pp. 221\u2013234. Springer, Heidelberg (2010)"},{"key":"3_CR15","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":"3_CR16","unstructured":"M\u00f6ller, U., Cottrell, L., Palfrader, P., Sassaman, L.: Mixmaster Protocol \u2014 Version 2. IETF Internet Draft (July 2003)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"P\u00e9rez-Gonz\u00e1lez, F., Troncoso, C.: Understanding statistical disclosure: A least squares approach. IEEE Transactions on Information Forensics and Security (under submission, 2012)","DOI":"10.1007\/978-3-642-31680-7_3"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-642-23822-2_28","volume-title":"Computer Security \u2013 ESORICS 2011","author":"D.V. Pham","year":"2011","unstructured":"Pham, D.V., Wright, J., Kesdogan, D.: A Practical Complexity-Theoretic Analysis of Mix Systems. In: Atluri, V., Diaz, C. (eds.) ESORICS 2011. LNCS, vol.\u00a06879, pp. 508\u2013527. Springer, Heidelberg (2011)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-44702-4_2","volume-title":"Designing Privacy Enhancing Technologies","author":"J.-F. Raymond","year":"2001","unstructured":"Raymond, J.-F.: Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems. In: Federrath, H. (ed.) Anonymity 2000. LNCS, vol.\u00a02009, pp. 10\u201329. Springer, Heidelberg (2001)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-36467-6_4","volume-title":"Privacy Enhancing Technologies","author":"A. Serjantov","year":"2003","unstructured":"Serjantov, A., Danezis, G.: Towards an Information Theoretic Metric for Anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol.\u00a02482, pp. 41\u201353. Springer, Heidelberg (2003)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-70630-4_2","volume-title":"Privacy Enhancing Technologies","author":"C. Troncoso","year":"2008","unstructured":"Troncoso, C., Gierlichs, B., Preneel, B., Verbauwhede, I.: Perfect Matching Disclosure Attacks. In: Borisov, N., Goldberg, I. (eds.) PETS 2008. LNCS, vol.\u00a05134, pp. 2\u201323. Springer, Heidelberg (2008)"}],"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-31680-7_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:52:14Z","timestamp":1743623534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31680-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316791","9783642316807"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31680-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}