Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2201.12512 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Password authentication schemes on a quantum computer

Sherry C. Wang, Carlisle M. Adams, Anne Broadbent

Published Oct 1, 2021• 4 citations
arXivHTMLPDF

Abstract

In a post-quantum world, where attackers may have access to full-scale quantum computers, all classical password-based authentication schemes will be compromised. Quantum copy-protection prevents adversaries from making copies of existing quantum software; we suggest this as a possible approach for designing post-quantum-secure password authentication systems. In this paper, we show an implementation of quantum copy-protection for password verification on IBM quantum computers. We also share our quantum computation results and analyses, as well as lessons learned.

DOI
10.1109/qce52317.2021.00051

Related papers

Hybrid Post-Quantum Secure Authentication Using Quantum-Generated One-Time Tokens: A Comparative Analysis with Classical Authentication Systems

Dipika S. Harode, Vedanti U. Deshmukh

ABSTRACT The rapid advancement of quantum computing poses a serious threat to classical authentication mechanisms that rely on computational hardness assumptions and software-based randomness. Traditional authentication systems such as passwords, one-time passwords (OTPs), and public-key cryptography depend heavily on pseudorandom number generators (PRNGs) and classical cryptographic algorithms, many of which are vulnerable to future quantum attacks. This paper proposes and analyzes a Hybrid Post-Quantum Secure Authentication system using Quantum-Generated One-Time Tokens (Q-OTT). The proposed approach combines true quantum randomness obtained from Quantum Random Number Generators (QRNGs) with post-quantum cryptographic (PQC) algorithms for token protection and verification. A detailed comparison between classical authentication systems and the hybrid Q-OTT approach is presented in terms of randomness, security, entropy, and quantum resistance. The study demonstrates that hybrid Q-OTT systems offer significantly enhanced security against both classical and quantum adversaries, at the cost of moderate infrastructure requirements. Keywords Post-Quantum Cryptography, Quantum Random Number Generator, One-Time Token, Authentication Systems, Quantum Security, Hybrid Authentication

INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT•Jan 24, 2026•0 citations

New Approaches for Quantum Copy-Protection

Scott Aaronson, Jiahui Liu, Qipeng Liu +2 more

Quantum copy protection uses the unclonability of quantum states to construct quantum software that provably cannot be pirated. Copy protection would be immensely useful, but unfortunately little is known about how to achieve it in general. In this work, we make progress on this goal, by giving the following results: - We show how to copy protect any program that cannot be learned from its input/output behavior, relative to a classical oracle. This improves on Aaronson [CCC'09], which achieves the same relative to a quantum oracle. By instantiating the oracle with post-quantum candidate obfuscation schemes, we obtain a heuristic construction of copy protection. -We show, roughly, that any program which can be watermarked can be copy detected, a weaker version of copy protection that does not prevent copying, but guarantees that any copying can be detected. Our scheme relies on the security of the assumed watermarking, plus the assumed existence of public key quantum money. Our construction is general, applicable to many recent watermarking schemes.

arXiv:2004.09674•Apr 20, 2020•10 citations

New Approaches for Quantum Copy-Protection.

Scott Aaronson, Jiahui Liu, Qipeng Liu +2 more

Quantum copy-protection uses the unclonability of quantum states to construct quantum software that provably cannot be pirated. copy-protection would be immensely useful, but unfortunately, little is known about achieving it in general. In this work, we make progress on this goal, by giving the following results: We show how to copy-protect any program that cannot be learned from its input-output behavior relative to a classical oracle. This construction improves on Aaronson (CCC 2009), which achieves the same relative to a quantum oracle. By instantiating the oracle with post-quantum candidate obfuscation schemes, we obtain a heuristic construction of copy-protection. We show, roughly, that any program which can be watermarked can be copy detected, a weaker version of copy-protection that does not prevent copying, but guarantees that any copying can be detected. Our scheme relies on the security of the assumed watermarking, plus the assumed existence of public-key quantum money. Our construction is publicly detectable and applicable to many recent watermarking schemes.

•Jan 1, 2020•1 citation

A Quantum Copy-Protection Scheme with Authentication

László Gyöngyösi, Sándor Imre

We propose a quantum copy-protection system which protects classical information in the form of non-orthogonal quantum states. The decryption of the stored information is not possible in the classical representation and the decryption mechanism of data qubits is realized by secret unitary rotations. We define an authentication method for the proposed copy-protection scheme and analyse the success probabilities of the authentication process. A possible experimental realization of the scheme is also presented.

arXiv:1207.4462•Jul 18, 2012•0 citations

Quantum-Resistant Password Generation A Comprehensive Model with QNN, Simplified Entropy, and QKD Integration

Swati Shinde, Amogh Chandragiri, Akshay Chaudhari +2 more

Passwords remain a universal mechanism for user authentication, yet they are troubled by weak choices and vulnerabilities. The arrival of quantum computing threatens to worsen these issues by enabling faster password cracking. Conventional wisdom suggests using longer or more complex passwords to counter quantum attacks, but this approach can be impractical.In this paper, we propose a novel quantum-resistant password generation framework that leverages a Quantum Neural Network (QNN) to create highly secure passwords. Our approach combines quantum machine learning with entropy-based rigorous analysis to ensure that generated passwords are resilient even against adversaries equipped with quantum computing capabilities. We design and train a QNN using large-scale password datasets (including RockYou, Have I Been Pwned, and others) to learn the distribution of common passwords and then generate passwords that avoid these patterns. To rigorously quantify security, we replace simplistic entropy estimations with a von Neumann entropy analysis, measuring the quantum entropy of the password generation process. The experimental results demonstrate that our QNN-generated passwords achieve significantly higher entropy and resistance to guessing attacks compared to conventional methods. This research highlights how quantum computing can be harnessed not only as a threat but as a tool to enhance security.

Global Conference in Emerging Technology (GINOTECH)•May 9, 2025•0 citations

Quantum-Resistant Blockchain Authentication Protocol: Securing Decentralized Systems Against Post-Quantum Attacks

Dhruv Dhayal, Preeti Preeti, Pankaj Kumar Varshney +1 more

The fast growth of quantum computing makes the old modes of cryptography, be it RSA or ECC, weak to quantum attacks, especially when it employs Shor's algorithm. Threatening also builds up on the post-quantum age regarding blockchain technology and its external cryptography, which secures reliable transactions and authentication. This study will address the importance of quantum resistant blockchain authentication protocols for the security of decentralized systems against any forward-looking quantum-enabled attacks. This paper goes through different classifications of post-quantum cryptography like lattice-based, hash-based, multivariate polynomial, and code-based cryptography, taking an effort to analyze their compatibility with blockchain use cases.[8] Moreover, we also introduce the innovative quantum-resistant authentication model designed to enhance security while not compromising upon efficiency.[2] [3] Our proposed model would ensure scalability and less computational overhead by partially providing immunity to quantum adversaries through its underlying use of post-quantum signature schemes and lightweight key exchange mechanisms. This research aims at laying the foundation for developing a secure blockchain ecosystem against quantum threats, heading toward a resistant future-proof decentralized infrastructure. [4] [5]

International Conference on Multidisciplinary Research and Innovations in Engineering (MRIE)•Jul 30, 2025•2 citations
In a post-quantum world, where attackers may have access to full-scale quantum computers, all classical password-based authentication schemes will be compromised. Quantum copy-protection prevents adversaries from making copies of existing quantum software; we suggest this as a possible approach for designing post-quantum-secure password authentication systems. In this paper, we show an implementation of quantum copy-protection for password verification on IBM quantum computers. We also share our quantum computation results and analyses, as well as lessons learned.
ABSTRACT The rapid advancement of quantum computing poses a serious threat to classical authentication mechanisms that rely on computational hardness assumptions and software-based randomness. Traditional authentication systems such as passwords, one-time passwords (OTPs), and public-key cryptography depend heavily on pseudorandom number generators (PRNGs) and classical cryptographic algorithms, many of which are vulnerable to future quantum attacks. This paper proposes and analyzes a Hybrid Post-Quantum Secure Authentication system using Quantum-Generated One-Time Tokens (Q-OTT). The proposed approach combines true quantum randomness obtained from Quantum Random Number Generators (QRNGs) with post-quantum cryptographic (PQC) algorithms for token protection and verification. A detailed comparison between classical authentication systems and the hybrid Q-OTT approach is presented in terms of randomness, security, entropy, and quantum resistance. The study demonstrates that hybrid Q-OTT systems offer significantly enhanced security against both classical and quantum adversaries, at the cost of moderate infrastructure requirements. Keywords Post-Quantum Cryptography, Quantum Random Number Generator, One-Time Token, Authentication Systems, Quantum Security, Hybrid Authentication
Quantum copy protection uses the unclonability of quantum states to construct quantum software that provably cannot be pirated. Copy protection would be immensely useful, but unfortunately little is known about how to achieve it in general. In this work, we make progress on this goal, by giving the following results: - We show how to copy protect any program that cannot be learned from its input/output behavior, relative to a classical oracle. This improves on Aaronson [CCC'09], which achieves the same relative to a quantum oracle. By instantiating the oracle with post-quantum candidate obfuscation schemes, we obtain a heuristic construction of copy protection. -We show, roughly, that any program which can be watermarked can be copy detected, a weaker version of copy protection that does not prevent copying, but guarantees that any copying can be detected. Our scheme relies on the security of the assumed watermarking, plus the assumed existence of public key quantum money. Our construction is general, applicable to many recent watermarking schemes.
Quantum copy-protection uses the unclonability of quantum states to construct quantum software that provably cannot be pirated. copy-protection would be immensely useful, but unfortunately, little is known about achieving it in general. In this work, we make progress on this goal, by giving the following results: We show how to copy-protect any program that cannot be learned from its input-output behavior relative to a classical oracle. This construction improves on Aaronson (CCC 2009), which achieves the same relative to a quantum oracle. By instantiating the oracle with post-quantum candidate obfuscation schemes, we obtain a heuristic construction of copy-protection. We show, roughly, that any program which can be watermarked can be copy detected, a weaker version of copy-protection that does not prevent copying, but guarantees that any copying can be detected. Our scheme relies on the security of the assumed watermarking, plus the assumed existence of public-key quantum money. Our construction is publicly detectable and applicable to many recent watermarking schemes.
We propose a quantum copy-protection system which protects classical information in the form of non-orthogonal quantum states. The decryption of the stored information is not possible in the classical representation and the decryption mechanism of data qubits is realized by secret unitary rotations. We define an authentication method for the proposed copy-protection scheme and analyse the success probabilities of the authentication process. A possible experimental realization of the scheme is also presented.
Passwords remain a universal mechanism for user authentication, yet they are troubled by weak choices and vulnerabilities. The arrival of quantum computing threatens to worsen these issues by enabling faster password cracking. Conventional wisdom suggests using longer or more complex passwords to counter quantum attacks, but this approach can be impractical.In this paper, we propose a novel quantum-resistant password generation framework that leverages a Quantum Neural Network (QNN) to create highly secure passwords. Our approach combines quantum machine learning with entropy-based rigorous analysis to ensure that generated passwords are resilient even against adversaries equipped with quantum computing capabilities. We design and train a QNN using large-scale password datasets (including RockYou, Have I Been Pwned, and others) to learn the distribution of common passwords and then generate passwords that avoid these patterns. To rigorously quantify security, we replace simplistic entropy estimations with a von Neumann entropy analysis, measuring the quantum entropy of the password generation process. The experimental results demonstrate that our QNN-generated passwords achieve significantly higher entropy and resistance to guessing attacks compared to conventional methods. This research highlights how quantum computing can be harnessed not only as a threat but as a tool to enhance security.
The fast growth of quantum computing makes the old modes of cryptography, be it RSA or ECC, weak to quantum attacks, especially when it employs Shor's algorithm. Threatening also builds up on the post-quantum age regarding blockchain technology and its external cryptography, which secures reliable transactions and authentication. This study will address the importance of quantum resistant blockchain authentication protocols for the security of decentralized systems against any forward-looking quantum-enabled attacks. This paper goes through different classifications of post-quantum cryptography like lattice-based, hash-based, multivariate polynomial, and code-based cryptography, taking an effort to analyze their compatibility with blockchain use cases.[8] Moreover, we also introduce the innovative quantum-resistant authentication model designed to enhance security while not compromising upon efficiency.[2] [3] Our proposed model would ensure scalability and less computational overhead by partially providing immunity to quantum adversaries through its underlying use of post-quantum signature schemes and lightweight key exchange mechanisms. This research aims at laying the foundation for developing a secure blockchain ecosystem against quantum threats, heading toward a resistant future-proof decentralized infrastructure. [4] [5]