Towards name-based trust and security for content-centric network

2011 ◽  
Author(s):  
Xinwen Zhang ◽  
Katharine Chang ◽  
Huijun Xiong ◽  
Yonggang Wen ◽  
Guangyu Shi ◽  
...  
Keyword(s):  
Content Centric Network

ECCN: an extended CCN architecture to improve data access in vehicular content-centric network

2017 ◽  
Vol 74 (1) ◽  
pp. 205-221 ◽  
Author(s):  
Ali Kazemi Niari ◽  
Reza Berangi ◽  
Mahmood Fathy
Keyword(s):  
Data Access ◽  
Content Centric Network

Performance Assessment of Cache Strategies in Content Centric Network

2013 ◽  
Vol 12 (23) ◽  
pp. 7083-7089 ◽  
Author(s):  
Guoyin Zhang ◽  
Bin Tang ◽  
Peng Wang ◽  
Yanxia Wu ◽  
Xinyu Zhang
Keyword(s):  
Performance Assessment ◽  
Content Centric Network

scholarly journals Certificateless Proxy Reencryption Scheme (CPRES) Based on Hyperelliptic Curve for Access Control in Content-Centric Network (CCN)

2020 ◽  
Vol 2020 ◽  
pp. 1-13 ◽  
Author(s):  
Zahid Ullah ◽  
Asim Zeb ◽  
Insaf Ullah ◽  
Khalid Mahmood Awan ◽  
Yousaf Saeed ◽  
...  
Keyword(s):  
Access Control ◽  
Hyperelliptic Curve ◽  
Data Communication ◽  
Key Generation ◽  
Communication Research ◽  
Efficient Utilization ◽  
Information Centric Networking ◽  
Internet Infrastructure ◽  
Different Types ◽  
Content Centric Network

Information-centric networking is the developing model envisioned by an increasing body of the data communication research community, which shifts the current network paradigm from host centric to data centric, well-known to information-centric networking (ICN). Further, the ICN adopts different types of architectures to extend the growth of the Internet infrastructure, e.g., name-based routing and in-network caching. As a result, the data can be easily routed and accessed within the network. However, when the producer generates contents for authentic consumers, then it is necessary for him/her to have a technique for content confidentiality, privacy, and access control. To provide the previously mentioned services, this paper presents a certificateless proxy reencryption scheme (CPRES) based on the hyperelliptic curve for access control in the content-centric network (CCN). Using certificateless PRE, the power of the key generation center (KGC) is limited to only the generation of partial keys to secure the access to the content. With the help of these partial keys, the producer further calculates keys for encryption and reencryption process. The simulation results show that the proposed scheme provides secure access to content during end-to-end communication. Moreover, the proposed CPRES scheme outperforms in terms of low computational energy and efficient utilization of communication bandwidth.

scholarly journals Intelligent data cache based on content popularity and user location for Content Centric Networks

2019 ◽  
Vol 9 (1) ◽  
Author(s):  
Hsin-Te Wu ◽  
Hsin-Hung Cho ◽  
Sheng-Jie Wang ◽  
Fan-Hsun Tseng
Keyword(s):  
Data Cache ◽  
Total Size ◽  
Hit Rate ◽  
Cache Size ◽  
Content Popularity ◽  
Content Centric Network ◽  
Cache Scheme ◽  
And Storage ◽  
User Location ◽  
Content Cache

AbstractContent cache as well as data cache is vital to Content Centric Network (CCN). A sophisticated cache scheme is necessary but unsatisfied currently. Existing content cache scheme wastes router’s cache capacity due to redundant replica data in CCN routers. The paper presents an intelligent data cache scheme, viz content popularity and user location (CPUL) scheme. It tackles the cache problem of CCN routers for pursuing better hit rate and storage utilization. The proposed CPUL scheme not only considers the location where user sends request but also classifies data into popular and normal content with correspond to different cache policies. Simulation results showed that the CPUL scheme yields the highest cache hit rate and the lowest total size of cache data with compared to the original cache scheme in CCN and the Most Popular Content (MPC) scheme. The CPUL scheme is superior to both compared schemes in terms of around 8% to 13% higher hit rate and around 4% to 16% lower cache size. In addition, the CPUL scheme achieves more than 20% and 10% higher cache utilization when the released cache size increases and the categories of requested data increases, respectively.

scholarly journals Efficient Lattice CP-ABE AC Scheme Supporting Reduced-OBDD Structure for CCN/NDN

Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 166
Author(s):  
Eric Affum ◽  
Xiasong Zhang ◽  
Xiaofen Wang ◽  
John Bosco Ansuura
Keyword(s):  
Special Property ◽  
Published Data ◽  
Access Structure ◽  
Practical Applications ◽  
Attribute Based Encryption ◽  
Generation Network ◽  
Efficient Scheme ◽  
Content Centric Network ◽  
Communication Needs ◽  
Ciphertext Policy

In line with the proposed 5th Generation network, content centric network/named data networking (CCN/NDN) has been offered as one of the promising paradigms to cope with the communication needs of future realistic network communications. CCN/NDN allows network communication based on content names and also allows users to obtain information from any of the nearest intermediary caches on the network. Due to that, the ability of cached content to protect itself is essential since contents can be cached on any node everywhere, and publishers may not have total control over their own published data. The attribute based encryption (ABE) scheme is a preferable approach, identified to enable cached contents to be self-secured since it has a special property of encryption with policies. However, most of the proposed ABE schemes for CCN/NDN suffer from some loopholes. They are not flexible in the expression of access policy, they are inefficient, they are based on bilinear maps with pairings, and they are vulnerable to quantum cryptography algorithms. Hence, we propose the ciphertext policy attribute based encryption access control (CP-ABE AC) scheme from a lightweight ideal lattice based on ring learning with error (R-LWE) problem, and demonstrated its use in practical applications. The proposed scheme is proved to be secure and efficient under the decision ring LWE problem in the selective set model. To achieve an efficient scheme, we used an efficient trapdoor technique and the access tree representation of access structure describing the access policies was modified into a new structure, based on a reduced ordered binary decision diagram (reduce-OBDD). This access structure can support Boolean operations such as AND, NOT, OR, and threshold gates. The final result showed that the proposed scheme was secure and efficient for applications, thereby supporting CCN/NDN as a promising paradigm.

Sign in / Sign up

Export Citation Format

Share Document