命名数据网络中防范内容中毒的网络协同验证机制

Haohao Kang, Yi Zhu, Yu Tao, Jianlong Yang
{"title":"命名数据网络中防范内容中毒的网络协同验证机制","authors":"Haohao Kang, Yi Zhu, Yu Tao, Jianlong Yang","doi":"10.1109/HOTICN.2018.8606003","DOIUrl":null,"url":null,"abstract":"The verification mechanism is the key to ensuring the content security in Name Data Networking (NDN). However, due to the limited computational capacity of NDN router, it is difficult to complete the verification task of all received data packets under heavy traffic. As a consequence, content poisoning has become one of the important security risks of current NDN. To solve this problem, we introduce the concept of data packet credibility and propose an in-network cooperative verification mechanism. In our design, the router calculates the credibility of received data packet from two aspects, one is the internal-evaluation estimated by itself, another is the external-evaluation from its upstream routers. After completing the combined evaluation, router further performs a probabilistic verification according to the credibility. For the data packet with high credibility, it will be verified with low probability. Then router forwards the combined evaluation result to its downstream routers on the reverse path by modifying the structure of data packet. Through building a collaborative verification relationship, this mechanism tries to avoid repeatedly verifying the data packets verified by upstream routers. Simulation results show that it can effectively defend content poisoning while significantly reducing content verification overhead.","PeriodicalId":243749,"journal":{"name":"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An in-network collaborative verification mechanism for defending content poisoning in Named Data Networking\",\"authors\":\"Haohao Kang, Yi Zhu, Yu Tao, Jianlong Yang\",\"doi\":\"10.1109/HOTICN.2018.8606003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The verification mechanism is the key to ensuring the content security in Name Data Networking (NDN). However, due to the limited computational capacity of NDN router, it is difficult to complete the verification task of all received data packets under heavy traffic. As a consequence, content poisoning has become one of the important security risks of current NDN. To solve this problem, we introduce the concept of data packet credibility and propose an in-network cooperative verification mechanism. In our design, the router calculates the credibility of received data packet from two aspects, one is the internal-evaluation estimated by itself, another is the external-evaluation from its upstream routers. After completing the combined evaluation, router further performs a probabilistic verification according to the credibility. For the data packet with high credibility, it will be verified with low probability. Then router forwards the combined evaluation result to its downstream routers on the reverse path by modifying the structure of data packet. Through building a collaborative verification relationship, this mechanism tries to avoid repeatedly verifying the data packets verified by upstream routers. Simulation results show that it can effectively defend content poisoning while significantly reducing content verification overhead.\",\"PeriodicalId\":243749,\"journal\":{\"name\":\"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HOTICN.2018.8606003\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 1st IEEE International Conference on Hot Information-Centric Networking (HotICN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HOTICN.2018.8606003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

验证机制是保证NDN (Name Data Networking)内容安全的关键。然而,由于NDN路由器的计算能力有限,在大流量下很难完成所有接收到的数据包的验证任务。因此,内容中毒已成为当前NDN的重要安全风险之一。为了解决这一问题,我们引入了数据包可信度的概念,并提出了一种网络内协作验证机制。在我们的设计中,路由器从两个方面来计算接收到的数据包的可信度,一是自身估计的内部评价,二是来自上游路由器的外部评价。组合评估完成后,路由器根据可信度进一步进行概率验证。对于可信度高的数据包,其验证概率较低。然后,路由器通过修改数据包的结构,将合并后的评估结果反向转发给下游路由器。该机制通过建立协作验证关系,避免了对上游路由器验证的数据包进行重复验证。仿真结果表明,该方法能够有效防御内容中毒,同时显著降低内容验证开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An in-network collaborative verification mechanism for defending content poisoning in Named Data Networking
The verification mechanism is the key to ensuring the content security in Name Data Networking (NDN). However, due to the limited computational capacity of NDN router, it is difficult to complete the verification task of all received data packets under heavy traffic. As a consequence, content poisoning has become one of the important security risks of current NDN. To solve this problem, we introduce the concept of data packet credibility and propose an in-network cooperative verification mechanism. In our design, the router calculates the credibility of received data packet from two aspects, one is the internal-evaluation estimated by itself, another is the external-evaluation from its upstream routers. After completing the combined evaluation, router further performs a probabilistic verification according to the credibility. For the data packet with high credibility, it will be verified with low probability. Then router forwards the combined evaluation result to its downstream routers on the reverse path by modifying the structure of data packet. Through building a collaborative verification relationship, this mechanism tries to avoid repeatedly verifying the data packets verified by upstream routers. Simulation results show that it can effectively defend content poisoning while significantly reducing content verification overhead.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信