Reliable mix cascade networks through reputation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2357, Issue , 2003, Pages 253-268

  Dingledine, Roger ^a   Syverson, Paul ^b  

^a Free Haven Project   (United States)

^b NAVAL RESEARCH LABORATORY   (United States)

Author keywords

Atnonymity; Communal randomness; Peer to peer; Reputation

Indexed keywords

CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS;

ATNONYMITY; CASCADE CONFIGURATION; COMMUNAL RANDOMNESS; MIX CASCADES; PEER TO PEER; REPUTATION; REPUTATION SYSTEMS;

CHROMIUM COMPOUNDS;

EID: 84957023357     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36504-4_18     Document Type: Conference Paper

References (28)

1. 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.
2. Oliver Berthold, Hannes Federrath, and Stefan Kopsell. Web MIXes: A system for anonymous and unobservable Internet access. In Designing Privacy Enhancing Technologies, LNCS Vol. 2009, pages 115-129. Springer-Verlag, 2000.
3. 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-45. Springer-Verlag, 2000.
4. Dan Boneh and Moni Naor. Timed commitments. In Advances in Cryptology - CRYPTO 2000, LNCS Vol. 1880, pages 236-254. Springer-Verlag, 2000.
5. David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 4(2), February 1982.
6. 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.
7. 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 .
8. Roger Dingledine, Michael J. Freedman, and David Molnar. Accountability. In Peer-to-peer: Harnessing the Benefits of a Disruptive Technology. O'Reilly and Associates, 2001.
9. Danny Dolev, Cynthia Dwork, and Moni Naor. Non-malleable cryptography. In 23rd ACM Symposium on the Theory of Computing (STOC), pages 542-552, 1991. Pull version available from the authors.
10. 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 '92, pp. 129-147.
11. David M. Goldschlag and Stuart G. Stubblebine. Publicly verifiable lotteries: Applications of delaying functions. In Financial Cryptography, FC'98, LNCS Vol. 1465, pages 214-226. Springer-Verlag, 1998.
12. David M. Goldschlag, Stuart G. Stubblebine, and Paul F. Syverson. Temporarily hidden bit commitment and lottery applications. Submitted for journal publication.
13. Markus Jakobsson. Flash Mixing. In Principles of Distributed Computing – PODC '99. ACM, 1999.
14. Markus Jakobsson and Ari Juels. Proofs of work and bread pudding protocols. In Proceedings of the IFIP TC6 and TCI 1 Joint Working Conference on Communications and Multimedia Security (CMS '99). Kluwer, September 1999.
15. Anja Jerichow, Jan Miiller, Andreas Pfitzmann, Birgit Pfitzmann, and Michael Waidner. Real-Time Mixes: A bandwidth-efficient anonymity protocol. IEEE Journal on Selected Areas in Communications 1998.
16. D. Kesdogan, M. Egner, and T. Biischkes. Stop-and-go MIXes providing probabilistic anonymity in an open system. In Information Hiding Workshop 1998, LNCS Vol. 1525. Springer Verlag, 1998.
17. Raph Levien. Advogato's trust metric. .
18. Tal Malkin. Private Information Retrieval. PhD thesis, MIT, 2000. see .
19. Tim May. Description of Levien's pinging service. .
20. Jim Mc Coy. Re: DC-net implementation via reputation capital. .
21. M. Mitomo and K. Kurosawa. Attack for Flash MIX. In Advances in Cryptology - ASIACRYPT 2000, LNCS Vol. 1976. Springer-Verlag, 2000.
22. 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-125. ACM Press, November 2001.
23. M. Ohkubo and M. Abe. A Length-Invariant Hybrid MIX. In Advances in Cryptology - ASIACRYPT 2000, LNCS Vol. 1976. Springer-Verlag, 2000.
24. James Riordan and Bruce Schneier. A certified e-madl protocol with no trusted third party. 13th Annual Computer Security Applications Conference, December 1998.
25. Ronald L. Rivest, Adi Shamir, and David A. Wagner. Time-lock puzzles and timedrelease crypto. MIT LCS technical memo MIT/LCS/TR-684, February 1996.
26. R Process. Selective denial of service attacks. .
27. Paul Syverson. Weakly secret bit commitment: Applications to lotteries and fair exchange. In Computer Security Foundations Workshop (CSFWll), pages 2-13, Rockport Massachusetts, June 1998. IEEE CS Press.
28. Zhou and Gollmann. Certified electronic mail. In ESORICS: European Symposium on Research in Computer Security, LNCS Vol. 1146. Springer-Verlag, 1996.