research-article

Dependent link padding algorithms for low latency anonymity systems

Authors:

Vikram SrinivasanAuthors Info & Claims

CCS '08: Proceedings of the 15th ACM conference on Computer and communications security

Pages 323 - 332

https://doi.org/10.1145/1455770.1455812

Published: 27 October 2008 Publication History

Abstract

Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analysis attacks while providing a strict delay bound. The covering traffic generated by our scheme uses the minimum sending rate to provide full anonymity for a given set of flows. The relationship between user anonymity and the minimum covering traffic rate is then studied via analysis and simulation. When user flows are Poisson processes with the same sending rate, the minimum covering traffic rate to provide full anonymity to m users is O(log m). For Pareto traffic, we show that the rate of the covering traffic converges to a constant when the number of flows goes to infinity. Finally, we use real Internet trace files to study the behavior of our algorithm when user flows have different rates.

References

[1]

D. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms," Communications of the ACM, vol. 24, no. 2, pp. 84--88, 1981.

Digital Library

[2]

G. Danezis, "The traffic analysis of continuous-time mixes," in Proceedings of Privacy Enhancing Technologies Workshop (PET), 2004.

Digital Library

[3]

X. Wang, S. Chen, and S. Jajodia, "Tracking anonymous peer-to-peer VoIP calls on the internet," in Proceedings of ACM CCS, 2005.

Digital Library

[4]

U. Moeller, L. Cottrell, P. Palfrader, and L. Sassaman, "IETF draft: Mixmaster protocol version 2," http://www.ietf.org/internet-drafts/draft-sassaman-mixmaster-03.txt, 2004.

[5]

M. Reed, P. Syverson, and D. Goldschlag, "Anonymous connections and onion routing," IEEE Journal on Selected Areas in Communications, vol. 16, no. 4, pp. 482--494, 1998.

Digital Library

[6]

R. Dingledine, N. Mathewson, and P. Syverson, "Tor: the second-generation onion router," in Proceedings of the 13th conference on USENIX Security Symposium, 2004.

Digital Library

[7]

M. Freedman and R. Morris, "Tarzan: a Peer-to-Peer Anonymizing Network Layer," in Proceedings of ACM CCS, 2002.

Digital Library

[8]

A. Serjantov and P. Sewell, "Passive Attack Analysis for Connection--Based Anonymity Systems," in Proceedings of European Symposium on Research in Computer Security, 2003.

[9]

V. Anantharam and S. Verdu, "Bits through queues," IEEE Trans. on Information Theory, vol. 42, no. 1, pp. 4--18, 1996.

Digital Library

[10]

X. Wang, S. Chen, and S. Jajodia, "Network Flow Watermarking Attack on Low-Latency Anonymous Communication Systems," in IEEE Symposium on Security and Privacy, 2007.

Digital Library

[11]

P. Venkitasubramaniam, T. He, and L. Tong, "Relay secrecy in wireless networks with eavesdroppers," in Proceedings of Allerton Conference on Communication, Control and Computing, 2006.

[12]

A. Pfitzmann, B. Pfitzmann, and M. Waidner, "ISDN-Mixes: Untraceable Communication with Very Small Bandwidth Overhead," in Proceedings of GI/ITG-Conference Communication in Distributed Systems, Feb. 1991.

Digital Library

[13]

P. Venkitasubramaniam and L. Tong, "Anonymous Networking for Minimum Latency in Multihop Networks," in IEEE Symposium on Security and Privacy, 2008.

Digital Library

[14]

P. Boucher, A. Shostack, and I. Goldberg, "Freedom systems 2.0 architecture,"White paper, Zero Knowledge Systems, Inc., December 2000.

[15]

S. J. Murdoch and P. Zielinski, "Sampled traffic analysis by internet-exchange-level adversaries," in Proceedings of Privacy Enhancing Technologies Workshop (PET), 2007.

Digital Library

[16]

S. Murdoch and G. Danezis, "Low-cost traffic analysis of Tor," in IEEE Symposium on Security and Privacy, 2005.

Digital Library

[17]

N. Hopper, E. Y. Vasserman, and E. Chan-Tin, "How Much Anonymity does Network Latency Leak?" in Proceedings of ACM CCS, 2007.

Digital Library

[18]

X. Fu, B. Graham, R. Bettati, and W. Zhao, "On effectiveness of link padding for statistical traffic analysis attacks," in Proceedings of IEEE ICDCS, 2003.

Digital Library

[19]

V. Shmatikov and M. Wang, "Timing analysis in low-latency mix networks: attacks and defenses?" in Proceedings of ESORICS, 2006.

Digital Library

[20]

A. Serjantov and G. Danezis, "Towards an information theoretic metric for anonymity," in Proceedings of Privacy Enhancing Technologies Workshop (PET), 2002.

Digital Library

[21]

C. Diaz, S. Seys, J. Claessens, and B. Preneel, "Towards measuring anonymity," in Proceedings of Privacy Enhancing Technologies Workshop (PET), 2002.

Digital Library

[22]

B. Bollobas, Modern Graph Theory. Springer, 1998.

[23]

A. Blum, D. Song, and S. Venkataraman, "Detection of interactive stepping stones: Algorithms and confidence bounds," in Proceedings of International Symposium on Recent Advances In Intrusion Detection, 2004.

[24]

T. He and L. Tong, "Detecting information flows: Improving chaff tolerance by joint detection," in Proceedings of Annual Conference Information Sciences and Systems (CISS), 2007.

[25]

G. H. Gonnet, "Expected Length of the Longest Probe Sequence in Hash Code Searching," Journal of the ACM, vol. 28, no. 2, pp. 289--304, 1981.

Digital Library

[26]

M. D. Mitzenmacher, "The power of two choices in randomized load balancing," PhD Thesis, University of Califonia at Berkeley 1996.

Digital Library

[27]

A. Papoulis and S. U. Pillai, Probability, Random Variables and Stochastic Processes. 4th Ed. McGraw Hill, 2002.

[28]

P. Venkitasubramaniam, T. He, and L. Tong, "Anonymous networking amidst eavesdroppers," IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2770--2784, 2008.

Digital Library

[29]

J. W. Cohen, The Single Server Queue. North-Holland, 1982.

[30]

M. E. Crovella and A. Bestavros, "Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes," IEEE/ACM Transactions on Networking, vol. 5, no. 6, pp. 835--846, 1997.

Digital Library

[31]

N. L. for Applied Network Research., "Auckland-viii data set," http://pma.nlanr.net/Special/auck8.html, 2003.

Cited By

Yu KChen D(2023)PAROS: The Missing “Puzzle” in Smart Home Router Operating Systems2023 32nd International Conference on Computer Communications and Networks (ICCCN)10.1109/ICCCN58024.2023.10230103(1-10)Online publication date: Jul-2023
https://doi.org/10.1109/ICCCN58024.2023.10230103
Sun RZhang YWang ZZhang XDong P(2023)Design of Privacy-Preserving in Multi-link Vehicle-Ground CommunicationEmerging Networking Architecture and Technologies10.1007/978-981-19-9697-9_17(209-220)Online publication date: 1-Feb-2023
https://doi.org/10.1007/978-981-19-9697-9_17
Xiong SSarwate AMandayam N(2022)Network Traffic Shaping for Enhancing Privacy in IoT SystemsIEEE/ACM Transactions on Networking10.1109/TNET.2021.314017430:3(1162-1177)Online publication date: Jun-2022
https://doi.org/10.1109/TNET.2021.3140174
Show More Cited By

Index Terms

Dependent link padding algorithms for low latency anonymity systems
1. Security and privacy
  1. Network security

Recommendations

An ultra-low-latency guaranteed-rate internet for cloud services

An Enhanced-Internet network that provides ultra-low-latency guaranteed-rate (GR) communications for Cloud Services is proposed. The network supports two traffic classes, the Smooth and Best-Effort classes. Smooth traffic flows receive low-jitter GR ...
Low-latency anonymity systems: statistical attacks and new applications
Deploying Low-Latency Anonymity: Design Challenges and Social Factors

Tor (the Onion Routing) is an open source, distributed, low-latency anonymity network. This article examines how Tor works, the underlying design philosophy, and some of the challenges in building, deploying, and sustaining a network for anonymous ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CCS '08: Proceedings of the 15th ACM conference on Computer and communications security

October 2008

590 pages

ISBN:9781595938107

DOI:10.1145/1455770

General Chair:
Peng Ning
North Carolina State University, USA
,
Program Chairs:
Paul Syverson
Naval Research Laboratory, USA
,
Somesh Jha
University of Wisconsin, USA

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 October 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CCS08

Sponsor:

CCS08: 15th ACM Conference on Computer and Communications Security 2008

October 27 - 31, 2008

Virginia, Alexandria, USA

Acceptance Rates

CCS '08 Paper Acceptance Rate 51 of 280 submissions, 18%;

Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Upcoming Conference

CCS '24

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 14 - 18, 2024

Salt Lake City , UT , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

42
Total Citations
View Citations
731
Total Downloads

Downloads (Last 12 months)15
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Yu KChen D(2023)PAROS: The Missing “Puzzle” in Smart Home Router Operating Systems2023 32nd International Conference on Computer Communications and Networks (ICCCN)10.1109/ICCCN58024.2023.10230103(1-10)Online publication date: Jul-2023
https://doi.org/10.1109/ICCCN58024.2023.10230103
Sun RZhang YWang ZZhang XDong P(2023)Design of Privacy-Preserving in Multi-link Vehicle-Ground CommunicationEmerging Networking Architecture and Technologies10.1007/978-981-19-9697-9_17(209-220)Online publication date: 1-Feb-2023
https://doi.org/10.1007/978-981-19-9697-9_17
Xiong SSarwate AMandayam N(2022)Network Traffic Shaping for Enhancing Privacy in IoT SystemsIEEE/ACM Transactions on Networking10.1109/TNET.2021.314017430:3(1162-1177)Online publication date: Jun-2022
https://doi.org/10.1109/TNET.2021.3140174
Buccafurri FDe Angelis VIdone MLabrini C(2022)A protocol for anonymous short communications in social networks and its application to proximity-based servicesOnline Social Networks and Media10.1016/j.osnem.2022.10022131(100221)Online publication date: Sep-2022
https://doi.org/10.1016/j.osnem.2022.100221
Chaddad LChehab AKayssi A(2021)OPriv: Optimizing Privacy Protection for Network TrafficJournal of Sensor and Actuator Networks10.3390/jsan1003003810:3(38)Online publication date: 24-Jun-2021
https://doi.org/10.3390/jsan10030038
Buccafurri FDe Angelis VIdone MLabrini CLazzaro S(2021)Achieving Sender Anonymity in Tor against the Global Passive AdversaryApplied Sciences10.3390/app1201013712:1(137)Online publication date: 23-Dec-2021
https://doi.org/10.3390/app12010137
Yu KLi QChen DRahman MWang S(2021)PrivacyGuardProceedings of the 20th International Conference on Information Processing in Sensor Networks (co-located with CPS-IoT Week 2021)10.1145/3412382.3458257(62-76)Online publication date: 18-May-2021
https://dl.acm.org/doi/10.1145/3412382.3458257
Buccafurri FDe Angelis VIdone MLabrini C(2021)Anonymous Short Communications over Social NetworksSecurity and Privacy in Communication Networks10.1007/978-3-030-90022-9_3(43-63)Online publication date: 4-Nov-2021
https://doi.org/10.1007/978-3-030-90022-9_3
Zhang HZou F(2020)A Survey of the Dark Web and Dark Market Research2020 IEEE 6th International Conference on Computer and Communications (ICCC)10.1109/ICCC51575.2020.9345271(1694-1705)Online publication date: 11-Dec-2020
https://doi.org/10.1109/ICCC51575.2020.9345271
Apthorpe NHuang DReisman DNarayanan AFeamster N(2019)Keeping the Smart Home Private with Smart(er) IoT Traffic ShapingProceedings on Privacy Enhancing Technologies10.2478/popets-2019-00402019:3(128-148)Online publication date: 12-Jul-2019
https://doi.org/10.2478/popets-2019-0040
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents