2,678 research outputs found
Quantum authentication with unitary coding sets
A general class of authentication schemes for arbitrary quantum messages is
proposed. The class is based on the use of sets of unitary quantum operations
in both transmission and reception, and on appending a quantum tag to the
quantum message used in transmission. The previous secret between partners
required for any authentication is a classical key. We obtain the minimal
requirements on the unitary operations that lead to a probability of failure of
the scheme less than one. This failure may be caused by someone performing a
unitary operation on the message in the channel between the communicating
partners, or by a potential forger impersonating the transmitter.Comment: RevTeX4, 10 page
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that
no code of length n can fix more than n/4 arbitrary errors, regardless of the
dimension of the coding and encoded Hilbert spaces. However, this bound only
applies to codes which recover the message exactly. Naively, one might expect
that correcting errors to very high fidelity would only allow small violations
of this bound. This intuition is incorrect: in this paper we describe quantum
error-correcting codes capable of correcting up to (n-1)/2 arbitrary errors
with fidelity exponentially close to 1, at the price of increasing the size of
the registers (i.e., the coding alphabet). This demonstrates a sharp
distinction between exact and approximate quantum error correction. The codes
have the property that any components reveal no information about the
message, and so they can also be viewed as error-tolerant secret sharing
schemes.
The construction has several interesting implications for cryptography and
quantum information theory. First, it suggests that secret sharing is a better
classical analogue to quantum error correction than is classical error
correction. Second, it highlights an error in a purported proof that verifiable
quantum secret sharing (VQSS) is impossible when the number of cheaters t is
n/4. More generally, the construction illustrates a difference between exact
and approximate requirements in quantum cryptography and (yet again) the
delicacy of security proofs and impossibility results in the quantum model.Comment: 14 pages, no figure
Roadmap on optical security
Postprint (author's final draft
Qubit authentication
Secure communication requires message authentication. In this paper we
address the problem of how to authenticate quantum information sent through a
quantum channel between two communicating parties with the minimum amount of
resources. Specifically, our objective is to determine whether one elementary
quantum message (a qubit) can be authenticated with a key of minimum length. We
show that, unlike the case of classical-message quantum authentication, this is
not possible.Comment: LaTeX, 8 page
Authentication of Quantum Messages
Authentication is a well-studied area of classical cryptography: a sender S
and a receiver R sharing a classical private key want to exchange a classical
message with the guarantee that the message has not been modified by any third
party with control of the communication line. In this paper we define and
investigate the authentication of messages composed of quantum states. Assuming
S and R have access to an insecure quantum channel and share a private,
classical random key, we provide a non-interactive scheme that enables S both
to encrypt and to authenticate (with unconditional security) an m qubit message
by encoding it into m+s qubits, where the failure probability decreases
exponentially in the security parameter s. The classical private key is 2m+O(s)
bits. To achieve this, we give a highly efficient protocol for testing the
purity of shared EPR pairs. We also show that any scheme to authenticate
quantum messages must also encrypt them. (In contrast, one can authenticate a
classical message while leaving it publicly readable.) This has two important
consequences: On one hand, it allows us to give a lower bound of 2m key bits
for authenticating m qubits, which makes our protocol asymptotically optimal.
On the other hand, we use it to show that digitally signing quantum states is
impossible, even with only computational security.Comment: 22 pages, LaTeX, uses amssymb, latexsym, time
Quantum broadcast communication
Broadcast encryption allows the sender to securely distribute his/her secret
to a dynamically changing group of users over a broadcast channel. In this
paper, we just consider a simple broadcast communication task in quantum
scenario, which the central party broadcasts his secret to multi-receiver via
quantum channel. We present three quantum broadcast communication schemes. The
first scheme utilizes entanglement swapping and Greenberger-Horne-Zeilinger
state to realize a task that the central party broadcasts his secret to a group
of receivers who share a group key with him. In the second scheme, based on
dense coding, the central party broadcasts the secret to multi-receiver who
share each of their authentication key with him. The third scheme is a quantum
broadcast communication scheme with quantum encryption, which the central party
can broadcast the secret to any subset of the legal receivers
Information Theoretic Authentication and Secrecy Codes in the Splitting Model
In the splitting model, information theoretic authentication codes allow
non-deterministic encoding, that is, several messages can be used to
communicate a particular plaintext. Certain applications require that the
aspect of secrecy should hold simultaneously. Ogata-Kurosawa-Stinson-Saido
(2004) have constructed optimal splitting authentication codes achieving
perfect secrecy for the special case when the number of keys equals the number
of messages. In this paper, we establish a construction method for optimal
splitting authentication codes with perfect secrecy in the more general case
when the number of keys may differ from the number of messages. To the best
knowledge, this is the first result of this type.Comment: 4 pages (double-column); to appear in Proc. 2012 International Zurich
Seminar on Communications (IZS 2012, Zurich
- …