{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:03:44Z","timestamp":1758845024019},"publisher-location":"Berlin, Heidelberg","reference-count":36,"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_16","type":"book-chapter","created":{"date-parts":[[2007,9,28]],"date-time":"2007-09-28T06:52:49Z","timestamp":1190962369000},"page":"254-271","source":"Crossref","is-referenced-by-count":15,"title":["Anonymity in the Wild: Mixes on Unstructured Networks"],"prefix":"10.1007","author":[{"given":"Shishir","family":"Nagaraja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Albert, R., Barab\u00e1si, A.: Statistical mechanics of complex networks (2002)","DOI":"10.1103\/RevModPhys.74.47"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/335305.335326","volume-title":"STOC 2000: Proceedings of the thirty-second annual ACM symposium on Theory of computing","author":"W. Aiello","year":"2000","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: STOC 2000: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 171\u2013180. ACM Press, New York (2000)"},{"key":"16_CR3","unstructured":"Borisov, N.: Phd thesis: Anonymous routing in structured peer-to-peer overlays (April 2005)"},{"key":"16_CR4","unstructured":"Borisov, N.: Private communication (June 2007)"},{"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":"crossref","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 4(2) (February 1981)","DOI":"10.1145\/358549.358563"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Clarke, I., Sandberg, O., Wiley, B., Hong, T.: Freenet: A distributed anonymous information storage and retrieval system. In: Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, pp. 46\u201366 (July 2000)","DOI":"10.1007\/3-540-44702-4_4"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (2003)"},{"key":"16_CR9","unstructured":"Danezis, G.: Private communication (July 2007)"},{"key":"16_CR10","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 (2003)","DOI":"10.1109\/SECPRI.2003.1199323"},{"key":"16_CR11","unstructured":"Dingledine, R., Mathewson, N.: Anonymity loves company: Usability and the network effect. In: Proceedings of the Fifth Workshop on the Economics of Information Security (WEIS 2006), Cambridge, UK (June 2006)"},{"key":"16_CR12","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_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/586110.586117","volume-title":"CCS 2002: Proceedings of the 9th ACM conference on Computer and communications security","author":"L. Eschenauer","year":"2002","unstructured":"Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: CCS 2002: Proceedings of the 9th ACM conference on Computer and communications security, pp. 41\u201347. ACM Press, New York (2002)"},{"key":"16_CR14","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erdos","year":"1959","unstructured":"Erdos, P., Rnyi, A.: On random graphs. Publicationes Mathemticae (Debrecen)\u00a06, 290\u2013297 (1959)","journal-title":"Publicationes Mathemticae (Debrecen)"},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1137\/S0097539794268765","volume":"27","author":"D. Gillman","year":"1998","unstructured":"Gillman, D.: A chernoff bound for random walks on expander graphs. SIAM J. Comput.\u00a027(4), 1203\u20131220 (1998)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"16_CR16","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"M.S. Granovetter","year":"1973","unstructured":"Granovetter, M.S.: The strength of weak ties. The American Journal of Sociology\u00a078(6), 1360\u20131380 (1973)","journal-title":"The American Journal of Sociology"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (2003)"},{"key":"16_CR18","unstructured":"Klingberg, T., Manfredi, R.: \u201dgnutella 0.6\u201d (June 2002)"},{"key":"16_CR19","first-page":"60","volume":"2","author":"S. Milgram","year":"1967","unstructured":"Milgram, S.: The small world problem. Psychology Today\u00a02, 60\u201367 (1967)","journal-title":"Psychology Today"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/SFCS.2003.1238178","volume-title":"FOCS 2003: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science","author":"M. Mihail","year":"2003","unstructured":"Mihail, M., Papadimitriou, C., Saberi, A.: On certain connectivity properties of the internet topology. In: FOCS 2003: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, p. 28. IEEE Computer Society, Washington (2003)"},{"key":"16_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms, vol.\u00a01. Cambridge Univ. Press, Motwani (1995)"},{"issue":"2","key":"16_CR22","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.021544898","volume":"98","author":"M.E. Newman","year":"2001","unstructured":"Newman, M.E.: The structure of scientific collaboration networks. Proc. Natl. Acad. Sci.\u00a098(2), 404\u2013409 (2001)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"16_CR23","doi-asserted-by":"crossref","first-page":"016132","DOI":"10.1103\/PhysRevE.64.016132","volume":"64","author":"M.E.J. Newman","year":"2001","unstructured":"Newman, M.E.J.: Scientific collaboration networks. ii. shortest paths, weighted networks, and centrality. Phys. Rev. E 64(1), 016132 (June 2001)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"16_CR24","doi-asserted-by":"crossref","first-page":"016131","DOI":"10.1103\/PhysRevE.64.016131","volume":"64","author":"M.E.J. Newman","year":"2001","unstructured":"Newman, M.E.J.: Scientific collaboration networks. i. networks construction and fundamental results. Phys. Rev. E 64(1), 016131 (June 2001)","journal-title":"Phys. Rev. E"},{"key":"16_CR25","doi-asserted-by":"crossref","first-page":"026126","DOI":"10.1103\/PhysRevE.67.026126","volume":"67","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: Mixing patterns in networks. Physical Review E 67, 026126 (2003)","journal-title":"Physical Review E"},{"issue":"2","key":"16_CR26","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Review\u00a045(2), 167\u2013256 (2003)","journal-title":"SIAM Review"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Pfitzmann, A., Hansen, M.: Anonymity, unobservability, and pseudonymity: A consolidated proposal for terminology. Draft (July 2000)","DOI":"10.1007\/3-540-44702-4_1"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Pfitzmann, A., Pfitzmann, B., Waidner, M.: ISDN-mixes: Untraceable communication with very small bandwidth overhead. In: GI\/ITG Conference on Communication in Distributed Systems, pp. 451\u2013463 (February 1991)","DOI":"10.1007\/978-3-642-76462-2_32"},{"issue":"2","key":"16_CR29","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MCSE.2006.30","volume":"8","author":"D. Randall","year":"2006","unstructured":"Randall, D.: Rapidly mixing markov chains with applications in computer science and physics. Computing in Science and Engineering\u00a08(2), 30\u201341 (2006)","journal-title":"Computing in Science and Engineering"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal 6(1) (August 2002)","DOI":"10.1007\/3-540-45748-8_8"},{"issue":"1","key":"16_CR31","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 Trans. Inf. Syst. Secur.\u00a01(1), 66\u201392 (1998)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications 16(4) (1998)","DOI":"10.1109\/49.668972"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2003)"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Sinclair, A.: Algorithms for random generation and counting: a Markov chain approach. Birkhauser Verlag, Basel, Switzerland (1993)","DOI":"10.1007\/978-1-4612-0323-0"},{"key":"16_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-44702-4_6","volume-title":"Designing Privacy Enhancing Technologies","author":"P. Syverson","year":"2001","unstructured":"Syverson, P., Tsudik, G., Reed, M., Landwehr, C.: Towards an Analysis of Onion Routing Security. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol.\u00a02009, pp. 96\u2013114. Springer, Heidelberg (2001)"},{"key":"16_CR36","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2001)","edition":"2"}],"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_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T04:13:13Z","timestamp":1684037593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75551-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755500"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75551-7_16","relation":{},"subject":[]}}