{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:25:28Z","timestamp":1778297128424,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540006466","type":"print"},{"value":"9783540365044","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36504-4_18","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T18:48:45Z","timestamp":1184957325000},"page":"253-268","source":"Crossref","is-referenced-by-count":29,"title":["Reliable MIX Cascade Networks through Reputation"],"prefix":"10.1007","author":[{"given":"Roger","family":"Dingledine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Syverson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054144","volume-title":"Advances in Cryptology-EUROCRYPT 1998","author":"M. Abe","year":"1998","unstructured":"Masayuki Abe. Universally verifiable MIX with verification work independent of the number of MIX servers. In Advances in Cryptology-EUROCRYPT 1998, LNCS Vol. 1403. Springer-Verlag, 1998."},{"key":"18_CR2","series-title":"Lect Notes Comput Sci","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":"2000","unstructured":"Oliver Berthold, Hannes Federrath, and Stefan K\u00f6psell. Web MIXes: A system for anonymous and unobservable Internet access. In Designing Privacy Enhancing Technologies, LNCS Vol. 2009, pages 115\u2013129. Springer-Verlag, 2000."},{"key":"18_CR3","series-title":"Lect Notes Comput Sci","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":"2000","unstructured":"Oliver Berthold, Andreas Pfitzmann, and Ronny Standtke. The disadvantages of free MIX routes and how to overcome them. In Designing Privacy Enhancing Technologies, LNCS Vol. 2009, pages 30\u201345. Springer-Verlag, 2000."},{"key":"18_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology-CRYPTO 2000","author":"D. Boneh","year":"2000","unstructured":"Dan Boneh and Moni Naor. Timed commitments. In Advances in Cryptology-CRYPTO 2000, LNCS Vol. 1880, pages 236\u2013254. Springer-Verlag, 2000."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 4(2), February 1982.","DOI":"10.1145\/358549.358563"},{"key":"18_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-EUROCRYPT 2000","author":"Y. Desmedt","year":"2000","unstructured":"Yvo Desmedt and Kaoru Kurosawa. How to break a practical MIX and design a new one. In Advances in Cryptology-EUROCRYPT 2000, LNCS Vol. 1803. Springer-Verlag, 2000."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Roger Dingledine, Michael J. Freedman, David Hopwood, and David Molnar. A Reputation System to Increase MIX-net Reliability. Proceedings of the Information Hiding Workshop 2001. Also available from < http:\/\/www.freehaven.net\/papers.html >.","DOI":"10.1007\/3-540-45496-9_10"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Roger Dingledine, Michael J. Freedman, and David Molnar. Accountability. In Peer-to-peer: Harnessing the Benefits of a Disruptive Technology. O\u2019Reilly and Associates, 2001.","DOI":"10.1145\/375348.377427"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Danny Dolev, Cynthia Dwork, and Moni Naor. Non-malleable cryptography. In 23rd ACM Symposium on the Theory of Computing (STOC), pages 542\u2013552, 1991. Full version available from the authors.","DOI":"10.1145\/103418.103474"},{"key":"18_CR10","unstructured":"Cynthia Dwork and Moni Naor. Pricing via processing or combatting junk mail. Technical Report CS95-20, Weizmann Institute, 1995. A preliminary version appeared in Crypto\u2019 92, pp. 129\u2013147."},{"key":"18_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/BFb0055485","volume-title":"Financial Cryptography, FC\u201998","author":"D. M. Goldschlag","year":"1998","unstructured":"David M. Goldschlag and Stuart G. Stubblebine. Publicly verifiable lotteries: Applications of delaying functions. In Financial Cryptography, FC\u201998, LNCS Vol. 1465, pages 214\u2013226. Springer-Verlag, 1998."},{"key":"18_CR12","unstructured":"David M. Goldschlag, Stuart G. Stubblebine, and Paul F. Syverson. Temporarily hidden bit commitment and lottery applications. Submitted for journal publication."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Markus Jakobsson. Flash Mixing. In Principles of Distributed Computing-PODC\u2019 99. ACM, 1999.","DOI":"10.1145\/301308.301333"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Markus Jakobsson and Ari Juels. Proofs of work and bread pudding protocols. In Proceedings of the IFIP TC6 and TC11 Joint Working Conference on Communications and Multimedia Security (CMS\u2019 99). Kluwer, September 1999.","DOI":"10.1007\/978-0-387-35568-9_18"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Anja Jerichow, Jan M\u00fcller, Andreas Pfitzmann, Birgit Pfitzmann, and Michael Waidner. Real-Time Mixes: A bandwidth-efficient anonymity protocol. IEEE Journal on Selected Areas in Communications 1998.","DOI":"10.1109\/49.668973"},{"key":"18_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Information Hiding Workshop 1998","author":"D. Kesdogan","year":"1998","unstructured":"D. Kesdogan, M. Egner, and T. B\u00fcschkes. Stop-and-go MIXes providing probabilistic anonymity in an open system. In Information Hiding Workshop 1998, LNCS Vol. 1525. Springer Verlag, 1998."},{"key":"18_CR17","unstructured":"Raph Levien. Advogato\u2019s trust metric. < http:\/\/www.advogato.org\/trust-metric.html >."},{"key":"18_CR18","unstructured":"Tal Malkin. Private Information Retrieval. PhD thesis, MIT, 2000. see < http:\/\/www.toc.lcs.mit.edu\/~tal\/ >."},{"key":"18_CR19","unstructured":"Tim May. Description of Levien\u2019s pinging service. < http:\/\/www2.pro-ns.net\/~crypto\/chapter8.html >."},{"key":"18_CR20","unstructured":"Jim McCoy. Re: DC-net implementation via reputation capital. < http:\/\/www.privacy.nb.ca\/cryptography\/archives\/coderpunks\/new\/1998-10\/0114.html >."},{"key":"18_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44448-3_15","volume-title":"Advances in Cryptology-ASIACRYPT 2000","author":"M. Mitomo","year":"2000","unstructured":"M. Mitomo and K. Kurosawa. Attack for Flash MIX. In Advances in Cryptology-ASIACRYPT 2000, LNCS Vol. 1976. Springer-Verlag, 2000."},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"C. Andrew Neff. A verifiable secret shuffle and its application to e-voting. In P. Samarati, editor, 8th ACM Conference on Computer and Communications Security (CCS-8), pages 116\u2013125. ACM Press, November 2001.","DOI":"10.1145\/501983.502000"},{"key":"18_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44448-3_14","volume-title":"Advances in Cryptology-ASIACRYPT 2000","author":"M. Ohkubo","year":"2000","unstructured":"M. Ohkubo and M. Abe. A Length-Invariant Hybrid MIX. In Advances in Cryptology-ASIACRYPT 2000, LNCS Vol. 1976. Springer-Verlag, 2000."},{"key":"18_CR24","unstructured":"James Riordan and Bruce Schneier. A certified e-mail protocol with no trusted third party. 13th Annual Computer Security Applications Conference, December 1998."},{"key":"18_CR25","unstructured":"Ronald L. Rivest, Adi Shamir, and David A. Wagner. Time-lock puzzles and timed-release crypto. MIT LCS technical memo MIT\/LCS\/TR-684, February 1996."},{"key":"18_CR26","unstructured":"RProcess. Selective denial of service attacks. < http:\/\/www.eff.org\/pub\/Privacy\/Anonymity\/1999_09_DoS_remaiLvuln.html >."},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Paul Syverson. Weakly secret bit commitment: Applications to lotteries and fair exchange. In Computer Security Foundations Workshop (CSF W11), pages 2\u201313, Rockport Massachusetts, June 1998. IEEE CS Press.","DOI":"10.21236\/ADA464109"},{"key":"18_CR28","series-title":"Lect Notes Comput Sci","volume-title":"ESORICS: European Symposium on Research in Computer Security","author":"Zhou","year":"1996","unstructured":"Zhou and Gollmann. Certified electronic mail. In ESORICS: European Symposium on Research in Computer Security, LNCS Vol. 1146. Springer-Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36504-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T20:48:15Z","timestamp":1737319695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36504-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006466","9783540365044"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-36504-4_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}