Sphinx: A compact and provably secure mix format

Proceedings - IEEE Symposium on Security and Privacy

Volumn , Issue , 2009, Pages 269-282

  Danezis, George ^b   Goldberg, Ian ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC SECURITY; MESSAGE FORMAT; MIX NETWORKS; PATH LENGTH; PROVABLY SECURE; RANDOM ORACLE MODEL; RELAY POSITION; SECURITY FEATURES; UNLINKABILITY;

NETWORK SECURITY;

EID: 70449674640     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2009.15     Document Type: Conference Paper

References (21)

1. Ross J. Anderson and Eli Biham. Two Practical and Provably Secure Block Ciphers: BEARS and LION. In Dieter Gollmann, editor, FSE, volume 1039 of Lecture Notes in Computer Science, pages 113-120. Springer, 1996.
2. Elaine Barker, William Barker, William Burr, William Polk, and Miles Smid. Recommendation for Key Management-Part 1: General (Revised). National Institute of Standards and Technology Special Publication 800-57, May 2006.
3. Daniel J. Bernstein. Curve25519: New Diffie-Hellman Speed Records. In Public Key Cryptography 2006, pages 207-228, 2006.
4. Oliver Berthold, Andreas Pfitzmann, and Ronny Standtke. The disadvantages of free MIX routes and how to overcome them. In H. Federrath, editor, Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, pages 30-45. Springer-Verlag, LNCS 2009, July 2000.
5. Jan Camenisch and Anna Lysyanskaya. A formal treatment of onion routing. In Victor Shoup, editor, Proceedings of CRYPTO 2005, pages 169-187. Springer-Verlag, LNCS 3621, August 2005.
6. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS, pages 136-145, 2001.
7. David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 4(2), February 1981.
8. George Danezis, Roger Dingledine, and Nick Mathewson. Mixminion: Design of a Type III Anonymous Remailer Protocol. In Proceedings of the 2003 IEEE Symposium on Security and Privacy, pages 2-15, May 2003.
9. George Danezis and Ben Laurie. Minx: A simple and efficient anonymous packet format. In Proceedings of the Workshop on Privacy in the Electronic Society (WPES 2004), Washington, DC, USA, October 2004.
10. Whitfield Diffie and Martin E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, 1976.
11. Roger Dingledine, Andrei Serjantov, and Paul Syverson. Blending different latency traffic with alphamixing. In George Danezis and Philippe Golle, editors, Proceedings of the Sixth Workshop on Privacy Enhancing Technologies (PET 2006), pages 245-257, Cambridge, UK, June 2006. Springer.
12. Ceki Gülcü and Gene Tsudik. Mixing E-mail with Babel. In Proceedings of the Network and Distributed Security Symposium - NDSS '96, pages 2-16. IEEE, 1996.
13. Dogan Kesdogan, Jan Egner, and Roland Büschkes. Stop-and-go MIXes: Providing probabilistic anonymity in an open system. In Proceedings of Information Hiding Workshop (IH 1998). Springer-Verlag, LNCS 1525, 1998.
14. David Mazières and M. Frans Kaashoek. The Design, Implementation and Operation of an Email Pseudonym Server. In Proceedings of the 5th ACM Conference on Computer and Communications Security (CCS 1998). ACM Press, 1998.
15. Bodo Möller. Provably secure public-key encryption for length-preserving chaumian mixes. In Proceedings of CT-RSA 2003. Springer-Verlag, LNCS 2612, 2003.
16. Ulf Möller, Lance Cottrell, Peter Palfrader, and Len Sassaman. Mixmaster Protocol - Version 2. IETF Internet Draft, 2003.
17. Mridul Nandi and Douglas R. Stinson. Multicollision Attacks on Some Generalized Sequential Hash Functions. IEEE Transactions on Information Theory, 53(2):759-767, February 2007.
18. Birgit Pfitzmann and Andreas Pfitzmann. How to break the direct RSA-implementation of MIXes. In Proceedings of EUROCRYPT 1989. Springer-Verlag, LNCS 434, 1990.
19. Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM, 21(2):120- 126, 1978.
20. Andrei Serjantov, Roger Dingledine, and Paul Syverson. From a trickle to a flood: Active attacks on several mix types. In Fabien Petitcolas, editor, Proceedings of Information Hiding Workshop (IH 2002). Springer- Verlag, LNCS 2578, October 2002.
21. Eric Shimshock, Matt Staats, and Nick Hopper. Breaking and Provably Fixing Minx. In Nikita Borisov and Ian Goldberg, editors, Proceedings of the Eighth International Symposium on Privacy Enhancing Technologies (PETS 2008), pages 99-114, Leuven, Belgium, July 2008. Springer.