Cryptography

25 pages, 400 KB

Open AccessArticle

Strong Non-Transferability from Randomizable Universal Designated Verifier Signatures

by Magdalena Bertram, Benjamin Zengin, Nicolas Buchmann and Marian Margraf

Cryptography 2026, 10(1), 14; https://doi.org/10.3390/cryptography10010014 - 18 Feb 2026

Viewed by 1008

In the context of digital certification systems, the demand for privacy-preserving authentication is increasingly vital, particularly for critical applications that involve sensitive personal data. Traditional digital signatures provide a robust means of implementing such systems. However, they raise significant privacy concerns due to [...] Read more.

In the context of digital certification systems, the demand for privacy-preserving authentication is increasingly vital, particularly for critical applications that involve sensitive personal data. Traditional digital signatures provide a robust means of implementing such systems. However, they raise significant privacy concerns due to their public verifiability, which allows verifiers to prove the authenticity of the received sensitive data to third parties. Universal designated verifier signature (UDVS) schemes address these privacy risks by offering non-transferability, ensuring that only the specified verifier can confirm the validity of the designated verifier signature (DVS). However, despite their advantages, existing UDVS models exhibit vulnerabilities that may allow tracking of the user’s authentications among cooperating verifiers and enable third parties to be convinced of the authenticity of sensitive user data by retrieving DVSs from different, non-cooperating verifiers. This paper presents a strategy to achieve strong non-transferability, which effectively addresses these vulnerabilities, by being the first to extend the concept of randomizability to UDVS schemes and their security properties. Our findings demonstrate that a randomizable UDVS scheme can serve as a solid foundation for constructing strong non-transferable UDVS schemes. Finally, we propose an efficient, strong, non-transferable UDVS scheme as an instantiation of our strategy, utilizing state-of-the-art Type 3 pairings, significantly improving upon previous constructions. Full article

33 pages, 5180 KB

Open AccessArticle

Secure and Efficient Block Cipher Mode Design for Parallel Processing and Reliable Security

by Valli Kumari Vatsavayi and Dinesh Reddy Bommireddy

Cryptography 2026, 10(1), 13; https://doi.org/10.3390/cryptography10010013 - 13 Feb 2026

Cited by 2 | Viewed by 2956

Abstract

Communication is defined as the process of transferring data and exchanging information between interconnected systems. Due to the increasing reliance on digital infrastructures by the military, financial, and healthcare sectors, it is important to ensure the confidential, authentication, and tamper-proof nature of communications. [...] Read more.

Communication is defined as the process of transferring data and exchanging information between interconnected systems. Due to the increasing reliance on digital infrastructures by the military, financial, and healthcare sectors, it is important to ensure the confidential, authentication, and tamper-proof nature of communications. In addition, the increasing need for secure communications in the fields of network security and cryptography have led to the development of numerous systems. The basic requirement of these systems is that under the same key, identical plaintexts do not result in identical ciphertexts. The most significant contribution to this requirement has came from block cipher modes. There are many traditional modes of operation such as the Electronic Code Book (ECB) compromises between simplicity and security. Probabilistic Modes such as the Cipher Block Chaining Mode (CBC) provide a method to randomize data so that the potential for pattern analysis is eliminated, while Deterministic Modes such as ECB enable potential access to the patterns within the plaintexts. Conversely, since the randomization is in the Probabilistic Mode, there is no access to the patterns; however, the sequentiality of the blocks creates dependence and increases the computing overhead. To address these issues, a novel block cipher mode that provides the highest level of security and the most effective method for performing encryption and decryption will be proposed in this paper. It is anticipated that the improved security features and efficient encryption and decryption procedures will significantly improve confidentiality. The methods proposed will utilize compact key structures, parallel processing, a header generation based on multiple random values, and a Key-derived S Box. The experimental results show that SEBCM is more effective than CBC with respect to speed in both encryption and decryption. Full article

(This article belongs to the Special Issue Advances in Provable and Practical Security—ProvSec 2025)

► Show Figures

Figure 1

24 pages, 455 KB

Open AccessReview

Post-Quantum Cryptography in Networking Protocols: Challenges, Solutions, and Future Directions

by Sang-Yoon Chang and Qaiser Khan

Cryptography 2026, 10(1), 12; https://doi.org/10.3390/cryptography10010012 - 12 Feb 2026

Cited by 9 | Viewed by 6485

Abstract

Post-quantum cryptography (PQC) provides the essential cryptographic algorithms needed to secure digital networking systems against future adversaries equipped with quantum computing. This paper reviews the PQC research landscape and identifies open challenges and future directions for the critical transition to PQC in digital [...] Read more.

Post-quantum cryptography (PQC) provides the essential cryptographic algorithms needed to secure digital networking systems against future adversaries equipped with quantum computing. This paper reviews the PQC research landscape and identifies open challenges and future directions for the critical transition to PQC in digital networking systems. Building on the NIST standardization process which has hardened the PQC cipher algorithm security, this paper analyzes and describes the recent research on PQC implementations and integrations into scalable and standardized networking systems (Internet, web and cellular networks). We review research on the security, side-channel threats, performances, overheads, and compatibility of PQC ciphers. We also study the research incorporating PQC into the standardized web and cellular networking protocols, ranging from testing the PQC feasibility to proposing protocol solutions and mechanisms to enable PQC. Our study highlights the PQC challenge of large parameter sizes, common across the PQC cipher algorithms, and the research proposing protocol- and system-level mechanisms to address them. Informed by the survey, this paper identifies and highlights the research gaps and future directions to facilitate further research and development for PQC and to secure next-generation digital networking systems. Full article

(This article belongs to the Special Issue Advances in Post-Quantum Cryptography)

► Show Figures

Figure 1

25 pages, 1156 KB

Open AccessReview

Post-Quantum PKI: A Survey of Applications and Benchmarking Practices

by Maya Thabet, Antonia Tsili, Konstantinos Krilakis and Dimitris Syvridis

Cryptography 2026, 10(1), 11; https://doi.org/10.3390/cryptography10010011 - 12 Feb 2026

Cited by 1 | Viewed by 2473

Abstract

Post-quantum cryptography (PQC) is, and should be, currently dominating the field of cybersecurity, with many works designing and evaluating the transition of communications security to quantum-safe solutions. As the security level and implementations of post-quantum algorithms become more mature, the research on their [...] Read more.

Post-quantum cryptography (PQC) is, and should be, currently dominating the field of cybersecurity, with many works designing and evaluating the transition of communications security to quantum-safe solutions. As the security level and implementations of post-quantum algorithms become more mature, the research on their application to realistic conditions changes accordingly, especially their application to widely adopted network architectures and corresponding protocols such as the Public Key Infrastructure (PKI). In this survey, we identified articles presenting ways of integrating PQC algorithms to PKI and classified related work according to the employed methods and benchmarking choices. The main results from many evaluations converge to similar conclusions on the performance of the most popular PC digital signature algorithms; however, modeling choices concerning architecture variants, hardware and measurement metrics vary. The diversity of the results and experimental setups makes comparison difficult and arrival at an objective conclusion regarding PKI requirements almost impossible. Ultimately, this review reveals a fragmented landscape of benchmarking practices for post-quantum PKI systems. The absence of standardized evaluation frameworks and common test environments limits the comparability and reproducibility of the findings. We aim to provide reference implementations, which are essential to guide the transition of PKI infrastructures toward robust, scalable, and quantum-resistant deployments. Full article

(This article belongs to the Special Issue Advances in Post-Quantum Cryptography)

► Show Figures

Graphical abstract

17 pages, 341 KB

Open AccessReview

Some Mathematical Problems Behind Lattice-Based Cryptography

by Chuanming Zong

Cryptography 2026, 10(1), 10; https://doi.org/10.3390/cryptography10010010 - 12 Feb 2026

Cited by 1 | Viewed by 3240

Abstract

In 1994, P. Shor discovered quantum algorithms that can break both the RSA cryptosystem and the ElGamal cryptosystem. In 2007, D-Wave demonstrated the first quantum computer. These events and further developments have brought a crisis to secret communication. In 2016, the National Institute [...] Read more.

In 1994, P. Shor discovered quantum algorithms that can break both the RSA cryptosystem and the ElGamal cryptosystem. In 2007, D-Wave demonstrated the first quantum computer. These events and further developments have brought a crisis to secret communication. In 2016, the National Institute of Standards and Technology (NIST) launched a global project to solicit and select a handful of encryption algorithms with the ability to resist quantum computer attacks. In 2022, it announced four candidates, CRYSTALS-Kyber, CRYSTALS-Dilithium, Falcon, and Sphincs+, for post-quantum cryptography standards. The first three are based on lattice theory and the last on a hash function. The security of lattice-based cryptosystems relies on the computational complexity of the shortest vector problem (SVP), the closest vector problem (CVP), and their generalizations. As we will explain, the SVP is a ball-packing problem, and the CVP is a ball-covering problem. Furthermore, both the SVP and CVP are equivalent to arithmetic problems for positive definite quadratic forms. This paper will briefly describe the mathematical problems on which lattice-based cryptography is built so that cryptographers can extend their views and learn something useful. Full article

(This article belongs to the Section Cryptography Reviews)

► Show Figures

Figure 1

22 pages, 571 KB

Open AccessFeature PaperArticle

MIND-Crypt: A Machine Learning Framework for Assessing the Indistinguishability of Lightweight Block Ciphers Across Multiple Modes of Operation

by Jimmy Dani, Kalyan Nakka and Nitesh Saxena

Cryptography 2026, 10(1), 9; https://doi.org/10.3390/cryptography10010009 - 10 Feb 2026

Viewed by 1703

Abstract

Indistinguishability is a fundamental principle of cryptographic security, crucial for securing data transmitted between Internet of Things (IoT) devices. This principle ensures that an attacker cannot distinguish between the encrypted data, also known as ciphertext, and random data or the ciphertexts of two [...] Read more.

Indistinguishability is a fundamental principle of cryptographic security, crucial for securing data transmitted between Internet of Things (IoT) devices. This principle ensures that an attacker cannot distinguish between the encrypted data, also known as ciphertext, and random data or the ciphertexts of two messages encrypted with the same key. This research investigates the ability of machine learning (ML) to assess the indistinguishability property in encryption systems, with a focus on lightweight ciphers. As our first case study, we consider the SPECK32/64 and SIMON32/64 lightweight block ciphers, designed for IoT devices operating under significant energy constraints. In this research, we introduce MIND-Crypt (a Machine-learning-based framework for assessing the INDistinguishability of Cryptographic algorithms), a novel ML-based framework designed to assess the cryptographic indistinguishability of lightweight block ciphers, specifically the SPECK32/64 and SIMON32/64 encryption algorithms in CBC, CFB, OFB, and CTR modes, under Known Plaintext Attacks (KPAs). Our approach involves training ML models using ciphertexts from two plaintext messages encrypted with the same key to determine whether ML algorithms can identify meaningful cryptographic patterns or leakage. Our experiments show that modern ML techniques consistently achieve accuracy equivalent to random guessing, indicating that no statistically exploitable patterns exist in the ciphertexts generated by the considered lightweight block ciphers. Although some models exhibit mode-dependent bias (e.g., collapsing to a single-class prediction in CBC and CFB), their overall accuracy remains at random guessing levels, reinforcing that no meaningful distinguishing patterns are learned. Furthermore, we demonstrate that, when ML algorithms are trained on all possible combinations of ciphertexts for given plaintext messages, their behavior reflects memorization rather than generalization to unseen ciphertexts. Collectively, these findings suggest that existing block ciphers have secure cryptographic designs against ML-based indistinguishability assessments, reinforcing their security even under round-reduced conditions. Full article

(This article belongs to the Special Issue Advances in Privacy, Security, and Trust: Cryptographic Perspectives from PST2025)

► Show Figures

Figure 1

15 pages, 451 KB

Open AccessArticle

On Tabu Search for Block Cyphers Cryptanalysis

by Adrian Donatien-Charon, Mijail Borges-Quintana, Miguel A. Borges-Trenard, Omar Rojas and Guillermo Sosa-Gómez

Cryptography 2026, 10(1), 8; https://doi.org/10.3390/cryptography10010008 - 27 Jan 2026

Viewed by 971

Abstract

This article presents general methodologies for plaintext attacks on block ciphers using the Tabu Search algorithm. These methods treat the cipher as a black box, with the objective of finding the session key. The primary innovation of our approach is the division of [...] Read more.

This article presents general methodologies for plaintext attacks on block ciphers using the Tabu Search algorithm. These methods treat the cipher as a black box, with the objective of finding the session key. The primary innovation of our approach is the division of the key space into subsets based on a divisor, enabling the attack to focus on a specific portion of the total space. The following investigation demonstrates the successful application of these methods to a member of a block cipher family that includes the Advanced Encryption Standard (AES) cipher. One of the proposed methodologies, the subregions path attack, enables navigation of the key session space by applying specific predetermined strategies within these subregions. Full article

► Show Figures

Figure 1

25 pages, 367 KB

Open AccessArticle

Autopotency and Conjugacy of Non-Diagonalizable Matrices for Challenge–Response Authentication

by Daniel Alarcón-Narváez, Luis Adrián Lizama-Pérez and Fausto Abraham Jacques-García

Cryptography 2026, 10(1), 7; https://doi.org/10.3390/cryptography10010007 - 18 Jan 2026

Viewed by 1127

Abstract

We present an algebraic framework for constructing challenge–response authentication protocols based on powers of non-diagonalizable matrices over finite fields. The construction relies on upper triangular Toeplitz matrices with a single Jordan block and on their structured power expansions, which induce nonlinear relations between [...] Read more.

We present an algebraic framework for constructing challenge–response authentication protocols based on powers of non-diagonalizable matrices over finite fields. The construction relies on upper triangular Toeplitz matrices with a single Jordan block and on their structured power expansions, which induce nonlinear relations between matrix parameters and exponents through an autopotency phenomenon. The protocol is built from a cyclic family of matrix products derived from secret matrices

{(A_{i})}_{i = 1}^{n} \subset G L_{k} (F_{p})

: for each index i, a product

P_{i} = A_{i} A_{i + 1} \dots A_{i + n - 1}

is formed (indices modulo n), and its power

P_{i}^{(x)}

is published for a secret exponent x. The resulting family of powered products is linked by conjugation via the unknown factors

A_{i}

, enabling an interactive authentication mechanism in which the prover demonstrates the knowledge of selected factors by satisfying explicit conjugacy relations. We formalize the underlying algebraic problems in terms of factor recovery and conjugacy identification from powered products, and analyze how the enforced non-diagonalizable structure and Toeplitz constraints lead to coupled multivariate polynomial systems. These systems arise naturally from the algebraic design of the construction and do not admit immediate reductions to classical discrete logarithm settings. The framework illustrates how non-diagonalizable matrix structures and structured conjugacy relations can be used to define concrete authentication primitives in noncommutative algebraic settings, and provides a basis for further cryptanalytic and cryptographic investigation. Full article

► Show Figures

Figure 1

26 pages, 2937 KB

Open AccessArticle

Secure Implementation of RISC-V’s Scalar Cryptography Extension Set

by Asmaa Kassimi, Abdullah Aljuffri, Christian Larmann, Said Hamdioui and Mottaqiallah Taouil

Cryptography 2026, 10(1), 6; https://doi.org/10.3390/cryptography10010006 - 17 Jan 2026

Viewed by 2535

Abstract

Instruction Set Architecture (ISA) extensions, particularly scalar cryptography extensions (Zk), combine the performance advantages of hardware with the adaptability of software, enabling the direct and efficient execution of cryptographic functions within the processor pipeline. This integration eliminates the need to communicate with external [...] Read more.

Instruction Set Architecture (ISA) extensions, particularly scalar cryptography extensions (Zk), combine the performance advantages of hardware with the adaptability of software, enabling the direct and efficient execution of cryptographic functions within the processor pipeline. This integration eliminates the need to communicate with external cores, substantially reducing latency, power consumption, and hardware overhead, making it especially suitable for embedded systems with constrained resources. However, current scalar cryptography extension implementations remain vulnerable to physical threats, notably power side-channel attacks (PSCAs). These attacks allow adversaries to extract confidential information, such as secret keys, by analyzing the power consumption patterns of the hardware during operation. This paper presents an optimized and secure implementation of the RISC-V scalar Advanced Encryption Standard (AES) extension (Zkne/Zknd) using Domain-Oriented Masking (DOM) to mitigate first-order PSCAs. Our approach features optimized assembly implementations for partial rounds and key scheduling alongside pipeline-aware microarchitecture optimizations. We evaluated the security and performance of the proposed design using the Xilinx Artix7 FPGA platform. The results indicate that our design is side-channel-resistant while adding a very low area overhead of 0.39% to the full 32-bit CV32E40S RISC-V processor. Moreover, the performance overhead is zero when the extension-related instructions are properly scheduled. Full article

(This article belongs to the Topic Recent Advances in Security, Privacy, and Trust)

► Show Figures

Figure 1

19 pages, 436 KB

Open AccessFeature PaperArticle

Lower Bound on the Overlattice-Based Sieve Algorithm

by Tongchen Shen, Xiangxue Li and Licheng Wang

Cryptography 2026, 10(1), 5; https://doi.org/10.3390/cryptography10010005 - 1 Jan 2026

Cited by 2 | Viewed by 1875

Abstract

Lattice-based cryptography stands as one of the most pivotal candidates in post-quantum cryptography. To configure the parameters of lattice-based cryptographic schemes, a thorough comprehension of their concrete security is indispensable. Lattice sieving algorithms represent among the most critical tools for conducting concrete security [...] Read more.

Lattice-based cryptography stands as one of the most pivotal candidates in post-quantum cryptography. To configure the parameters of lattice-based cryptographic schemes, a thorough comprehension of their concrete security is indispensable. Lattice sieving algorithms represent among the most critical tools for conducting concrete security analysis. Currently, the state-of-the-art BDGL-sieve (SODA 2016) achieves a time complexity of

2^{0.292 n + o (n)}

, and Kirshanova and Laarhoven (CRYPTO 2021) have proven that the BDGL-sieve attains the lower bound under the technical paradigm of the Nearest Neighbor Search (NNS) problem. A natural question emerges: whether overlattice-based sieving algorithms (ANTS 2014) can outperform the BDGL-sieve within an alternative technical framework. This work provides an almost negative response to this question. Specifically, we propose a generalized overlattice tower model, which facilitates the proof of the lower bound for the overlattice-based method. Our findings indicate that the original Overlattice-sieve has already reached this lower bound. Consequently, the BDGL-sieve will maintain its status as the sieving algorithm with optimal time complexity, unless a revolutionary technical optimization is developed in the future. Full article

► Show Figures

Figure 1

32 pages, 33846 KB

Open AccessArticle

Unbreakable QR Code Watermarks: A High-Robustness Technique for Digital Image Security Using DWT, SVD, and Schur Factorization

by Bashar Suhail Khassawneh, Issa AL-Aiash, Mahmoud AlJamal, Omar Aljamal, Latifa Abdullah Almusfar, Bashair Faisal AlThani and Waad Aldossary

Cryptography 2026, 10(1), 4; https://doi.org/10.3390/cryptography10010004 - 30 Dec 2025

Cited by 1 | Viewed by 2400

Abstract

In the digital era, protecting the integrity and ownership of digital content is increasingly crucial, particularly against unauthorized copying and tampering. Traditional watermarking techniques often struggle to remain robust under various image manipulations, leading to a need for more resilient methods. To address [...] Read more.

In the digital era, protecting the integrity and ownership of digital content is increasingly crucial, particularly against unauthorized copying and tampering. Traditional watermarking techniques often struggle to remain robust under various image manipulations, leading to a need for more resilient methods. To address this challenge, we propose a novel watermarking technique that integrates the Discrete Wavelet Transform (DWT), Singular Value Decomposition (SVD), and Schur matrix factorization to embed a QR code as a watermark into digital images. Our method was rigorously tested across a range of common image attacks, including histogram equalization, salt-and-pepper noise, ripple distortions, smoothing, and extensive cropping. The results demonstrate that our approach significantly outperforms existing methods, achieving high normalized correlation (NC) values such as 0.9949 for histogram equalization, 0.9846 for salt-and-pepper noise (2%), 0.96063 for ripple distortion, 0.9670 for smoothing, and up to 0.9995 under 50% cropping. The watermark consistently maintained its integrity and scannability under all tested conditions, making our method a reliable solution for enhancing digital copyright protection. Full article

(This article belongs to the Special Issue Advanced Techniques in Watermarking, Encryption and Steganography for Secure Communication)

► Show Figures

Figure 1

18 pages, 325 KB

Open AccessArticle

Large Pages, Large Leaks? Hugepage-Induced Side-Channels vs. Performance Improvements in Cryptographic Computations

by Xinyao Li and Akhilesh Tyagi

Cryptography 2026, 10(1), 3; https://doi.org/10.3390/cryptography10010003 - 30 Dec 2025

Viewed by 1512

Abstract

Side-channel attacks leveraging microarchitectural components such as caches and translation lookaside buffers (TLBs) pose increasing risks to cryptographic and machine-learning workloads. This paper presents a comparative study of performance and side-channel leakage under two page-size configurations—standard 4 KB pages and 2 MB huge [...] Read more.

Side-channel attacks leveraging microarchitectural components such as caches and translation lookaside buffers (TLBs) pose increasing risks to cryptographic and machine-learning workloads. This paper presents a comparative study of performance and side-channel leakage under two page-size configurations—standard 4 KB pages and 2 MB huge pages—using paired attacker–victim experiments instrumented with both Performance Monitoring Unit (PMU) counters and precise per-access timing using rdtscp(). The victim executes repeated, key-dependent memory accesses across eight cryptographic modes (AES, ChaCha20, RSA, and ECC variants) while the attacker records eight PMU features per access (cpu-cycles, instructions, cache-references, cache-misses, etc.) and precise rdtscp() timing. The resulting traces are analyzed using a multilayer perceptron classifier to quantify key-dependent leakage. Results show that the 2 MB huge-page configuration achieves a comparable key-classification accuracy (mean 0.79 vs. 0.77 for 4 KB) while reducing average CPU cycles by approximately 11%. Page-index identification remains near random chance (3.6–3.7% for PMU side-channels and 1.5% for timing side-channel), indicating no increase in measurable leakage at the page level. These findings suggest that huge-page mappings can improve runtime efficiency without amplifying observable side-channel vulnerabilities, offering a practical configuration for balancing performance and security in user-space cryptographic workloads. Full article

(This article belongs to the Section Hardware Security)

► Show Figures

Figure 1

14 pages, 319 KB

Open AccessArticle

AI-Enhanced Perceptual Hashing with Blockchain for Secure and Transparent Digital Copyright Management

by Zhaoxiong Meng, Rukui Zhang, Bin Cao, Meng Zhang, Yajun Li, Huhu Xue and Meimei Yang

Cryptography 2026, 10(1), 2; https://doi.org/10.3390/cryptography10010002 - 29 Dec 2025

Cited by 1 | Viewed by 3222

Abstract

This study presents a novel framework for digital copyright management that integrates AI-enhanced perceptual hashing, blockchain technology, and digital watermarking to address critical challenges in content protection and verification. Traditional watermarking approaches typically employ content-independent metadata and rely on centralized authorities, introducing risks [...] Read more.

This study presents a novel framework for digital copyright management that integrates AI-enhanced perceptual hashing, blockchain technology, and digital watermarking to address critical challenges in content protection and verification. Traditional watermarking approaches typically employ content-independent metadata and rely on centralized authorities, introducing risks of tampering and operational inefficiencies. The proposed system utilizes a pre-trained convolutional neural network (CNN) to generate a robust, content-based perceptual hash value, which serves as an unforgeable watermark intrinsically linked to the image content. This hash is embedded as a QR code in the frequency domain and registered on a blockchain, ensuring tamper-proof timestamping and comprehensive traceability. The blockchain infrastructure further enables verification of multiple watermark sequences, thereby clarifying authorship attribution and modification history. Experimental results demonstrate high robustness against common image modifications, strong discriminative capabilities, and effective watermark recovery, supported by decentralized storage via the InterPlanetary File System (IPFS). The framework provides a transparent, secure, and efficient solution for digital rights management, with potential future enhancements including post-quantum cryptography integration. Full article

(This article belongs to the Special Issue Interdisciplinary Cryptography)

► Show Figures

Figure 1

25 pages, 709 KB

Open AccessArticle

DLR-Auth: A Decentralized Lightweight and Revocable Authentication Framework for the Industrial Internet of Things

by Yijia Dai, Yitong Li, Ye Yuan, Xianwei Gao, Cong Bian and Meici Liu

Cryptography 2026, 10(1), 1; https://doi.org/10.3390/cryptography10010001 - 20 Dec 2025

Viewed by 963

Abstract

The integration of operational technology (OT) and information technology (IT) within the Industrial Internet of Things (IIoT) has posed prominent security challenges for resource-constrained devices. Existing authentication architectures often suffer from critical vulnerabilities: one is their reliance on centralized trusted third parties, which [...] Read more.

The integration of operational technology (OT) and information technology (IT) within the Industrial Internet of Things (IIoT) has posed prominent security challenges for resource-constrained devices. Existing authentication architectures often suffer from critical vulnerabilities: one is their reliance on centralized trusted third parties, which creates single points of failure; the other is their use of static credentials like biometrics, which pose severe privacy risks if compromised. To address these limitations, this paper proposes DLR-Auth, which combines chaotic synchronization of semiconductor superlattice physically unclonable functions (SSL-PUFs) with Shamir’s secret sharing (SSS) to enable decentralized registration and revocable templates. Notably, DLR-Auth is a two-party authentication framework that removes the need for a separate online registration authority that operates directly between a user device (

U D_{i}

) and a server (S). In our setting, the server S still acts as the central relying party and hardware authority embedding the matched SSL-PUF module. The protocol also includes an efficient multi-access mechanism optimized for high-frequency interactions. Formal security analysis with the Real-or-Random (ROR) model proves the semantic security of the session key, while performance evaluations demonstrate that DLR-Auth has significant advantages in computational and communication efficiency. DLR-Auth thus offers a robust, scalable, lightweight solution for next-generation secure IIoT systems. Full article

► Show Figures

Figure 1

Journal Menu

Journal Browser

Cryptography, Volume 10, Issue 1 (February 2026) – 14 articles

Further Information

Guidelines

MDPI Initiatives

Follow MDPI