{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:39:42Z","timestamp":1774946382180,"version":"3.50.1"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319075358","type":"print"},{"value":"9783319075365","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07536-5_23","type":"book-chapter","created":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T23:14:16Z","timestamp":1401923656000},"page":"380-400","source":"Crossref","is-referenced-by-count":9,"title":["BackRef: Accountability in Anonymous Communication Networks"],"prefix":"10.1007","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[]},{"given":"Jeremy","family":"Clark","sequence":"additional","affiliation":[]},{"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[]},{"given":"Milivoj","family":"Simeonovski","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Druschel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptology 1(1) (1988)","DOI":"10.1007\/BF00206326"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Ford, B.: Dissent: accountable anonymous group messaging. In: CCS, pp. 340\u2013350 (2010)","DOI":"10.1145\/1866307.1866346"},{"key":"23_CR3","unstructured":"Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and onion routing. In: IEEE Symposium on Security and Privacy (1997)"},{"issue":"2","key":"23_CR4","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"David L. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. CACM 24(2) (1981)","journal-title":"Communications of the ACM"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Mittal, P., Borisov, N.: Shadowwalker: peer-to-peer anonymous communication using redundant structured topologies. In: CCS, pp. 161\u2013172 (2009)","DOI":"10.1145\/1653662.1653683"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: the second-generation onion router. In: USENIX Security (2004)","DOI":"10.21236\/ADA465464"},{"key":"23_CR7","unstructured":"M\u00f6ller, U., Cottrell, L., Palfrader, P., Sassaman, L.: Mixmaster Protocol\u2014 Version 2. IETF Internet Draft (2003), http:\/\/mixmaster.sourceforge.net\/"},{"key":"23_CR8","unstructured":"Janssen, A.W.: Tor madness reloaded (2007), http:\/\/itnomad.wordpress.com\/2007\/09\/16\/tor-madness-reloaded\/ (accessed January 2014)"},{"key":"23_CR9","unstructured":"AccusedOperator: Raided for operating a Tor exit node (2012), http:\/\/raided4tor.cryto.net\/"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/11766155_15","volume-title":"Emerging Trends in Information and Communication Security","author":"S. K\u00f6psell","year":"2006","unstructured":"K\u00f6psell, S., Wendolsky, R., Federrath, H.: Revocable anonymity. In: M\u00fcller, G. (ed.) ETRICS 2006. LNCS, vol.\u00a03995, pp. 206\u2013220. Springer, Heidelberg (2006)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/11957454_12","volume-title":"Privacy Enhancing Technologies","author":"L. Ahn von","year":"2006","unstructured":"von Ahn, L., Bortz, A., Hopper, N.J., O\u2019Neill, K.: Selectively traceable anonymity. In: Danezis, G., Golle, P. (eds.) PET 2006. LNCS, vol.\u00a04258, pp. 208\u2013222. Springer, Heidelberg (2006)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Diaz, C., Preneel, B.: Accountable anonymous communication. In: Security, Privacy, and Trust in Modern Data Management (2007)","DOI":"10.1007\/978-3-540-69861-6_16"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11423409_4","volume-title":"Privacy Enhancing Technologies","author":"P. Golle","year":"2005","unstructured":"Golle, P.: Reputable mix networks. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol.\u00a03424, pp. 51\u201362. Springer, Heidelberg (2005)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Clark, J., Gauvin, P., Adams, C.: Exit node repudiation for anonymity networks. In: On the Identity Trail: Privacy, Anonymity and Identity in a Networked Society. Oxford University Press (2009)","DOI":"10.1093\/oso\/9780195372472.003.0022"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-75551-7_8","volume-title":"Privacy Enhancing Technologies","author":"P.C. Johnson","year":"2007","unstructured":"Johnson, P.C., Kapadia, A., Tsang, P.P., Smith, S.W.: Nymble: Anonymous IP-address blocking. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol.\u00a04776, pp. 113\u2013133. Springer, Heidelberg (2007)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Henry, R., Goldberg, I.: Formalizing anonymous blacklisting systems. In: IEEE Symposium on Security and Privacy, pp. 81\u201395 (2011)","DOI":"10.1109\/SP.2011.13"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Goldberg, I., Wagner, D., Brewer, E.: Privacy-enhancing technologies for the internet. In: IEEE Compcon. (1997)","DOI":"10.21236\/ADA385546"},{"key":"23_CR18","unstructured":"Goldberg, I., Shostack, A.: Freedom network 1.0 architecture and protocols. Technical report, Zero-Knowledge Systems (2001)"},{"issue":"4","key":"23_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1880022.1880023","volume":"13","author":"Aniket Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Pairing-based onion routing with improved forward secrecy. ACM Trans. Inf. Syst. Secur. 13(4) (2010)","journal-title":"ACM Transactions on Information and System Security"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Danezis, G., Goldberg, I.: Sphinx: A compact and provably secure mix format. In: IEEE Symposium on Security and Privacy (2009)","DOI":"10.1109\/SP.2009.15"},{"key":"23_CR21","unstructured":"Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: design of a type iii anonymous remailer protocol. In: IEEE Symposium on Security and Privacy (2003)"},{"key":"23_CR22","unstructured":"Pfitzmann, A., Hansen, M.: A terminology for talking about privacy by data minimization v0.34, http:\/\/dud.inf.tu-dresden.de\/literatur\/Anon_Terminology_v0.34.pdf (August 2010)"},{"key":"23_CR23","unstructured":"Wolinsky, D.I., Corrigan-Gibbs, H., Ford, B., Johnson, A.: Dissent in numbers: making strong anonymity scale. In: OSDI (2012)"},{"key":"23_CR24","unstructured":"Corrigan-Gibbs, H., Wolinsky, D.I., Ford, B.: Proactively accountable anonymous messaging in verdict. In: USENIX Security (2013)"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-70630-4_12","volume-title":"Privacy Enhancing Technologies","author":"G. Danezis","year":"2008","unstructured":"Danezis, G., Sassaman, L.: How to bypass two anonymity revocation schemes. In: Borisov, N., Goldberg, I. (eds.) PETS 2008. LNCS, vol.\u00a05134, pp. 187\u2013201. Springer, Heidelberg (2008)"},{"key":"23_CR26","unstructured":"TorProject: Exonerator Service (2012), https:\/\/exonerator.torproject.org\/ (accessed January 2014)"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-75551-7_9","volume-title":"Privacy Enhancing Technologies","author":"L. \u00d8verlier","year":"2007","unstructured":"\u00d8verlier, L., Syverson, P.F.: Improving efficiency and simplicity of tor circuit establishment and hidden services. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol.\u00a04776, pp. 134\u2013152. Springer, Heidelberg (2007)"},{"key":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-14577-3_30","volume-title":"Financial Cryptography and Data Security","author":"A. Kate","year":"2010","unstructured":"Kate, A., Goldberg, I.: Using sphinx to improve onion routing circuit construction. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 359\u2013366. Springer, Heidelberg (2010)"},{"key":"23_CR29","unstructured":"Backes, M., Kate, A., Mohammadi, E.: Ace: an efficient key-exchange protocol for onion routing. In: WPES (2012)"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D., Gennaro, R.: Certificateless onion routing. In: CCS (2009)","DOI":"10.1145\/1653662.1653682"},{"issue":"2","key":"23_CR31","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10623-011-9604-z","volume":"67","author":"Ian Goldberg","year":"2012","unstructured":"Goldberg, I., Stebila, D., Ustaoglu, B.: Anonymity and one-way authentication in key exchange protocols. Designs, Codes and Cryptography (2012)","journal-title":"Designs, Codes and Cryptography"},{"key":"23_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/11535218_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J.L. Camenisch","year":"2005","unstructured":"Camenisch, J.L., Lysyanskaya, A.: A formal treatment of onion routing. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 169\u2013187. Springer, Heidelberg (2005)"},{"key":"23_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-14527-8_12","volume-title":"Privacy Enhancing Technologies","author":"G. Danezis","year":"2010","unstructured":"Danezis, G., Diaz, C., Troncoso, C., Laurie, B.: Drac: An architecture for anonymous low-volume communications. In: Atallah, M.J., Hopper, N.J. (eds.) PETS 2010. LNCS, vol.\u00a06205, pp. 202\u2013219. Springer, Heidelberg (2010)"},{"key":"23_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-70630-4_7","volume-title":"Privacy Enhancing Technologies","author":"E. Shimshock","year":"2008","unstructured":"Shimshock, E., Staats, M., Hopper, N.: Breaking and provably fixing minx. In: Borisov, N., Goldberg, I. (eds.) PETS 2008. LNCS, vol.\u00a05134, pp. 99\u2013114. Springer, Heidelberg (2008)"},{"issue":"2","key":"23_CR35","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput.\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"key":"23_CR36","unstructured":"Haeberlen, A., Fonseca, P., Rodrigues, R., Druschel, P.: Fighting cybercrime with packet attestation. Technical report, MPI-SWS (2011)"},{"key":"23_CR37","unstructured":"Dingledine, R., Mathewson, N.: Tor Protocol Specification (2008), https:\/\/gitweb.torproject.org\/torspec.git\/tree\/HEAD (accessed January 2014)"},{"key":"23_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, p. 514. Springer, Heidelberg (2001)"},{"key":"23_CR39","doi-asserted-by":"crossref","unstructured":"Blake, I., Seroussi, G., Smart, N., Cassels, J.W.S.: Advances in Elliptic Curve Cryptography. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511546570"},{"key":"23_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-23951-9_9","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-speed high-security signatures. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 124\u2013142. Springer, Heidelberg (2011)"},{"key":"23_CR41","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: POPL (2001)","DOI":"10.1145\/360204.360213"},{"key":"23_CR42","unstructured":"Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: CSFW (2001)"},{"key":"23_CR43","unstructured":"BackRef: Introducing accountability to anonymity networks (proverif scripts), http:\/\/crypsys.mmci.uni-saarland.de\/projects\/BackRef\/"},{"key":"23_CR44","unstructured":"Backes, M., Clark, J., Kate, A., Simeonovski, M., Druschel, P.: Backref: Introducing accountability to anonymity networks, http:\/\/arxiv.org\/abs\/1311.3151"},{"key":"23_CR45","doi-asserted-by":"crossref","unstructured":"Delaune, S., Kremer, S., Ryan, M.: Verifying privacy-type properties of electronic voting protocols, 435\u2013487 (2009)","DOI":"10.3233\/JCS-2009-0340"},{"key":"23_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11888116_9","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2006","author":"T. Chothia","year":"2006","unstructured":"Chothia, T.: Analysing the MUTE anonymous file-sharing system using the pi-calculus. In: Najm, E., Pradat-Peyre, J.-F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol.\u00a04229, pp. 115\u2013130. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07536-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T09:34:43Z","timestamp":1716802483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07536-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075358","9783319075365"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07536-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}