{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T10:23:17Z","timestamp":1760782997106},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75551-7_1","type":"book-chapter","created":{"date-parts":[[2007,9,28]],"date-time":"2007-09-28T06:52:49Z","timestamp":1190962369000},"page":"1-16","source":"Crossref","is-referenced-by-count":22,"title":["Attacking Unlinkability: The Importance of Context"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Franz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Pashalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Adida, B.: Advances in cryptographic voting systems. PhD thesis, Massachusetts Institute of Technology (2006)"},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/SECPRI.2003.1199324","volume-title":"2003 IEEE Symposium on Security and Privacy (S&P 2003)","author":"D. Agrawal","year":"2003","unstructured":"Agrawal, D., Kesdogan, D., Penz, S.: Probabilistic treatment of mixes to hamper traffic analysis. In: 2003 IEEE Symposium on Security and Privacy (S&P 2003), Berkeley, CA, May 11-14, 2003, pp. 16\u201327. IEEE Computer Society, Los Alamitos (2003)"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"411","DOI":"10.2307\/2300300","volume":"41","author":"E.T. Bell","year":"1934","unstructured":"Bell, E.T.: Exponential numbers. American Mathematical Monthly\u00a041, 411\u2013419 (1934)","journal-title":"American Mathematical Monthly"},{"key":"1_CR4","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.\u00a02009, pp. 115\u2013129. Springer, Heidelberg (2001)"},{"key":"1_CR5","volume-title":"Cambridge Studies in Advanced Mathematics","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. In: Cambridge Studies in Advanced Mathematics, 2nd edn., vol.\u00a073, Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/586110.586121","volume-title":"Proc. of the 9th ACM Conference on Computer and Communications Security","author":"D. Boneh","year":"2002","unstructured":"Boneh, D., Golle, P.: Almost entirely correct mixing with applications to voting. In: Atluri, V. (ed.) Proc. of the 9th ACM Conference on Computer and Communications Security, pp. 68\u201377. ACM Press, New York (2002)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 93\u2013118. Springer, Heidelberg (2001)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J. Camenisch","year":"2004","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 56\u201372. Springer, Heidelberg (2004)"},{"issue":"2","key":"1_CR9","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":"10","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"Chaum, D.: Security without identification: transaction systems to make big brother obsolete. Communications of the ACM\u00a028(10), 1030\u20131044 (1985)","journal-title":"Communications of the ACM"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/BFb0030366","volume-title":"Advances in Cryptology \u2014 AUSCRYPT 1990","author":"D. Chaum","year":"1990","unstructured":"Chaum, D.: Showing credentials without identification: transferring signatures between unconditionally unlinkable pseudonyms. In: Seberry, J., Pieprzyk, J.P. (eds.) AUSCRYPT 1990. LNCS, vol.\u00a0453, pp. 246\u2013264. Springer, Heidelberg (1990)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0032362","volume-title":"Cryptography: Policy and Algorithms","author":"L. Chen","year":"1996","unstructured":"Chen, L.: Access with pseudonyms. In: Dawson, E., Golic, J.D. (eds.) Cryptography: Policy and Algorithms. LNCS, vol.\u00a01029, pp. 232\u2013243. Springer, Heidelberg (1996)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/11507840_12","volume-title":"Financial Cryptography and Data Security","author":"L. Chen","year":"2005","unstructured":"Chen, L., Enzmann, M., Sadeghi, A.-R., Schneider, M., Steiner, M.: A privacy-protecting coupon system. In: Patrick, A.S., Yung, M. (eds.) FC 2005. LNCS, vol.\u00a03570, pp. 93\u2013108. Springer, Heidelberg (2005)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/0-387-34799-2_26","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"I. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.: Payment systems and credential mechanisms with provable security against abuse by individuals. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 328\u2013335. Springer, Heidelberg (1990)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"1_CR17","volume-title":"Security, Privacy and Trust in Modern Data Management, chapter Accountable Anonymous Communication","author":"C. D\u00edaz","year":"2006","unstructured":"D\u00edaz, C., Preneel, B.: Security, Privacy and Trust in Modern Data Management, chapter Accountable Anonymous Communication. Springer, Berlin, 2006 (in print)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-36467-6_5","volume-title":"Privacy Enhancing Technologies","author":"C. D\u00edaz","year":"2003","unstructured":"D\u00edaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol.\u00a02482, pp. 54\u201368. Springer, Heidelberg (2003)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.F.: Tor: The second-generation onion router. In: Proceedings of the 13th USENIX Security Symposium, August 9-13, 2004, San Diego, CA, USA, USENIX, pp. 303\u2013320 (2004)","DOI":"10.21236\/ADA465464"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"J. Douceur","year":"2002","unstructured":"Douceur, J.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 251\u2013260. Springer, Heidelberg (2002)"},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs I. Publicationes Mathematicae Debrecen\u00a06, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"1_CR22","first-page":"257","volume-title":"Concrete Mathematics: A Foundation for Computer Science. ch. 6.1","author":"R.L. Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. ch. 6.1, 2nd edn., pp. 257\u2013267. Addison-Wesley, Reading (1994)","edition":"2"},{"key":"1_CR23","volume-title":"Interscience Series in Discrete Mathematics and Optimization","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. In: Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., Chichester (2000)"},{"issue":"4","key":"1_CR24","doi-asserted-by":"publisher","first-page":"393","DOI":"10.2307\/147043","volume":"30","author":"D. Kagan","year":"1961","unstructured":"Kagan, D.: The origin and purposes of ostracism. Hesperia\u00a030(4), 393\u2013401 (1961)","journal-title":"Hesperia"},{"key":"1_CR25","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":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-49380-8_7","volume-title":"Information Hiding","author":"D. Kesdogan","year":"1998","unstructured":"Kesdogan, D., Egner, J., B\u00fcschkes, R.: Stop-and-go-mixes providing probabilistic anonymity in an open system. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol.\u00a01525, pp. 83\u201398. Springer, Heidelberg (1998)"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/11558859_3","volume-title":"Information Hiding","author":"M. Klonowski","year":"2005","unstructured":"Klonowski, M., Kutylowski, M.: Provable anonymity for networks of mixes. In: Barni, M., Herrera-Joancomart\u00ed, J., Katzenbeisser, S., P\u00e9rez-Gonz\u00e1lez, F. (eds.) IH 2005. LNCS, vol.\u00a03727, pp. 26\u201338. Springer, Heidelberg (2005)"},{"issue":"5","key":"1_CR28","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1214\/aop\/1176996856","volume":"1","author":"R.F. Ling","year":"1973","unstructured":"Ling, R.F.: The expected number of components in random linear graphs. The Annals of Probability\u00a01(5), 876\u2013881 (1973)","journal-title":"The Annals of Probability"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-46513-8_14","volume-title":"Selected Areas in Cryptography","author":"A. Lysyanskaya","year":"2000","unstructured":"Lysyanskaya, A., Rivest, R.L., Sahai, A., Wolf, S.: Pseudonym systems. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol.\u00a01758, pp. 184\u2013199. Springer, Heidelberg (2000)"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/11957454_22","volume-title":"Privacy Enhancing Technologies","author":"A. Pashalidis","year":"2006","unstructured":"Pashalidis, A., Meyer, B.: Linking anonymous transactions: The consistent view attack. In: Danezis, G., Golle, P. (eds.) PET 2006. LNCS, vol.\u00a04258, pp. 384\u2013392. Springer, Heidelberg (2006)"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/978-3-540-27809-2_21","volume-title":"Financial Cryptography","author":"G. Persiano","year":"2004","unstructured":"Persiano, G., Visconti, I.: An efficient and usable multi-show non-transferable anonymous credential system. In: Juels, A. (ed.) FC 2004. LNCS, vol.\u00a03110, pp. 196\u2013211. Springer, Heidelberg (2004)"},{"issue":"1","key":"1_CR33","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"M.K. Reiter","year":"1998","unstructured":"Reiter, M.K., Rubin, A.D.: Crowds: anonymity for Web transactions. ACM Transactions on Information and System Security\u00a01(1), 66\u201392 (1998)","journal-title":"ACM Transactions on Information and System Security"},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/644527.644537","volume-title":"Proceedings of the 2002 ACM Workshop on Privacy in the Electronic Society, WPES 2002","author":"M. Rennhard","year":"2002","unstructured":"Rennhard, M., Plattner, B.: Introducing morphmix: peer-to-peer based anonymous internet usage with collusion detection. In: Jajodia, S., Samarati, P. (eds.) Proceedings of the 2002 ACM Workshop on Privacy in the Electronic Society, WPES 2002, Washington, DC, USA, November 21, 2002, pp. 91\u2013102. ACM, New York (2002)"},{"key":"1_CR35","doi-asserted-by":"publisher","first-page":"498","DOI":"10.2307\/2312585","volume":"71","author":"G.C. Rota","year":"1964","unstructured":"Rota, G.C.: The number of partitions of a set. American Mathematical Monthly\u00a071, 498\u2013504 (1964)","journal-title":"American Mathematical Monthly"},{"key":"1_CR36","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":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/978-3-540-40956-4_3","volume-title":"Privacy Enhancing Technologies","author":"S. Steinbrecher","year":"2003","unstructured":"Steinbrecher, S., K\u00f6psell, S.: Modelling unlinkability. In: Dingledine, R. (ed.) PET 2003. LNCS, vol.\u00a02760, pp. 32\u201347. Springer, Heidelberg (2003)"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/3-540-45682-1_31","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"E.R. Verheul","year":"2001","unstructured":"Verheul, E.R.: Self-blindable credential certificates from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 533\u2013551. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75551-7_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T04:13:12Z","timestamp":1684037592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75551-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755500"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75551-7_1","relation":{},"subject":[]}}