Buses for anonymous message delivery

DOI10.1007/S00145-002-0128-6zbMath1027.94010OpenAlexW2063547081WikidataQ56806116 ScholiaQ56806116MaRDI QIDQ1402361

Shlomi Dolev, Amos Beimel

Publication date: 27 August 2003

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-002-0128-6

zbMATH Keywords

privacyanonymous communicationtraffic analysis

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Cryptography (94A60) Traffic problems in operations research (90B20) Applications of graph theory to circuits and networks (94C15)

Related Items (4)

Spreading alerts quietly and the subgroup escape problem ⋮ Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks ⋮ New bounds for randomized busing ⋮ Provable unlinkability against traffic analysis with low message overhead

This page was built for publication: Buses for anonymous message delivery