Efficient Simulation for Quantum Message Authentication
arXiv:1607.03075 · doi:10.1007/978-3-319-49175-2_4
Abstract
Quantum message authentication codes are families of keyed encoding and decoding maps that enable the detection of tampering on encoded quantum data. Here, we study a new class of simulators for quantum message authentication schemes, and show how they are applied in the context of two codes: the Clifford and the trap code. Our results show for the first time that these codes admit an efficient simulation (assuming that the adversary is efficient). Such efficient simulation is typically crucial in order to establish a composable notion of security.
16 pages
References in corpus (7)
- How to share a quantum secret
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Authentication of Quantum Messages
- Quantum Cryptography Beyond Quantum Key Distribution
- Universally Composable Quantum Multi-Party Computation
- Quantum one-time programs
- Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Cited by in corpus (11)
- A quantum network stack and protocols for reliable entanglement-based networks
- Modular architectures for quantum networks
- Long-range big quantum-data transmission
- Secure Multi-party Quantum Computation with a Dishonest Majority
- Unforgeable Quantum Encryption
- Quantum authentication with key recycling
- Quantum Fully Homomorphic Encryption With Verification
- Quantum non-malleability and authentication
- Entanglement generation secure against general attacks
- Can you sign a quantum state?
- Simple proof of confidentiality for private quantum channels in noisy environments