Lora-lisk: A lightweight shared secret key generation scheme for lora networks
AK Junejo, F Benkhelifa, B Wong… - IEEE Internet of Things …, 2021 - ieeexplore.ieee.org
… devices and the gateway is a prerequisite of the existing key generation schemes. However,
… because the current LoRa driver specifications do not provide CSI measurements. In other …
… because the current LoRa driver specifications do not provide CSI measurements. In other …
A multiple end-devices authentication scheme for lorawan
… Supporting group key creation may be helpful for future … The gateway will send a time
synchronization signal to the end-… Then, we can construct a probabilistic polynomial time simulator …
synchronization signal to the end-… Then, we can construct a probabilistic polynomial time simulator …
Sound and complete witnesses for template-based verification of LTL properties on polynomial programs
… problems of safety (invariant generation) and reachability (safety … programs with respect to
formal specifications given in the … generation part from the description of the algorithms below. …
formal specifications given in the … generation part from the description of the algorithms below. …
Design and Evaluation of Device Authentication and Secure Communication System with PQC for AIoT Environments
YJ Chen, CL Hsu, TW Lin, JS Lee - Electronics, 2024 - mdpi.com
… The NTRU [9] is faster than ECC is in key generation, encryption… Step 1: The gateway randomly
chooses polynomial rG and … We defined FalGW as the time the gateway takes to execute …
chooses polynomial rG and … We defined FalGW as the time the gateway takes to execute …
Improved Gentry–Halevi's fully homomorphic encryption‐based lightweight privacy preserving scheme for securing medical Internet of Things
… the high-order polynomial and at the same time adopts a … Protocol Specification Language)
for running the algorithm in … it to the gateway device, a check of random number generation …
for running the algorithm in … it to the gateway device, a check of random number generation …
QAKA: A novel quantum authentication and key agreement (QAKA) protocol using quantum entanglement for secure communication among IoT devices
D Chawla, PS Mehra - Transactions on Emerging …, 2024 - Wiley Online Library
… is unable to prime factorization in polynomial time. The recent … In our scheme, the Gateway
is a trusted entity onto which … also registers them onto gateway by generating a quantum key …
is a trusted entity onto which … also registers them onto gateway by generating a quantum key …
A review of physical unclonable functions (PUFs) and its applications in IoT environment
A Yadav, S Kumar, J Singh - Ambient Communications and Computer …, 2022 - Springer
… that no polynomial time algorithm presents for enquiring threshold of almost half cases. …
, then network gateway needs to authenticate these two routers, before key generation and …
, then network gateway needs to authenticate these two routers, before key generation and …
CMAF-IIoT: Chaotic map-based authentication framework for Industrial Internet of Things
… with the gateway. Using the session key, users securely access real-time information from
… A can determine all pairs of passwords and identities within polynomial time. The smart card …
… A can determine all pairs of passwords and identities within polynomial time. The smart card …
TAPU: A Transmission-Analytics Processing Unit for Accelerating Multi-functions in IoT Gateways
… As packet headers follow a unified protocol specification, shallow … Since it is difficult to predict
the exact generation time of … in polynomial time, and we utilize Goldberg’s algorithm [18], …
the exact generation time of … in polynomial time, and we utilize Goldberg’s algorithm [18], …
Provably secure and lightweight authentication key agreement scheme for smart meters
S Chai, H Yin, B Xing, Z Li, Y Guo… - … on Smart Grid, 2023 - ieeexplore.ieee.org
… Furthermore, we assume that legitimate NAN gateways and … on the elliptic curve and G a
generator of E(Fp). Hardness … problem for PSLA is polynomial time reducible to the decisional …
generator of E(Fp). Hardness … problem for PSLA is polynomial time reducible to the decisional …