Building reliable mix networks with fair exchange

Lecture Notes in Computer Science

Volumn 3531, Issue , 2005, Pages 378-392

  Reiter, Michael K ^a   Wang, XiaoFeng ^b   Wright, Matthew ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b INDIANA UNIVERSITY   (United States)

^c UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; NETWORK PROTOCOLS; SECURITY OF DATA;

CONNECTION-BASED MIX NETWORKS; FAIR EXCHANGE MECHANISMS; FAIRNESS; PAYMENT MECHANISM;

COMPUTER NETWORKS;

EID: 26444583386     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496137_26     Document Type: Conference Paper

References (30)

1. M. Abe. Universally verifiable MIX with verification work independent of the number of MIX servers. In Proc. EUROCRYPT 1998, 1998.
2. A. Acquisti, R. Dingledine, and P. Syverson. On the economics of anonymity. In Proc. Financial Cryptography (FC '03), 2003.
3. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications, 18(4):593-610, April 2000.
4. A. Ateniese. Efficient verifiable encryption (and fair exchange) of digital signatures. In Proc. ACM Conference on Computer and Communications Security (CCS 1999), Nov. 1999.
5. R. Axelrod. The Evolution of Cooperation. Basic Books, 1984.
6. F. Bao, R. Deng, and W. Mao. Efficient and practical fair exchange protocols with off-line TTP. In Proc. IEEE Symposium on Security and Privacy, pages 77-85, 1998.
7. D. Boneh. The decision Diffie-Hellman problem. In Proc. Third Algorithmic Number Theory Symposium, volume 1423, pages 48-63, 1998.
8. L. Buttyan and J.P. Hubaux. Toward a formal model of fair exchange - a game theoretic approach. In Proc. International Workshop on ecommerce, 2000.
9. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, February 1981.
10. D. Chaum. Blind signatures for untraceable payments. In Proc. Crypto'82, pages 199-203, 1982.
11. D. Chaum. The dining cryptographers problem: Unconditional sender and receipient untraceability. Journal of Cryptography, 1(1):65-75, 1988.
12. B. Cohen. Incentives build robustness in BitTorrent. In Proc. Workshop on Economics of Peer-to-Peer Systems, May 2003.
13. R. Deng, L. Gong, A. Lazar, and W. Wang. Practical protocols for certified electronic mail. Journal of Network and Systems Management, 4(3):279-297, 1996.
14. R. Dingledine, M. J. Freedman, D. Hopwood, and D. Molnar. A reputation system to increase MIX-net reliability. In Proc. Financial Cryptography (FC '02). Springer Verlag, LNCS, 2002.
15. R. Dingledine, N. Mathewson, and P. Syverson. Reliable MIX cascade networks through reputation. In Proc. Financial Cryptography (FC '03), 2003.
16. D. R. Figueiredo, J. K. Shapiro, and D. Towsley. Using Payments to Promote Cooperation in Anonymity Protocols, 2003. Manuscript.
17. E. Fijisaki and T. Okamoto. Statistical zero-knowledge protocols to prove modular polynomial relations. In Advances in Cryptology - CRYPTO '97 (LNCS 1294), pages 16-30, 1997.
18. E. Franz, A. Jerichow, and G. Wicke. A payment scheme for mixes providing anonymity. In Proc. Trends in Distributed Systems for Electronic Commerce, volume 1402, 1998.
19. M. Jakobsson. Ripping coins for a fair exchange. In Proc. Advances in Cryptology - EURO CRYPT'95, volume 921, pages 220-230, 1995.
20. M. Jakobsson and A. Juels. An optimally robust hybrid mix network (extended abstract). In Proc. Principles of Distributed Computing - PODC '01, 2001.
21. M. Jakobsson, A. Juels, and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In Proc. USENIX Security '02, 2002.
22. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In Proc. Information and Communications Security - First International Conference, volume 1334, pages 440-444, 1997.
23. A. Pasick. File-sharing network thrives beneath the radar. http://in.tech.yahoo.com/041103/137/2ho4i.html, November 2004.
24. M. K. Reiter and A. D. Rubin. Crowds: Anonymity for Web Transactions. ACM Transactions on Information and System Security, 1(1):66-92, November 1998.
25. R. L. Rivest and A. Shamir. PayWord and MicroMint - two simple micropayment schemes. CryptoBytes, 2(1):7-11, Spring 1996.
26. T. Sandholm and X. F. Wang. (Im)possibility of safe exchange mechanism design. In Proc. National Conference on Artificial Intelligence, 2002.
27. V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. Journal of Cryptology, 15:75-96, 2002.
28. M. Wright, M. Adler, B. Levine, and C. Shields. An analysis of the degradation of anonymous protocols. In Proc. ISOC Symposium on Network and Distributed System Security (NDSS 2002), February 2002.
29. M. Wright, M. Adler, B. Levine, and C. Shields. Defending anonymous communication against passive logging attacks. In Proc. 2003 IEEE Symposium on Security and Privacy, May 2003.
30. J. Zhou and D. Gollmann. A fair nonrepudiation protocol. In Proc. IEEE Symposium of Security and Privacy, May 1996.