Semantic Security for Quantum Wiretap Channels
- URL: http://arxiv.org/abs/2001.05719v2
- Date: Wed, 16 Nov 2022 15:04:55 GMT
- Title: Semantic Security for Quantum Wiretap Channels
- Authors: Holger Boche, Minglai Cai, Christian Deppe, Roberto Ferrara, Moritz
Wiese
- Abstract summary: We consider the problem of semantic security via classical-quantum and quantum wiretap channels.
We use explicit constructions to transform a non-secure code into a semantically secure code, achieving capacity by means of biregular irreducible functions.
- Score: 68.24747267214373
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We consider the problem of semantic security via classical-quantum and
quantum wiretap channels and use explicit constructions to transform a
non-secure code into a semantically secure code, achieving capacity by means of
biregular irreducible functions. Explicit parameters in finite regimes can be
extracted from theorems. We also generalize the semantic security capacity
theorem, which shows that a strongly secure code guarantees a semantically
secure code with the same secrecy rate, to any quantum channel, including the
infinite-dimensional and non-Gaussian ones.
Related papers
- Inevitable Negativity: Additivity Commands Negative Quantum Channel Entropy [2.7961972519572442]
Quantum channels represent a broad spectrum of operations crucial to quantum information theory.
This paper establishes a rigorous framework for assessing the uncertainty in both classical and quantum channels.
arXiv Detail & Related papers (2024-06-19T20:33:17Z) - Encryption with Quantum Public Keys [1.7725414095035827]
We study the question of building quantum public-key encryption schemes from one-way functions and even weaker assumptions.
We propose three schemes for quantum public-key encryption from one-way functions, pseudorandom function-like states with proof of deletion and pseudorandom function-like states, respectively.
arXiv Detail & Related papers (2023-03-09T16:17:19Z) - 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) - Semantic Security with Infinite Dimensional Quantum Eavesdropping
Channel [19.275181096881454]
We propose a new proof method for direct coding theorems for wiretap channels.
The method yields errors that decay exponentially with increasing block lengths.
It provides a guarantee of a quantum version of semantic security.
arXiv Detail & Related papers (2022-05-16T13:25:56Z) - Commitment capacity of classical-quantum channels [70.51146080031752]
We define various notions of commitment capacity for classical-quantum channels.
We prove matching upper and lower bound on it in terms of the conditional entropy.
arXiv Detail & Related papers (2022-01-17T10:41:50Z) - Security in Quantum Cryptography [5.914028209673859]
Quantum cryptography exploits principles of quantum physics for the secure processing of information.
We review this physical notion of security, focusing on quantum key distribution and secure communication.
arXiv Detail & Related papers (2021-01-29T19:00:54Z) - Efficient simulatability of continuous-variable circuits with large
Wigner negativity [62.997667081978825]
Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures.
We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable.
We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
arXiv Detail & Related papers (2020-05-25T11:03:42Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z) - Quantum-secure message authentication via blind-unforgeability [74.7729810207187]
We propose a natural definition of unforgeability against quantum adversaries called blind unforgeability.
This notion defines a function to be predictable if there exists an adversary who can use "partially blinded" access to predict values.
We show the suitability of blind unforgeability for supporting canonical constructions and reductions.
arXiv Detail & Related papers (2018-03-10T05:31:38Z)
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.