Hybrid Quantum Cryptography from Communication Complexity
- URL: http://arxiv.org/abs/2311.09164v2
- Date: Mon, 27 Nov 2023 09:16:44 GMT
- Title: Hybrid Quantum Cryptography from Communication Complexity
- Authors: Francesco Mazzoncini, Balthazar Bauer, Peter Brown, Romain All\'eaume
- Abstract summary: We build a key distribution protocol called HM-QCT from the Hidden Matching problem.
We show that the security of HM-QCT against arbitrary i.i.d. attacks can be reduced to the difficulty of solving the underlying Hidden Matching problem.
Remarkably, the scheme remains secure with up to $mathcalObig( fracsqrtnlog(n)big)$ input photons for each channel use.
- Score: 0.43695508295565777
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We introduce an explicit construction for a key distribution protocol in the
Quantum Computational Timelock (QCT) security model, where one assumes that
computationally secure encryption may only be broken after a time much longer
than the coherence time of available quantum memories.
Taking advantage of the QCT assumptions, we build a key distribution protocol
called HM-QCT from the Hidden Matching problem for which there exists an
exponential gap in one-way communication complexity between classical and
quantum strategies.
We establish that the security of HM-QCT against arbitrary i.i.d. attacks can
be reduced to the difficulty of solving the underlying Hidden Matching problem
with classical information. Legitimate users, on the other hand, can use
quantum communication, which gives them the possibility of sending multiple
copies of the same quantum state while retaining an information advantage. This
leads to an everlasting secure key distribution scheme over $n$ bosonic modes.
Such a level of security is unattainable with purely classical techniques.
Remarkably, the scheme remains secure with up to $\mathcal{O}\big(
\frac{\sqrt{n}}{\log(n)}\big)$ input photons for each channel use, extending
the functionalities and potentially outperforming QKD rates by several orders
of magnitudes.
Related papers
- Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC)
We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
arXiv Detail & Related papers (2024-02-13T12:12:39Z) - Robust Quantum Public-Key Encryption with Applications to Quantum Key
Distribution [16.06159998475861]
Quantum key distribution (QKD) allows Alice and Bob to agree on a shared secret key, while communicating over a public (untrusted) quantum channel.
It has two main advantages: (i) The key is unconditionally hidden to the eyes of any attacker, and (ii) its security assumes only the existence of authenticated classical channels.
We propose a two-message QKD protocol that satisfies everlasting security, assuming only the existence of quantum-secure one-way functions.
arXiv Detail & Related papers (2023-04-06T11:14:55Z) - Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities.
We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z) - Quantum oblivious transfer: a short review [0.06554326244334865]
We study the concept of oblivious transfer in the area of theoretical quantum cryptography.
We review the impossibility results that daunt this primitive and discuss several quantum security models under which it is possible to prove QOT security.
arXiv Detail & Related papers (2022-06-06T15:19:26Z) - Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's
Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task.
In this work, we examine the hardness of finding such chain of PoWs against quantum strategies.
We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z) - Quantum hacking perceiving for quantum key distribution using temporal
ghost imaging [7.7270491671042425]
Quantum key distribution (QKD) can generate secure key bits between remote users with quantum mechanics.
The most insidious attacks, known as quantum hacking, are the ones with no significant discrepancy of the measurement results.
We propose the method exploring temporal ghost imaging (TGI) scheme to perceive quantum hacking with temporal fingerprints.
arXiv Detail & Related papers (2020-12-28T02:21:09Z) - Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs"
We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM)
As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
arXiv Detail & Related papers (2020-09-29T08:41:53Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Everlasting Secure Key Agreement with performance beyond QKD in a
Quantum Computational Hybrid security model [0.0]
We introduce the textitQuantum Computational Hybrid (QCH) security model.
We propose an explicit $d$-dimensional key distribution protocol, that we call MUB-textitQuantum Computational Timelock (MUB-QCT)
We demonstrate that MUB-QCT enables everlasting secure key distribution with input states containing up to $O(sqrtd)$ photons.
arXiv Detail & Related papers (2020-04-21T17:26:55Z) - Backflash Light as a Security Vulnerability in Quantum Key Distribution
Systems [77.34726150561087]
We review the security vulnerabilities of quantum key distribution (QKD) systems.
We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
arXiv Detail & Related papers (2020-03-23T18:23:12Z)
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.