Efficient Simulation for Quantum Message Authentication

TL;DR

This paper demonstrates that certain quantum message authentication codes, specifically Clifford and trap codes, can be efficiently simulated assuming an efficient adversary, which is key for establishing composable security.

Contribution

The paper introduces a new class of simulators for quantum message authentication schemes and proves their efficiency for Clifford and trap codes.

Findings

Efficient simulation of Clifford and trap codes under adversary assumptions

First demonstration of efficient simulation enabling composable security

Supports secure quantum communication protocols

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.