A Post-Quantum Secure Lattice-Based Forward-Secure Identity Based Encryption with Applications to Internet of Things Architecture

• URL: http://arxiv.org/abs/2606.22340v1
• Date: Sun, 21 Jun 2026 05:10:09 GMT
• Title: A Post-Quantum Secure Lattice-Based Forward-Secure Identity Based Encryption with Applications to Internet of Things Architecture
• Abstract summary: IoT devices are highly vulnerable to side-channel and key-extraction attacks.<n>Existing FS-IBE constructions based on classical hardness assumptions are not secure in the era of post-quantum.<n>We propose a new lattice-based fs-IBE scheme in the ring setting, relying on the RLWE assumption to achieve post-quantum security.
• Score: 6.617223072425418
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The rapid expansion of the Internet of Things (IoT) has led to an unprecedented scale of data exchange across heterogeneous and resource-constrained devices. Ensuring confidentiality and secure key management in such environments is challenging. Traditional public-key infrastructures require heavy certificate-handling overhead. Identity-Based Encryption (IBE) offers a lightweight alternative by deriving public keys directly from device identities, making it attractive for IoT deployments. However, IoT devices are highly vulnerable to side-channel and key-extraction attacks, motivating the need for Forward-Secure IBE(FS-IBE), where the compromise of a current secret key does not threaten past communications. Existing FS-IBE constructions based on classical hardness assumptions are not secure in the era of post-quantum, while the lattice-based (LWE-based) forward-secure scheme suffer from large key and ciphertext sizes, limiting their suitability for constrained IoT systems. Here, we propose a new lattice-based fs-IBE scheme in the ring setting, relying on the RLWE assumption to achieve post-quantum security and significant efficiency gains. Our design uses trapdoor delegation with a minimal-cover mechanism over a binary tree. It results in compact public parameters and efficient per-epoch key updates. Compared to prior LWE-based constructions, our scheme reduces public key, secret key, and ciphertext sizes, and thus, making it better suited for practical IoT environments.

Related papers

• A Protocol-Agnostic Backscatter-Based Security Layer for Ultra-Low-Power SWIPT IoT Networks [36.94429692322632]
  This paper presents a protocol-agnostic security enhancement for Simultaneous Wireless Information and Power Transfer (SWIPT) in Internet of Things (IoT) applications.<n>Building on a backscatter-based identification mechanism, the proposed approach introduces a secure, energy-efficient layer that operates independently of communication protocols.<n>Results show that the method achieves secure identification, reliable energy harvesting, and data transmission with negligible impact on node autonomy.
  arXiv  Detail & Related papers  (2026-04-17T08:34:56Z)
• Anamorphic Encryption with CCA Security: A Standard Model Construction [32.95661036494699]
  Anamorphic encryption serves as a vital tool for covert communication, maintaining secrecy even during post-compromise scenarios.<n>We formalize the Anamorphic Key Encapsulation Mechanism (AKEM), encompassing both Public-Key (PKAKEM) and Symmetric-Key (SKAKEM) variants.<n>We provide a rigorous formal proof in the standard model, demonstrating resilience against a "dictator" who controls the decapsulation key.
  arXiv  Detail & Related papers  (2026-04-09T03:49:41Z)
• Efficient ML-DSA Public Key Management Method with Identity for PKI and Its Application [34.906142924769675]
  We propose a novel identity-based public key management framework for PKI based on post-quantum cryptography, termed textitIPK-pq.<n>Building on the concept of the Composite Public Key (CPK), textitIPK-pq addresses the linear collusion problem inherent in CPK through an enhanced identity mapping mechanism.<n>We provide a formal security proof for textitIPK-pq, covering both individual private key components and the composite private key.
  arXiv  Detail & Related papers  (2026-03-26T05:26:31Z)
• On Implementing Hybrid Post-Quantum End-to-End Encryption [0.0]
  Quantum computing poses a fundamental threat to current public key cryptographic systems.<n>We present a hybrid end-to-end encryption system that combines classical and post-quantum cryptographic primitives.
  arXiv  Detail & Related papers  (2026-01-21T12:17:24Z)
• LSEG: A Lightweight and Secure Key Exchange Protocol for Smart Grid Communication [0.9449650062296824]
  This paper proposes a lightweight authentication and secure key exchange protocol for smart grid environments.<n>Session communication is protected using ASCON128a, a lightweight, NIST-standardized, authenticated encryption algorithm.<n>Results show LSEG effectively balances security, efficiency, and compliance, making it a scalable solution for secure communication in smart grid infrastructures.
  arXiv  Detail & Related papers  (2025-11-10T19:01:55Z)
• Zero-Trust Foundation Models: A New Paradigm for Secure and Collaborative Artificial Intelligence for Internet of Things [61.43014629640404]
  Zero-Trust Foundation Models (ZTFMs) embed zero-trust security principles into the lifecycle of foundation models (FMs) for Internet of Things (IoT) systems.<n>ZTFMs can enable secure, privacy-preserving AI across distributed, heterogeneous, and potentially adversarial IoT environments.
  arXiv  Detail & Related papers  (2025-05-26T06:44:31Z)
• Intelligent Detection of Non-Essential IoT Traffic on the Home Gateway [45.70482328441101]
  This work presents ML-IoTrim, a system for detecting and mitigating non-essential IoT traffic by analyzing network behavior at the edge.<n>We test our framework in a consumer smart home setup with IoT devices from five categories, demonstrating that the model can accurately identify and block non-essential traffic.<n>This research advances privacy-aware traffic control in smart homes, paving the way for future developments in IoT device privacy.
  arXiv  Detail & Related papers  (2025-04-22T09:40:05Z)
• Privacy Enhanced QKD Networks: Zero Trust Relay Architecture based on Homomorphic Encryption [0.0]
  Quantum key distribution (QKD) enables unconditionally secure symmetric key exchange between parties.<n>Traditional solutions rely on trusted relay nodes, which perform intermediate re-encryption of keys using one-time pad (OTP) encryption.<n>We propose a zero-trust relay design that applies fully homomorphic encryption (FHE) to perform intermediate OTP re-encryption.
  arXiv  Detail & Related papers  (2025-03-21T10:20:06Z)
• Application of $α$-order Information Metrics for Secure Communication in Quantum Physical Layer Design [45.41082277680607]
  We study the $alpha$-order information-theoretic metrics based on R'enyi entropy.<n>We apply our framework to a practical scenario involving BPSK modulation over a lossy bosonic channel.
  arXiv  Detail & Related papers  (2025-02-07T03:44:11Z)
• LPUF-AuthNet: A Lightweight PUF-Based IoT Authentication via Tandem Neural Networks and Split Learning [2.37507453143459]
  Internet of things (IoT) is projected to connect over 75 billion devices globally by 2025. Traditional cryptographic methods often struggle with the constraints of IoT devices. This paper considers physical unclonable functions (PUFs) as robust security solutions. Our proposed solution introduces a lightweight PUF mechanism, called LPUF-AuthNet, combining tandem neural networks (TNN) with a split learning (SL) paradigm.
  arXiv  Detail & Related papers  (2024-10-16T03:25:04Z)
• Establishing Dynamic Secure Sessions for ECQV Implicit Certificates in Embedded Systems [0.0]
  We present a design that utilizes the Station to Station (STS) protocol with implicit certificates. We show that with a slight computational increase of 20% compared to a static ECDSA key derivation, we are able to mitigate many session-related security vulnerabilities.
  arXiv  Detail & Related papers  (2023-11-19T22:40:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.