Password authentication schemes on a quantum computer

• URL: http://arxiv.org/abs/2201.12512v1
• Date: Sat, 29 Jan 2022 06:40:39 GMT
• Title: Password authentication schemes on a quantum computer
• Authors: Sherry Wang, Carlisle Adams, Anne Broadbent
• Abstract summary: Quantum copy-protection prevents adversaries from making copies of existing quantum software. We show an implementation of quantum copy-protection for password verification on IBM quantum computers.
• Score: 0.5156484100374059
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Designing Hash and Encryption Engines using Quantum Computing [2.348041867134616]
  We explore quantum-based hash functions and encryption to fortify data security. The integration of quantum and classical methods demonstrates potential in securing data in the era of quantum computing.
  arXiv  Detail & Related papers  (2023-10-26T14:49:51Z)
• Deploying hybrid quantum-secured infrastructure for applications: When quantum and post-quantum can work together [0.8702432681310401]
  Quantum key distribution is secure against unforeseen technological developments. Post-quantum cryptography is believed to be secure even against attacks with both classical and quantum computing technologies. Various directions in the further development of the full-stack quantum-secured infrastructure are also indicated.
  arXiv  Detail & Related papers  (2023-04-10T13:44:21Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Cyberattacks on Quantum Networked Computation and Communications -- Hacking the Superdense Coding Protocol on IBM's Quantum Computers [0.0]
  We study two types of attacks on automated quantum communications protocols. We show that, due to quantum entanglement and symmetries, the second type of attack works as a way to strategically disrupt quantum communications networks.
  arXiv  Detail & Related papers  (2021-05-15T09:42:36Z)
• A practical quantum encryption protocol with varying encryption configurations [0.0]
  We propose a quantum encryption protocol that utilizes a quantum algorithm to create blocks oftext ciphers based on quantum states. The main feature of our quantum encryption protocol is that the encryption configuration of each block is determined by the previous blocks.
  arXiv  Detail & Related papers  (2021-01-22T20:09:03Z)
• Anti-Forging Quantum Data: Cryptographic Verification of Quantum Computational Power [1.9737117321211988]
  Quantum cloud computing is emerging as a popular model for users to experience the power of quantum computing through the internet. How can users be sure that the output strings sent by the server are really from a quantum hardware?
  arXiv  Detail & Related papers  (2020-05-04T14:28:14Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.