MétaCan
Menu
← Retour à la cohorte
Enregistrement W7026910233

Authentication Protocols for IoT Edge Computing

2024· other· en· W7026910233 sur OpenAlexfundno aff

Notice bibliographique

RevueSpectrum Research Repository (Concordia University) · 2024
Typeother
Langueen
Domaine
Thématique
Établissements canadiensnon disponible
Organismes subventionnairesFonds de recherche du Québec – Nature et technologies
Mots-clésAuthentication (law)Edge computingCryptographic protocolAuthentication protocolCloud computingEnhanced Data Rates for GSM EvolutionKey exchangeMutual authenticationAdversaryCryptography
DOInon disponible

Résumé

récupéré en direct d'OpenAlex

The proliferation of IoT has led to vast interconnectivity, generating massive data that exceeds the processing capabilities of IoT devices. Traditional IoT-cloud models, where devices offload computations to centralized cloud servers, are increasingly inadequate due to the expected surge in IoT devices, projected to surpass 75 billion by 2025. This growth intensifies cloud vulnerability to single points of failure and highlights the need for alternatives that meet QoS requirements like low latency and location awareness. The 3-tier IoT-edge-cloud architecture offers a solution by processing data at nearby edge nodes, improving location awareness, and mitigating single-point-of-failure. While this distributed approach meets QoS requirements, it introduces security challenges, such as offloading data to distributed edge nodes without prior registration. Additionally, an adversary can trace the edge node attached to the IoT device and compromise the privacy of an IoT device user. Moreover, many deployed IoT devices are vulnerable to hardware compromise and unauthorized access, raising significant privacy and security concerns that hinder the broader adoption of edge computing. In this thesis, we address the above challenges by proposing efficient and secure authentication protocols for IoT applications in edge computing. Our proposed protocols include Symmetric Key Authentication with Forward Secrecy (SKAFS), Symmetric Key Inter-Cloud Authentication and Redeemable Micropayment Protocol (SKICAP), Mutual Authentication Privacy-Preserving Protocol with Forward Secrecy (MAPFS), and Conditional Privacy-Preserving Message Authentication for VANET Emergency Exchange (CP-MAVE). The proposed protocols utilize lightweight cryptographic primitives to realize efficient protocols for edge computing. Moreover, the proposed protocols fulfill the security requirements for IoT applications, such as IoT device anonymity, session unlinkability, and resilience to hardware compromise of IoT devices. For our proposed protocols, we provided formal security analyses based on computationally hard problems. Furthermore, we evaluated their performance in terms of communication overhead and computational complexity and compared them with other closely related protocols. Finally, we implemented prototypes of our proposed protocols using socket programming, simulating the message flow between the protocol entities to calculate their end-to-end latency and confirm the efficiency of our proposed protocols. The proliferation of IoT has led to vast interconnectivity, generating massive data that exceeds the processing capabilities of IoT devices. Traditional IoT-cloud models, where devices offload computations to centralized cloud servers, are increasingly inadequate due to the expected surge in IoT devices, projected to surpass 75 billion by 2025. This growth intensifies cloud vulnerability to single points of failure and highlights the need for alternatives that meet Quality of Service (QoS) requirements like low latency and location awareness. The 3-tier IoT-edge-cloud architecture offers a solution by processing data at nearby edge nodes, improving location awareness, and mitigating single-point-of-failure. While this distributed approach meets QoS requirements, it introduces security challenges, such as offloading data to distributed edge nodes without prior registration. Additionally, an adversary can trace the edge node attached to the IoT device and compromise the privacy of an IoT device user. Moreover, with 2.38 billion IoT devices vulnerable to hardware compromise and unauthorized access, raising significant privacy and security concerns that hinder the broader adoption of edge computing. In this thesis, we address the above challenges by proposing efficient and secure authentication protocols for IoT applications in edge computing. Our proposed protocols include Symmetric Key Authentication with Forward Secrecy (SKAFS), Symmetric Key Inter-Cloud Authentication and Redeemable Micropayment Protocol (SKICAP), Mutual Authentication Privacy-Preserving Protocol with Forward Secrecy (MAPFS), and Conditional Privacy-Preserving Message Authentication for VANET Emergency Exchange (CP-MAVE). The proposed protocols utilize lightweight cryptographic primitives to realize efficient protocols for edge computing. Moreover, the proposed protocols fulfill the security requirements for IoT applications, such as IoT device anonymity, session unlinkability, and resilience to hardware compromise of IoT devices. For our proposed protocols, we provided formal security analyses based on computationally hard problems. Furthermore, we evaluated their performance in terms of communication overhead and computational complexity and compared them with other closely related protocols. Finally, we implemented prototypes of our proposed protocols using socket programming, simulating the message flow between the protocol entities to calculate their end-to-end latency and confirm the efficiency of our proposed protocols.

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.

Comment cette classification a été obtenuedéplier

Prédiction machine sur la base complète

Imitation des enseignants

Ni prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.

score de la tête « metaresearch » (Codex)0,002
score de la tête « metaresearch » (Gemma)0,006
Version: metacan-v3-hybrid-931329e0061cStatut de validation: machine_predicted_unvalidated
Catégories candidatesaucune
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Théorique ou conceptuel · Signal consensuel: Théorique ou conceptuel
GenreSignal candidat: Méthodes · Signal consensuel: Méthodes
Score de désaccord entre enseignants0,005
Score d'incertitude au seuil0,017

Scores du classifieur distillé par catégorie (deux têtes)

CatégorieCodexGemma
Métarecherche0,0020,006
Méta-épidémiologie (sens strict)0,0010,001
Méta-épidémiologie (sens large)0,0010,001
Bibliométrie0,0010,001
Études des sciences et des technologies0,0020,002
Communication savante0,0020,006
Science ouverte0,0010,004
Intégrité de la recherche0,0020,003
Charge utile insuffisante (le modèle a refusé de juger)0,0050,002

Scores machine (provisoires)

Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.

Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.

Tête enseignante Opus0,060
Tête enseignante GPT0,348
Écart entre enseignants0,288 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle

Classification

machine, non validée

Prédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.

Les modèles n’ont appliqué aucune catégorie : rien dans la taxonomie ne correspondait à ce travail.
Devis d'étudeThéorique ou conceptuel
Domainenon disponible
GenreMéthodes

Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».

En bref

Citations0
Publié2024
Routes d'admission1
Résumé présentoui

Explorer davantage

Même revueSpectrum Research Repository (Concordia University)→Travaux en français237 207→