{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:01:30Z","timestamp":1725904890233},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319612720"},{"type":"electronic","value":"9783319612737"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-61273-7_4","type":"book-chapter","created":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T11:22:58Z","timestamp":1499944978000},"page":"56-82","source":"Crossref","is-referenced-by-count":1,"title":["Another Look at Anonymous Communication"],"prefix":"10.1007","author":[{"given":"Russell W. F.","family":"Lai","sequence":"first","affiliation":[]},{"given":"Henry K. F.","family":"Cheung","sequence":"additional","affiliation":[]},{"given":"Sherman S. M.","family":"Chow","sequence":"additional","affiliation":[]},{"given":"Anthony Man-Cho","family":"So","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,14]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-319-07536-5_23","volume-title":"Applied Cryptography and Network Security","author":"M Backes","year":"2014","unstructured":"Backes, M., Clark, J., Kate, A., Simeonovski, M., Druschel, P.: BackRef: accountability in anonymous communication networks. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 380\u2013400. Springer, Cham (2014). doi: 10.1007\/978-3-319-07536-5_23"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Backes, M., Goldberg, I., Kate, A., Mohammadi, E.: Provably secure and practical onion routing. In: 25th IEEE Computer Security Foundations Symposium, Cambridge, MA, USA, 25\u201327 June 2012, pp. 369\u2013385 (2012)","DOI":"10.1109\/CSF.2012.32"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Backes, M., Kate, A., Manoharan, P., Meiser, S., Mohammadi, E.: AnoA: a framework for analyzing anonymous communication protocols. In: 2013 IEEE 26th Computer Security Foundations Symposium, New Orleans, LA, USA, 26\u201328 June 2013, pp. 163\u2013178 (2013)","DOI":"10.1109\/CSF.2013.18"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Backes, M., Kate, A., Meiser, S., Mohammadi, E.: (Nothing else) MATor(s): monitoring the anonymity of Tor\u2019s path selection. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, USA, 3\u20137 November 2014, pp. 513\u2013524 (2014)","DOI":"10.1145\/2660267.2660371"},{"issue":"1","key":"4_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00145-002-0128-6","volume":"16","author":"A Beimel","year":"2003","unstructured":"Beimel, A., Dolev, S.: Buses for anonymous message delivery. J. Cryptol. 16(1), 25\u201339 (2003)","journal-title":"J. Cryptol."},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-45682-1_33","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"M Bellare","year":"2001","unstructured":"Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-privacy in public-key encryption. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 566\u2013582. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45682-1_33"},{"key":"4_CR7","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization, 1st edn. Athena Scientific, Belmont (1997)","edition":"1"},{"issue":"3","key":"4_CR8","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/rsa.3240010303","volume":"1","author":"G Brightwell","year":"1990","unstructured":"Brightwell, G., Winkler, P.: Maximum hitting time for random walks on graphs. Random Struct. Algorithms 1(3), 263\u2013276 (1990)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"4_CR9","doi-asserted-by":"crossref","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. Commun. ACM 24(2), 84\u201388 (1981)","journal-title":"Commun. ACM"},{"issue":"1","key":"4_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65\u201375 (1988)","journal-title":"J. Cryptol."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Boneh, D., Mazi\u00e8res, D.: Riposte: an anonymous messaging system handling millions of users. In: 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, USA, 17\u201321 May 2015, pp. 321\u2013338 (2015)","DOI":"10.1109\/SP.2015.27"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Ford, B.: Dissent: accountable anonymous group messaging. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, Chicago, Illinois, USA, 4\u20138 October 2010, pp. 340\u2013350 (2010)","DOI":"10.1145\/1866307.1866346"},{"key":"4_CR13","unstructured":"Corrigan-Gibbs, H., Wolinsky, D.I., Ford, B.: Proactively accountable anonymous messaging in verdict. In: Proceedings of the 22th USENIX Security, Washington, DC, USA, 14\u201316 August 2013, pp. 147\u2013162 (2013)"},{"key":"4_CR14","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, 9\u201313 August 2004, San Diego, CA, USA, pp. 303\u2013320 (2004)","DOI":"10.21236\/ADA465464"},{"issue":"3","key":"4_CR15","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/2382448.2382452","volume":"15","author":"J Feigenbaum","year":"2012","unstructured":"Feigenbaum, J., Johnson, A., Syverson, P.F.: Probabilistic analysis of onion routing in a black-box model. ACM Trans. Inf. Syst. Secur. 15(3), 14 (2012)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Gelernter, N., Herzberg, A.: On the limits of provable anonymity. In: Proceedings of the 12th Annual ACM Workshop on Privacy in the Electronic Society, WPES 2013, Berlin, Germany, 4 November 2013, pp. 225\u2013236 (2013)","DOI":"10.1145\/2517840.2517850"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-540-70630-4_3","volume-title":"Privacy Enhancing Technologies","author":"A Hevia","year":"2008","unstructured":"Hevia, A., Micciancio, D.: An indistinguishability-based characterization of anonymous channels. In: Borisov, N., Goldberg, I. (eds.) PETS 2008. LNCS, vol. 5134, pp. 24\u201343. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-70630-4_3"},{"key":"4_CR18","unstructured":"Hirt, A., Jacobson Jr., M.J., Williamson, C.L.: A practical buses protocol for anonymous internet communication. In: Proceedings of the Third Annual Conference on Privacy, Security and Trust, 12\u201314 October 2005, The Fairmont Algonquin, St. Andrews, New Brunswick, Canada (2005)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Hirt, A., Jacobson Jr., M.J., Williamson, C.L.: Taxis: scalable strong anonymous communication. In: 16th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Baltimore, Maryland, USA, 8\u201310 September 2008, pp. 269\u2013278 (2008)","DOI":"10.1109\/MASCOT.2008.4770566"},{"issue":"1","key":"4_CR20","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.tcs.2008.10.020","volume":"410","author":"S Ikeda","year":"2009","unstructured":"Ikeda, S., Kubo, I., Yamashita, M.: The hitting and cover times of random walks on finite graphs using local degree information. Theor. Comput. Sci. 410(1), 94\u2013100 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"4_CR21","doi-asserted-by":"crossref","first-page":"213","DOI":"10.3233\/JCS-2002-10302","volume":"10","author":"BN Levine","year":"2002","unstructured":"Levine, B.N., Shields, C.: Hordes: a multicast-based protocol for anonymity. J. Comput. Secur. 10(3), 213\u2013240 (2002)","journal-title":"J. Comput. Secur."},{"key":"4_CR22","unstructured":"Mittal, P., Olumofin, F.G., Troncoso, C., Borisov, N., Goldberg, I.: PIR-Tor: scalable anonymous communication using private information retrieval. In: Proceedings of the 20th USENIX Security Symposium, San Francisco, CA, USA, 8\u201312 August 2011"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Panchenko, A., Niessen, L., Zinnen, A., Engel, T.: Website fingerprinting in onion routing based anonymization networks. In: Proceedings of the 10th Annual ACM Workshop on Privacy in the Electronic Society, WPES 2011, Chicago, IL, USA, 17 October 2011, pp. 103\u2013114 (2011)","DOI":"10.1145\/2046556.2046570"},{"key":"4_CR24","unstructured":"Pfitzmann, A., Hansen, M.: A terminology for talking about privacy by data minimization: anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management, v0.34, August 2010. http:\/\/dud.inf.tu-dresden.de\/literatur\/Anon_Terminology_v0.34.pdf"},{"issue":"4","key":"4_CR25","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/49.668972","volume":"16","author":"MG Reed","year":"1998","unstructured":"Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous connections and onion routing. IEEE J. Sel. Areas Commun. 16(4), 482\u2013494 (1998)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1","key":"4_CR26","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"MK Reiter","year":"1998","unstructured":"Reiter, M.K., Rubin, A.D.: Crowds: anonymity for web transactions. ACM Trans. Inf. Syst. Secur. 1(1), 66\u201392 (1998)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"1","key":"4_CR27","doi-asserted-by":"crossref","first-page":"4:1","DOI":"10.1145\/2629621","volume":"17","author":"E Syta","year":"2014","unstructured":"Syta, E., Corrigan-Gibbs, H., Weng, S.-C., Wolinsky, D., Ford, B., Johnson, A.: Security analysis of accountable anonymity in dissent. ACM Trans. Inf. Syst. Secur. 17(1), 4:1\u20134:35 (2014)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"4_CR28","unstructured":"Wolinsky, D.I., Corrigan-Gibbs, H., Ford, B., Johnson, A.: Dissent in numbers: making strong anonymity scale. In: 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2012, Hollywood, CA, USA, 8\u201310 October 2012, pp. 179\u2013182 (2012)"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Young, A.L., Yung, M.: The drunk motorcyclist protocol for anonymous communication. In: IEEE Conference on Communications and Network Security, CNS 2014, San Francisco, CA, USA, 29\u201331 October 2014, pp. 157\u2013165 (2014)","DOI":"10.1109\/CNS.2014.6997482"}],"container-title":["Lecture Notes in Computer Science","Paradigms in Cryptology \u2013 Mycrypt 2016. Malicious and Exploratory Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61273-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T00:57:56Z","timestamp":1569805076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61273-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319612720","9783319612737"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61273-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}