MétaCan
Menu
Back to cohort
Record W2937199800 · doi:10.1145/3309074.3309081

Lightweight authentication for MQTT to improve the security of IoT communication

2019· article· en· W2937199800 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCryptography and Data Security
Canadian institutionsConcordia University of Edmonton
FundersDivision of Electrical, Communications and Cyber SystemsPublic Safety CanadaMinistère de l'Économie, de la Science et de l'Innovation - Québec
KeywordsMQTTComputer scienceMessage queueComputer networkAuthentication protocolAuthentication (law)Message authentication codeKey (lock)Protocol (science)Computer securityInternet of ThingsCryptography

Abstract

fetched live from OpenAlex

A widely used application layer protocol for IoT communication is Message Queue Telemetry Transport (MQTT) protocol. The provision of security in MQTT protocol is an essential concern in IoT applications. In this paper, we show how the conventional secure MQTT protocol is vulnerable to cipher attack. Then, we present a novel approach to improve the MQTT security by providing lightweight authentication mechanism. The proposed approach is using chaotic algorithm with topic based self-key agreement and block cipher. Moreover, the empirical study is performed to measure the efficiency of proposed approach in Cooja simulated environment.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.739
Threshold uncertainty score0.218

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.007
GPT teacher head0.243
Teacher spread0.236 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations28
Published2019
Admission routes2
Has abstractyes

Explore more

Same topicCryptography and Data SecurityFrench-language works237,207