UCL  IRIS
Institutional Research Information Service
UCL Logo
Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to your Research Finance Administrator. Your can find your Research Finance Administrator at http://www.ucl.ac.uk/finance/research/post_award/post_award_contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:

Email: portico-services@ucl.ac.uk

Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
Impact of network topology on anonymity and overhead in low-latency anonymity networks
  • Publication Type:
    Conference
  • Authors:
    Diaz C, Murdoch SJ, Troncoso C
  • Publisher:
    Springer
  • Publication date:
    21/07/2010
  • Pagination:
    184, 201
  • Published proceedings:
    Lecture Notes in Computer Science
  • Volume:
    6205
  • ISBN-10:
    3642145264
  • ISBN-13:
    9783642145261
  • Name of conference:
    Privacy Enhancing Technologies Symposium
  • Conference place:
    Berlin, Germany
  • Conference start date:
    21/07/2010
  • Conference finish date:
    23/07/2010
  • Print ISSN:
    0302-9743
  • Language:
    eng
Abstract
Low-latency anonymous communication networks require padding to resist timing analysis attacks, and dependent link padding has been proven to prevent these attacks with minimal overhead. In this paper we consider low-latency anonymity networks that implement dependent link padding, and examine various network topologies. We find that the choice of the topology has an important influence on the padding overhead and the level of anonymity provided, and that Stratified networks offer the best trade-off between them. We show that fully connected network topologies (Free Routes) are impractical when dependent link padding is used, as they suffer from feedback effects that induce disproportionate amounts of padding; and that Cascade topologies have the lowest padding overhead at the cost of poor scalability with respect to anonymity. Furthermore, we propose an variant of dependent link padding that considerably reduces the overhead at no loss in anonymity with respect to external adversaries. Finally, we discuss how Tor, a deployed large-scale anonymity network, would need to be adapted to support dependent link padding. © 2010 Springer-Verlag Berlin Heidelberg.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Author
Dept of Computer Science
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by