Oct 2026· IEEE Internet of Things Journal· Vol 13, pp. 45151-45169· 0 citations· 37 references
Abstract
In the Industrial Internet of Things (IIoT), secure data sharing via edge computing is pivotal for enabling collaborative manufacturing. However, existing bilateral access control (BAC) schemes suffer from a “Transmit-then-Verify” limitation: full ciphertexts must be transmitted before privilege verification, causing severe bandwidth wastage for gigabyte-level payloads upon decryption failure. Moreover, performing policy matching at honest-but-curious edge nodes (ENs) often necessitates exposing access policies in plaintext, compromising privacy. To bridge this gap, we propose a bandwidth-efficient and privacy-preserving BAC (BE-PBAC) scheme. We introduce a novel “verify-then-transmit” paradigm by integrating a Groth–Sahai (GS) zero-knowledge proof (ZKP) mechanism into the ciphertext header. This empowers the EN to rigorously preverify a user’s decryption eligibility without learning their credentials, effectively intercepting unauthorized requests. Additionally, we design a blinded attribute matching protocol that supports fine-grained policy hiding with explicitly bounded leakage against honest-but-curious ENs. Performance evaluations confirm that BE-PBAC reduces bandwidth consumption by orders of magnitude for unauthorized access attempts while maintaining robust privacy guarantees.
This work proposes a novel Post-Quantum Cryptographic ABE scheme based on the hardness of the Cyclic Learning With Errors (CLWE) problem, which achieves up to 70% reduction in key sizes and supports full traitor tracing, real-time revocation, and attribute value concealment, making it highly suitable for post-quantum s...
S. Hasib, A. Rasool, M. Gyanchandani· Cluster Computing· 0 citations
Enterprise collaboration in open networks faces a fundamental tension between verifying counterparty credential authenticity and preserving business privacy. Existing identity authentication methods either rely on easily forged static documents or demand full credential access, resulting in inefficient manual due dilig...
Yiang Xu, Shuai-Hang Li, Min Han· 2026 6th International Confe...· 0 citations
A privacy-preserving, secure data-sharing framework tailored for edge-cloud collaborative architectures that minimizes the computational overhead on the terminal side while safeguarding user privacy, and effectively reduces the overhead associated with user joining and revocation within the same group.
Qi-Kun Zhang, Zheng Cai, Jinbo Feng et al.· Journal of King Saud Univers...· 0 citations
This work designs a polynomial-based revocation mechanism that eliminates revocation list verification and secure-channel token updates, enabling lightweight and privacy-preserving member revocation, and formally proves the scheme’s anonymity, traceability, Existential Unforgeability under Chosen-Message Attack, and no...
An academic authentication framework that integrates the ERC-5192 Soulbound Token standard with Groth16 zk-SNARKs implemented using Circom, SnarkJS, and client-side WebAssembly to support privacy-preserving credential verification and replay resistance is presented.
Dedy Sumarhadi, Sunardi, I. Riadi· Journal of Renewable Energy...· 0 citations
A novel LWE paradigm is introduced, delivering encryption and digital signature techniques that defy quantum threats while excelling in performance and security, and a groundbreaking post-quantum key policy attribute-based encryption scheme, promising scalability, efficiency, security, collision resistance, and privacy...
S. Barj· SN Computer Science· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.