The rapid development of industrial digitalization has made secure and efficient authentication mechanisms for resource-constrained Industrial Internet of Things (IIoT) devices increasingly important. However, existing authentication schemes often suffer from high computational overhead, limited adaptability to dynamic industrial environments, and delayed detection of credential compromises. To address these challenges, this article proposes a lightweight, adaptive, and security-enhanced authentication scheme tailored for IIoT systems. The scheme integrates physical unclonable function (PUF) technology for hardware-level security, applies SSS to manage PUF response instability, and incorporates a honeyword mechanism for proactive password leakage detection. Formal security analyses using BAN logic and ProVerif, along with heuristic assessments, demonstrate the scheme’s robustness against common IIoT threats, including impersonation, replay, and password-guessing attacks. Experimental results indicate that, under the stated assumptions and implementation settings, our scheme exhibits lower simulated computational cost (10.855 ms) and achieves an estimated sensor-node energy of 0.466 mJ on MICAz using Shim’s methodology. Taken together, these results indicate strong security with improved efficiency, suggesting practicality for evolving IIoT deployments.

Multipartite secret sharing schemes are those that have multipartite access structures. The set of the participants in those schemes is divided into several parts, and all the participants in the same part play the equivalent role. One type of such access structure is the compartmented access structure, and the other is the hierarchical access structure. We propose an efficient compartmented multisecret sharing scheme based on the linear homogeneous recurrence (LHR) relations. In the construction phase, the shared secrets are hidden in some terms of the linear homogeneous recurrence sequence. In the recovery phase, the shared secrets are obtained by solving those terms in which the shared secrets are hidden. When the global threshold is t , our scheme can reduce the computational complexity of the compartmented secret sharing schemes from the exponential time to polynomial time. The security of the proposed scheme is based on Shamir’s threshold scheme, i.e., our scheme is perfect and ideal. Moreover, it is efficient to share the multisecret and to change the shared secrets in the proposed scheme.