More Web Proxy on the site http://driver.im/

research-article

Free access

On preserving privacy in content-oriented networks

Authors:

Somaya Arianfar,

Barath Raghavan,

Scott ShenkerAuthors Info & Claims

ICN '11: Proceedings of the ACM SIGCOMM workshop on Information-centric networking

Pages 19 - 24

https://doi.org/10.1145/2018584.2018589

Published: 19 August 2011 Publication History

Abstract

The recent literature has hailed the benefits of content-oriented network architectures. However, such designs pose a threat to privacy by revealing a user's content requests. In this paper, we study how to ameliorate privacy in such designs. We present an approach that does not require any special infrastructure or shared secrets between the publishers and consumers of content. In lieu of any informational asymmetry, the approach leverages computational asymmetry by forcing the adversary to perform sizable computations to reconstruct each request. This approach does not provide ideal privacy, but makes it hard for an adversary to effectively monitor the content requests of a large number of users.

References

[1]

R. Anderson. The Eternity Service. In Proc. of Pragocrypt, 1996.

[2]

Anonymizer. http://www.anonymizer.com/.

[3]

D. Asonov and J.-C. Freytag. Repudiative Information Retrieval. In Proc. of Workshop on Privacy in the Electronic Society, 2002.

Digital Library

[4]

J. Aspnes, J. Feigenbaum, A. Yampolskiy, and S. Zhong. Towards a Theory of Data Entanglement. Theoretical Computer Science, 389(1-2):26--43, 2007.

Digital Library

[5]

M. Bellare and S. Micali. Non-interactive Oblivious Transfer and Applications. In Proc. of CRYPTO, 1989.

Digital Library

[6]

N. Borisov, I. Goldberg, and E. Brewer. Off-the-record communication, or, why not to use PGP. In Proc. of Workshop on Privacy in the Electronic Society, pages 77--84, 2004.

Digital Library

[7]

C. Cachin, S. Micali, and M. Stadler. Computationally Private Information Retrieval with Polylogarithmic Communication. Lecture Notes in Computer Science, 1592, 1999.

Digital Library

[8]

R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky. Deniable Encryption. In Proc. of CRYPTO, 1997.

Digital Library

[9]

D. L. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, 24(2):84--90, 1981.

Digital Library

[10]

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private Information Retrieval. In IEEE Symposium on FOCS, 1995.

Digital Library

[11]

I. Clarke, T. W. Hong, S. G. Miller, O. Sandberg, and B. Wiley. Protecting Free Expression Online with Freenet. IEEE Internet Computing, 6(1):40--49, 2002.

Digital Library

[12]

R. Dingledine, M. J. Freedman, and D. Molnar. The Free Haven Project: Distributed Anonymous Storage Service. LNCS, 2009, 2001.

Digital Library

[13]

R. Dingledine, N. Mathewson, and P. Syverson. Tor: The Second-Generation Onion Router. In Proc. of USENIX Security Symposium, 2004.

Digital Library

[14]

N. Feamster, M. Balazinska, G. Harfst, H. Balakrishnan, and D. Karger. Infranet: Circumventing Web Censorship and Surveillance. In Proc. of USENIX Security Symposium, 2002.

Digital Library

[15]

A. Fiat and M. Naor. Broadcast Encryption. In Proc. CRYPTO, 1993.

Digital Library

[16]

M. J. Freedman and R. Morris. Tarzan: a Peer-to-Peer Anonymizing Network Layer. In Proc. of ACM CCS, 2002.

Digital Library

[17]

D. Goldschlag, M. Reed, and P. Syverson. Onion Routing. Commun. ACM, 42(2):39--41, 1999.

Digital Library

[18]

S. Hand and T. Roscoe. Mnemosyne: Peer-to-Peer Steganographic Storage. In Proc. of IPTPS, 2002.

Digital Library

[19]

V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard. Networking Named Content. In Proc. CoNEXT, Dec. 2009.

Digital Library

[20]

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 Proc. of SIGCOMM, 2007.

Digital Library

[21]

E. Kushilevitz and R. Ostrovsky. Replication Is Not Needed: Single Database, Computationally-private Information Retrieval. In Proc. 38th IEEE FOCS, 1997.

Digital Library

[22]

M. Luby. LT codes. In Proceedings of IEEE FOCS, 2002.

Digital Library

[23]

M. Naor and B. Pinkas. Oblivious Transfer with Adaptive Queries. In Proc. of CRYPTO, 1999.

Digital Library

[24]

M. Naor and B. Pinkas. Efficient Oblivious Transfer Protocols. In Proc. of SODA, 2001.

Digital Library

[25]

M. Naor and O. Reingold. On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. Journal of Cryptology, 12(1):29--66, 1999.

Digital Library

[26]

R. Rivest. All-or-nothing Encryption and the Package Transform. In Proceedings of Fast Software Encryption, 1997.

Digital Library

[27]

S. W. Smith and D. Safford. Practical Private Information Retrieval with Secure Coprocessors. In Technical report, IBM T.J. Watson Research Center, 2000.

[28]

A. Stubblefield and D. Wallach. Dagster: Censorship-Resistant Publishing Without Replication. Rice University, Dept. of Computer Science, Tech. Rep. TR01-380, 2001.

[29]

D. Trossen, M. Särelä, and K. Sollins. Arguments for an Information-centric Internetworking Architecture. SIGCOMM CCR, 40, Apr. 2010.

Digital Library

[30]

TrueCrypt. http://www.truecrypt.org/.

[31]

L. Von Ahn and N. Hopper. Public-key Steganography. In Proc. of EUROCRYPT, 2004.

[32]

M. Waldman and D. Mazieres. Tangler: a censorship-resistant publishing system based on document entanglements. In Proc. of ACM CCS, pages 126--135, 2001.

Digital Library

[33]

Zero Knowledge Systems Freedom Network. http://www.zks.net/.

Cited By

Tan XWang SJi LTong XZou CZheng QYang J(2024)Hybrid-Coding Based Content Access Control for Information-Centric NetworkingIEEE Transactions on Wireless Communications10.1109/TWC.2023.333293023:7(6765-6777)Online publication date: Jul-2024
https://doi.org/10.1109/TWC.2023.3332930
Duan JTang WSun CYan ZCheng WLi C(2024)A Dummy Query-Based User Privacy Protection Scheme in Named Data NetworkingCommunications and Networking10.1007/978-3-031-67162-3_11(162-181)Online publication date: 6-Aug-2024
https://doi.org/10.1007/978-3-031-67162-3_11
Yoshinaka YKita KTakemasa JKoizumi YHasegawa T(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
https://doi.org/10.1109/TNSM.2023.3275250
Show More Cited By

Recommendations

Privacy in content-oriented networking: threats and countermeasures

As the Internet struggles to cope with scalability, mobility, and security issues, new network architectures are being proposed to better accommodate the needs of modern systems and applications. In particular, Content-Oriented Networking (CON) has ...
Named data networking

Named Data Networking (NDN) is one of five projects funded by the U.S. National Science Foundation under its Future Internet Architecture Program. NDN has its roots in an earlier project, Content-Centric Networking (CCN), which Van Jacobson first ...
Protecting access privacy of cached contents in information centric networks
ASIA CCS '13: Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security

In recently proposed information centric networks (ICN), a user issues "interest" packets to retrieve contents from network by names. Once fetched from origin servers, "data" packets are replicated and cached in all routers along routing and forwarding ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICN '11: Proceedings of the ACM SIGCOMM workshop on Information-centric networking

August 2011

80 pages

ISBN:9781450308014

DOI:10.1145/2018584

Program Chairs:
Dirk Kutscher
NEC Laboratories Europe, Germany
,
Giacomo Morabito
University of Catania, Italy
,
Ignacio Solis
PARC, USA
,
Börje Ohlman
Ericsson, Sweden
,
George C. Polyzos
AUEB, Greece
,
Lixia Zhang
UCLA, USA

Copyright © 2011 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

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 August 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGCOMM '11

Sponsor:

SIGCOMM

SIGCOMM '11: ACM SIGCOMM 2011 Conference

August 19, 2011

Ontario, Toronto, Canada

Acceptance Rates

ICN '11 Paper Acceptance Rate 12 of 50 submissions, 24%;

Overall Acceptance Rate 133 of 482 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

63
Total Citations
View Citations
579
Total Downloads

Downloads (Last 12 months)71
Downloads (Last 6 weeks)7

Reflects downloads up to 18 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Tan XWang SJi LTong XZou CZheng QYang J(2024)Hybrid-Coding Based Content Access Control for Information-Centric NetworkingIEEE Transactions on Wireless Communications10.1109/TWC.2023.333293023:7(6765-6777)Online publication date: Jul-2024
https://doi.org/10.1109/TWC.2023.3332930
Duan JTang WSun CYan ZCheng WLi C(2024)A Dummy Query-Based User Privacy Protection Scheme in Named Data NetworkingCommunications and Networking10.1007/978-3-031-67162-3_11(162-181)Online publication date: 6-Aug-2024
https://doi.org/10.1007/978-3-031-67162-3_11
Yoshinaka YKita KTakemasa JKoizumi YHasegawa T(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
https://doi.org/10.1109/TNSM.2023.3275250
Lu YWang DObaidat MVijayakumar P(2023)Edge-Assisted Intelligent Device Authentication in Cyber–Physical SystemsIEEE Internet of Things Journal10.1109/JIOT.2022.315182810:4(3057-3070)Online publication date: 15-Feb-2023
https://doi.org/10.1109/JIOT.2022.3151828
Xia QGao JWorae DObiri IAsamoah K(2023)Security Overall in Information‐Centric NetworksAttribute‐based Encryption (ABE)10.1002/9781119989387.ch12(195-214)Online publication date: 6-Oct-2023
https://doi.org/10.1002/9781119989387.ch12
Kita KKoizumi YHasegawa TAscigil OPsaras I(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
https://doi.org/10.1109/TNSM.2020.3019052
Zhang ZWon SZhang L(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
https://doi.org/10.1109/MILCOM52596.2021.9652892
Babu VJose M(2021)Dynamic forest of random subsets-based one-time signature-based capability enhancing security architecture for named data networkingInternational Journal of Information Technology10.1007/s41870-021-00786-915:2(773-788)Online publication date: 31-Aug-2021
https://doi.org/10.1007/s41870-021-00786-9
Tehrani PSchiller JSchmidt TWählisch M(2020)On economic, societal, and political aspects in ICNProceedings of the 7th ACM Conference on Information-Centric Networking10.1145/3405656.3420229(155-157)Online publication date: 22-Sep-2020
https://dl.acm.org/doi/10.1145/3405656.3420229
Zhu YTao YHuang R(2020)BEAcM‐DPTransactions on Emerging Telecommunications Technologies10.1002/ett.379431:2Online publication date: 16-Feb-2020
https://dl.acm.org/doi/10.1002/ett.3794
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Media

Figures

Other

Tables

View Table of Contents