{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,19]],"date-time":"2026-10-19T11:31:53Z","timestamp":1792409513071,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262237","type":"print"},{"value":"9783540315421","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11496137_26","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T15:14:24Z","timestamp":1285427664000},"page":"378-392","source":"Crossref","is-referenced-by-count":12,"title":["Building Reliable Mix Networks with Fair Exchange"],"prefix":"10.1007","author":[{"given":"Michael K.","family":"Reiter","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"XiaoFeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew","family":"Wright","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054144","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Abe","year":"1998","unstructured":"Abe, M.: Universally verifiable MIX with verification work independent of the number of MIX servers. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, Springer, Heidelberg (1998)"},{"key":"26_CR2","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.F.: On the economics of anonymity. In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742, pp. 84\u2013102. Springer, Heidelberg (2003)"},{"issue":"4","key":"26_CR3","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1109\/49.839935","volume":"18","author":"N. Asokan","year":"2000","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications\u00a018(4), 593\u2013610 (2000)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Ateniese, A.: Efficient verifiable encryption (and fair exchange) of digital signatures. In: Proc. ACM Conference on Computer and Communications Security (CCS 1999) (November 1999)","DOI":"10.1145\/319709.319728"},{"key":"26_CR5","unstructured":"Axelrod, R.: The Evolution of Cooperation. Basic Books (1984)"},{"key":"26_CR6","unstructured":"Bao, F., Deng, R., Mao, W.: Efficient and practical fair exchange protocols with off-line TTP. In: Proc. IEEE Symposium on Security and Privacy, pp. 77\u201385 (1998)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D. Boneh","year":"1998","unstructured":"Boneh, D.: The decision Diffie-Hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 48\u201363. Springer, Heidelberg (1998)"},{"key":"26_CR8","unstructured":"Buttyan, L., Hubaux, J.P.: Toward a formal model of fair exchange \u2013 a game theoretic approach. In: Proc. International Workshop on ecommerce (2000)"},{"issue":"2","key":"26_CR9","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(2), 84\u201388 (1981)","journal-title":"Communications of the ACM"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Proc. Crypto 1982, pp. 199\u2013203 (1982)","DOI":"10.1007\/978-1-4757-0602-4_18"},{"issue":"1","key":"26_CR11","first-page":"65","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and receipient untraceability. Journal of Cryptography\u00a01(1), 65\u201375 (1988)","journal-title":"Journal of Cryptography"},{"key":"26_CR12","unstructured":"Cohen, B.: Incentives build robustness in BitTorrent. In: Proc. Workshop on Economics of Peer-to-Peer Systems (May 2003)"},{"issue":"3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02139147","volume":"4","author":"R. Deng","year":"1996","unstructured":"Deng, R., Gong, L., Lazar, A., Wang, W.: Practical protocols for certified electronic mail. Journal of Network and Systems Management\u00a04(3), 279\u2013297 (1996)","journal-title":"Journal of Network and Systems Management"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36504-4_18","volume-title":"Financial Cryptography","author":"R. Dingledine","year":"2003","unstructured":"Dingledine, R., Freedman, M.J., Hopwood, D., Molnar, D.: A reputation system to increase MIX-net reliability. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357. Springer, Heidelberg (2003)"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Financial Cryptography","author":"R. Dingledine","year":"2003","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Reliable MIX cascade networks through reputation. In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742. Springer, Heidelberg (2003)"},{"key":"26_CR16","unstructured":"Figueiredo, D.R., Shapiro, J.K., Towsley, D.: Using Payments to Promote Cooperation in Anonymity Protocols(2003) (manuscript)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/BFb0053404","volume-title":"Trends in Distributed Systems for Electronic Commerce","author":"E. Franz","year":"1998","unstructured":"Franz, E., Jerichow, A., Wicke, G.: A payment scheme for mixes providing anonymity. In: Lamersdorf, W., Merz, M. (eds.) TREC 1998. LNCS, vol.\u00a01402, p. 94. Springer, Heidelberg (1998)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/3-540-49264-X_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"M. Jakobsson","year":"1995","unstructured":"Jakobsson, M.: Ripping coins for a fair exchange. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 220\u2013230. Springer, Heidelberg (1995)"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Juels, A.: An optimally robust hybrid mix network (extended abstract). In: Proc. Principles of Distributed Computing - PODC 2001 (2001)","DOI":"10.1145\/383962.384046"},{"key":"26_CR21","unstructured":"Jakobsson, M., Juels, A., Rivest, R.: Making mix nets robust for electronic voting by randomized partial checking. In: Proc. USENIX Security 2002 (2002)"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BFb0028500","volume-title":"Information and Communications Security","author":"W. Ogata","year":"1997","unstructured":"Ogata, W., Kurosawa, K., Sako, K., Takatani, K.: Fault tolerant anonymous channel. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 440\u2013444. Springer, Heidelberg (1997)"},{"key":"26_CR23","unstructured":"Pasick, A.: File-sharing network thrives beneath the radar (November 2004), \n                  \n                    http:\/\/in.tech.yahoo.com\/041103\/137\/2ho4i.html"},{"issue":"1","key":"26_CR24","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 Transactions on Information and System Security\u00a01(1), 66\u201392 (1998)","journal-title":"ACM Transactions on Information and System Security"},{"issue":"1","key":"26_CR25","first-page":"7","volume":"2","author":"R.L. Rivest","year":"1996","unstructured":"Rivest, R.L., Shamir, A.: PayWord and MicroMint \u2013 two simple micropayment schemes. CryptoBytes\u00a02(1), 7\u201311 (Spring 1996)","journal-title":"CryptoBytes"},{"key":"26_CR26","unstructured":"Sandholm, T., Wang, X.F.: (Im)possibility of safe exchange mechanism design. In: Proc. National Conference on Artificial Intelligence (2002)"},{"key":"26_CR27","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00145-001-0020-9","volume":"15","author":"V. Shoup","year":"2002","unstructured":"Shoup, V., Gennaro, R.: Securing threshold cryptosystems against chosen ciphertext attack. Journal of Cryptology\u00a015, 75\u201396 (2002)","journal-title":"Journal of Cryptology"},{"key":"26_CR28","unstructured":"Wright, M., Adler, M., Levine, B., Shields, C.: An analysis of the degradation of anonymous protocols. In: Proc. ISOC Symposium on Network and Distributed System Security (NDSS 2002) (February 2002)"},{"key":"26_CR29","unstructured":"Wright, M., Adler, M., Levine, B., Shields, C.: Defending anonymous communication against passive logging attacks. In: Proc. 2003 IEEE Symposium on Security and Privacy (May 2003)"},{"key":"26_CR30","unstructured":"Zhou, J., Gollmann, D.: A fair nonrepudiation protocol. In: Proc. IEEE Symposium of Security and Privacy (May 1996)"}],"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\/11496137_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:14:37Z","timestamp":1558293277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496137_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262237","9783540315421"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11496137_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}