Provable Unlinkability Against Traffic Analysis with Low Message Overhead-Reference-Cited by-同舟云学术

Provable Unlinkability Against Traffic Analysis with Low Message Overhead

Published:2013-12-14 Issue:3 Volume:28 Page:623-640
ISSN:0933-2790
Container-title:Journal of Cryptology
language:en
Short-container-title:J Cryptol

Author:

Berman Ron,Fiat Amos,Gomułkiewicz Marcin,Klonowski Marek,Kutyłowski Mirosław,Levinboim Tomer,Ta-Shma Amnon

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,Software

Link

http://link.springer.com/content/pdf/10.1007/s00145-013-9171-8.pdf

Reference25 articles.

1. D.J. Aldous, Random walks on finite groups and rapidly mixing Markov chains, in Séminaire de Probabilités de Strasbourg, vol. 17, (1983), pp. 243–297

2. N. Alon, Testing subgraphs in large graphs, in FOCS, (2001), pp. 434–439

3. R. Bubley, M. Dyer, Path coupling: a technique for proving rapid mixing in Markov chains, in FOCS, (1997), pp. 223–231

4. A. Beimel, S. Dolev, Buses for anonymous message delivery. J. Cryptol. 16(1), 25–39 (2003)

5. LNCS;R. Berman,2004

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantifying unlinkability in multi-hop wireless networks;Computer Communications;2022-01

2. Quantifying Unlinkability in Multi-hop Wireless Networks;Proceedings of the 23rd International ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems;2020-11-16

3. Systematic literature review on the state of the art and future research work in anonymous communications systems;Computers & Electrical Engineering;2018-07

4. Ghost Train for Anonymous Communication;Security, Privacy, and Anonymity in Computation, Communication, and Storage;2016