Detectable byzantine agreement secure against faulty majorities
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Can quantum mechanics help distributed computing?
ACM SIGACT News
Anonymous quantum communication
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Measurement-based and universal blind quantum computation
SFM'10 Proceedings of the Formal methods for quantitative aspects of programming languages, and 10th international conference on School on formal methods for the design of computer, communication and software systems
Quantum authentication protocol using entangled states
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Universal quantum computation in a hidden basis
Quantum Information & Computation
Quantum Information & Computation
New encoding schemes for quantum authentication
Quantum Information & Computation
An arbitrated quantum message signature scheme
CIS'04 Proceedings of the First international conference on Computational and Information Science
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
A quantum cipher with near optimal key-recycling
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Approximate quantum error-correcting codes and secret sharing schemes
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Attack and improvements of fair quantum blind signature schemes
Quantum Information Processing
Reexamination of arbitrated quantum signature: the impossible and the possible
Quantum Information Processing
An arbitrated quantum signature scheme with fast signing and verifying
Quantum Information Processing
| Hi-index | 0.00 |
Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical secret key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states.We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a secret, classical random key, we provide a non-interactive scheme that enables A to both encrypt and authenticate an m qubitmessage by encoding it into m + s qubits, where the error probability decreases exponentially in the security parameter s . The scheme requires a secret key of size 2m +O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs.It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically.This reasoning has two important consequences: It allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. Moreover, we use it to show that digitally signing quantum states is impossible.