Provable unlinkability against traffic analysis already after O(log(n)) steps!

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

Volumn 3225, Issue , 2004, Pages 354-366

  Gomułkiewicz, Marcin ^a   Klonowski, Marek ^a   Kutyłowski, Mirosław ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Anonymity; Markov chain; Mix network; Path coupling; Rapid mixing; Unlinkability

Indexed keywords

CHAINS; MARKOV PROCESSES; MIXING; PROBABILITY; SECURITY OF DATA;

ANONYMITY; MIX NETWORKS; PATH COUPLING; RAPID MIXING; UNLINKABILITY;

PROBABILITY DISTRIBUTIONS;

EID: 35048849599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30144-8_30     Document Type: Article

References (11)

1. Adler, M., Levine, B.N., Schields, C., Wright, M.: Defending Anonymous Communication Against Passive Logging Attacks. IEEE Symp. on Security and Privacy, 2003
2. Aldous, D.: Random Walks of Finite Groups and Rapidly Mixing Markov Chains. In: Azéma, J., Yor, M. (eds.): Séminare de Probabilités XVII 1981/82. Lecture Notes in Mathematics 986. Springer-Verlag, Berlin (1983) 243-297
3. Alon, N.: Testing Subgraphs in Large Graphs. ACM-SIAM FOCS '2001, 434-439
4. Berman, R., Fiat, A., Ta-Shma, A.: Provable Unlinkability Against Traffic Analysis. Financial Cryptography'2004
5. Bubley, B., Dyer, M.: Path Coupling: a Technique for Proving Rapid Mixing in Markov Chains. ACM-SIAM FOCS '1997, 223-231
6. Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. CACM 24(2) (1981), 84-88
7. Chaum, D.: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology 1.1 (1988), 65-75
8. Czumaj, A., Kanarek, P., Kutyłowski, M., Loryś K.: Distributed Stochastic Processes for Generating Random Permutations. ACM-SIAM SODA'99, 271-280
9. Czumaj, A., Kutylowski, M.: Delayed Path Coupling and Generating Random Permutations. In: Random Structures and Algorithms 17(3-4) (2000), 238-259
10. Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Hiding Routing Information. Information Hiding '1996, Lecture Notes in Computer Science 1174, Springer-Verlag, 137-150
11. Rackoff, C., Simon, D. R.: Cryptographic Defense Against Traffic Analysis. ACM STOC'1993, 672-681