Mosaics of Combinatorial Designs for Semantic Security on Quantum Wiretap Channels

TL;DR

This paper introduces a novel approach using mosaics of combinatorial designs to achieve semantic security and capacity in classical-quantum wiretap channels, with explicit, practical code constructions.

Contribution

It extends classical security methods to quantum channels and provides explicit, implementable code schemes for secure communication.

Findings

Mosaics of designs ensure semantic security in quantum channels

The codes are capacity achieving and explicitly constructible

Applicable to all channels with practical implementation

Abstract

We study semantic security for classical-quantum channels. Our security functions are functional forms of mosaics of combinatorial designs. We extend methods for classical channels to classical-quantum channels to demonstrate that mosaics of designs ensure semantic security for classical-quantum channels, and are also capacity achieving coding scheme. The legitimate channel users share an additional public resource, more precisely, a seed chosen uniformly at random. An advantage of these modular wiretap codes is that we provide explicit code constructions that can be implemented in practice for every channels, giving an arbitrary public code.