DOCSLIB.ORG

Accconf: an Access Control Framework for Leveraging In

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Accconf: an Access Control Framework for Leveraging In AccConF: An Access Control Framework for Leveraging In-Network Cached Data in ICNs Satyajayant Misray, Reza Touraniy, Frank Natividady, Travis Micky, Nahid Ebrahimi Majdz and Hong Huang? y Computer Science Department, New Mexico State University, Las Cruces, New Mexico Email:fmisra, rtourani, fnativid,[email protected] z Computer Science Department, California State University, San Marcos, California Email:[email protected] ? Electrical and Computer Engineering Department, New Mexico State University, Las Cruces, New Mexico Email:[email protected] Netflix Repository Abstract—The fast-growing Internet traffic is increasingly becoming content-based and driven by mobile users, with users more interested in data rather than its source. This has precipitated the need for an information-centric Internet archi- Netflix server1 Netflix server2 tecture. Research in information-centric networks (ICNs) have resulted in novel architectures, e.g., CCN/NDN, DONA, and Top Level PSIRP/PURSUIT; all agree on named data based addressing CDN and pervasive caching as integral design components. With CDN1 CDN2 CDN3 CDN4 5 network-wide content caching, enforcement of content access Upper Level control policies become non-trivial. Each caching node in the network needs to enforce access control policies with the help ISP2 ISP3 ISP of the content provider. This becomes inefficient and prone to 1 Base Station unbounded latencies especially during provider outages. Lower Level In this paper, we propose an efficient access control frame- Bottom Level work for ICN, which allows legitimate users to access and Fig. 1. Multi-level network architecture for Internet-based content distri- use the cached content directly, and does not require verifica- bution. tion/authentication by an online provider authentication server or the content serving router. This framework would help reduce allows each user on the Internet to become a data server. the impact of system down-time from server outages and re- duce delivery latency by leveraging caching while guaranteeing This phenomenon has led to the Internet users becoming access only to legitimate users. Experimental/simulation results indifferent about the data source (video, music, movies) as demonstrate the suitability of this scheme for all users, but long as they are reasonably sure about the content. These are particularly for mobile users, especially in terms of the security alarming signs—the Internet was not engineered to scale for and latency overheads. such trends. Keywords: Information-centric networks, threshold secret sharing, authentication, caching, access control. To address these concerns there has been a strong push to redesign the Internet architecture. This push is aimed at a shift from the host-centric Internet to the information- arXiv:1603.03501v1 [cs.NI] 11 Mar 2016 1. INTRODUCTION centric network [15] where each data item is named and The nature of the traffic and the service requirements from routing is performed using the name. The ICN Internet the Internet have changed tremendously. As per the Cisco leverages pervasive in-network data caching and has built- Visual Networking Index Forecast (2019) [6]: high bandwidth in intelligence to satisfy requests by obtaining the data from video traffic would account for 77% of the Internet traffic by network caches or the content provider, and transferring it to 2019 and mobile wireless devices will account for 77% of the requester(s). Several newly proposed Information-Centric the world Internet traffic. This implies that the majority of the Network (ICN) architectures, such as the CCN/NDN [15], traffic on the Internet will be multimedia and emanate from DONA [16], PSIRP [30], PURSUIT [11], and NetInf [7], wireless mobile users. This rapid growth has also been fueled aim to attain the above objectives. We refer the interested by the use of P2P software (Ares, BitTorrent, etc.), which readers to a survey on Information-Centric Networks [1] for more information. This work has been submitted to IEEE Transactions on Information In today’s Internet most Content Providers (CPs) use Forensics and Security journal and is supported in part by the U.S. NSF grants:1345232 and 1248109 and the U.S. DoD/ARO grant: W911NF-07- content distribution networks (CDNs) to cache (store) content 2-0027. geographically closer to the users for faster content delivery. As shown in Fig. 1, the Internet hierarchy consists of CPs at authenticator/verifier. (ii) Discussions on design and imple- the top, followed by the CDNs (e.g. Akamai and Limelight), mentation issues of AccConF in the popular CCN/NDN and then the ISPs (e.g. Comcast, AT&T, and Verizon), architecture. (iii) Proof that AccConF can handle user revo- culminating in the static/mobile end-users. This architecture cations limited by a large threshold t and can be augmented places most of the CDN nodes at the edge of ISPs (refer to handle more than t revoked users. (iv) Implementation of Fig. 1) to reduce the network traffic; yet the ISPs keep AccConF in a CCN/NDN testbed and the ndn-SIM simulator deploying more network resources to handle the explosive on ns-3 and accompanying analysis validating its usability in data growth. The ICN paradigm, with its decoupling of data mobile devices. from the source, will enable in-network caching by the ISPs, In Section 2, we present the related work. In Section 3, we reducing their network traffic load and improving scalability present the basic definitions and notations, and in Section 4, and data availability [33]. But, the important concern is how we present the system model, security assumptions, and the to ensure that the available cached content are only usable threat model. We present our framework in Section 5, its ICN by authentic/legitimate users? specific details in Section 6, and discuss its security provi- Let’s illustrate this concern using Netflix as the CP and sions in Section 7. In Section 8, we present our experimental the CCN/NDN Internet architecture [15]. To ensure user results and analysis. In Section 9, we present our conclusions. authenticity, in the current architecture, a legitimate user’s Netflix player authenticates itself to a server hosted on a 2. RELATED WORK Cloud service (e.g., Amazon EC2). Once the server authen- In CCN/NDN [15], the user’s data interest (request) is ticates the user, the player/client connects to a CDN node either served by an intermediate router that receives the (selected based on network load, proximity, etc.) to access interest and has the data cached or the Content Provider (CP). the content. The access control (AC) is enforced by the server Data is routed back using information stored in a router’s and subsequently, streaming happens from the designated pending interests table and the forwarding information base, CDN node. and is cached at each forwarding router. In DONA [16], CPs With ICN, ubiquitous caching would require each node advertise their named content, in form of P:L where P is the that caches any portion of a content to enforce the AC hash of their public key and L is the content’s unique label, policies; an impractical exercise. To cope with this problem, to resolution handlers (RHs), which form an inter-domain the user still has to authenticate himself to Netflix. The RH-hierarchy. A user transmits a data request with the help decryption key, for the encrypted cached content, is granted of the RH-hierarchy to a data source, which then transmits to the user upon successful authentication. However, there is the data back along the same path. The data can be cached an obvious concern; in our illustration, if the cloud service, in the buffer of the involved RHs along the return path. The Amazon EC2, is down, then the Netflix service is down. The design paradigms of both PURSUIT and PSIRP [11] involve user cannot authenticate himself to use the cached content. three separate elements – publishers, subscribers, and the This has occurred several times in the past. One may argue REndezvous NEtwork (RENE) with similar naming scheme that this service-loss can be addressed through better service- as DONA. Rendezvous Points (RPs) in RENE perform level agreements (SLAs) with the cloud provider, but even the rendezvous action between publishers and subscribers and best SLA cannot guarantee zero downtime. A better approach select a path for a publisher/subscriber pair. Network of In- is one that can leverage the data available in routers close to formation (NetInf) [7] provides a service conceptually similar the users, to satisfy requests from legitimate users. to the rendezvous service in PSIRP/PURSUIT. Caching and This research is motivated by these observations. We named data based addressing are integral facets of all these address the question: Can we design an efficient AC frame- architectures, which are also the only two pre-requisites of work to utilize the cached content in ICNs that only serves our framework. legitimate users/subscribers? In this paper, we extend our AC in the ICN has recently received more attention from preliminary framework to answer this question [23] (ACM the community [2], [5], [10], [12], [14], [19], [20]. In [2], ICN Workshop, 2013) and show that our framework also the authors proposed a per-user privacy design in which increases content availability (even when the provider’s au- content chunks are mixed with chunks of cover and the thentication service is offline) and improves clients’ quality results are published into the network. The user gets the of experience. necessary decoding information via a secure back channel In a nutshell, our contributions include: (i) Design of from the CP, which requires the CP to be always online. AccConF a novel ICN AC framework to guarantee trusted Fotiou et al. proposed an AC enforcement delegation tech- content in nearby caches can be efficiently used by only nique [10].
Load more

Recommended publications
  • Thesis Jiayuan.Pdf (2.335Mb)
    A Security Analysis of Some Physical Content Distribution Systems by Jiayuan Sui A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in Computer Science Waterloo, Ontario, Canada, 2008 c Jiayuan Sui 2008 I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Abstract Content distribution systems are essentially content protection systems that protect premium multimedia content from being illegally distributed. Physical content distribution systems form a subset of content distribution systems with which the content is distributed via physical media such as CDs, Blu-ray discs, etc. This thesis studies physical content distribution systems. Specifically, we con- centrate our study on the design and analysis of three key components of the system: broadcast encryption for stateless receivers, mutual authentication with key agree- ment, and traitor tracing. The context in which we study these components is the Advanced Access Content System (AACS). We identify weaknesses present in AACS, and we also propose improvements to make the original system more secure, flexible and efficient. iii Acknowledgements I would like to thank my supervisor, Dr. Douglas R. Stinson, for guiding me through the writing of this thesis. He has always been so patient and glad to help. I could not have completed this thesis without his insight and advice. I would also like to thank Dr. Ian Goldberg and Dr.
    [Show full text]
  • Forward-Secure Content Distribution to Reconfigurable Hardware
    2008 International Conference on Reconfigurable Computing and FPGAs Forward-Secure Content Distribution to Reconfigurable Hardware David Champagne1, Reouven Elbaz1,2, Catherine Gebotys2, Lionel Torres3 and Ruby B. Lee1 1Princeton University USA, {dav, relbaz, rblee}@princeton.edu 2University of Waterloo, Canada, {reouven, cgebotys}@uwaterloo.ca 3LIRMM University of Montpellier 2/CNRS, France, [email protected] Abstract server sends out a bitstream update patching the vulnerability. This prevents devices that do not apply Confidentiality and integrity of bitstreams and an earlier security patch from still being able to view authenticated update of FPGA configurations are content sent later. In addition, forward security fundamental to trusted computing on reconfigurable precludes obsolete hardware from processing new technology. In this paper, we propose to provide these digital content. security services for digital content broadcast to Achieving forward security requires the FPGA-based devices. To that end, we introduce a new authentication and encryption of both the bitstream and property we call forward security, which ensures that the digital content. Existing techniques providing broadcast content can only be accessed by FPGA chips confidentiality and integrity for bitstream updates or configured with the latest bitstream version. We content transmissions assign each device a private key describe the hardware architecture and from an asymmetric key pair or a symmetric key communication protocols supporting this security shared
    [Show full text]
  • An Overview of the Advanced Access Content System (AACS)
    An Overview of the Advanced Access Content System (AACS) Kevin Henry, Jiayuan Sui, Ge Zhong David R. Cheriton School of Computer Science University of Waterloo Waterloo, ON, N2L 3G1, Canada {k2henry, jsui, gzhong}@cs.uwaterloo.ca Abstract The Advanced Access Content System (AACS) is a content distribution system for record- able and pre-recorded media, currently used to protect HD-DVD and Blu-Ray content. AACS builds off of its predecessors, the Content Scramble System (CSS) and Content Protection for Pre-recorded/Recordable media (CPRM/CPPM), adding more robust key distribution and re- vocation capabilities. In this paper, a concise summary of the lengthy AACS specification for pre-recorded media is provided, with emphasis on how the AACS keys are organized, distributed, and revoked using subset difference trees. A description of the AACS mechanisms for recordable content and on-line content is also provided. 1 Introduction The Advanced Access Content System (AACS) is a content distribution system for recordable and pre-recorded media. Most notably, the AACS is used to protect high definition video content on Blu- Ray and HD-DVD discs. The current AACS technical specifications span nearly 550 pages spread across seven documents [3-9], and provide an overview of the system, as well as specific implemen- tations for pre-recorded and recordable media for both Blu-Ray and HD-DVD formats. The goal of this paper is to provide a concise summary of the information contained within these specifications, with extra attention given to the broadcast encryption scheme used. Over the entire specification, only two or three pages are dedicated to how a device’s cryptographic keys are distributed and revoked, however this mechanism, described in Section 2.3, is the core upon which the rest of the system is built.
    [Show full text]
  • Complete Tree Subset Difference Broadcast Encryption Scheme And
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by UEL Research Repository at University of East London Complete Tree Subset Difference Broadcast Encryption Scheme and its Analysis Sanjay Bhattacherjee and Palash Sarkar Applied Statistics Unit Indian Statistical Institute 203, B.T.Road, Kolkata, India - 700108. {sanjayb r,palash}@isical.ac.in Abstract The Subset Difference (SD) method proposed by Naor, Naor and Lotspiech is the most popular broadcast encryption (BE) scheme. It is suitable for real-time applications like Pay-TV and has been suggested for use by the AACS standard for digital rights management in Blu-Ray and HD-DVD discs. The SD method assumes the number of users to be a power of two. We propose the Complete Tree Subset Difference (CTSD) method that allows the system to support an arbitrary number of users. In particular, it subsumes the SD method and all results proved for the CTSD method also hold for the SD method. Recurrences are obtained for the CTSD scheme to count the number, N(n, r, h), of possible ways r users in the system of n users can be revoked to result in a transmission overhead or header length of h. The recurrences lead to a polynomial time dynamic programming algorithm for computing N(n, r, h). Further, they provide bounds on the maximum possible header length. A probabilistic analysis is performed to obtain an O(r log n) time algorithm to compute the expected header length in the CTSD scheme. Further, for the SD scheme we obtain an explicit limiting upper bound on the expected header length.
    [Show full text]
  • Digital Rights Management
    Digital Rights Management 4/6/21 Digital Rights Management 1 Introduction • Digital Rights Management (DRM) is a term used for systems that restrict the use of digital media • DRM defends against the illegal altering, sharing, copying, printing, viewing of digital media • Copyright owners claim DRM is needed to prevent revenue lost from illegal distribution of their copyrighted material 4/6/21 Digital Rights Management 2 DRM Content and Actions • There are many capabilities covered by DRM Digital Rights Management Digital content: Possible Actions and Restrictions: • Videos • Play once • Music • Play k times • Audio books • Play for a set time period • Digital books • Play an unlimited amount • Software • Copy • Video games • Burn to physical media • Lend to a friend • Sell • Transfer to a different device 4/6/21 Digital Rights Management 3 Early U.S. Copyright History • US Constitution, Article 1, Section 8 – “The Congress shall have the Power … To promote the Progress of Science and useful Arts, by securing for limited Times to Authors and Inventors the exclusive Right to their respective Writings and Discoveries” • Copyright Act of 1790 – "the author and authors of any map, chart, book or books already printed within these United States, being a citizen or citizens thereof....shall have the sole right and liberty of printing, reprinting, publishing and vending such map, chart, book or books...." – Citizens could patent books, charts, or maps for a period of 14 years – Could renew for another 14 years if you were alive – Non-citizens
    [Show full text]
  • Content Protection: from Past to Future
    CONTENT PROTECTION: FROM PAST TO FUTURE DIEHL Eric THOMSON R&D France Corporate Research, Security Laboratory Rennes, France [email protected] protection designers used for new schemes. The race was starting. Key Words This document focuses on the protection of Content protection, Conditional Access, Digital audiovisual contents. Nevertheless, many of the Rights Management, Copy Protection described techniques are applicable to other types of content such as games or eBooks. The first sections introduce the history of content protections. It gives Introduction a quick overview of the current techniques and some deployed systems. Last section proposes a list of research topics that may influence the design of Since about twenty years, the value of audiovisual future content protection systems. contents continuously increased. Digitalization of contents has simplified and empowered the creative process, has multiplied the number of delivery Twenty years ago channels, and made easier the consumption of contents. Digital contents are easier to distribute. Scrambling the content Digital contents are easier to consume. Digital The history of content protection started with the contents are easier to copy. All these factors advent of Pay TV operators. In 1984, French favoured the hackers. Canal+ launched its first subscription based channel. The video was analog and the transmission was terrestrial. The protection principles were rather simple. Content was scrambled, i.e., the content was modified. Digital technologies allowed more powerful key- based scrambling techniques. For instance, Canal+ added a variable delay after the sync signal of each video line. An algorithm using a key defined the amplitude of the transformation. If the user dialed the same key, then the decoder descrambled the content, i.e., the decoder reversed the applied transformation.
    [Show full text]
  • Fully Resilient Traitor Tracing Scheme Using Key Update
    Fully Resilient Traitor Tracing Scheme using Key Update Eun Sun Yoo1, Koutarou Suzuki2 and Myung-Hwan Kim1 1 Department of Mathematical Science, Seoul National University San56-1 Shinrim-dong, Gwanak-gu, Seoul, 151-747, Korea [email protected] 2 NTT Laboratories, Nippon Telegraph and Telephone Corporation 3-9-11 Midori-cho, Musashino-shi, Tokyo, 180-8585, Japan [email protected] Abstract. This paper proposes fully resilient traitor tracing schemes which have no restriction about the number of traitors. By using the concept of key update, the schemes can make the pirate decoders useless within some time-period, which will be called life-time of the decoder. There is a trade-off between the size of ciphertext and life-time of pirate decoders. 1 Introduction A traitor tracing scheme is a encryption scheme that can trace the traitors who create a pirate decoder. Some traitor tracing schemes, called trace-and-revoke schemes, have the property of broadcast encryption [1, 9]. Since Chor, Fiat and Naor [7] introduced the notion of traitor tracing, many traitor tracing schemes are proposed [12, 17, 2, 19, 18, 16, 13, 10, 14, 15, 8, 20, 23, 11, 6, 3–5]. In these schemes, the CS (Complete Subset) and SD (Subset Difference) schemes [16] are practically important broadcast encryption schemes, and adopted for the copyright management system of next generation DVD, i.e., Blu-ray Disc. These schemes depend on no computational assumption, while achieving good efficiency and fully resiliency. However, these schemes have drawbacks from the viewpoint of traitor tracing. In these scheme, some keys are shared among plural users, so if the traitor makes a pirate decoder using the shared keys, the traitor cannot be determined from the keys stored in the pirate decoder.
    [Show full text]
  • Broadcast Encryption Using Probabilistic Key Distribution And
    JOURNAL OF COMPUTERS, VOL. 1, NO. 3, JUNE 2006 1 Broadcast Encryption Using Probabilistic Key Distribution and Applications Mahalingam Ramkumar Department of Computer Science and Engineering, Mississippi State University Email: [email protected] Abstract— A family of novel broadcast encryption schemes applications regulating access to content C is realized by based on probabilistic key pre-distribution are proposed, encrypting content with a content encryption key KC . The that enable multiple sources to broadcast secrets, without content encryption key is encrypted with the group secret the use of asymmetric cryptographic primitives. A com- prehensive analysis of their efficiencies and performance KG (and KG(KC ) distributed with the content) to ensure bounds are presented. The paper also suggests a framework that only members of the group can gain access to KC , for applications of broadcast encryption, depending on 1) and hence the content. the relationship between the size of the network (or the 1) Protecting Group Secrets: The ability to protect any total number of deployed devices) and the group size, and secret depends on the number of nodes that have access 2) the nature of the devices (stateless or otherwise) in the deployment. The utility of the proposed broadcast encryp- to the secret. Obviously, the higher the number of nodes tion schemes is investigated for securing content distribution with access to a secret, the higher is the susceptibility of applications based on the publish-subscribe paradigm. the secret to exposure. With BE, all except a few revoked Index Terms— broadcast encryption, stateless vs stateful, nodes share the group secret. The use of weak security probabilistic key predistribution associations calls for assurances of trustworthiness of the entities that are provided with access to the secrets.
    [Show full text]