Quantum Private Broadcasting
- URL: http://arxiv.org/abs/2107.11474v1
- Date: Fri, 23 Jul 2021 22:22:35 GMT
- Title: Quantum Private Broadcasting
- Authors: Anne Broadbent (1), Carlos E. Gonz\'alez-Guill\'en (2), Christine
Schuknecht (1) ((1) University of Ottawa, Ottawa, Canada, (2) Universidad
Polit\'ecnica de Madrid, Madrid, Spain)
- Abstract summary: We give three solutions to $t$-recipient Quantum Private Broadcasting ($t$-QPB)
The first method is the independent encryption with the quantum one-time pad, which requires a key linear in the number of recipients, $t$.
We show that the key length can be decreased to be logarithmic in $t$ by using unitary $t$-designs.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In Private Broadcasting, a single plaintext is broadcast to multiple
recipients in an encrypted form, such that each recipient can decrypt locally.
When the message is classical, a straightforward solution is to encrypt the
plaintext with a single key shared among all parties, and to send to each
recipient a copy of the ciphertext. Surprisingly, the analogous method is
insufficient in the case where the message is quantum (i.e. in Quantum Private
Broadcasting (QPB)). In this work, we give three solutions to $t$-recipient
Quantum Private Broadcasting ($t$-QPB) and compare them in terms of key
lengths. The first method is the independent encryption with the quantum
one-time pad, which requires a key linear in the number of recipients, $t$. We
show that the key length can be decreased to be logarithmic in $t$ by using
unitary $t$-designs. Our main contribution is to show that this can be improved
to a key length that is logarithmic in the dimension of the symmetric subspace,
using a new concept that we define of symmetric unitary $t$-designs, that may
be of independent interest.
Related papers
- Deterministic identification over channels with finite output: a
dimensional perspective on superlinear rates [53.66705737169404]
We consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets.
Our main findings are that the maximum number of messages thus identifiable scales super-exponentially as $2R,nlog n$ with the block length $n$.
Results are shown to generalise directly to classical-quantum channels with finite-dimensional output quantum system.
arXiv Detail & Related papers (2024-02-14T11:59:30Z) - Public-Key Encryption with Quantum Keys [11.069434965621683]
We study the notion of quantum public-key encryption (qPKE) where keys are allowed to be quantum states.
We show that computational assumptions are necessary to build quantum public-key encryption.
arXiv Detail & Related papers (2023-06-13T11:32:28Z) - Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions [12.45203887838637]
We construct quantum public-key encryption from one-way functions.
In our construction, public keys are quantum, but ciphertexts are classical.
arXiv Detail & Related papers (2023-04-04T13:57:17Z) - 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) - Computation-aided classical-quantum multiple access to boost network
communication speeds [61.12008553173672]
We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC.
We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
arXiv Detail & Related papers (2021-05-30T11:19:47Z) - Efficient Quantum Public-Key Encryption From Learning With Errors [1.8021287677546958]
Our main result is a quantum public-key encryption scheme based on the Extrapolated Dihedral Coset problem (EDCP)
For limited number of public keys, the proposed scheme is information-theoretically secure.
arXiv Detail & Related papers (2021-05-26T18:48:26Z) - Quantum statistical mechanics of encryption: reaching the speed limit of
classical block ciphers [0.0]
We cast encryption via classical block ciphers in terms of operator spreading in a dual space of Pauli strings.
We quantify the quality of ciphers using measures of delocalization in string space.
arXiv Detail & Related papers (2020-11-12T18:06:27Z) - 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) - Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
A client remotely prepares a quantum state using a classical channel.
Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear.
We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
arXiv Detail & Related papers (2020-07-03T13:15:13Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z) - Fault tolerant quantum data locking [0.0]
We present a quantum data locking protocol that employs pseudo-random circuits consisting of Clifford gates only.
We show that information can be encrypted into $n$-qubit code words using order $n.
As an application, we discuss an efficient method for encrypting the output of a quantum computer.
arXiv Detail & Related papers (2020-03-25T16:07:41Z)
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.