Provable Unlinkability Against Traffic Analysis with Low Message Overhead

[1]  I. Chuang,et al.  Quantum computation and quantum information , 2020 .

[2]  George Danezis,et al.  A Survey of Anonymous Communication Channels , 2008 .

[3]  Marek Klonowski,et al.  Local View Attack on Anonymous Communication , 2005, ESORICS.

[4]  Jan Camenisch,et al.  A Formal Treatment of Onion Routing , 2005, CRYPTO.

[5]  Miroslaw Kutylowski,et al.  Mobile Mixing , 2004, ICISC.

[6]  Marek Klonowski,et al.  Provable Unlinkability Against Traffic Analysis Already After O(log(n)) Steps! , 2004, ISC.

[7]  Amos Fiat,et al.  Provable Unlinkability against Traffic Analysis , 2004, Financial Cryptography.

[8]  Shlomi Dolev,et al.  Buses for Anonymous Message Delivery , 2003, Journal of Cryptology.

[9]  Olle Häggström.  Finite Markov Chains and Algorithmic Applications , 2002 .

[10]  Dahlia Malkhi,et al.  Anonymity without 'Cryptography' , 2002, Financial Cryptography.

[11]  Noga Alon,et al.  Testing subgraphs in large graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[12]  Artur Czumaj,et al.  Delayed path coupling and generating random permutations , 2000, Random Struct. Algorithms.

[13]  Michael K. Reiter,et al.  Crowds: anonymity for Web transactions , 1998, TSEC.

[14]  Martin E. Dyer,et al.  Path coupling: A technique for proving rapid mixing in Markov chains , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[15]  Daniel R. Simon,et al.  Cryptographic defense against traffic analysis , 1993, STOC.

[16]  Birgit Pfitzmann,et al.  How to Break the Direct RSA-Implementation of Mixes , 1990, EUROCRYPT.

[17]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[18]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[19]  G Danezis,et al.  Statistical disclosure attacks: Traffic confirmation in open environments , 2003 .

[20]  Dahlia Malkhi,et al.  Anonymity without `Cryptography' (Extended Abstract) , 2001 .

[21]  Jean-François Raymond,et al.  Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[22]  Artur Czumaj,et al.  Delayed path coupling and generating random permutations via distributed stochastic processes , 1999, SODA '99.

[23]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[24]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .