NDN-BDA: A Blockchain-Based Decentralized Data Authentication Mechanism for Vehicular Named Data Networking

A trust management scheme to secure mobile information centric networks

Information Centric Networking (ICN) has been proposed as an encouraging remedy for solving complications of traditional IP based architecture. In this work, we present the design and implementation of an ICN framework in Contiki NG OS, a prominent operating system (OS) for constrained IoT devices that have limited computing and communication capabilities. Elementary end-to-end communication paradigms of Named Data Networking (NDN), inspired from ICN concepts and proposed as one of Future Internet Architectures (FIA), is integrated to Contiki NG OS developed for low-power and constrained Internet of Things (IoT) devices. Our results demonstrate the expediency of using the NDN concept for constrained IoT devices in Contiki NG OS.

Named Data Networking (NDN) presents strong bandwidth benefits on edge networks because its in-network caching design is probably fit for popularity and locality. However, separate NDN edge regions cannot be efficiently connected over IP backbone world, slowing down the deployment of NDN edges. Due to the difference of stateful NDN and stateless IP in forwarding principles, the coexistence of two protocols is difficult and challenging in the network layer. In this paper, we propose iGate, an NDN gateway design for tunneling over IP world, to bridge two kinds of protocols in the same layer. iGate translates protocols between stateful NDN and stateless IP by two temporary tables. It considers many factors about gateway efficiency, like table tunning, minimal NDN integration, TCP/UDP alternatives. We evaluate the performance of iGate with a real implementation on Linux and the results show that it can achieve more than 85.03% translation efficiency and less than 29% protocol conversion delay compared with IP VPN which uses the typical tunneling technology over IP network. Our work presents a practical and highly-efficient solution to assemble NDN edges into IP world, and can be applied to other similar Information-Centric Networking (ICN) designs.

The proposed Internet paradigm The Flying Ad Hoc Network (FANET), Named Data Network (NDN), and Software Defined Network (SDN) have attracted the interest of the scientific community. The TCP/IP protocol is the present Internet standard, while NDN is the future internet architecture that builds on it. Data availability is improved via NDN, which substitutes named data for the nodes' addresses. SDN is a good option for communicating effectively, utilizing resources effectively, and supporting developing technologies. The SDN has attracted interest because of its high-level programmability and flexibility. Numerous applications in the military, business, and civil sectors make extensive use of FANE T. The broadcast characteristic of NDN causes an issue known as a broadcast storm in dense FANET environments. The issue is caused by duplicate packets, which raises the overall amount of traffic and retransmissions. FANET has a problem with the timely and quick transmission of essential packets. In this paper, we suggested a new scheme named "Novel Adaptive Broadcast Storm Avoidance (NABA)" for SDN and NDN-enabled FANET, which uses a controller to lessen the broadcast issue. Our scheme made use of the SDN controller's effective flow management to regulate the broadcast storm and facilitate packet transfers. Additionally, we divided up the packet into categories based on priority. The priority of the packet is determined by the naming criterion. In terms of the overall number of Interests and content retrieval time, the findings show that NAB A performs better than native NDN floods.

A blockchain-based architecture for secure vehicular Named Data Networks

This article describes how the named data networking (NDN) has recently received a lot of attention as a potential information-centric networking (ICN) architecture for the future Internet. The NDN paradigm has a great potential to efficiently address and solve the current seminal IP-based IoT architecture issues and requirements. NDN can be used with different sets of caching algorithms and caching replacement policies. The authors investigate the most suitable combination of these two features to be implemented in an IoT environment. For this purpose, the authors first reviewed the current research and development progress in ICN, then they conduct a qualitative comparative study of the relevant ICN proposals and discuss the suitability of the NDN as a promising architecture for IoT. Finally, they evaluate the performance of NDN in an IoT environment with different caching algorithms and replacement policies. The obtained results show that the consumer-cache caching algorithm used with the Random Replacement (RR) policy significantly improve NDN content validity in an IoT environment.

Research in Information-Centric Networking (ICN) and Named Data Networking (NDN) has produced many protocol designs and software prototypes, but they need to be validated and evaluated by real usage on the Internet, which is also critical to the realization of the ICN/NDN vision in the long run. This article presents the first Internet-scale adaptive video streaming service over NDN, which allows regular users to watch videos using NDN technology with no software installation or manual configuration. Since mid-2019, the official NDN website [1] has started using our service to deliver its videos to Internet users over the global NDN testbed, showcasing the feasibility of NDN. We conduct real-world experiments on the NDN testbed to validate the proper implementation of the client, network, and server sides of the proposed system and also evaluate the performance of our video streaming service.

Named Data Networking (NDN) is a future Internet architecture that replaces IP addresses with namespaces of contents that are searchable at the network layer. A challenging task for NDN routers is to manage forwarding-information bases (FIBs) that store next-hop routes to contents using their stored usually long names or name prefixes. In this paper, we propose FCTree, a compressed FIB data structure that significantly reduces the required storage space at the router and can efficiently meet the demands of having routes that are orders of magnitude larger than IP-based ones in conventional routing tables. FCTree employs a localized front-coding compression to buckets containing partitions of the routes. The top routes in these buckets are then organized in B-ary self-balancing trees. By adjusting the size of the buckets, the router can reach an optimal tradeoff between the latency of the longest prefix matching (LPM) operation and the FIB storage space. In addition, in contrast to existing hash and bloom-filter based solutions, the proposed FCTree structure can significantly reduce the latency required for range and wildcard searches (e.g., for latency sensitive streaming applications or network-layer search engines) where up to k routes are returned if they are prefixed by a requested name. Performance evaluation results demonstrate the significant space savings achieved by FCTree compared to traditional hash-based FIBs.

Information-Centric Networking (ICN) is a new communication paradigm that replaces the host addresses by the name of content; Named Data Networking (NDN) is a promising ICN architecture that has attracted research attention in recent years. NDN is a receiver-driven architecture implements pull-based communication in the form of one-interest-one-data. This model poses different challenges, especially from the transport layer perspective. In contact to IP-based networks where the congestion is handled in an end-to-end manner, NDN cannot apply the same concept, while most of the existing solutions are based on hop-by-hop connection. In this paper, we present a new congestion control mechanism for NDN based on link quality estimation. We focus our efforts to provide fast data transmission, decrease packet dropping rate, and maximize the link utilization. The simulation results show that our solution outperforms the NDN schemes in terms of throughput and drop packets.

Named data networking (NDN) is one representation and implementation of information-centric networking (ICN) and is considered to be among the most promising designs for the next generation of network architecture. The introduction of NDN into vehicular ad-hoc networks (VANETs) and utilization of its content-centric characteristic to improve data transmission and distribution in VANETs has become a research hotspot in recent years. However, research on mobility support of NDN-based VANETs still faces many challenges. To solve the issue of data transmission path breaking due to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Consumer</i> mobility in NDN-based VANETs, this article proposes a novel vehicle tracking-based <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Data</i> packet forwarding scheme (VTDF) to improve the successful delivery rate of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Data</i> packets in mobile environments. In this approach, the urban road structure is divided into complex multi-junction and straight lane scenarios and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Data</i> packets are forwarded according to vehicle movement information. Simulations indicated that this vehicle tracking scheme provides a lower average data transmission delay, shorter handover delay between roadside units, and higher data delivery rate for <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Consumers</i> compared to the standard methods.

Named data networking (NDN) supports receiver-driven content retrieval with stateful forwarding (pending interest table (PIT)/forwarding information base) and in-network caching, yet many deployments still rely on classical cryptography that may be undermined by quantum-capable adversaries. Despite NDN’s built-in data authenticity via producer signatures, quantum-enabled attacks become plausible once RSA/ECC-based trust anchors are weakened by Shor-type attacks. Existing quantum-security efforts for NDN largely focus on post-quantum replacements of signatures or key exchange, but do not address the tension between confidentiality-preserving payload protection and NDN’s in-network processing (forwarding/caching decisions) in a quantum setting. This paper presents a quantum-enhanced NDN architecture that preserves NDN’s content-centric semantics—naming, PIT-driven forwarding, and cache-assisted dissemination of verifiable control objects—while delivering privacy-sensitive payloads as quantum homomorphic encryption (QHE)-encrypted quantum states over an underlying quantum network. QHE provides end-to-end confidentiality and enables authorized operations on encrypted quantum payloads without exposing plaintext. To make the design compatible with NDN forwarding, the proposed protocol encrypts the payload while keeping name-based forwarding semantics intact, and supports ciphertext-domain processing for selected policy functions. To protect provenance and integrity of NDN metadata, routing instructions, and session state, we incorporate quantum digital signatures (QDS) bound to NDN names and session identifiers. The main contributions are: (i) a QHE+QDS layered protection model tailored to NDN’s Interest and Data exchange; (ii) a session workflow that couples proactive entanglement distribution with NDN-style stateful signaling for efficient establishment and recovery; and (iii) a security analysis clarifying the achieved guarantees and the remaining trust assumptions. Security analysis indicates robustness against quantum man-in-the-middle and tampering attacks, with modest overhead on NDN control traffic.

Named data networking (NDN) is a future Internet architecture that directly emphasizes accessible content by assigning each piece of content a unique name. Data transmission in NDN is realized via name-based routing and forwarding. Name-based forwarding information base (FIB) usually has much more and longer prefixes than IP-based ones, and therefore, name-based forwarding brings more challenges on the NDN router in terms of high forwarding throughput, low memory consumption, and fast FIB update. In this paper, we present an index data structure called BFAST for the name-based FIB. BFAST is designed based on a basic hash table, it employs a counting Bloom filter to balance the load among hash table slots, so that the number of items in each non-empty slot is close to 1, leading to low searching time in each slot. Meanwhile, the first-rank-indexed scheme is proposed to effectively reduce the massive memory consumption required by the pointers in all the hash table slots. Evaluation results show that, for the longest prefix match FIB lookup, BFAST achieves a speed of 2.14 MS/S using one thread, and meanwhile, the memory consumption is reasonably low. By leveraging the parallelism of today’s multi-core CPU, BFAST arrives at an FIB lookup speed of 33.64 MS/S using 24 threads, and the latency is around $0.71~\mu s$ .

A Lightweight Forwarding Strategy for Named Data Networking in Low-end IoT

With information becoming a first-class citizen on the Internet, information-centric networking (ICN) is considered as a promising direction for the future Internet. Named data networking (NDN) is a prominent example of emerging ICN architectures. Unfortunately, NDN is vulnerable to various attacks targeting its in-network caching mechanism. In this paper, we focus on the false-locality pollution attack, in which an adversary repeatedly requests a number of unpopular data objects to waste the precious cache space on the NDN router and to reduce normal users’ hit ratios. With simulation experiments, we show that such an attack can cause considerable damage to the NDN network. To detect and mitigate such an attack, we introduce an algorithm that exploits the diversity of the Interest traversing paths within an Internet service provider’s point-of-presence network. We also propose inexpensive methodologies based on the probabilistic counting and Bloom filter techniques to implement the algorithm on an NDN router. The experimental results indicate that our proposed algorithm is effective in thwarting false-locality pollution. We also experiment with strategies that the adversary may utilize against our antipollution algorithm and demonstrate that such strategies are either ineffective or impractical in the real world.

Στη σύγχρονη εποχή του Διαδικτύου, η εστίαση τόσο στους τελικούς χρήστες όσο και στα ίδια τα δεδομένα έχουν εξελιχθεί σε δύο θεμελιώδεις πυλώνες. Αυτό οφείλεται κυρίως στη σημαντική διεύρυνση των πηγών δεδομένων, ιδιαίτερα με την εμφάνιση του Διαδικτύου των Πραγμάτων (Internet of Things (IoT)). Η εξέλιξη αυτή απαιτεί εξειδικευμένες λύσεις για την αποδοτική διαχείριση της συνεχώς αυξανόμενης κίνησης των δεδομένων αλλά και την υποστήριξη σύνθετων τύπων δεδομένων, όπως το πολυμεσικό περιεχόμενο, ενώ παράλληλα είναι ανάγκη να διασφαλίζεται η αξιοπιστία των δεδομένων, η ανθεκτικότητα στις επιθέσεις και υψηλή Ποιότητα Εμπειρίας (Quality of Experience (QoE)) για τους τελικούς χρήστες. Στην παρούσα διδακτορική διατριβή, αξιοποιούμε την εμπιστοσύνη που βασίζεται στη φήμη (reputation-based trust) ως ένα βασικό εργαλείο για την αντιμετώπιση αυτών των προκλήσεων σε δύο διακεκριμένα πρότυπα δικτύων επόμενης γενιάς: τα Πληροφοριοκεντρικά Δίκτυα (Information-Centric Networking (ICN)) και τα Δίκτυα Υπολογιστικού Νέφους (Cloud Networking). Στο πρώτο μέρος αυτής της διατριβής, διερευνούμε πώς η εμπιστοσύνη που βασίζεται στη φήμη μπορεί να ενδυναμώσει τα Πληροφοριοκεντρικά Δίκτυα· εστιάζοντας στην Named Data Networking (NDN), την πιο διαδεδομένη πληροφοριοκεντρική αρχιτεκτονική, διερευνούμε την εμπιστοσύνη που βασίζεται στη φήμη ως μέσο για την αντιμετώπιση ορισμένων εγγενών ευπαθειών των NDN δικτύων, ιδίως στις λειτουργίες ασφάλειας και προσωρινής αποθήκευσης. Σε αυτό το πλαίσιο, ασχολούμαστε με διάφορα σενάρια χρήσης και δικτυακές υποδομές, με στόχο να αναδείξουμε τις δυνατότητες της εμπιστοσύνης που βασίζεται στη φήμη σε ένα ευρύ φάσμα εφαρμογών. Αρχικά, δείχνουμε πώς η φήμη μπορεί να λειτουργήσει ως ένας συμπληρωματικός μηχανισμός στα υφιστάμενα συστήματα ασφαλείας σε ad hoc NDN δίκτυα. Εφαρμόζουμε έναν μηχανισμό που βασίζεται στη φήμη και αποδεικνύουμε τα οφέλη του όσον αφορά τη χρηστικότητα, καθώς και το επικοινωνιακό και υπολογιστικό κόστος. Στη συνέχεια, προτείνουμε δύο διακριτούς μηχανισμούς βασισμένους στη φήμη, καθένας από τους οποίους έχει σχεδιαστεί για την αντιμετώπιση μιας διαφορετικής κρίσιμης απειλής ασφαλείας των NDN δικτύων: συγκεκριμένα, τις επιθέσεις Δηλητηρίασης Περιεχομένου (Content Poisoning Attacks) και των επιθέσεων Ταλάντωσης του Ρυθμού Μετάδοσης (Bitrate Oscillation Attacks). Τα πειραματικά αποτελέσματα δείχνουν ότι η φήμη μπορεί να αποτελέσει ένα αποτελεσματικό αντίμετρο για τον μετριασμό των επιθέσεων και στις δύο περιπτώσεις. Πιο συγκεκριμένα, ο πρώτος μηχανισμός περιορίζει σημαντικά τη διάδοση του “δηλητηριώδους”/κακόβουλου περιεχομένου στο δίκτυο αποφεύγοντας κακόφημους παραγωγούς περιεχομένου. Ο δεύτερος μηχανισμός παρακολουθεί τις ταλαντώσεις στην ποιότητα μετάδοσης κατά τη διάρκεια μιας συνόδου πολυμεσικής ροής (streaming sessions) και προσαρμόζει την πολιτική προσωρινής αποθήκευσης ανάλογα, ώστε τελικά να διασφαλίσει εμπειρία χρηστών παρόμοια με όταν η μετάδοση γίνεται κανονικά, χωρίς επιθέσεις. Τέλος, παρουσιάζουμε μια πολιτική προσωρινής αποθήκευσης βασισμένη στη φήμη, ειδικά σχεδιασμένη ώστε να λαμβάνει υπόψιν την ανοχή σε σφάλματα και την εξοικονόμηση ενέργειας σε NDN IoT δίκτυα. Τα πειραματικά αποτελέσματα ανέδειξαν τα πλεονεκτήματα της λύσης μας ως προς την αξιοποίηση της προσωρινής αποθήκευσης και την ενεργειακή αποδόση. Το δεύτερο ζήτημα που εξετάζεται σε αυτή τη διατριβή είναι η παρακολούθηση της απόδοσης των υπηρεσιών υπολογιστικού νέφους λαμβάνοντας υπόψιν την εμπειρία του χρήστη, δίνοντας έμφαση στην ανάγκη ενσωμάτωσης αποκλειστικά αξιόπιστων αξιολογήσεων από χρήστες. Παρουσιάζουμε το Feed4Cloud, μια λύση βασισμένη στο blockchain που χρησιμοποιεί τη φήμη για να διασφαλίσει τη δίκαιη αξιολόγηση των υπηρεσιών με βάση την εμπειρία των χρηστών. Η φήμη της υπηρεσίας εντάσσεται στη διαδικασία παρακολούθησης της απόδοσής της ως ένα επιπλέον κριτήριο, ώστε να βελτιωθεί, τελικά, η ορχήστρωση των υπηρεσιών σε όλο το υπολογιστικό εύρος - από το νέφος έως τις άκρες του δικτύου. Τα αντίστοιχα πειραματικά αποτελέσματα δείχνουν ότι το Feed4Cloud μπορεί να εντοπίσει και να φιλτράρει αποτελεσματικά τις μη έγκυρες αξιολογήσεις των χρηστών, ακόμη και αν η στρατηγική της επίθεσης είναι αρκετά πολύπλοκη, ενώ η αξιολόγηση των υπηρεσιών με βάση την εμπειρία των χρηστών διεξάγεται με συνέπεια και αξιοπιστία. Από πλευράς υλοποίησης, στο πρώτο μέρος της διατριβής οι προτεινόμενοι μηχανισμοί έχουν αναπτυχθεί και επικυρωθεί σε περιβάλλοντα προσομοίωσης, ενώ, στο δεύτερο μέρος, παρέχουμε ένα πραγματικό πρωτότυπο του συστήματος. Μέσω εκτεταμένων πειραμάτων, η παρούσα διατριβή καταδεικνύει την αποτελεσματικότητα των μηχανισμών εμπιστοσύνης που βασίζονται στη φήμη για την ενίσχυση της ασφάλειας και τη διατήρηση της εμπειρίας των χρηστών σε υψηλά επίπεδα σε πληροφοριοκεντρικά δίκτυα και δίκτυα υπολογιστικού νέφους. Συνολικά, η διατριβή συνεισφέρει με τεκμηριωμένα συμπεράσματα για την πρακτική υλοποίηση και τα οφέλη στην απόδοση των λύσεων που βασίζονται στη φήμη, συμβάλλοντας στην ανάπτυξη ανθεκτικών, προσαρμοστικών και εύχρηστων μοντέλων εμπιστοσύνης για δίκτυα επόμενης γενιάς.