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.
CITATION STYLE
Broadbent, A., & Wainewright, E. (2016). Efficient simulation for quantum message authentication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10015 LNCS, pp. 72–91). Springer Verlag. https://doi.org/10.1007/978-3-319-49175-2_4
Mendeley helps you to discover research relevant for your work.