Having access to a unique quantum circuit that one wants to protect against use by others is a very likely scenario in industrial computing. However, currently, users rely on classical computer security schemes, which have known shortcomings. In this paper, we introduce a novel protection scheme along with a survey of other known methods to protect quantum information. In particular, we review physically unclonable functions (PUFs), obfuscation, and introduce quantum logic locking (QLL). The latter technique provisions end users to protect their circuit from an adversary through the use of a secret key.
Having access to a unique quantum circuit that one wants to protect against use by others is a very likely scenario in industrial computing. However, currently, users rely on classical computer security schemes, which have known shortcomings. In this paper, we introduce a novel protection scheme along with a survey of other known methods to protect quantum information. In particular, we review physically unclonable functions (PUFs), obfuscation, and introduce quantum logic locking (QLL). The latter technique provisions end users to protect their circuit from an adversary through the use of a secret key.
Physical Unclonable Functions (PUFs) have garnered significant attention for their potential in enhancing the security of IoT devices, offering an alternative to traditional computational-based approaches. Despite their potential, classical PUFs suffer from critical drawbacks, including vulnerability to machine learning attacks and inadequate defense against quantum adversaries. To address these limitations, alternative architectures utilizing quantum mechanical principles, known as Quantum PUFs (QPUFs), have been proposed. This paper presents a comprehensive survey of the diverse range of QPUFs, detailing their architectures and security features. Additionally, it explores the information-theoretic applications of QPUFs in IoT, including secret key generation, secure storage, authentication, and identification. The findings indicate that classical results translate effectively to the quantum domain in most cases, with QPUFs exhibiting larger capacity regions compared to their classical counterparts.
The emergence of quantum computing has provided new paradigms for cryptography. On the one hand, it poses significant new threats to existing classically cryptographic systems, requiring the community to define new security models that capture what a quantum adversary can do. On the other hand, it gives us new tools to design cryptographic protocols, with weaker assumptions than in the classical world, or even protocols that are impossible classically. In this survey, we first give an overview of new security definitions for classical cryptography, considering quantum adversaries who can either only use local quantum computation (post-quantum security), or even send quantum messages and in particular have access to oracle in superposition (quantum security). We explore these new notions through the examples of commitments, zero-knowledge proofs, encryption, and signatures. Then, we present what is arguably the most famous application of quantum cryptography: quantum key distribution (QKD) protocols that take advantage of unique properties of quantum mechanics to provide secure communication unconditionally. We also explore cryptography beyond QKD, focusing on unclonable cryptography: a family of cryptographic functionalities, built with quantum states, and designed to be resistant to counterfeit by leveraging the “no-cloning” theorem. We examine in particular quantum money, but also the recent notions of unclonable encryption and copy-protection, including related variants. By presenting a comprehensive survey of these topics, this paper aims to provide a thorough understanding of the current landscape and future potential of quantum cryptography.
The promise of scalable quantum computing is causing major upheaval in the domain of cryptography and security. In this perspective paper, we review the progress towards the realization of large-scale quantum computing. We further summarize the imminent threats towards existing cryptographic primitives. To address this challenges, there is a consolidated effort towards the standardization of new cryptographic primitives, namely post-quantum cryptography (PQC). We discuss the underlying mathematical problems that define different classes of PQC candidates, and their resistance to an adversary having access to large Quantum computer. In parallel to this thread of research, several classical cryptographic primitives have been ported to the Quantum world as well. We discuss, in that context - Quantum Key Distribution (QKD), Physically Unclonable Function (PUF) and True Random Number Generator (TRNG). For those implementations, we take a sneak preview in the resulting implementation-related vulnerabilities.
Quantum computing presents a significant threat to traditional cryptographic protocols, particularly those relying on the hardness of factoring large integers and computing discrete logarithms, as quantum algorithms can solve these problems in polynomial time. With the advent of quantum computers capable of breaking current cryptographic schemes, the need for quantum-resistant cryptographic mechanisms has become increasingly urgent. In this paper, we focused on authentication, a critical security property, and reviewed various classical cryptographic techniques to this aim and their potential to resist quantum attacks. We present a (non-exhaustive) overview of the state of the art in quantum-resistant authentication, particularly through symmetric cryptography, digital signatures, and hardware-based approaches such as physical unclonable functions (PUFs). By offering a clear and focused analysis, we used this survey to bridge the gap between diverse academic communities and provide a foundation for future research in post-quantum authentication.
As quantum technologies advance, ensuring secure authentication of quantum devices has become increasingly important. Existing methods, often relying on stored cryptographic keys, are vulnerable to physical and side-channel attacks. Quantum Physical Unclonable Functions (QPUFs) offer a promising alternative by leveraging quantum phenomena such as superposition, entanglement, and quantum noise to produce unique, unclonable responses. However, many existing QPUF designs are based on simulations or report only idealized, best-case results. This work presents and evaluates a set of QPUF circuits on IBM’s real quantum hardware, assessing their performance in terms of instability, randomness, and uniqueness to identify the most effective configurations. Our results show that specific configurations can achieve a positive balance between stability and device distinguishability, reaching 0.05 instability, 0.48 uniqueness, and 0.75 randomness. These findings provide a solid foundation for implementing robust authentication protocols tailored for quantum devices in real-world settings.
With the rapid development of quantum computing, in response to its disruptive threats to traditional cryptosystems and the urgent demand for lightweight and highly scalable secure group communication among resource-constrained devices in large-scale Internet of Things (IoT) scenarios, this paper proposes a lightweight anonymous group authentication scheme that integrates Physical Unclonable Functions (PUFs), distributed Gossip algorithms, and quantum key distribution. By exploiting the uniqueness and unclonability derived from the inherent physical characteristics of PUF hardware, the scheme fundamentally eliminates attack vectors against quantum computers without requiring devices to pre-store any secret keys in their memory, while the QKCS pre-provisions CRPs and key seeds, which is the standard enrollment procedure in PUF-based systems. Combined with information-theoretically secure quantum keys as session keys, it forms a dual protection mechanism: anti-forgery at the physical layer and anti-quantum attack at the cryptographic layer. Innovatively, the Gossip algorithm is deeply integrated with group key agreement, converting global broadcast into local iterative interactions between nodes, which effectively alleviates broadcast storms and improves the scalability and fault tolerance of the protocol. Meanwhile, a pseudonym mechanism is introduced to achieve anonymous identity protection, and a dynamic key update strategy guarantees forward and backward security when members join or leave the group. Formal verification based on BAN logic and security analysis show that the proposed protocol can resist typical attacks such as replay attacks, man-in-the-middle attacks, and impersonation attacks. Performance evaluations demonstrate that our scheme outperforms existing comparable schemes in terms of computational cost, communication overhead, and dynamic group management efficiency, demonstrating its potential for resource-constrained IoT environments, pending further validation on real hardware platforms.