Authentication of Quantum Messages
<|reference_start|>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.<|reference_end|>
@article{barnum2002authentication,
    title={Authentication of Quantum Messages},
    author={Howard Barnum, Claude Crepeau, Daniel Gottesman, Adam Smith and Alain
  Tapp},
    journal={Proc. 43rd Annual IEEE Symposium on the Foundations of Computer
  Science (FOCS '02), pp. 449-458. IEEE Press, 2002.},
    year={2002},
    doi={10.1109/SFCS.2002.1181969},
    archivePrefix={arXiv},
    eprint={quant-ph/0205128},
    primaryClass={quant-ph cs.CR}
}