{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T21:40:03Z","timestamp":1748382003750,"version":"3.41.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319184661"},{"type":"electronic","value":"9783319184678"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18467-8_3","type":"book-chapter","created":{"date-parts":[[2015,5,8]],"date-time":"2015-05-08T12:12:03Z","timestamp":1431087123000},"page":"35-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards Relations Between the Hitting-Set Attack and the Statistical Disclosure Attack"],"prefix":"10.1007","author":[{"given":"Dang Vinh","family":"Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dogan","family":"Kesdogan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,9]]},"reference":[{"key":"3_CR1","first-page":"143","volume":"3","author":"LA Adamic","year":"2002","unstructured":"Adamic, L.A., Huberman, B.A.: Zipf\u2019s Law and the Internet. Glottometrics 3, 143\u2013150 (2002)","journal-title":"Glottometrics"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, D., Kesdogan, D., Penz, S.: Probabilistic treatment of MIXes to hamper traffic analysis. In: IEEE Symposium on Security and Privacy 0, p. 16 (2003)","DOI":"10.1109\/SECPRI.2003.1199324"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-44702-4_7","volume-title":"Designing Privacy Enhancing Technologies","author":"O Berthold","year":"2001","unstructured":"Berthold, O., Federrath, H., K\u00f6psell, S.: Web MIXes: a system for anonymous and unobservable internet access. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 115\u2013129. Springer, Heidelberg (2001)"},{"key":"3_CR4","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. 2482, pp. 110\u2013128. Springer, Heidelberg (2003)"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0022-247X(63)90076-3","volume":"7","author":"RK Brayton","year":"1963","unstructured":"Brayton, R.K.: On the Asymptotic Behavior of the Number of Trials Necessary to Complete a Set with Random Selection. Journal of Mathematical Analysis and Applications 7(1), 31\u201361 (1963)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and Zipf-like distributions: evidence and implications. In: Proceedings of Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 1999, vol. 1, pp. 126\u2013134. IEEE (1999)","DOI":"10.1109\/INFCOM.1999.749260"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM 24(2), 84\u201388 (1981)","journal-title":"Communications of the ACM"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Danezis, G.: Statistical disclosure attacks: traffic confirmation in open environments. In: Proceedings of Security and Privacy in the Age of Uncertainty, pp. 421\u2013426 (2003)","DOI":"10.1007\/978-0-387-35691-4_40"},{"key":"3_CR9","unstructured":"Danezis, G.: Better Anonymous Communications. Ph.D. thesis, University of Cambridge (2004)"},{"key":"3_CR10","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. 4776, pp. 30\u201344. Springer, Heidelberg (2007)"},{"key":"3_CR11","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. 3200, pp. 293\u2013308. Springer, Heidelberg (2004)"},{"key":"3_CR12","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. 5672, pp. 56\u201372. Springer, Heidelberg (2009)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: the second-generation onion router. In: Proceedings of the 13th USENIX Security Symposium, pp. 303\u2013320. USENIX (2004)","DOI":"10.21236\/ADA465464"},{"key":"3_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1990)"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0169-7552(94)90130-9","volume":"27","author":"S Glassman","year":"1994","unstructured":"Glassman, S.: A Caching Relay for the World Wide Web. Computer Networks and ISDN Systems 27(2), 165\u2013173 (1994)","journal-title":"Computer Networks and ISDN Systems"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Kesdogan, D., Agrawal, D., Pham, V., Rauterbach, D.: Fundamental limits on the anonymity provided by the mix technique. In: Proceedings of the 2006 IEEE Symposium on Security and Privacy, pp. 86\u201399. IEEE (2006)","DOI":"10.1109\/SP.2006.17"},{"key":"3_CR17","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. 3200, pp. 326\u2013339. Springer, Heidelberg (2004)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Kesdogan, D., Pimenidis, L.: The lower bound of attacks on anonymity systems - a unicity distance approach. In: Quality of Protection, Advances in Information Security, vol. 23, pp. 145\u2013158. Springer (2006)","DOI":"10.1007\/978-0-387-36584-8_12"},{"key":"3_CR19","unstructured":"K\u00f6psell, S.: Entwicklung und Betrieb eines Anonymisierungsdienstes f\u00fcr das WWW. Ph.D. thesis, Technische Universit\u00e4t Dresden (2010) (in German)"},{"key":"3_CR20","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. 3424, pp. 17\u201334. Springer, Heidelberg (2005)"},{"key":"3_CR21","unstructured":"O\u2019Connor, L.: Entropy Bounds for Traffic Confirmation. Cryptology ePrint Archive, Report 2008\/365, August 2008. http:\/\/eprint.iacr.org\/2008\/"},{"issue":"9","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1109\/TIFS.2014.2330696","volume":"9","author":"F Perez-Gonzalez","year":"2014","unstructured":"Perez-Gonzalez, F., Troncoso, C., Oya, S.: A Least Squares Approach to the Static Traffic Analysis of High-Latency Anonymous Communication Systems. IEEE Transactions on Information Forensics and Security 9(9), 1341\u20131355 (2014)","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"3_CR23","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. 7384, pp. 38\u201357. Springer, Heidelberg (2012)"},{"key":"3_CR24","unstructured":"Pfitzmann, A., Hansen, M.: Anonymity, Unobservability, Pseudonymity, and Identity Management - A Proposal for Terminology, August 2010 (version v0.34)"},{"key":"3_CR25","unstructured":"Pham, D.V.: Towards Practical and Fundamental Limits of Anonymity Protection. Ph.D. thesis, University of Regensburg (2013)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-02620-1_3","volume-title":"Information Security and Privacy","author":"DV Pham","year":"2009","unstructured":"Pham, D.V., Kesdogan, D.: A combinatorial approach for an anonymity metric. In: Boyd, C., Gonz\u00e1lez Nieto, J. (eds.) ACISP 2009. LNCS, vol. 5594, pp. 26\u201343. Springer, Heidelberg (2009)"},{"key":"3_CR27","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":"DV 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. 6879, pp. 508\u2013527. Springer, Heidelberg (2011)"},{"key":"3_CR28","unstructured":"Pham, V.: Analysis of the anonymity set of chaumian mixes. In: 13th Nordic Workshop on Secure IT-Systems (2008)"},{"key":"3_CR29","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.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 10\u201329. Springer, Heidelberg (2001)"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C Shannon","year":"1949","unstructured":"Shannon, C.: Communication Theory of Secrecy Systems. Bell System Technical Journal 28, 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"},{"key":"3_CR31","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. 5134, pp. 2\u201323. Springer, Heidelberg (2008)"}],"container-title":["IFIP Advances in Information and Communication Technology","ICT Systems Security and Privacy Protection"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18467-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T21:22:21Z","timestamp":1748380941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18467-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319184661","9783319184678"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18467-8_3","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}