arXiv Analytics

Sign in

arXiv:1607.03075 [quant-ph]AbstractReferencesReviewsResources

Efficient Simulation for Quantum Message Authentication

Anne Broadbent, Evelyn Wainewright

Published 2016-07-11Version 1

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.

Related articles: Most relevant | Search more
arXiv:quant-ph/0103123 (Published 2001-03-21, updated 2001-11-05)
Quantum message authentication codes
arXiv:quant-ph/0109115 (Published 2001-09-22, updated 2003-05-05)
Necessary conditions for the efficient simulation of Hamiltonians using local unitary operations
arXiv:quant-ph/0310089 (Published 2003-10-14)
Efficient simulation of one-dimensional quantum many-body systems