Provable unlinkability against traffic analysis

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

Volumn 3110, Issue , 2004, Pages 266-280

  Berman, Ron ^a   Fiat, Amos ^a   Ta Shma, Amnon ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Anonymity; Peer to Peer networks; Privacy; Traffic Analysis; Unlinkability

Indexed keywords

COMPUTATIONAL LINGUISTICS; DATA PRIVACY; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION THEORY;

ANONYMITY; ANONYMOUS SYSTEMS; ATTACK MODEL; EFFICIENT PROTOCOLS; PRIORI INFORMATION; REAL-WORLD; TRAFFIC ANALYSIS; UNLINKABILITY;

PEER TO PEER NETWORKS;

EID: 35048864525     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27809-2_26     Document Type: Article

References (18)

1. Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Thesis (M.S. in Computer Science), University of California, Berkeley, Berkeley, CA, USA (1979)
2. Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the Association for Computing Machinery 24 (1981) 84-88
3. Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications 16 (1998) 482-494
4. Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and onion routing. In: 1997 IEEE Symposium on Security and Privacy. (1997) 44-54
5. Rackoff, C., Simon, D.R.: Cryptographic defense against traffic analysis. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, San Diego, California (1993) 672-681
6. Chaum, D.: The Dining Cryptographers Problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1 (1988) 65-75
7. Reiter, M.K., Rubin, A.D.: Crowds: anonymity for Web transactions. ACM Transactions on Information and System Security 1 (1998) 66-92
8. Abe, M.: Mix-networks on permutation networks. In: Advances in Cryptology - ASIACRYPT '99, International Conference on the Theory and Applications of Cryptology and Information Security, Singapore, November 14-18, 1999, Proceedings. Volume 1716 of Lecture Notes in Computer Science. (1999) 258-273
9. Abe, M., Hoshino, F.: Remarks on mix-network based on permutation networks. Lecture Notes in Computer Science 1992 (2001) 317-324
10. Malkhi, D., Pavlov, E.: Anonymity without 'cryptography' (extended abstract). In: FC: International Conference on Financial Cryptography, LNCS, Springer-Verlag (2001)
11. Beimel, Dolev: Buses for anonymous message delivery. JCRYPTOL: Journal of Cryptology 16 (2003)
12. Raymond, J.F.: Traffic analysis: Protocols, attacks, design issues, and open problems. Lecture Notes in Computer Science 2009 (2001) 10-29
13. The anonymizer. (http://anonymizer.com)
14. Anonymous remailer information. (http://anon.efga.org/Remailers.)
15. Federrath, H., ed.: Designing Privacy Enhancing Technologies, International Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, USA, July 25-26, 2000, Proceedings. In Federrath, H., ed.: International Workshop on Design Issues in Anonymity and Unobservability. Volume 2009 of Lecture Notes in Computer Science., Springer (2001)
16. Alon, N.: Testing subgraphs in large graphs. In: 42nd IEEE Symposium on Foundations of Computer Science. (2001) 434-439
17. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York, NY, USA (1991)
18. Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge (2000).