{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T20:43:31Z","timestamp":1759092211925},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262039"},{"type":"electronic","value":"9783540319603"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11423409_16","type":"book-chapter","created":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T14:30:11Z","timestamp":1278513011000},"page":"243-255","source":"Crossref","is-referenced-by-count":10,"title":["On the PET Workshop Panel \u201cMix Cascades Versus Peer-to-Peer: Is One Concept Superior?\u201d"],"prefix":"10.1007","author":[{"given":"Rainer","family":"B\u00f6hme","sequence":"first","affiliation":[]},{"given":"George","family":"Danezis","sequence":"additional","affiliation":[]},{"given":"Claudia","family":"D\u00edaz","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"K\u00f6psell","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Pfitzmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-45126-6_7","volume-title":"Financial Cryptography","author":"A. Acquisti","year":"2003","unstructured":"Acquisti, A., Dingledine, R., Syverson, P.: On the Economics of Anonymity. In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742, pp. 84\u2013102. Springer, Heidelberg (2003)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-45496-9_18","volume-title":"Information Hiding","author":"A. Back","year":"2001","unstructured":"Back, A., M\u00f6ller, U., Stiglic, A.: Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems. In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol.\u00a02137, pp. 245\u2013257. Springer, Heidelberg (2001)"},{"key":"16_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.\u00a02009, pp. 115\u2013129. Springer, Heidelberg (2001)"},{"key":"16_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.\u00a02482, pp. 110\u2013128. Springer, Heidelberg (2003)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-44702-4_3","volume-title":"Designing Privacy Enhancing Technologies","author":"O. Berthold","year":"2001","unstructured":"Berthold, O., Pfitzmann, A., Standtke, R.: The Disadvantages of Free MIX Routes and How to Overcome Them. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol.\u00a02009, pp. 30\u201345. Springer, Heidelberg (2001)"},{"key":"16_CR6","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, 84\u201388 (1981)","journal-title":"Communications of the ACM"},{"key":"16_CR7","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, 1030\u20131044 (1985)","journal-title":"Communications of the ACM"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-40956-4_1","volume-title":"Privacy Enhancing Technologies","author":"G. Danezis","year":"2003","unstructured":"Danezis, G.: Mix-Networks with Restricted Routes. In: Dingledine, R. (ed.) PET 2003. LNCS, vol.\u00a02760, pp. 1\u201317. Springer, Heidelberg (2003)"},{"key":"16_CR9","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 (SEC 2003), Athens, pp. 421\u2013426 (May 2003)","DOI":"10.1007\/978-0-387-35691-4_40"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: Design of a Type III Anonymous Remailer Protocol. In: Proceedings of the IEEE Symposium on Security and Privacy (May 2003)","DOI":"10.1109\/SECPRI.2003.1199323"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Danezis, G.: The Anonymity of Continuous Time Mixes. In: Paper presented at the Privacy Enhancing Technologies Workshop, Toronto, Canada (May 2004)","DOI":"10.1007\/11423409_3"},{"key":"16_CR12","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":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-30108-0_9","volume-title":"Computer Security \u2013 ESORICS 2004","author":"C. D\u00edaz","year":"2004","unstructured":"D\u00edaz, C., Sassaman, L., Dewitte, E.: Comparison between Two Practical Mix Designs. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol.\u00a03193, pp. 141\u2013159. Springer, Heidelberg (2004)"},{"key":"16_CR14","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":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-45496-9_10","volume-title":"Information Hiding","author":"R. Dingledine","year":"2001","unstructured":"Dingledine, R., Freedman, M.J., Hopwood, D., Molnar, D.: A Reputation System to Increase MIX-net Reliability. In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol.\u00a02137, pp. 126\u2013141. Springer, Heidelberg (2001)"},{"key":"16_CR16","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 (August 2004)","DOI":"10.21236\/ADA465464"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Shmatikov, V., Syverson, P.: Synchronous Batching: From Cascades to Free Routes. Paper presented at the Privacy Enhancing Technologies Workshop, Toronto, Canada (May 2004)","DOI":"10.1007\/11423409_12"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Syverson, P.: Reliable MIX Cascade Networks through Reputation. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36504-4_18"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, p. 251. Springer, Heidelberg (2002)"},{"key":"16_CR20","unstructured":"Farber, D.J., Larson, K.C.: Network Security Via Dynamic Process Renaming. In: Fourth Data Communications Symposium, Quebec City, Canada, pp. 8-13\u20138-18 (October 1975)"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Morris, R.: Tarzan: A Peer-to-Peer Anonymizing Network Layer. In: Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS 2002), Washington, DC (November 2002)","DOI":"10.1145\/586110.586137"},{"key":"16_CR22","unstructured":"Jakobsson, M., Juels, A., Rivest, R.L.: Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking. In: Proceedings of the 11th USENIX Security Symposium (August 2002)"},{"key":"16_CR23","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":"16_CR24","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/501983.502000","volume-title":"Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS 2001)","author":"C.A. Neff","year":"2001","unstructured":"Neff, C.A.: A Verifiable Secret Shuffle and its Application to E-Voting. In: Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS 2001), pp. 116\u2013125. ACM Press, New York (November 2001)"},{"key":"16_CR25","series-title":"IFB 234","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-75544-6","volume-title":"Diensteintegrierende Kommunikationsnetze mit teilnehmer\u00fcberpr\u00fcfbarem Datenschutz. Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, Dissertation","author":"A. Pfitzmann","year":"1990","unstructured":"Pfitzmann, A.: Diensteintegrierende Kommunikationsnetze mit teilnehmer\u00fcberpr\u00fcfbarem Datenschutz. Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, Dissertation, February 1989. IFB 234. Springer, Heidelberg (1990)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44702-4_1","volume-title":"Designing Privacy Enhancing Technologies","author":"A. Pfitzmann","year":"2001","unstructured":"Pfitzmann, A., K\u00f6hntopp, M.: Anonymity, Unobservability, and Pseudonymity \u2013 A Proposal for Terminology. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol.\u00a02009, pp. 1\u20139. Springer, Heidelberg (2001)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-27809-2_24","volume-title":"Financial Cryptography","author":"M. Rennhard","year":"2004","unstructured":"Rennhard, M., Plattner, B.: Practical Anonymity for the Masses with MorphMix. In: Juels, A. (ed.) FC 2004. LNCS, vol.\u00a03110, pp. 233\u2013250. Springer, Heidelberg (2004)"},{"key":"16_CR28","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":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-36415-3_3","volume-title":"Information Hiding","author":"A. Serjantov","year":"2003","unstructured":"Serjantov, A., Dingledine, R., Syverson, P.: From a Trickle to a Flood: Active Attacks on Several Mix Types. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol.\u00a02578, pp. 36\u201352. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Privacy Enhancing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11423409_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:53:00Z","timestamp":1605624780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11423409_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262039","9783540319603"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11423409_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}