skip to main content
10.1145/2810156.2810171acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article

Catch Me If You Can: A Practical Framework to Evade Censorship in Information-Centric Networks

Published: 30 September 2015 Publication History

Abstract

Internet traffic is increasingly becoming multimedia-centric. Its growth is driven by the fast-growing mobile user base that is more interested in the content rather than its origin. These trends have motivated proposals for a new Internet networking paradigm information-centric networking (ICN). This paradigm requires unique names for packets to leverage pervasive in-network caching, name-based routing, and named-data provenance. However named-data routing makes user censorship easy. Hence an anti-censorship mechanism is imperative to help users mask their named queries to prevent censorship and identification. However, this masking mechanism should not adversely affect request rates. In this paper, we propose such an anti-censorship framework, which is lightweight and specifically targets low compute power mobile devices. We analyze our framework's information-theoretic secrecy and present perfect secrecy thresholds under different scenarios. We also analyze its breakability and computational security. Experimental results prove the framework's effectiveness: for requests it adds between 1.3-1.8 times in latency overhead over baseline ICN; significantly lesser than the overhead of the state of the art Tor (up to 38 times over TCP).

References

[1]
PSIRP Project, Deliverable D4.6: Final Evaluation Report on Deployment Incentives and Business Models, http://www.psirp.org/publications/.
[2]
G. Acs, M. Conti, P. Gasti, C. Ghali, and G. Tsudik. Cache privacy in named-data networking. In International Conference onDistributed Computing Systems (ICDCS), pages 41--51. IEEE, 2013.
[3]
Anonymizer Universal. https://anonymizer.com/.
[4]
S. Arianfar, T. Koponen, B. Raghavan, and S. Shenker. On preserving privacy in content-oriented networks. In Proceedings of the ACM SIGCOMM workshop on Information-centric networking, pages 19--24. ACM, 2011.
[5]
A. Chaabane, E. De Cristofaro, M. Kaafar, and E. Uzun. Privacy in content-oriented networking: Threats and countermeasures. ACM SIGCOMM Computer Communication Review, 43(3):25--33, 2013.
[6]
C. Dannewitz. NetInf: An information-centric design for the future Internet. In 3rd GI/ITG KuVS Workshop on The Future Internet, 2009.
[7]
S. DiBenedetto, P. Gasti, G. Tsudik, and E. Uzun. Andana: Anonymous named data networking application. Arxiv preprint arXiv:1112.2205, 2011.
[8]
H. Dorrie. 100 Great problems of elementary mathematics. Dover Publications, 1965.
[9]
A. S. Fraenkel and S. T. Klein. Complexity aspects of guessing prefix codes. Algorithmica, 12(4-5):409--419, 1994.
[10]
D. Gillman, M. Mohtashemi, and R. Rivest. On breaking a human code. IEEE Transactions on Information Theory, 42(3):972--976, 1996.
[11]
D. Huffman et al. A method for the construction of minimum redundancy codes. proc. IRE, 40(9):1098--1101, 1952.
[12]
V. Jacobson, D.K. Smetters, J.D. Thornton, M.F. Plass, N.H. Briggs, and R.L. Braynard. Networking named content. In Proceedings of the 5th international conference on Emerging networking experiments and technologies, pages 1--12. ACM, 2009.
[13]
T. Koponen, M. Chawla, B.G. Chun, A. Ermolinskiy, K.H. Kim, S. Shenker, and I. Stoica. A data-oriented (and beyond) network architecture. In ACM SIGCOMM Computer Communication Review, volume 37, pages 181--192. ACM, 2007.
[14]
Palo Alto Research Lab. Ccnx. http://www.ccnx.org/.
[15]
J. L. Massey. Guessing and entropy. In Proceedings to IEEE International Symposium on Information Theory, page 204. IEEE, 1994.
[16]
PURSUIT Project. http://www.fp7-pursuit.eu/pursuitweb.
[17]
C. Shannon. Prediction and entropy of printed english. Bell system technical journal, 30(1):50--64, 1951.
[18]
G. Smith. On the foundations of quantitative information flow. In Foundations of Software Science and Computational Structures, pages 288--302. Springer, 2009.
[19]
Tor Project: Anonymity Online. http://www.torproject.org/.
[20]
C.-P. Wu and C.-C. Kuo. Design of integrated multimedia compression and encryption systems. IEEE Transactions on Multimedia, 7(5):828--839, 2005.
[21]
D. Xie and C.-C. Kuo. nhanced multiple human table (mht) encryption scheme using key hopping. In Proceedings of the 2004 International Symposium on Circuits and Systems (ISCAS), volume 5, pages 568--571. IEEE, 2004.
[22]
J. Zhou, Z. Liang, Y. Chen, and Oscar C. Au. Security analysis of multimedia encryption schemes based on multiple human table. Signal Processing Letters, IEEE, 14(3):201--204, 2007.

Cited By

View all
  • (2023)Programmable Name Obfuscation Framework for Controlling Privacy and Performance on CCNIEEE Transactions on Network and Service Management10.1109/TNSM.2023.327525020:3(2460-2474)Online publication date: Sep-2023
  • (2023)Security and Integrity Attacks in Named Data Networking: A SurveyIEEE Access10.1109/ACCESS.2023.323873211(7984-8004)Online publication date: 2023
  • (2022)Harpocrates: Anonymous Data Publication in Named Data NetworkingProceedings of the 27th ACM on Symposium on Access Control Models and Technologies10.1145/3532105.3535025(79-90)Online publication date: 7-Jun-2022
  • Show More Cited By

Index Terms

  1. Catch Me If You Can: A Practical Framework to Evade Censorship in Information-Centric Networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ACM-ICN '15: Proceedings of the 2nd ACM Conference on Information-Centric Networking
    September 2015
    236 pages
    ISBN:9781450338554
    DOI:10.1145/2810156
    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 the author(s) 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: 30 September 2015

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. NDN
    2. information theory
    3. information-centric networking
    4. privacy
    5. security

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    ICN'15
    Sponsor:
    ICN'15: 2nd International Conference on Information-Centric Networking
    September 30 - October 2, 2015
    California, San Francisco, USA

    Acceptance Rates

    ACM-ICN '15 Paper Acceptance Rate 18 of 55 submissions, 33%;
    Overall Acceptance Rate 133 of 482 submissions, 28%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 17 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Programmable Name Obfuscation Framework for Controlling Privacy and Performance on CCNIEEE Transactions on Network and Service Management10.1109/TNSM.2023.327525020:3(2460-2474)Online publication date: Sep-2023
    • (2023)Security and Integrity Attacks in Named Data Networking: A SurveyIEEE Access10.1109/ACCESS.2023.323873211(7984-8004)Online publication date: 2023
    • (2022)Harpocrates: Anonymous Data Publication in Named Data NetworkingProceedings of the 27th ACM on Symposium on Access Control Models and Technologies10.1145/3532105.3535025(79-90)Online publication date: 7-Jun-2022
    • (2021)Analyzing GDPR compliance of named data networkingProceedings of the 8th ACM Conference on Information-Centric Networking10.1145/3460417.3482979(107-117)Online publication date: 22-Sep-2021
    • (2021)Producer Anonymity Based on Onion Routing in Named Data NetworkingIEEE Transactions on Network and Service Management10.1109/TNSM.2020.301905218:2(2420-2436)Online publication date: Jun-2021
    • (2021)Name Space Analysis: Verification of Named Data Network Data PlanesIEEE/ACM Transactions on Networking10.1109/TNET.2021.305076929:2(848-861)Online publication date: Apr-2021
    • (2021)Investigating the Design Space for Name Confidentiality in Named Data NetworkingMILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)10.1109/MILCOM52596.2021.9652892(570-576)Online publication date: 29-Nov-2021
    • (2021)SmartDetour: Defending Blackhole and Content Poisoning Attacks in IoT NDN NetworksIEEE Internet of Things Journal10.1109/JIOT.2021.30615318:15(12119-12136)Online publication date: 1-Aug-2021
    • (2020)BEAcM‐DPTransactions on Emerging Telecommunications Technologies10.1002/ett.379431:2Online publication date: 16-Feb-2020
    • (2019)Name Space AnalysisProceedings of the 6th ACM Conference on Information-Centric Networking10.1145/3357150.3357406(44-54)Online publication date: 24-Sep-2019
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media