New bounds for randomized busingSEIDEN, Steven S; CHEN, Peter P; LAX, R. F et al.Theoretical computer science. 2005, Vol 332, Num 1-3, pp 63-81, issn 0304-3975, 19 p.Article

Buses for anonymous message deliveryBEIMEL, Amos; DOLEV, Shlomi.Journal of cryptology. 2003, Vol 16, Num 1, pp 25-39, issn 0933-2790, 15 p.Article

RAD: Recipient-anonymous data delivery based on public routing proxiesKIM, Hyoungshick; JEONG, Jaehoon.Computer networks (1999). 2011, Vol 55, Num 15, pp 3469-3484, issn 1389-1286, 16 p.Article

PACOM: Parasitic anonymous communication in the BitTorrent networkJIANMING LV; TIEYING ZHANG; ZHENHUA LI et al.Computer networks (1999). 2014, Vol 74, pp 13-33, issn 1389-1286, 21 p., aArticle

Privacy Addressing-Based Anonymous Communication for Vehicular Ad Hoc NetworksLONGJIANG LI; YUMING MAO; YONGGANG LI et al.Wireless personal communications. 2013, Vol 71, Num 3, pp 2349-2359, issn 0929-6212, 11 p.Article

Garbled Routing (GR): A generic framework towards unification of anonymous communication systemsMADANI, Shaahin; KHALIL, Ibrahim.Journal of network and computer applications. 2014, Vol 44, pp 183-195, issn 1084-8045, 13 p.Article

Anonymity analysis of P2P anonymous communication systemsJIA ZHANG; HAIXIN DUAN; WU LIU et al.Computer communications. 2011, Vol 34, Num 3, pp 358-366, issn 0140-3664, 9 p.Article

Optimizing the design parameters of threshold pool mixes for anonymity and delayREBOLLO-MONEDERO, David; PARRA-ARNAU, Javier; FORNE, Jordi et al.Computer networks (1999). 2014, Vol 67, pp 180-200, issn 1389-1286, 21 p.Article