A Probability Verification Strategy Based on Credibility of Router in Content Centric Networking

摘要

As the representative architecture of the nextgeneration network, Content Centric Networking (CCN)adopts a content-oriented security design by using the signature and verification mechanism, thus binding security tocontent itself. However, because of the huge computationoverhead this basic design may cause, it cannot be exploitedeffectively. As a result, the content pollution has been aserious security threat in CCN. Aiming at this problem,this paper evaluates the validity of received data trafficand defines it as the credibility of router, then proposes aprobability verification strategy based on router’s credibility(named as PVSRC in short). The verification probability ofPVSRC is co-determined by the credibility and the maximum verification capacity of router. To assess the strategyperformance, the theoretical approximation expressions arederived for valid content hit probability,verification overheadand packet drop rate of user. The numerical results show thatPVSRC can guarantee high percentage of valid contents innetwork while reducing the workload of router. Comparedwith the strategy of verification on hit, it provides betterrobust protection against content pollution attack.