LIVE: Lightweight Integrity Verification and Content Access Control for Named Data Networking

被引:74
作者
Li, Qi [1 ]
Zhang, Xinwen [2 ]
Zheng, Qingji [3 ]
Sandhu, Ravi [4 ]
Fu, Xiaoming [5 ]
机构
[1] Tsinghua Univ, Grad Sch Shenzhen, Shenzhen 518055, Peoples R China
[2] Samsung Res Amer, Santa Clara, CA 95134 USA
[3] Huawei Res Ctr, Santa Clara, CA 95050 USA
[4] Univ Texas San Antonio, Inst Cyber Secur, San Antonio, TX 78249 USA
[5] Univ Gottingen, Inst Comp Sci, D-37073 Gottingen, Germany
基金
中国国家自然科学基金;
关键词
Next generation networking; access control; data security; POLLUTION ATTACKS;
D O I
10.1109/TIFS.2014.2365742
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Named data networking (NDN) is a new paradigm for the future Internet wherein interest and data packets carry content names rather than the current IP paradigm of source and destination addresses. Security is built into NDN by embedding a public key signature in each data packet to enable verification of authenticity and integrity of the content. However, existing heavyweight signature generation and verification algorithms prevent universal integrity verification among NDN nodes, which may result in content pollution and denial of service attacks. Furthermore, caching and location-independent content access disables the capability of a content provider to control content access, e.g., who can cache a content and which end user or device can access it. We propose a lightweight integrity verification (LIVE) architecture, an extension to the NDN protocol, to address these two issues seamlessly. LIVE enables universal content signature verification in NDN with lightweight signature generation and verification algorithms. Furthermore, it allows a content provider to control content access in NDN nodes by selectively distributing integrity verification tokens to authorized nodes. We evaluate the effectiveness of LIVE with open source CCNx project. Our paper shows that LIVE only incurs average 10% delay in accessing contents. Compared with traditional public key signature schemes, the verification delay is reduced by over 20 times in LIVE.
引用
收藏
页码:308 / 320
页数:13
相关论文
共 28 条
[1]   Cache Privacy in Named-Data Networking [J].
Acs, Gergely ;
Conti, Mauro ;
Gasti, Paolo ;
Ghali, Cesar ;
Tsudik, Gene .
2013 IEEE 33RD INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS), 2013, :41-51
[2]  
Afanasyev A, 2013, P IFIP NETW C MAY 20
[3]  
[Anonymous], 2012, P 2 ED ICN WORKSH IN
[4]  
[Anonymous], 1993, ACM CCS 1993, DOI DOI 10.1145/168588.168596
[5]  
Arianfar Soraaya., 2011, Proceedings of the ACM SIGCOMM Workshop on Information-Centric Networking, ICN '11, P19
[6]  
Bianchi G, 2013, ACM SIGCOMM COMP COM, V43, P60
[7]  
Chang H., 2006, Proceeding of The 25th Annual IEEE International Conference on Computer Communications, P1, DOI [10.1049/cp:20060380, DOI 10.1049/CP:20060380]
[8]  
Compagno A, 2013, C LOCAL COMPUT NETW, P630, DOI 10.1109/LCN.2013.6761300
[9]   A lightweight mechanism for detection of cache pollution attacks in Named Data Networking [J].
Conti, Mauro ;
Gasti, Paolo ;
Teoli, Marco .
COMPUTER NETWORKS, 2013, 57 (16) :3178-3191
[10]   Pollution attacks and defenses for Internet caching systems [J].
Deng, Leiwen ;
Gao, Yan ;
Chen, Yan ;
Kumanovic, Aleksandar .
COMPUTER NETWORKS, 2008, 52 (05) :935-956